/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 05:58:06,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 05:58:06,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 05:58:06,186 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 05:58:06,186 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 05:58:06,188 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 05:58:06,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 05:58:06,194 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 05:58:06,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 05:58:06,201 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 05:58:06,201 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 05:58:06,202 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 05:58:06,202 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 05:58:06,203 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 05:58:06,203 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 05:58:06,204 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 05:58:06,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 05:58:06,208 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 05:58:06,211 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 05:58:06,213 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 05:58:06,214 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 05:58:06,217 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 05:58:06,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 05:58:06,218 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 05:58:06,219 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 05:58:06,221 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 05:58:06,221 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 05:58:06,221 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 05:58:06,222 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 05:58:06,222 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 05:58:06,223 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 05:58:06,223 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 05:58:06,224 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 05:58:06,224 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 05:58:06,225 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 05:58:06,225 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 05:58:06,226 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 05:58:06,226 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 05:58:06,226 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 05:58:06,227 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 05:58:06,230 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 05:58:06,232 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 05:58:06,233 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 05:58:06,254 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 05:58:06,255 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 05:58:06,264 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 05:58:06,264 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 05:58:06,264 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 05:58:06,264 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 05:58:06,264 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 05:58:06,265 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 05:58:06,265 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 05:58:06,265 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 05:58:06,265 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 05:58:06,265 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 05:58:06,265 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 05:58:06,265 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 05:58:06,265 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 05:58:06,265 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 05:58:06,266 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 05:58:06,266 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 05:58:06,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 05:58:06,266 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 05:58:06,266 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 05:58:06,266 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 05:58:06,266 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 05:58:06,266 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 05:58:06,266 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 05:58:06,267 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 05:58:06,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 05:58:06,512 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 05:58:06,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 05:58:06,514 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 05:58:06,515 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 05:58:06,516 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound2.c [2022-04-08 05:58:06,561 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e1babd3c/8cee84a9cc174a4fb19a392dbbf07770/FLAGa621a0758 [2022-04-08 05:58:06,957 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 05:58:06,958 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound2.c [2022-04-08 05:58:06,963 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e1babd3c/8cee84a9cc174a4fb19a392dbbf07770/FLAGa621a0758 [2022-04-08 05:58:06,975 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e1babd3c/8cee84a9cc174a4fb19a392dbbf07770 [2022-04-08 05:58:06,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 05:58:06,979 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 05:58:06,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 05:58:06,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 05:58:06,983 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 05:58:06,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 05:58:06" (1/1) ... [2022-04-08 05:58:06,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54a9eac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:58:06, skipping insertion in model container [2022-04-08 05:58:06,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 05:58:06" (1/1) ... [2022-04-08 05:58:06,991 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 05:58:07,006 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 05:58:07,165 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound2.c[490,503] [2022-04-08 05:58:07,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 05:58:07,214 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 05:58:07,229 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound2.c[490,503] [2022-04-08 05:58:07,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 05:58:07,266 INFO L208 MainTranslator]: Completed translation [2022-04-08 05:58:07,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:58:07 WrapperNode [2022-04-08 05:58:07,267 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 05:58:07,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 05:58:07,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 05:58:07,268 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 05:58:07,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:58:07" (1/1) ... [2022-04-08 05:58:07,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:58:07" (1/1) ... [2022-04-08 05:58:07,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:58:07" (1/1) ... [2022-04-08 05:58:07,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:58:07" (1/1) ... [2022-04-08 05:58:07,301 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:58:07" (1/1) ... [2022-04-08 05:58:07,308 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:58:07" (1/1) ... [2022-04-08 05:58:07,312 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:58:07" (1/1) ... [2022-04-08 05:58:07,313 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 05:58:07,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 05:58:07,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 05:58:07,314 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 05:58:07,316 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:58:07" (1/1) ... [2022-04-08 05:58:07,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 05:58:07,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:58:07,344 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 05:58:07,364 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 05:58:07,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 05:58:07,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 05:58:07,390 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 05:58:07,390 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 05:58:07,390 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 05:58:07,391 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 05:58:07,391 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 05:58:07,391 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 05:58:07,391 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 05:58:07,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 05:58:07,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 05:58:07,392 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 05:58:07,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 05:58:07,393 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 05:58:07,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 05:58:07,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 05:58:07,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 05:58:07,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 05:58:07,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 05:58:07,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 05:58:07,458 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 05:58:07,459 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 05:58:07,663 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 05:58:07,670 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 05:58:07,670 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-08 05:58:07,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 05:58:07 BoogieIcfgContainer [2022-04-08 05:58:07,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 05:58:07,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 05:58:07,674 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 05:58:07,683 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 05:58:07,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 05:58:06" (1/3) ... [2022-04-08 05:58:07,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bdf1526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 05:58:07, skipping insertion in model container [2022-04-08 05:58:07,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:58:07" (2/3) ... [2022-04-08 05:58:07,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bdf1526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 05:58:07, skipping insertion in model container [2022-04-08 05:58:07,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 05:58:07" (3/3) ... [2022-04-08 05:58:07,686 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_valuebound2.c [2022-04-08 05:58:07,695 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 05:58:07,695 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 05:58:07,736 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 05:58:07,750 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 05:58:07,751 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 05:58:07,773 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 05:58:07,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 05:58:07,780 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:58:07,780 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 05:58:07,782 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:58:07,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:58:07,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1237885594, now seen corresponding path program 1 times [2022-04-08 05:58:07,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:58:07,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1831965203] [2022-04-08 05:58:07,803 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:58:07,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1237885594, now seen corresponding path program 2 times [2022-04-08 05:58:07,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:58:07,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597523878] [2022-04-08 05:58:07,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:58:07,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:58:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:58:07,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 05:58:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:58:08,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {64#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {43#true} is VALID [2022-04-08 05:58:08,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-08 05:58:08,017 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #112#return; {43#true} is VALID [2022-04-08 05:58:08,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 05:58:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:58:08,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-08 05:58:08,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-08 05:58:08,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-08 05:58:08,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} #94#return; {44#false} is VALID [2022-04-08 05:58:08,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 05:58:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:58:08,053 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-08 05:58:08,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-08 05:58:08,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-08 05:58:08,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #96#return; {44#false} is VALID [2022-04-08 05:58:08,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 05:58:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:58:08,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-08 05:58:08,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-08 05:58:08,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-08 05:58:08,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #98#return; {44#false} is VALID [2022-04-08 05:58:08,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-08 05:58:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:58:08,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-08 05:58:08,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-08 05:58:08,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-08 05:58:08,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #100#return; {44#false} is VALID [2022-04-08 05:58:08,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {64#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 05:58:08,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {64#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {43#true} is VALID [2022-04-08 05:58:08,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-08 05:58:08,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #112#return; {43#true} is VALID [2022-04-08 05:58:08,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret6 := main(); {43#true} is VALID [2022-04-08 05:58:08,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {43#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {43#true} is VALID [2022-04-08 05:58:08,073 INFO L272 TraceCheckUtils]: 6: Hoare triple {43#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {43#true} is VALID [2022-04-08 05:58:08,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-08 05:58:08,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-08 05:58:08,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-08 05:58:08,078 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} #94#return; {44#false} is VALID [2022-04-08 05:58:08,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {44#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {44#false} is VALID [2022-04-08 05:58:08,079 INFO L272 TraceCheckUtils]: 12: Hoare triple {44#false} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {43#true} is VALID [2022-04-08 05:58:08,080 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-08 05:58:08,080 INFO L290 TraceCheckUtils]: 14: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-08 05:58:08,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-08 05:58:08,081 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {44#false} {44#false} #96#return; {44#false} is VALID [2022-04-08 05:58:08,081 INFO L272 TraceCheckUtils]: 17: Hoare triple {44#false} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-08 05:58:08,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-08 05:58:08,082 INFO L290 TraceCheckUtils]: 19: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-08 05:58:08,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-08 05:58:08,083 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {44#false} {44#false} #98#return; {44#false} is VALID [2022-04-08 05:58:08,083 INFO L272 TraceCheckUtils]: 22: Hoare triple {44#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-08 05:58:08,083 INFO L290 TraceCheckUtils]: 23: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-08 05:58:08,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-08 05:58:08,084 INFO L290 TraceCheckUtils]: 25: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-08 05:58:08,085 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {44#false} {44#false} #100#return; {44#false} is VALID [2022-04-08 05:58:08,085 INFO L290 TraceCheckUtils]: 27: Hoare triple {44#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {44#false} is VALID [2022-04-08 05:58:08,085 INFO L290 TraceCheckUtils]: 28: Hoare triple {44#false} assume false; {44#false} is VALID [2022-04-08 05:58:08,085 INFO L272 TraceCheckUtils]: 29: Hoare triple {44#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {44#false} is VALID [2022-04-08 05:58:08,086 INFO L290 TraceCheckUtils]: 30: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2022-04-08 05:58:08,086 INFO L290 TraceCheckUtils]: 31: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2022-04-08 05:58:08,086 INFO L290 TraceCheckUtils]: 32: Hoare triple {44#false} assume !false; {44#false} is VALID [2022-04-08 05:58:08,087 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 05:58:08,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:58:08,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597523878] [2022-04-08 05:58:08,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597523878] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:58:08,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:58:08,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 05:58:08,092 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:58:08,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1831965203] [2022-04-08 05:58:08,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1831965203] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:58:08,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:58:08,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 05:58:08,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271177348] [2022-04-08 05:58:08,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:58:08,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 33 [2022-04-08 05:58:08,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:58:08,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 05:58:08,161 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 05:58:08,162 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 05:58:08,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:58:08,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 05:58:08,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 05:58:08,181 INFO L87 Difference]: Start difference. First operand has 40 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 05:58:08,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:58:08,390 INFO L93 Difference]: Finished difference Result 73 states and 115 transitions. [2022-04-08 05:58:08,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 05:58:08,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 33 [2022-04-08 05:58:08,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:58:08,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 05:58:08,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2022-04-08 05:58:08,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 05:58:08,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2022-04-08 05:58:08,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 115 transitions. [2022-04-08 05:58:08,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:58:08,584 INFO L225 Difference]: With dead ends: 73 [2022-04-08 05:58:08,584 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 05:58:08,587 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 05:58:08,589 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 24 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 05:58:08,590 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 43 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 05:58:08,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 05:58:08,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-08 05:58:08,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:58:08,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 05:58:08,629 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 05:58:08,629 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 05:58:08,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:58:08,636 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-08 05:58:08,636 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-08 05:58:08,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:58:08,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:58:08,637 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 35 states. [2022-04-08 05:58:08,638 INFO L87 Difference]: Start difference. First operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 35 states. [2022-04-08 05:58:08,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:58:08,646 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-08 05:58:08,646 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-08 05:58:08,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:58:08,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:58:08,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:58:08,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:58:08,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 05:58:08,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-08 05:58:08,653 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 33 [2022-04-08 05:58:08,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:58:08,653 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-08 05:58:08,653 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 05:58:08,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 44 transitions. [2022-04-08 05:58:08,713 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 05:58:08,714 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-08 05:58:08,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 05:58:08,716 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:58:08,716 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 05:58:08,717 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 05:58:08,717 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:58:08,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:58:08,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1569470122, now seen corresponding path program 1 times [2022-04-08 05:58:08,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:58:08,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1853943632] [2022-04-08 05:58:08,720 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:58:08,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1569470122, now seen corresponding path program 2 times [2022-04-08 05:58:08,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:58:08,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303163435] [2022-04-08 05:58:08,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:58:08,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:58:08,767 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:58:08,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1587293210] [2022-04-08 05:58:08,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:58:08,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:58:08,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:58:08,772 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 05:58:08,804 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 05:58:08,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 05:58:08,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:58:08,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 05:58:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:58:08,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:58:09,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {353#true} call ULTIMATE.init(); {353#true} is VALID [2022-04-08 05:58:09,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {353#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); {353#true} is VALID [2022-04-08 05:58:09,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {353#true} assume true; {353#true} is VALID [2022-04-08 05:58:09,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {353#true} {353#true} #112#return; {353#true} is VALID [2022-04-08 05:58:09,149 INFO L272 TraceCheckUtils]: 4: Hoare triple {353#true} call #t~ret6 := main(); {353#true} is VALID [2022-04-08 05:58:09,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {353#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {353#true} is VALID [2022-04-08 05:58:09,149 INFO L272 TraceCheckUtils]: 6: Hoare triple {353#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {353#true} is VALID [2022-04-08 05:58:09,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {353#true} ~cond := #in~cond; {353#true} is VALID [2022-04-08 05:58:09,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {353#true} assume !(0 == ~cond); {353#true} is VALID [2022-04-08 05:58:09,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {353#true} assume true; {353#true} is VALID [2022-04-08 05:58:09,150 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {353#true} {353#true} #94#return; {353#true} is VALID [2022-04-08 05:58:09,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {353#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {353#true} is VALID [2022-04-08 05:58:09,150 INFO L272 TraceCheckUtils]: 12: Hoare triple {353#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {353#true} is VALID [2022-04-08 05:58:09,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {353#true} ~cond := #in~cond; {353#true} is VALID [2022-04-08 05:58:09,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {353#true} assume !(0 == ~cond); {353#true} is VALID [2022-04-08 05:58:09,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {353#true} assume true; {353#true} is VALID [2022-04-08 05:58:09,151 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {353#true} {353#true} #96#return; {353#true} is VALID [2022-04-08 05:58:09,151 INFO L272 TraceCheckUtils]: 17: Hoare triple {353#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {353#true} is VALID [2022-04-08 05:58:09,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {353#true} ~cond := #in~cond; {353#true} is VALID [2022-04-08 05:58:09,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {353#true} assume !(0 == ~cond); {353#true} is VALID [2022-04-08 05:58:09,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {353#true} assume true; {353#true} is VALID [2022-04-08 05:58:09,155 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {353#true} {353#true} #98#return; {353#true} is VALID [2022-04-08 05:58:09,155 INFO L272 TraceCheckUtils]: 22: Hoare triple {353#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {353#true} is VALID [2022-04-08 05:58:09,155 INFO L290 TraceCheckUtils]: 23: Hoare triple {353#true} ~cond := #in~cond; {353#true} is VALID [2022-04-08 05:58:09,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {353#true} assume !(0 == ~cond); {353#true} is VALID [2022-04-08 05:58:09,156 INFO L290 TraceCheckUtils]: 25: Hoare triple {353#true} assume true; {353#true} is VALID [2022-04-08 05:58:09,156 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {353#true} {353#true} #100#return; {353#true} is VALID [2022-04-08 05:58:09,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {353#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {439#(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 05:58:09,158 INFO L290 TraceCheckUtils]: 28: Hoare triple {439#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {439#(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 05:58:09,159 INFO L290 TraceCheckUtils]: 29: Hoare triple {439#(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); {446#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:58:09,160 INFO L272 TraceCheckUtils]: 30: Hoare triple {446#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {450#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:58:09,161 INFO L290 TraceCheckUtils]: 31: Hoare triple {450#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {454#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:58:09,161 INFO L290 TraceCheckUtils]: 32: Hoare triple {454#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {354#false} is VALID [2022-04-08 05:58:09,161 INFO L290 TraceCheckUtils]: 33: Hoare triple {354#false} assume !false; {354#false} is VALID [2022-04-08 05:58:09,162 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 05:58:09,162 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:58:09,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:58:09,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303163435] [2022-04-08 05:58:09,163 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:58:09,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587293210] [2022-04-08 05:58:09,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587293210] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:58:09,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:58:09,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 05:58:09,165 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:58:09,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1853943632] [2022-04-08 05:58:09,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1853943632] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:58:09,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:58:09,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 05:58:09,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089001821] [2022-04-08 05:58:09,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:58:09,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2022-04-08 05:58:09,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:58:09,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 05:58:09,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:58:09,191 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 05:58:09,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:58:09,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 05:58:09,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 05:58:09,199 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 05:58:09,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:58:09,606 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2022-04-08 05:58:09,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 05:58:09,607 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2022-04-08 05:58:09,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:58:09,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 05:58:09,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-08 05:58:09,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 05:58:09,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-08 05:58:09,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2022-04-08 05:58:09,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:58:09,688 INFO L225 Difference]: With dead ends: 54 [2022-04-08 05:58:09,688 INFO L226 Difference]: Without dead ends: 51 [2022-04-08 05:58:09,689 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 05:58:09,690 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 14 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 05:58:09,690 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 158 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 05:58:09,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-08 05:58:09,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-08 05:58:09,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:58:09,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 05:58:09,705 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 05:58:09,706 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 05:58:09,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:58:09,709 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2022-04-08 05:58:09,709 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2022-04-08 05:58:09,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:58:09,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:58:09,711 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 51 states. [2022-04-08 05:58:09,711 INFO L87 Difference]: Start difference. First operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 51 states. [2022-04-08 05:58:09,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:58:09,715 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2022-04-08 05:58:09,715 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2022-04-08 05:58:09,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:58:09,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:58:09,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:58:09,729 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:58:09,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 05:58:09,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-08 05:58:09,732 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 34 [2022-04-08 05:58:09,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:58:09,733 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-04-08 05:58:09,733 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 05:58:09,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 64 transitions. [2022-04-08 05:58:09,814 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 05:58:09,814 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-08 05:58:09,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 05:58:09,815 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:58:09,815 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 05:58:09,843 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 05:58:10,031 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 05:58:10,032 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:58:10,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:58:10,032 INFO L85 PathProgramCache]: Analyzing trace with hash 584996456, now seen corresponding path program 1 times [2022-04-08 05:58:10,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:58:10,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1714595016] [2022-04-08 05:58:10,033 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:58:10,033 INFO L85 PathProgramCache]: Analyzing trace with hash 584996456, now seen corresponding path program 2 times [2022-04-08 05:58:10,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:58:10,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358962771] [2022-04-08 05:58:10,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:58:10,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:58:10,056 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:58:10,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [78553689] [2022-04-08 05:58:10,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:58:10,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:58:10,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:58:10,058 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 05:58:10,059 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 05:58:10,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:58:10,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:58:10,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 05:58:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:58:10,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:58:10,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {774#true} call ULTIMATE.init(); {774#true} is VALID [2022-04-08 05:58:10,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {774#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); {774#true} is VALID [2022-04-08 05:58:10,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-08 05:58:10,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {774#true} {774#true} #112#return; {774#true} is VALID [2022-04-08 05:58:10,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {774#true} call #t~ret6 := main(); {774#true} is VALID [2022-04-08 05:58:10,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {774#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {774#true} is VALID [2022-04-08 05:58:10,293 INFO L272 TraceCheckUtils]: 6: Hoare triple {774#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {774#true} is VALID [2022-04-08 05:58:10,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-08 05:58:10,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-08 05:58:10,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-08 05:58:10,296 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {774#true} {774#true} #94#return; {774#true} is VALID [2022-04-08 05:58:10,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {774#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {774#true} is VALID [2022-04-08 05:58:10,297 INFO L272 TraceCheckUtils]: 12: Hoare triple {774#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {774#true} is VALID [2022-04-08 05:58:10,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-08 05:58:10,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-08 05:58:10,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-08 05:58:10,300 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {774#true} {774#true} #96#return; {774#true} is VALID [2022-04-08 05:58:10,300 INFO L272 TraceCheckUtils]: 17: Hoare triple {774#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {774#true} is VALID [2022-04-08 05:58:10,301 INFO L290 TraceCheckUtils]: 18: Hoare triple {774#true} ~cond := #in~cond; {833#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:58:10,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {833#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {837#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:58:10,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {837#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {837#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:58:10,308 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {837#(not (= |assume_abort_if_not_#in~cond| 0))} {774#true} #98#return; {844#(<= 1 main_~x~0)} is VALID [2022-04-08 05:58:10,308 INFO L272 TraceCheckUtils]: 22: Hoare triple {844#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {774#true} is VALID [2022-04-08 05:58:10,308 INFO L290 TraceCheckUtils]: 23: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-08 05:58:10,308 INFO L290 TraceCheckUtils]: 24: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-08 05:58:10,308 INFO L290 TraceCheckUtils]: 25: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-08 05:58:10,309 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {774#true} {844#(<= 1 main_~x~0)} #100#return; {844#(<= 1 main_~x~0)} is VALID [2022-04-08 05:58:10,310 INFO L290 TraceCheckUtils]: 27: Hoare triple {844#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {863#(<= 1 main_~a~0)} is VALID [2022-04-08 05:58:10,310 INFO L290 TraceCheckUtils]: 28: Hoare triple {863#(<= 1 main_~a~0)} assume !false; {863#(<= 1 main_~a~0)} is VALID [2022-04-08 05:58:10,311 INFO L290 TraceCheckUtils]: 29: Hoare triple {863#(<= 1 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {870#(<= 1 main_~c~0)} is VALID [2022-04-08 05:58:10,311 INFO L290 TraceCheckUtils]: 30: Hoare triple {870#(<= 1 main_~c~0)} assume !false; {870#(<= 1 main_~c~0)} is VALID [2022-04-08 05:58:10,312 INFO L290 TraceCheckUtils]: 31: Hoare triple {870#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {870#(<= 1 main_~c~0)} is VALID [2022-04-08 05:58:10,312 INFO L290 TraceCheckUtils]: 32: Hoare triple {870#(<= 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; {880#(<= 1 main_~b~0)} is VALID [2022-04-08 05:58:10,313 INFO L290 TraceCheckUtils]: 33: Hoare triple {880#(<= 1 main_~b~0)} assume !false; {880#(<= 1 main_~b~0)} is VALID [2022-04-08 05:58:10,313 INFO L290 TraceCheckUtils]: 34: Hoare triple {880#(<= 1 main_~b~0)} assume !(0 != ~b~0); {775#false} is VALID [2022-04-08 05:58:10,313 INFO L272 TraceCheckUtils]: 35: Hoare triple {775#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {775#false} is VALID [2022-04-08 05:58:10,314 INFO L290 TraceCheckUtils]: 36: Hoare triple {775#false} ~cond := #in~cond; {775#false} is VALID [2022-04-08 05:58:10,314 INFO L290 TraceCheckUtils]: 37: Hoare triple {775#false} assume 0 == ~cond; {775#false} is VALID [2022-04-08 05:58:10,314 INFO L290 TraceCheckUtils]: 38: Hoare triple {775#false} assume !false; {775#false} is VALID [2022-04-08 05:58:10,314 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 05:58:10,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:58:10,596 INFO L290 TraceCheckUtils]: 38: Hoare triple {775#false} assume !false; {775#false} is VALID [2022-04-08 05:58:10,597 INFO L290 TraceCheckUtils]: 37: Hoare triple {775#false} assume 0 == ~cond; {775#false} is VALID [2022-04-08 05:58:10,597 INFO L290 TraceCheckUtils]: 36: Hoare triple {775#false} ~cond := #in~cond; {775#false} is VALID [2022-04-08 05:58:10,597 INFO L272 TraceCheckUtils]: 35: Hoare triple {775#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {775#false} is VALID [2022-04-08 05:58:10,597 INFO L290 TraceCheckUtils]: 34: Hoare triple {880#(<= 1 main_~b~0)} assume !(0 != ~b~0); {775#false} is VALID [2022-04-08 05:58:10,598 INFO L290 TraceCheckUtils]: 33: Hoare triple {880#(<= 1 main_~b~0)} assume !false; {880#(<= 1 main_~b~0)} is VALID [2022-04-08 05:58:10,598 INFO L290 TraceCheckUtils]: 32: Hoare triple {870#(<= 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; {880#(<= 1 main_~b~0)} is VALID [2022-04-08 05:58:10,601 INFO L290 TraceCheckUtils]: 31: Hoare triple {870#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {870#(<= 1 main_~c~0)} is VALID [2022-04-08 05:58:10,602 INFO L290 TraceCheckUtils]: 30: Hoare triple {870#(<= 1 main_~c~0)} assume !false; {870#(<= 1 main_~c~0)} is VALID [2022-04-08 05:58:10,603 INFO L290 TraceCheckUtils]: 29: Hoare triple {863#(<= 1 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {870#(<= 1 main_~c~0)} is VALID [2022-04-08 05:58:10,604 INFO L290 TraceCheckUtils]: 28: Hoare triple {863#(<= 1 main_~a~0)} assume !false; {863#(<= 1 main_~a~0)} is VALID [2022-04-08 05:58:10,604 INFO L290 TraceCheckUtils]: 27: Hoare triple {844#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {863#(<= 1 main_~a~0)} is VALID [2022-04-08 05:58:10,605 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {774#true} {844#(<= 1 main_~x~0)} #100#return; {844#(<= 1 main_~x~0)} is VALID [2022-04-08 05:58:10,605 INFO L290 TraceCheckUtils]: 25: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-08 05:58:10,605 INFO L290 TraceCheckUtils]: 24: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-08 05:58:10,605 INFO L290 TraceCheckUtils]: 23: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-08 05:58:10,606 INFO L272 TraceCheckUtils]: 22: Hoare triple {844#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {774#true} is VALID [2022-04-08 05:58:10,606 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {837#(not (= |assume_abort_if_not_#in~cond| 0))} {774#true} #98#return; {844#(<= 1 main_~x~0)} is VALID [2022-04-08 05:58:10,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {837#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {837#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:58:10,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {959#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {837#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:58:10,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {774#true} ~cond := #in~cond; {959#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-08 05:58:10,608 INFO L272 TraceCheckUtils]: 17: Hoare triple {774#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {774#true} is VALID [2022-04-08 05:58:10,608 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {774#true} {774#true} #96#return; {774#true} is VALID [2022-04-08 05:58:10,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-08 05:58:10,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-08 05:58:10,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-08 05:58:10,608 INFO L272 TraceCheckUtils]: 12: Hoare triple {774#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {774#true} is VALID [2022-04-08 05:58:10,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {774#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {774#true} is VALID [2022-04-08 05:58:10,609 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {774#true} {774#true} #94#return; {774#true} is VALID [2022-04-08 05:58:10,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-08 05:58:10,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-08 05:58:10,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-08 05:58:10,609 INFO L272 TraceCheckUtils]: 6: Hoare triple {774#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {774#true} is VALID [2022-04-08 05:58:10,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {774#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {774#true} is VALID [2022-04-08 05:58:10,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {774#true} call #t~ret6 := main(); {774#true} is VALID [2022-04-08 05:58:10,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {774#true} {774#true} #112#return; {774#true} is VALID [2022-04-08 05:58:10,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-08 05:58:10,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {774#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); {774#true} is VALID [2022-04-08 05:58:10,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {774#true} call ULTIMATE.init(); {774#true} is VALID [2022-04-08 05:58:10,610 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 05:58:10,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:58:10,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358962771] [2022-04-08 05:58:10,611 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:58:10,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78553689] [2022-04-08 05:58:10,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78553689] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:58:10,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:58:10,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-08 05:58:10,612 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:58:10,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1714595016] [2022-04-08 05:58:10,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1714595016] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:58:10,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:58:10,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 05:58:10,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542064857] [2022-04-08 05:58:10,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:58:10,613 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-08 05:58:10,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:58:10,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 05:58:10,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:58:10,637 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 05:58:10,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:58:10,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 05:58:10,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-08 05:58:10,638 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 05:58:11,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:58:11,390 INFO L93 Difference]: Finished difference Result 103 states and 143 transitions. [2022-04-08 05:58:11,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 05:58:11,391 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-08 05:58:11,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:58:11,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 05:58:11,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-08 05:58:11,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 05:58:11,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-08 05:58:11,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 108 transitions. [2022-04-08 05:58:11,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:58:11,498 INFO L225 Difference]: With dead ends: 103 [2022-04-08 05:58:11,498 INFO L226 Difference]: Without dead ends: 96 [2022-04-08 05:58:11,499 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-08 05:58:11,500 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 68 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 05:58:11,500 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 232 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 05:58:11,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-08 05:58:11,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2022-04-08 05:58:11,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:58:11,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 05:58:11,577 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 05:58:11,577 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 05:58:11,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:58:11,583 INFO L93 Difference]: Finished difference Result 96 states and 136 transitions. [2022-04-08 05:58:11,583 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 136 transitions. [2022-04-08 05:58:11,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:58:11,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:58:11,585 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 96 states. [2022-04-08 05:58:11,586 INFO L87 Difference]: Start difference. First operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 96 states. [2022-04-08 05:58:11,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:58:11,591 INFO L93 Difference]: Finished difference Result 96 states and 136 transitions. [2022-04-08 05:58:11,591 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 136 transitions. [2022-04-08 05:58:11,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:58:11,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:58:11,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:58:11,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:58:11,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 05:58:11,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 95 transitions. [2022-04-08 05:58:11,596 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 95 transitions. Word has length 39 [2022-04-08 05:58:11,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:58:11,597 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 95 transitions. [2022-04-08 05:58:11,597 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 05:58:11,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 95 transitions. [2022-04-08 05:58:11,728 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 05:58:11,729 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 95 transitions. [2022-04-08 05:58:11,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 05:58:11,729 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:58:11,729 INFO L499 BasicCegarLoop]: trace histogram [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] [2022-04-08 05:58:11,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 05:58:11,948 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 05:58:11,949 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:58:11,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:58:11,949 INFO L85 PathProgramCache]: Analyzing trace with hash -974923140, now seen corresponding path program 1 times [2022-04-08 05:58:11,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:58:11,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [444646844] [2022-04-08 05:58:11,950 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:58:11,950 INFO L85 PathProgramCache]: Analyzing trace with hash -974923140, now seen corresponding path program 2 times [2022-04-08 05:58:11,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:58:11,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843938959] [2022-04-08 05:58:11,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:58:11,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:58:11,968 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:58:11,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2049726939] [2022-04-08 05:58:11,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:58:11,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:58:11,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:58:11,970 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 05:58:11,981 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 05:58:12,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:58:12,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:58:12,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-08 05:58:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:58:12,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:58:12,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1566#true} is VALID [2022-04-08 05:58:12,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {1566#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); {1566#true} is VALID [2022-04-08 05:58:12,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-08 05:58:12,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #112#return; {1566#true} is VALID [2022-04-08 05:58:12,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret6 := main(); {1566#true} is VALID [2022-04-08 05:58:12,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {1566#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1566#true} is VALID [2022-04-08 05:58:12,771 INFO L272 TraceCheckUtils]: 6: Hoare triple {1566#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {1566#true} is VALID [2022-04-08 05:58:12,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-08 05:58:12,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-08 05:58:12,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-08 05:58:12,771 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1566#true} {1566#true} #94#return; {1566#true} is VALID [2022-04-08 05:58:12,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {1566#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1566#true} is VALID [2022-04-08 05:58:12,772 INFO L272 TraceCheckUtils]: 12: Hoare triple {1566#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {1566#true} is VALID [2022-04-08 05:58:12,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {1566#true} ~cond := #in~cond; {1610#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:58:12,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {1610#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1614#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:58:12,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {1614#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1614#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:58:12,774 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1614#(not (= |assume_abort_if_not_#in~cond| 0))} {1566#true} #96#return; {1621#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 05:58:12,775 INFO L272 TraceCheckUtils]: 17: Hoare triple {1621#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1566#true} is VALID [2022-04-08 05:58:12,775 INFO L290 TraceCheckUtils]: 18: Hoare triple {1566#true} ~cond := #in~cond; {1610#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:58:12,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {1610#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1614#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:58:12,776 INFO L290 TraceCheckUtils]: 20: Hoare triple {1614#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1614#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:58:12,777 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1614#(not (= |assume_abort_if_not_#in~cond| 0))} {1621#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #98#return; {1637#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2))} is VALID [2022-04-08 05:58:12,777 INFO L272 TraceCheckUtils]: 22: Hoare triple {1637#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1566#true} is VALID [2022-04-08 05:58:12,777 INFO L290 TraceCheckUtils]: 23: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-08 05:58:12,777 INFO L290 TraceCheckUtils]: 24: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-08 05:58:12,777 INFO L290 TraceCheckUtils]: 25: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-08 05:58:12,778 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1566#true} {1637#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2))} #100#return; {1637#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2))} is VALID [2022-04-08 05:58:12,778 INFO L290 TraceCheckUtils]: 27: Hoare triple {1637#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1656#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:58:12,779 INFO L290 TraceCheckUtils]: 28: Hoare triple {1656#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !false; {1656#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:58:12,780 INFO L290 TraceCheckUtils]: 29: Hoare triple {1656#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1663#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-08 05:58:12,780 INFO L290 TraceCheckUtils]: 30: Hoare triple {1663#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !false; {1663#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-08 05:58:12,781 INFO L290 TraceCheckUtils]: 31: Hoare triple {1663#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !(~c~0 >= ~b~0); {1663#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-08 05:58:12,781 INFO L290 TraceCheckUtils]: 32: Hoare triple {1663#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {1673#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 05:58:12,782 INFO L290 TraceCheckUtils]: 33: Hoare triple {1673#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !false; {1673#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 05:58:12,786 INFO L290 TraceCheckUtils]: 34: Hoare triple {1673#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1680#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 05:58:12,787 INFO L290 TraceCheckUtils]: 35: Hoare triple {1680#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !false; {1680#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 05:58:12,788 INFO L290 TraceCheckUtils]: 36: Hoare triple {1680#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {1687#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (<= main_~x~0 main_~a~0))} is VALID [2022-04-08 05:58:12,789 INFO L290 TraceCheckUtils]: 37: Hoare triple {1687#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (<= main_~x~0 main_~a~0))} assume !false; {1687#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (<= main_~x~0 main_~a~0))} is VALID [2022-04-08 05:58:12,789 INFO L272 TraceCheckUtils]: 38: Hoare triple {1687#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (<= main_~x~0 main_~a~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1694#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:58:12,790 INFO L290 TraceCheckUtils]: 39: Hoare triple {1694#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1698#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:58:12,790 INFO L290 TraceCheckUtils]: 40: Hoare triple {1698#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1567#false} is VALID [2022-04-08 05:58:12,791 INFO L290 TraceCheckUtils]: 41: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2022-04-08 05:58:12,791 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 05:58:12,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:58:13,264 INFO L290 TraceCheckUtils]: 41: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2022-04-08 05:58:13,264 INFO L290 TraceCheckUtils]: 40: Hoare triple {1698#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1567#false} is VALID [2022-04-08 05:58:13,265 INFO L290 TraceCheckUtils]: 39: Hoare triple {1694#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1698#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:58:13,265 INFO L272 TraceCheckUtils]: 38: Hoare triple {1714#(= 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)); {1694#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:58:13,266 INFO L290 TraceCheckUtils]: 37: Hoare triple {1714#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {1714#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:58:13,266 INFO L290 TraceCheckUtils]: 36: Hoare triple {1721#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (<= main_~b~0 main_~c~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {1714#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:58:13,267 INFO L290 TraceCheckUtils]: 35: Hoare triple {1721#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (<= main_~b~0 main_~c~0)))} assume !false; {1721#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-08 05:58:13,267 INFO L290 TraceCheckUtils]: 34: Hoare triple {1728#(or (not (<= main_~b~0 main_~a~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1721#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-08 05:58:13,268 INFO L290 TraceCheckUtils]: 33: Hoare triple {1728#(or (not (<= main_~b~0 main_~a~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !false; {1728#(or (not (<= main_~b~0 main_~a~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 05:58:13,271 INFO L290 TraceCheckUtils]: 32: Hoare triple {1735#(or (not (<= main_~c~0 main_~b~0)) (= 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; {1728#(or (not (<= main_~b~0 main_~a~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 05:58:13,272 INFO L290 TraceCheckUtils]: 31: Hoare triple {1735#(or (not (<= main_~c~0 main_~b~0)) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {1735#(or (not (<= main_~c~0 main_~b~0)) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 05:58:13,272 INFO L290 TraceCheckUtils]: 30: Hoare triple {1735#(or (not (<= main_~c~0 main_~b~0)) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {1735#(or (not (<= main_~c~0 main_~b~0)) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 05:58:13,273 INFO L290 TraceCheckUtils]: 29: Hoare triple {1745#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (<= main_~a~0 main_~b~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1735#(or (not (<= main_~c~0 main_~b~0)) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 05:58:13,274 INFO L290 TraceCheckUtils]: 28: Hoare triple {1745#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (<= main_~a~0 main_~b~0)))} assume !false; {1745#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (<= main_~a~0 main_~b~0)))} is VALID [2022-04-08 05:58:13,274 INFO L290 TraceCheckUtils]: 27: Hoare triple {1566#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1745#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (<= main_~a~0 main_~b~0)))} is VALID [2022-04-08 05:58:13,274 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1566#true} {1566#true} #100#return; {1566#true} is VALID [2022-04-08 05:58:13,275 INFO L290 TraceCheckUtils]: 25: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-08 05:58:13,275 INFO L290 TraceCheckUtils]: 24: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-08 05:58:13,275 INFO L290 TraceCheckUtils]: 23: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-08 05:58:13,275 INFO L272 TraceCheckUtils]: 22: Hoare triple {1566#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1566#true} is VALID [2022-04-08 05:58:13,275 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1566#true} {1566#true} #98#return; {1566#true} is VALID [2022-04-08 05:58:13,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-08 05:58:13,275 INFO L290 TraceCheckUtils]: 19: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-08 05:58:13,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-08 05:58:13,276 INFO L272 TraceCheckUtils]: 17: Hoare triple {1566#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1566#true} is VALID [2022-04-08 05:58:13,276 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1566#true} {1566#true} #96#return; {1566#true} is VALID [2022-04-08 05:58:13,276 INFO L290 TraceCheckUtils]: 15: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-08 05:58:13,276 INFO L290 TraceCheckUtils]: 14: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-08 05:58:13,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-08 05:58:13,276 INFO L272 TraceCheckUtils]: 12: Hoare triple {1566#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {1566#true} is VALID [2022-04-08 05:58:13,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {1566#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1566#true} is VALID [2022-04-08 05:58:13,277 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1566#true} {1566#true} #94#return; {1566#true} is VALID [2022-04-08 05:58:13,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-08 05:58:13,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-08 05:58:13,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-08 05:58:13,277 INFO L272 TraceCheckUtils]: 6: Hoare triple {1566#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {1566#true} is VALID [2022-04-08 05:58:13,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {1566#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1566#true} is VALID [2022-04-08 05:58:13,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret6 := main(); {1566#true} is VALID [2022-04-08 05:58:13,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #112#return; {1566#true} is VALID [2022-04-08 05:58:13,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-08 05:58:13,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {1566#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); {1566#true} is VALID [2022-04-08 05:58:13,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1566#true} is VALID [2022-04-08 05:58:13,278 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 05:58:13,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:58:13,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843938959] [2022-04-08 05:58:13,279 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:58:13,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049726939] [2022-04-08 05:58:13,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049726939] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:58:13,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:58:13,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 18 [2022-04-08 05:58:13,280 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:58:13,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [444646844] [2022-04-08 05:58:13,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [444646844] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:58:13,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:58:13,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 05:58:13,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976559458] [2022-04-08 05:58:13,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:58:13,281 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2022-04-08 05:58:13,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:58:13,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 05:58:13,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:58:13,314 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 05:58:13,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:58:13,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 05:58:13,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-04-08 05:58:13,315 INFO L87 Difference]: Start difference. First operand 71 states and 95 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 05:58:14,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:58:14,928 INFO L93 Difference]: Finished difference Result 112 states and 151 transitions. [2022-04-08 05:58:14,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 05:58:14,928 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2022-04-08 05:58:14,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:58:14,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 05:58:14,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 117 transitions. [2022-04-08 05:58:14,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 05:58:14,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 117 transitions. [2022-04-08 05:58:14,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 117 transitions. [2022-04-08 05:58:15,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:58:15,062 INFO L225 Difference]: With dead ends: 112 [2022-04-08 05:58:15,062 INFO L226 Difference]: Without dead ends: 110 [2022-04-08 05:58:15,062 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2022-04-08 05:58:15,063 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 89 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 05:58:15,064 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 245 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 05:58:15,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-08 05:58:15,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 93. [2022-04-08 05:58:15,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:58:15,255 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 93 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 05:58:15,255 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 93 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 05:58:15,256 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 93 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 05:58:15,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:58:15,261 INFO L93 Difference]: Finished difference Result 110 states and 149 transitions. [2022-04-08 05:58:15,261 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 149 transitions. [2022-04-08 05:58:15,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:58:15,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:58:15,262 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 110 states. [2022-04-08 05:58:15,263 INFO L87 Difference]: Start difference. First operand has 93 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 110 states. [2022-04-08 05:58:15,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:58:15,268 INFO L93 Difference]: Finished difference Result 110 states and 149 transitions. [2022-04-08 05:58:15,268 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 149 transitions. [2022-04-08 05:58:15,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:58:15,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:58:15,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:58:15,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:58:15,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 05:58:15,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 122 transitions. [2022-04-08 05:58:15,273 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 122 transitions. Word has length 42 [2022-04-08 05:58:15,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:58:15,273 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 122 transitions. [2022-04-08 05:58:15,273 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 05:58:15,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 122 transitions. [2022-04-08 05:58:15,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:58:15,421 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 122 transitions. [2022-04-08 05:58:15,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 05:58:15,421 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:58:15,421 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, 1] [2022-04-08 05:58:15,438 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 05:58:15,622 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 05:58:15,622 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:58:15,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:58:15,622 INFO L85 PathProgramCache]: Analyzing trace with hash 81990170, now seen corresponding path program 1 times [2022-04-08 05:58:15,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:58:15,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [805466688] [2022-04-08 05:58:15,623 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:58:15,623 INFO L85 PathProgramCache]: Analyzing trace with hash 81990170, now seen corresponding path program 2 times [2022-04-08 05:58:15,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:58:15,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809504192] [2022-04-08 05:58:15,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:58:15,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:58:15,641 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:58:15,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1512801296] [2022-04-08 05:58:15,641 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:58:15,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:58:15,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:58:15,645 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 05:58:15,653 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 05:58:15,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:58:15,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:58:15,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 05:58:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:58:15,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:58:16,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {2475#true} call ULTIMATE.init(); {2475#true} is VALID [2022-04-08 05:58:16,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {2475#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); {2475#true} is VALID [2022-04-08 05:58:16,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-08 05:58:16,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2475#true} {2475#true} #112#return; {2475#true} is VALID [2022-04-08 05:58:16,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {2475#true} call #t~ret6 := main(); {2475#true} is VALID [2022-04-08 05:58:16,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {2475#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2475#true} is VALID [2022-04-08 05:58:16,020 INFO L272 TraceCheckUtils]: 6: Hoare triple {2475#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {2475#true} is VALID [2022-04-08 05:58:16,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-08 05:58:16,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-08 05:58:16,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-08 05:58:16,020 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2475#true} {2475#true} #94#return; {2475#true} is VALID [2022-04-08 05:58:16,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {2475#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2475#true} is VALID [2022-04-08 05:58:16,020 INFO L272 TraceCheckUtils]: 12: Hoare triple {2475#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {2475#true} is VALID [2022-04-08 05:58:16,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {2475#true} ~cond := #in~cond; {2519#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:58:16,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {2519#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2523#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:58:16,021 INFO L290 TraceCheckUtils]: 15: Hoare triple {2523#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2523#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:58:16,022 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2523#(not (= |assume_abort_if_not_#in~cond| 0))} {2475#true} #96#return; {2530#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 05:58:16,022 INFO L272 TraceCheckUtils]: 17: Hoare triple {2530#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2475#true} is VALID [2022-04-08 05:58:16,022 INFO L290 TraceCheckUtils]: 18: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-08 05:58:16,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-08 05:58:16,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-08 05:58:16,023 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2475#true} {2530#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #98#return; {2530#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 05:58:16,023 INFO L272 TraceCheckUtils]: 22: Hoare triple {2530#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2475#true} is VALID [2022-04-08 05:58:16,023 INFO L290 TraceCheckUtils]: 23: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-08 05:58:16,023 INFO L290 TraceCheckUtils]: 24: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-08 05:58:16,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-08 05:58:16,024 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2475#true} {2530#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #100#return; {2530#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 05:58:16,025 INFO L290 TraceCheckUtils]: 27: Hoare triple {2530#(and (<= 0 main_~y~0) (<= main_~y~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2564#(<= 0 main_~b~0)} is VALID [2022-04-08 05:58:16,025 INFO L290 TraceCheckUtils]: 28: Hoare triple {2564#(<= 0 main_~b~0)} assume !false; {2564#(<= 0 main_~b~0)} is VALID [2022-04-08 05:58:16,026 INFO L290 TraceCheckUtils]: 29: Hoare triple {2564#(<= 0 main_~b~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-08 05:58:16,026 INFO L290 TraceCheckUtils]: 30: Hoare triple {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !false; {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-08 05:58:16,026 INFO L290 TraceCheckUtils]: 31: Hoare triple {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-08 05:58:16,027 INFO L290 TraceCheckUtils]: 32: Hoare triple {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !false; {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-08 05:58:16,027 INFO L272 TraceCheckUtils]: 33: Hoare triple {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2475#true} is VALID [2022-04-08 05:58:16,027 INFO L290 TraceCheckUtils]: 34: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-08 05:58:16,028 INFO L290 TraceCheckUtils]: 35: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-08 05:58:16,028 INFO L290 TraceCheckUtils]: 36: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-08 05:58:16,029 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2475#true} {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #102#return; {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-08 05:58:16,029 INFO L272 TraceCheckUtils]: 38: Hoare triple {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2475#true} is VALID [2022-04-08 05:58:16,029 INFO L290 TraceCheckUtils]: 39: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-08 05:58:16,029 INFO L290 TraceCheckUtils]: 40: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-08 05:58:16,030 INFO L290 TraceCheckUtils]: 41: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-08 05:58:16,031 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2475#true} {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #104#return; {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-08 05:58:16,032 INFO L272 TraceCheckUtils]: 43: Hoare triple {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2614#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:58:16,032 INFO L290 TraceCheckUtils]: 44: Hoare triple {2614#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2618#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:58:16,032 INFO L290 TraceCheckUtils]: 45: Hoare triple {2618#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2476#false} is VALID [2022-04-08 05:58:16,032 INFO L290 TraceCheckUtils]: 46: Hoare triple {2476#false} assume !false; {2476#false} is VALID [2022-04-08 05:58:16,033 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-08 05:58:16,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:58:16,273 INFO L290 TraceCheckUtils]: 46: Hoare triple {2476#false} assume !false; {2476#false} is VALID [2022-04-08 05:58:16,274 INFO L290 TraceCheckUtils]: 45: Hoare triple {2618#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2476#false} is VALID [2022-04-08 05:58:16,274 INFO L290 TraceCheckUtils]: 44: Hoare triple {2614#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2618#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:58:16,275 INFO L272 TraceCheckUtils]: 43: Hoare triple {2634#(= 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)); {2614#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:58:16,276 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2475#true} {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #104#return; {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:58:16,277 INFO L290 TraceCheckUtils]: 41: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-08 05:58:16,277 INFO L290 TraceCheckUtils]: 40: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-08 05:58:16,277 INFO L290 TraceCheckUtils]: 39: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-08 05:58:16,277 INFO L272 TraceCheckUtils]: 38: Hoare triple {2634#(= 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)); {2475#true} is VALID [2022-04-08 05:58:16,278 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2475#true} {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #102#return; {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:58:16,278 INFO L290 TraceCheckUtils]: 36: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-08 05:58:16,278 INFO L290 TraceCheckUtils]: 35: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-08 05:58:16,279 INFO L290 TraceCheckUtils]: 34: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-08 05:58:16,279 INFO L272 TraceCheckUtils]: 33: Hoare triple {2634#(= 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)); {2475#true} is VALID [2022-04-08 05:58:16,280 INFO L290 TraceCheckUtils]: 32: Hoare triple {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !false; {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:58:16,280 INFO L290 TraceCheckUtils]: 31: Hoare triple {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:58:16,281 INFO L290 TraceCheckUtils]: 30: Hoare triple {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !false; {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:58:16,281 INFO L290 TraceCheckUtils]: 29: Hoare triple {2475#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:58:16,281 INFO L290 TraceCheckUtils]: 28: Hoare triple {2475#true} assume !false; {2475#true} is VALID [2022-04-08 05:58:16,281 INFO L290 TraceCheckUtils]: 27: Hoare triple {2475#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2475#true} is VALID [2022-04-08 05:58:16,282 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2475#true} {2475#true} #100#return; {2475#true} is VALID [2022-04-08 05:58:16,282 INFO L290 TraceCheckUtils]: 25: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-08 05:58:16,282 INFO L290 TraceCheckUtils]: 24: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-08 05:58:16,282 INFO L290 TraceCheckUtils]: 23: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-08 05:58:16,282 INFO L272 TraceCheckUtils]: 22: Hoare triple {2475#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2475#true} is VALID [2022-04-08 05:58:16,282 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2475#true} {2475#true} #98#return; {2475#true} is VALID [2022-04-08 05:58:16,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-08 05:58:16,282 INFO L290 TraceCheckUtils]: 19: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-08 05:58:16,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-08 05:58:16,283 INFO L272 TraceCheckUtils]: 17: Hoare triple {2475#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2475#true} is VALID [2022-04-08 05:58:16,283 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2475#true} {2475#true} #96#return; {2475#true} is VALID [2022-04-08 05:58:16,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-08 05:58:16,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-08 05:58:16,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-08 05:58:16,284 INFO L272 TraceCheckUtils]: 12: Hoare triple {2475#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {2475#true} is VALID [2022-04-08 05:58:16,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {2475#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2475#true} is VALID [2022-04-08 05:58:16,284 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2475#true} {2475#true} #94#return; {2475#true} is VALID [2022-04-08 05:58:16,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-08 05:58:16,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-08 05:58:16,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-08 05:58:16,285 INFO L272 TraceCheckUtils]: 6: Hoare triple {2475#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {2475#true} is VALID [2022-04-08 05:58:16,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {2475#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2475#true} is VALID [2022-04-08 05:58:16,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {2475#true} call #t~ret6 := main(); {2475#true} is VALID [2022-04-08 05:58:16,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2475#true} {2475#true} #112#return; {2475#true} is VALID [2022-04-08 05:58:16,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-08 05:58:16,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {2475#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); {2475#true} is VALID [2022-04-08 05:58:16,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {2475#true} call ULTIMATE.init(); {2475#true} is VALID [2022-04-08 05:58:16,286 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 05:58:16,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:58:16,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809504192] [2022-04-08 05:58:16,288 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:58:16,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512801296] [2022-04-08 05:58:16,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512801296] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 05:58:16,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 05:58:16,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-08 05:58:16,289 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:58:16,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [805466688] [2022-04-08 05:58:16,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [805466688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:58:16,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:58:16,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:58:16,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410327055] [2022-04-08 05:58:16,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:58:16,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 47 [2022-04-08 05:58:16,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:58:16,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 05:58:16,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:58:16,319 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 05:58:16,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:58:16,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 05:58:16,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-08 05:58:16,319 INFO L87 Difference]: Start difference. First operand 93 states and 122 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 05:58:16,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:58:16,799 INFO L93 Difference]: Finished difference Result 130 states and 179 transitions. [2022-04-08 05:58:16,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 05:58:16,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 47 [2022-04-08 05:58:16,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:58:16,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 05:58:16,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 05:58:16,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 05:58:16,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 05:58:16,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-08 05:58:16,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:58:16,876 INFO L225 Difference]: With dead ends: 130 [2022-04-08 05:58:16,876 INFO L226 Difference]: Without dead ends: 128 [2022-04-08 05:58:16,876 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-08 05:58:16,877 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 8 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 05:58:16,877 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 141 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:58:16,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-08 05:58:17,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2022-04-08 05:58:17,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:58:17,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 123 states, 76 states have (on average 1.263157894736842) internal successors, (96), 77 states have internal predecessors, (96), 39 states have call successors, (39), 8 states have call predecessors, (39), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 05:58:17,172 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 123 states, 76 states have (on average 1.263157894736842) internal successors, (96), 77 states have internal predecessors, (96), 39 states have call successors, (39), 8 states have call predecessors, (39), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 05:58:17,172 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 123 states, 76 states have (on average 1.263157894736842) internal successors, (96), 77 states have internal predecessors, (96), 39 states have call successors, (39), 8 states have call predecessors, (39), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 05:58:17,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:58:17,177 INFO L93 Difference]: Finished difference Result 128 states and 177 transitions. [2022-04-08 05:58:17,177 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 177 transitions. [2022-04-08 05:58:17,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:58:17,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:58:17,178 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 76 states have (on average 1.263157894736842) internal successors, (96), 77 states have internal predecessors, (96), 39 states have call successors, (39), 8 states have call predecessors, (39), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 128 states. [2022-04-08 05:58:17,179 INFO L87 Difference]: Start difference. First operand has 123 states, 76 states have (on average 1.263157894736842) internal successors, (96), 77 states have internal predecessors, (96), 39 states have call successors, (39), 8 states have call predecessors, (39), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 128 states. [2022-04-08 05:58:17,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:58:17,189 INFO L93 Difference]: Finished difference Result 128 states and 177 transitions. [2022-04-08 05:58:17,189 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 177 transitions. [2022-04-08 05:58:17,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:58:17,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:58:17,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:58:17,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:58:17,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 76 states have (on average 1.263157894736842) internal successors, (96), 77 states have internal predecessors, (96), 39 states have call successors, (39), 8 states have call predecessors, (39), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 05:58:17,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 172 transitions. [2022-04-08 05:58:17,196 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 172 transitions. Word has length 47 [2022-04-08 05:58:17,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:58:17,197 INFO L478 AbstractCegarLoop]: Abstraction has 123 states and 172 transitions. [2022-04-08 05:58:17,197 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 05:58:17,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 172 transitions. [2022-04-08 05:58:17,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:58:17,426 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 172 transitions. [2022-04-08 05:58:17,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 05:58:17,426 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:58:17,427 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2022-04-08 05:58:17,443 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 05:58:17,631 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 05:58:17,631 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:58:17,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:58:17,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1524769911, now seen corresponding path program 1 times [2022-04-08 05:58:17,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:58:17,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [611189722] [2022-04-08 05:58:17,633 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:58:17,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1524769911, now seen corresponding path program 2 times [2022-04-08 05:58:17,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:58:17,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053441845] [2022-04-08 05:58:17,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:58:17,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:58:17,648 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:58:17,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [498494298] [2022-04-08 05:58:17,648 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:58:17,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:58:17,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:58:17,649 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 05:58:17,651 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 05:58:17,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:58:17,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:58:17,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-08 05:58:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:58:17,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:58:18,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {3530#true} call ULTIMATE.init(); {3530#true} is VALID [2022-04-08 05:58:18,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {3530#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); {3530#true} is VALID [2022-04-08 05:58:18,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-08 05:58:18,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3530#true} {3530#true} #112#return; {3530#true} is VALID [2022-04-08 05:58:18,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {3530#true} call #t~ret6 := main(); {3530#true} is VALID [2022-04-08 05:58:18,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {3530#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3530#true} is VALID [2022-04-08 05:58:18,435 INFO L272 TraceCheckUtils]: 6: Hoare triple {3530#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {3530#true} is VALID [2022-04-08 05:58:18,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-08 05:58:18,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-08 05:58:18,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-08 05:58:18,435 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3530#true} {3530#true} #94#return; {3530#true} is VALID [2022-04-08 05:58:18,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {3530#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3530#true} is VALID [2022-04-08 05:58:18,435 INFO L272 TraceCheckUtils]: 12: Hoare triple {3530#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {3530#true} is VALID [2022-04-08 05:58:18,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {3530#true} ~cond := #in~cond; {3574#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:58:18,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {3574#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3578#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:58:18,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {3578#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3578#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:58:18,437 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3578#(not (= |assume_abort_if_not_#in~cond| 0))} {3530#true} #96#return; {3585#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 05:58:18,438 INFO L272 TraceCheckUtils]: 17: Hoare triple {3585#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3530#true} is VALID [2022-04-08 05:58:18,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {3530#true} ~cond := #in~cond; {3574#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:58:18,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {3574#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3578#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:58:18,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {3578#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3578#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:58:18,439 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3578#(not (= |assume_abort_if_not_#in~cond| 0))} {3585#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #98#return; {3601#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2))} is VALID [2022-04-08 05:58:18,440 INFO L272 TraceCheckUtils]: 22: Hoare triple {3601#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3530#true} is VALID [2022-04-08 05:58:18,442 INFO L290 TraceCheckUtils]: 23: Hoare triple {3530#true} ~cond := #in~cond; {3574#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:58:18,442 INFO L290 TraceCheckUtils]: 24: Hoare triple {3574#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3578#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:58:18,443 INFO L290 TraceCheckUtils]: 25: Hoare triple {3578#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3578#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:58:18,443 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3578#(not (= |assume_abort_if_not_#in~cond| 0))} {3601#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2))} #100#return; {3617#(and (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0))} is VALID [2022-04-08 05:58:18,444 INFO L290 TraceCheckUtils]: 27: Hoare triple {3617#(and (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3621#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:58:18,445 INFO L290 TraceCheckUtils]: 28: Hoare triple {3621#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {3621#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:58:18,446 INFO L290 TraceCheckUtils]: 29: Hoare triple {3621#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3628#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:58:18,452 INFO L290 TraceCheckUtils]: 30: Hoare triple {3628#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {3628#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:58:18,453 INFO L290 TraceCheckUtils]: 31: Hoare triple {3628#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {3635#(and (= main_~r~0 0) (<= 1 main_~x~0) (< main_~c~0 main_~y~0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:58:18,453 INFO L290 TraceCheckUtils]: 32: Hoare triple {3635#(and (= main_~r~0 0) (<= 1 main_~x~0) (< main_~c~0 main_~y~0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-08 05:58:18,454 INFO L290 TraceCheckUtils]: 33: Hoare triple {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-08 05:58:18,455 INFO L290 TraceCheckUtils]: 34: Hoare triple {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-08 05:58:18,455 INFO L290 TraceCheckUtils]: 35: Hoare triple {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-08 05:58:18,456 INFO L290 TraceCheckUtils]: 36: Hoare triple {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-08 05:58:18,456 INFO L290 TraceCheckUtils]: 37: Hoare triple {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-08 05:58:18,456 INFO L272 TraceCheckUtils]: 38: Hoare triple {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3530#true} is VALID [2022-04-08 05:58:18,456 INFO L290 TraceCheckUtils]: 39: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-08 05:58:18,457 INFO L290 TraceCheckUtils]: 40: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-08 05:58:18,457 INFO L290 TraceCheckUtils]: 41: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-08 05:58:18,458 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3530#true} {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #102#return; {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-08 05:58:18,459 INFO L272 TraceCheckUtils]: 43: Hoare triple {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3673#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:58:18,459 INFO L290 TraceCheckUtils]: 44: Hoare triple {3673#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3677#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:58:18,459 INFO L290 TraceCheckUtils]: 45: Hoare triple {3677#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3531#false} is VALID [2022-04-08 05:58:18,460 INFO L290 TraceCheckUtils]: 46: Hoare triple {3531#false} assume !false; {3531#false} is VALID [2022-04-08 05:58:18,460 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 05:58:18,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:58:18,898 INFO L290 TraceCheckUtils]: 46: Hoare triple {3531#false} assume !false; {3531#false} is VALID [2022-04-08 05:58:18,899 INFO L290 TraceCheckUtils]: 45: Hoare triple {3677#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3531#false} is VALID [2022-04-08 05:58:18,900 INFO L290 TraceCheckUtils]: 44: Hoare triple {3673#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3677#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:58:18,900 INFO L272 TraceCheckUtils]: 43: Hoare triple {3693#(= 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)); {3673#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:58:18,901 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3530#true} {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #102#return; {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:58:18,901 INFO L290 TraceCheckUtils]: 41: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-08 05:58:18,902 INFO L290 TraceCheckUtils]: 40: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-08 05:58:18,902 INFO L290 TraceCheckUtils]: 39: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-08 05:58:18,905 INFO L272 TraceCheckUtils]: 38: Hoare triple {3693#(= 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)); {3530#true} is VALID [2022-04-08 05:58:18,906 INFO L290 TraceCheckUtils]: 37: Hoare triple {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:58:18,906 INFO L290 TraceCheckUtils]: 36: Hoare triple {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:58:18,907 INFO L290 TraceCheckUtils]: 35: Hoare triple {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:58:18,907 INFO L290 TraceCheckUtils]: 34: Hoare triple {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:58:18,908 INFO L290 TraceCheckUtils]: 33: Hoare triple {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:58:20,909 WARN L290 TraceCheckUtils]: 32: Hoare triple {3727#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is UNKNOWN [2022-04-08 05:58:20,910 INFO L290 TraceCheckUtils]: 31: Hoare triple {3731#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} assume !(~c~0 >= ~b~0); {3727#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-08 05:58:20,910 INFO L290 TraceCheckUtils]: 30: Hoare triple {3731#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} assume !false; {3731#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} is VALID [2022-04-08 05:58:20,911 INFO L290 TraceCheckUtils]: 29: Hoare triple {3738#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3731#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} is VALID [2022-04-08 05:58:20,911 INFO L290 TraceCheckUtils]: 28: Hoare triple {3738#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} assume !false; {3738#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-08 05:58:20,912 INFO L290 TraceCheckUtils]: 27: Hoare triple {3530#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3738#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-08 05:58:20,912 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3530#true} {3530#true} #100#return; {3530#true} is VALID [2022-04-08 05:58:20,912 INFO L290 TraceCheckUtils]: 25: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-08 05:58:20,912 INFO L290 TraceCheckUtils]: 24: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-08 05:58:20,912 INFO L290 TraceCheckUtils]: 23: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-08 05:58:20,912 INFO L272 TraceCheckUtils]: 22: Hoare triple {3530#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3530#true} is VALID [2022-04-08 05:58:20,912 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3530#true} {3530#true} #98#return; {3530#true} is VALID [2022-04-08 05:58:20,912 INFO L290 TraceCheckUtils]: 20: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-08 05:58:20,912 INFO L290 TraceCheckUtils]: 19: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-08 05:58:20,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-08 05:58:20,912 INFO L272 TraceCheckUtils]: 17: Hoare triple {3530#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3530#true} is VALID [2022-04-08 05:58:20,912 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3530#true} {3530#true} #96#return; {3530#true} is VALID [2022-04-08 05:58:20,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-08 05:58:20,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-08 05:58:20,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-08 05:58:20,913 INFO L272 TraceCheckUtils]: 12: Hoare triple {3530#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {3530#true} is VALID [2022-04-08 05:58:20,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {3530#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3530#true} is VALID [2022-04-08 05:58:20,913 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3530#true} {3530#true} #94#return; {3530#true} is VALID [2022-04-08 05:58:20,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-08 05:58:20,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-08 05:58:20,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-08 05:58:20,913 INFO L272 TraceCheckUtils]: 6: Hoare triple {3530#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {3530#true} is VALID [2022-04-08 05:58:20,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {3530#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3530#true} is VALID [2022-04-08 05:58:20,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {3530#true} call #t~ret6 := main(); {3530#true} is VALID [2022-04-08 05:58:20,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3530#true} {3530#true} #112#return; {3530#true} is VALID [2022-04-08 05:58:20,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-08 05:58:20,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {3530#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); {3530#true} is VALID [2022-04-08 05:58:20,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {3530#true} call ULTIMATE.init(); {3530#true} is VALID [2022-04-08 05:58:20,914 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 05:58:20,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:58:20,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053441845] [2022-04-08 05:58:20,914 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:58:20,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498494298] [2022-04-08 05:58:20,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498494298] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:58:20,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:58:20,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 17 [2022-04-08 05:58:20,915 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:58:20,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [611189722] [2022-04-08 05:58:20,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [611189722] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:58:20,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:58:20,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 05:58:20,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567525219] [2022-04-08 05:58:20,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:58:20,916 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 47 [2022-04-08 05:58:20,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:58:20,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 05:58:20,970 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 05:58:20,971 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 05:58:20,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:58:20,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 05:58:20,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-04-08 05:58:20,972 INFO L87 Difference]: Start difference. First operand 123 states and 172 transitions. Second operand has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 05:58:22,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:58:22,522 INFO L93 Difference]: Finished difference Result 137 states and 184 transitions. [2022-04-08 05:58:22,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 05:58:22,523 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 47 [2022-04-08 05:58:22,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:58:22,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 05:58:22,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 101 transitions. [2022-04-08 05:58:22,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 05:58:22,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 101 transitions. [2022-04-08 05:58:22,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 101 transitions. [2022-04-08 05:58:22,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:58:22,647 INFO L225 Difference]: With dead ends: 137 [2022-04-08 05:58:22,647 INFO L226 Difference]: Without dead ends: 135 [2022-04-08 05:58:22,648 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2022-04-08 05:58:22,650 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 50 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 05:58:22,651 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 259 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 05:58:22,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-08 05:58:22,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2022-04-08 05:58:22,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:58:22,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 131 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 83 states have internal predecessors, (102), 39 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 05:58:22,935 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 131 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 83 states have internal predecessors, (102), 39 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 05:58:22,936 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 131 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 83 states have internal predecessors, (102), 39 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 05:58:22,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:58:22,941 INFO L93 Difference]: Finished difference Result 135 states and 182 transitions. [2022-04-08 05:58:22,941 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 182 transitions. [2022-04-08 05:58:22,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:58:22,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:58:22,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 83 states have internal predecessors, (102), 39 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 135 states. [2022-04-08 05:58:22,943 INFO L87 Difference]: Start difference. First operand has 131 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 83 states have internal predecessors, (102), 39 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 135 states. [2022-04-08 05:58:22,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:58:22,947 INFO L93 Difference]: Finished difference Result 135 states and 182 transitions. [2022-04-08 05:58:22,947 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 182 transitions. [2022-04-08 05:58:22,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:58:22,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:58:22,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:58:22,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:58:22,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 83 states have internal predecessors, (102), 39 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 05:58:22,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 178 transitions. [2022-04-08 05:58:22,954 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 178 transitions. Word has length 47 [2022-04-08 05:58:22,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:58:22,955 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 178 transitions. [2022-04-08 05:58:22,955 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 05:58:22,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 178 transitions. [2022-04-08 05:58:23,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:58:23,174 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 178 transitions. [2022-04-08 05:58:23,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 05:58:23,174 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:58:23,175 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:58:23,191 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 05:58:23,379 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 05:58:23,380 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:58:23,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:58:23,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1836145722, now seen corresponding path program 3 times [2022-04-08 05:58:23,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:58:23,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1507390047] [2022-04-08 05:58:23,381 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:58:23,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1836145722, now seen corresponding path program 4 times [2022-04-08 05:58:23,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:58:23,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790288256] [2022-04-08 05:58:23,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:58:23,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:58:23,397 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:58:23,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [164800720] [2022-04-08 05:58:23,397 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 05:58:23,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:58:23,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:58:23,398 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 05:58:23,419 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 05:58:23,448 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 05:58:23,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:58:23,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 05:58:23,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:58:23,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:58:23,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {4642#true} call ULTIMATE.init(); {4642#true} is VALID [2022-04-08 05:58:23,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {4642#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); {4642#true} is VALID [2022-04-08 05:58:23,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {4642#true} assume true; {4642#true} is VALID [2022-04-08 05:58:23,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4642#true} {4642#true} #112#return; {4642#true} is VALID [2022-04-08 05:58:23,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {4642#true} call #t~ret6 := main(); {4642#true} is VALID [2022-04-08 05:58:23,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {4642#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4642#true} is VALID [2022-04-08 05:58:23,606 INFO L272 TraceCheckUtils]: 6: Hoare triple {4642#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {4642#true} is VALID [2022-04-08 05:58:23,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {4642#true} ~cond := #in~cond; {4642#true} is VALID [2022-04-08 05:58:23,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {4642#true} assume !(0 == ~cond); {4642#true} is VALID [2022-04-08 05:58:23,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {4642#true} assume true; {4642#true} is VALID [2022-04-08 05:58:23,606 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4642#true} {4642#true} #94#return; {4642#true} is VALID [2022-04-08 05:58:23,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {4642#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4642#true} is VALID [2022-04-08 05:58:23,607 INFO L272 TraceCheckUtils]: 12: Hoare triple {4642#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {4642#true} is VALID [2022-04-08 05:58:23,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {4642#true} ~cond := #in~cond; {4642#true} is VALID [2022-04-08 05:58:23,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {4642#true} assume !(0 == ~cond); {4642#true} is VALID [2022-04-08 05:58:23,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {4642#true} assume true; {4642#true} is VALID [2022-04-08 05:58:23,607 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4642#true} {4642#true} #96#return; {4642#true} is VALID [2022-04-08 05:58:23,607 INFO L272 TraceCheckUtils]: 17: Hoare triple {4642#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4642#true} is VALID [2022-04-08 05:58:23,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {4642#true} ~cond := #in~cond; {4642#true} is VALID [2022-04-08 05:58:23,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {4642#true} assume !(0 == ~cond); {4642#true} is VALID [2022-04-08 05:58:23,608 INFO L290 TraceCheckUtils]: 20: Hoare triple {4642#true} assume true; {4642#true} is VALID [2022-04-08 05:58:23,608 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4642#true} {4642#true} #98#return; {4642#true} is VALID [2022-04-08 05:58:23,608 INFO L272 TraceCheckUtils]: 22: Hoare triple {4642#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4642#true} is VALID [2022-04-08 05:58:23,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {4642#true} ~cond := #in~cond; {4642#true} is VALID [2022-04-08 05:58:23,608 INFO L290 TraceCheckUtils]: 24: Hoare triple {4642#true} assume !(0 == ~cond); {4642#true} is VALID [2022-04-08 05:58:23,608 INFO L290 TraceCheckUtils]: 25: Hoare triple {4642#true} assume true; {4642#true} is VALID [2022-04-08 05:58:23,608 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4642#true} {4642#true} #100#return; {4642#true} is VALID [2022-04-08 05:58:23,608 INFO L290 TraceCheckUtils]: 27: Hoare triple {4642#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4642#true} is VALID [2022-04-08 05:58:23,608 INFO L290 TraceCheckUtils]: 28: Hoare triple {4642#true} assume !false; {4642#true} is VALID [2022-04-08 05:58:23,609 INFO L290 TraceCheckUtils]: 29: Hoare triple {4642#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4642#true} is VALID [2022-04-08 05:58:23,609 INFO L290 TraceCheckUtils]: 30: Hoare triple {4642#true} assume !false; {4642#true} is VALID [2022-04-08 05:58:23,609 INFO L290 TraceCheckUtils]: 31: Hoare triple {4642#true} assume !(~c~0 >= ~b~0); {4740#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-08 05:58:23,610 INFO L290 TraceCheckUtils]: 32: Hoare triple {4740#(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; {4744#(< main_~b~0 main_~a~0)} is VALID [2022-04-08 05:58:23,610 INFO L290 TraceCheckUtils]: 33: Hoare triple {4744#(< main_~b~0 main_~a~0)} assume !false; {4744#(< main_~b~0 main_~a~0)} is VALID [2022-04-08 05:58:23,611 INFO L290 TraceCheckUtils]: 34: Hoare triple {4744#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4751#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:58:23,611 INFO L290 TraceCheckUtils]: 35: Hoare triple {4751#(< main_~b~0 main_~c~0)} assume !false; {4751#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:58:23,612 INFO L290 TraceCheckUtils]: 36: Hoare triple {4751#(< main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {4643#false} is VALID [2022-04-08 05:58:23,612 INFO L290 TraceCheckUtils]: 37: Hoare triple {4643#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; {4643#false} is VALID [2022-04-08 05:58:23,612 INFO L290 TraceCheckUtils]: 38: Hoare triple {4643#false} assume !false; {4643#false} is VALID [2022-04-08 05:58:23,612 INFO L290 TraceCheckUtils]: 39: Hoare triple {4643#false} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4643#false} is VALID [2022-04-08 05:58:23,612 INFO L290 TraceCheckUtils]: 40: Hoare triple {4643#false} assume !false; {4643#false} is VALID [2022-04-08 05:58:23,612 INFO L290 TraceCheckUtils]: 41: Hoare triple {4643#false} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {4643#false} is VALID [2022-04-08 05:58:23,613 INFO L290 TraceCheckUtils]: 42: Hoare triple {4643#false} assume !false; {4643#false} is VALID [2022-04-08 05:58:23,613 INFO L272 TraceCheckUtils]: 43: Hoare triple {4643#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4643#false} is VALID [2022-04-08 05:58:23,613 INFO L290 TraceCheckUtils]: 44: Hoare triple {4643#false} ~cond := #in~cond; {4643#false} is VALID [2022-04-08 05:58:23,613 INFO L290 TraceCheckUtils]: 45: Hoare triple {4643#false} assume 0 == ~cond; {4643#false} is VALID [2022-04-08 05:58:23,613 INFO L290 TraceCheckUtils]: 46: Hoare triple {4643#false} assume !false; {4643#false} is VALID [2022-04-08 05:58:23,613 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 05:58:23,613 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:58:23,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:58:23,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790288256] [2022-04-08 05:58:23,614 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:58:23,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164800720] [2022-04-08 05:58:23,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164800720] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:58:23,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:58:23,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:58:23,614 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:58:23,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1507390047] [2022-04-08 05:58:23,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1507390047] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:58:23,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:58:23,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:58:23,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121244539] [2022-04-08 05:58:23,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:58:23,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 47 [2022-04-08 05:58:23,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:58:23,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 05:58:23,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:58:23,643 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 05:58:23,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:58:23,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 05:58:23,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 05:58:23,644 INFO L87 Difference]: Start difference. First operand 131 states and 178 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 05:58:24,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:58:24,157 INFO L93 Difference]: Finished difference Result 170 states and 230 transitions. [2022-04-08 05:58:24,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 05:58:24,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 47 [2022-04-08 05:58:24,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:58:24,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 05:58:24,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2022-04-08 05:58:24,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 05:58:24,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2022-04-08 05:58:24,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 102 transitions. [2022-04-08 05:58:24,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:58:24,242 INFO L225 Difference]: With dead ends: 170 [2022-04-08 05:58:24,242 INFO L226 Difference]: Without dead ends: 114 [2022-04-08 05:58:24,243 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 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 05:58:24,243 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 18 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 05:58:24,244 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 155 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 05:58:24,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-08 05:58:24,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2022-04-08 05:58:24,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:58:24,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 106 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-08 05:58:24,484 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 106 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-08 05:58:24,484 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 106 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-08 05:58:24,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:58:24,488 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2022-04-08 05:58:24,489 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 146 transitions. [2022-04-08 05:58:24,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:58:24,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:58:24,490 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 114 states. [2022-04-08 05:58:24,490 INFO L87 Difference]: Start difference. First operand has 106 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 114 states. [2022-04-08 05:58:24,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:58:24,494 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2022-04-08 05:58:24,494 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 146 transitions. [2022-04-08 05:58:24,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:58:24,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:58:24,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:58:24,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:58:24,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-08 05:58:24,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 137 transitions. [2022-04-08 05:58:24,499 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 137 transitions. Word has length 47 [2022-04-08 05:58:24,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:58:24,499 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 137 transitions. [2022-04-08 05:58:24,499 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 05:58:24,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 137 transitions. [2022-04-08 05:58:24,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:58:24,681 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 137 transitions. [2022-04-08 05:58:24,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-08 05:58:24,683 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:58:24,683 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, 1] [2022-04-08 05:58:24,699 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 05:58:24,883 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 05:58:24,884 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:58:24,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:58:24,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1952108775, now seen corresponding path program 1 times [2022-04-08 05:58:24,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:58:24,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [437440670] [2022-04-08 05:58:24,885 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:58:24,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1952108775, now seen corresponding path program 2 times [2022-04-08 05:58:24,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:58:24,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903400128] [2022-04-08 05:58:24,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:58:24,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:58:24,901 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:58:24,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1353076233] [2022-04-08 05:58:24,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:58:24,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:58:24,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:58:24,916 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 05:58:24,918 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 05:58:24,962 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:58:24,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:58:24,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 05:58:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:58:24,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:58:25,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {5572#true} call ULTIMATE.init(); {5572#true} is VALID [2022-04-08 05:58:25,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {5572#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); {5572#true} is VALID [2022-04-08 05:58:25,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {5572#true} assume true; {5572#true} is VALID [2022-04-08 05:58:25,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5572#true} {5572#true} #112#return; {5572#true} is VALID [2022-04-08 05:58:25,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {5572#true} call #t~ret6 := main(); {5572#true} is VALID [2022-04-08 05:58:25,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {5572#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {5572#true} is VALID [2022-04-08 05:58:25,108 INFO L272 TraceCheckUtils]: 6: Hoare triple {5572#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {5572#true} is VALID [2022-04-08 05:58:25,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {5572#true} ~cond := #in~cond; {5572#true} is VALID [2022-04-08 05:58:25,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {5572#true} assume !(0 == ~cond); {5572#true} is VALID [2022-04-08 05:58:25,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {5572#true} assume true; {5572#true} is VALID [2022-04-08 05:58:25,108 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5572#true} {5572#true} #94#return; {5572#true} is VALID [2022-04-08 05:58:25,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {5572#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5572#true} is VALID [2022-04-08 05:58:25,108 INFO L272 TraceCheckUtils]: 12: Hoare triple {5572#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {5572#true} is VALID [2022-04-08 05:58:25,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {5572#true} ~cond := #in~cond; {5572#true} is VALID [2022-04-08 05:58:25,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {5572#true} assume !(0 == ~cond); {5572#true} is VALID [2022-04-08 05:58:25,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {5572#true} assume true; {5572#true} is VALID [2022-04-08 05:58:25,109 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5572#true} {5572#true} #96#return; {5572#true} is VALID [2022-04-08 05:58:25,109 INFO L272 TraceCheckUtils]: 17: Hoare triple {5572#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5572#true} is VALID [2022-04-08 05:58:25,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {5572#true} ~cond := #in~cond; {5572#true} is VALID [2022-04-08 05:58:25,109 INFO L290 TraceCheckUtils]: 19: Hoare triple {5572#true} assume !(0 == ~cond); {5572#true} is VALID [2022-04-08 05:58:25,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {5572#true} assume true; {5572#true} is VALID [2022-04-08 05:58:25,109 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5572#true} {5572#true} #98#return; {5572#true} is VALID [2022-04-08 05:58:25,109 INFO L272 TraceCheckUtils]: 22: Hoare triple {5572#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5572#true} is VALID [2022-04-08 05:58:25,110 INFO L290 TraceCheckUtils]: 23: Hoare triple {5572#true} ~cond := #in~cond; {5572#true} is VALID [2022-04-08 05:58:25,110 INFO L290 TraceCheckUtils]: 24: Hoare triple {5572#true} assume !(0 == ~cond); {5572#true} is VALID [2022-04-08 05:58:25,110 INFO L290 TraceCheckUtils]: 25: Hoare triple {5572#true} assume true; {5572#true} is VALID [2022-04-08 05:58:25,110 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5572#true} {5572#true} #100#return; {5572#true} is VALID [2022-04-08 05:58:25,110 INFO L290 TraceCheckUtils]: 27: Hoare triple {5572#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {5572#true} is VALID [2022-04-08 05:58:25,110 INFO L290 TraceCheckUtils]: 28: Hoare triple {5572#true} assume !false; {5572#true} is VALID [2022-04-08 05:58:25,110 INFO L290 TraceCheckUtils]: 29: Hoare triple {5572#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {5572#true} is VALID [2022-04-08 05:58:25,110 INFO L290 TraceCheckUtils]: 30: Hoare triple {5572#true} assume !false; {5572#true} is VALID [2022-04-08 05:58:25,111 INFO L290 TraceCheckUtils]: 31: Hoare triple {5572#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-08 05:58:25,111 INFO L290 TraceCheckUtils]: 32: Hoare triple {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} assume !false; {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-08 05:58:25,111 INFO L272 TraceCheckUtils]: 33: Hoare triple {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {5572#true} is VALID [2022-04-08 05:58:25,112 INFO L290 TraceCheckUtils]: 34: Hoare triple {5572#true} ~cond := #in~cond; {5572#true} is VALID [2022-04-08 05:58:25,112 INFO L290 TraceCheckUtils]: 35: Hoare triple {5572#true} assume !(0 == ~cond); {5572#true} is VALID [2022-04-08 05:58:25,112 INFO L290 TraceCheckUtils]: 36: Hoare triple {5572#true} assume true; {5572#true} is VALID [2022-04-08 05:58:25,112 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5572#true} {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #102#return; {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-08 05:58:25,113 INFO L272 TraceCheckUtils]: 38: Hoare triple {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {5572#true} is VALID [2022-04-08 05:58:25,113 INFO L290 TraceCheckUtils]: 39: Hoare triple {5572#true} ~cond := #in~cond; {5572#true} is VALID [2022-04-08 05:58:25,113 INFO L290 TraceCheckUtils]: 40: Hoare triple {5572#true} assume !(0 == ~cond); {5572#true} is VALID [2022-04-08 05:58:25,113 INFO L290 TraceCheckUtils]: 41: Hoare triple {5572#true} assume true; {5572#true} is VALID [2022-04-08 05:58:25,128 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5572#true} {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #104#return; {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-08 05:58:25,128 INFO L272 TraceCheckUtils]: 43: Hoare triple {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {5572#true} is VALID [2022-04-08 05:58:25,128 INFO L290 TraceCheckUtils]: 44: Hoare triple {5572#true} ~cond := #in~cond; {5572#true} is VALID [2022-04-08 05:58:25,128 INFO L290 TraceCheckUtils]: 45: Hoare triple {5572#true} assume !(0 == ~cond); {5572#true} is VALID [2022-04-08 05:58:25,128 INFO L290 TraceCheckUtils]: 46: Hoare triple {5572#true} assume true; {5572#true} is VALID [2022-04-08 05:58:25,129 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5572#true} {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #106#return; {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-08 05:58:25,130 INFO L272 TraceCheckUtils]: 48: Hoare triple {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {5722#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:58:25,130 INFO L290 TraceCheckUtils]: 49: Hoare triple {5722#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5726#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:58:25,131 INFO L290 TraceCheckUtils]: 50: Hoare triple {5726#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5573#false} is VALID [2022-04-08 05:58:25,131 INFO L290 TraceCheckUtils]: 51: Hoare triple {5573#false} assume !false; {5573#false} is VALID [2022-04-08 05:58:25,131 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 05:58:25,131 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:58:25,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:58:25,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903400128] [2022-04-08 05:58:25,132 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:58:25,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353076233] [2022-04-08 05:58:25,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353076233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:58:25,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:58:25,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:58:25,132 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:58:25,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [437440670] [2022-04-08 05:58:25,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [437440670] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:58:25,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:58:25,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:58:25,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682698564] [2022-04-08 05:58:25,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:58:25,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 52 [2022-04-08 05:58:25,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:58:25,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 05:58:25,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:58:25,163 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 05:58:25,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:58:25,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 05:58:25,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 05:58:25,164 INFO L87 Difference]: Start difference. First operand 106 states and 137 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 05:58:25,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:58:25,702 INFO L93 Difference]: Finished difference Result 158 states and 221 transitions. [2022-04-08 05:58:25,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 05:58:25,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 52 [2022-04-08 05:58:25,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:58:25,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 05:58:25,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 05:58:25,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 05:58:25,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 05:58:25,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-08 05:58:25,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:58:25,761 INFO L225 Difference]: With dead ends: 158 [2022-04-08 05:58:25,762 INFO L226 Difference]: Without dead ends: 156 [2022-04-08 05:58:25,762 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 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 05:58:25,763 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 9 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 05:58:25,763 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 156 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:58:25,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-04-08 05:58:26,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 140. [2022-04-08 05:58:26,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:58:26,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand has 140 states, 74 states have (on average 1.162162162162162) internal successors, (86), 81 states have internal predecessors, (86), 55 states have call successors, (55), 11 states have call predecessors, (55), 10 states have return successors, (53), 47 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-08 05:58:26,115 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand has 140 states, 74 states have (on average 1.162162162162162) internal successors, (86), 81 states have internal predecessors, (86), 55 states have call successors, (55), 11 states have call predecessors, (55), 10 states have return successors, (53), 47 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-08 05:58:26,116 INFO L87 Difference]: Start difference. First operand 156 states. Second operand has 140 states, 74 states have (on average 1.162162162162162) internal successors, (86), 81 states have internal predecessors, (86), 55 states have call successors, (55), 11 states have call predecessors, (55), 10 states have return successors, (53), 47 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-08 05:58:26,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:58:26,122 INFO L93 Difference]: Finished difference Result 156 states and 219 transitions. [2022-04-08 05:58:26,122 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 219 transitions. [2022-04-08 05:58:26,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:58:26,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:58:26,123 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 74 states have (on average 1.162162162162162) internal successors, (86), 81 states have internal predecessors, (86), 55 states have call successors, (55), 11 states have call predecessors, (55), 10 states have return successors, (53), 47 states have call predecessors, (53), 53 states have call successors, (53) Second operand 156 states. [2022-04-08 05:58:26,124 INFO L87 Difference]: Start difference. First operand has 140 states, 74 states have (on average 1.162162162162162) internal successors, (86), 81 states have internal predecessors, (86), 55 states have call successors, (55), 11 states have call predecessors, (55), 10 states have return successors, (53), 47 states have call predecessors, (53), 53 states have call successors, (53) Second operand 156 states. [2022-04-08 05:58:26,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:58:26,130 INFO L93 Difference]: Finished difference Result 156 states and 219 transitions. [2022-04-08 05:58:26,130 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 219 transitions. [2022-04-08 05:58:26,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:58:26,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:58:26,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:58:26,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:58:26,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 74 states have (on average 1.162162162162162) internal successors, (86), 81 states have internal predecessors, (86), 55 states have call successors, (55), 11 states have call predecessors, (55), 10 states have return successors, (53), 47 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-08 05:58:26,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2022-04-08 05:58:26,138 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 52 [2022-04-08 05:58:26,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:58:26,138 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2022-04-08 05:58:26,138 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 05:58:26,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 194 transitions. [2022-04-08 05:58:26,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:58:26,494 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2022-04-08 05:58:26,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-08 05:58:26,495 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:58:26,495 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, 1, 1] [2022-04-08 05:58:26,514 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 05:58:26,696 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 05:58:26,696 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:58:26,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:58:26,697 INFO L85 PathProgramCache]: Analyzing trace with hash 188363668, now seen corresponding path program 1 times [2022-04-08 05:58:26,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:58:26,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [469269649] [2022-04-08 05:58:26,697 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:58:26,697 INFO L85 PathProgramCache]: Analyzing trace with hash 188363668, now seen corresponding path program 2 times [2022-04-08 05:58:26,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:58:26,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939485797] [2022-04-08 05:58:26,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:58:26,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:58:26,713 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:58:26,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1859515651] [2022-04-08 05:58:26,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:58:26,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:58:26,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:58:26,723 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 05:58:26,724 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 05:58:26,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:58:26,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:58:26,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-08 05:58:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:58:26,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:58:27,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {6642#true} call ULTIMATE.init(); {6642#true} is VALID [2022-04-08 05:58:27,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {6642#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); {6642#true} is VALID [2022-04-08 05:58:27,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-08 05:58:27,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6642#true} {6642#true} #112#return; {6642#true} is VALID [2022-04-08 05:58:27,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {6642#true} call #t~ret6 := main(); {6642#true} is VALID [2022-04-08 05:58:27,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {6642#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {6642#true} is VALID [2022-04-08 05:58:27,543 INFO L272 TraceCheckUtils]: 6: Hoare triple {6642#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {6642#true} is VALID [2022-04-08 05:58:27,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-08 05:58:27,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-08 05:58:27,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-08 05:58:27,543 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6642#true} {6642#true} #94#return; {6642#true} is VALID [2022-04-08 05:58:27,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {6642#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6642#true} is VALID [2022-04-08 05:58:27,543 INFO L272 TraceCheckUtils]: 12: Hoare triple {6642#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {6642#true} is VALID [2022-04-08 05:58:27,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-08 05:58:27,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-08 05:58:27,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-08 05:58:27,544 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6642#true} {6642#true} #96#return; {6642#true} is VALID [2022-04-08 05:58:27,544 INFO L272 TraceCheckUtils]: 17: Hoare triple {6642#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6642#true} is VALID [2022-04-08 05:58:27,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-08 05:58:27,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-08 05:58:27,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-08 05:58:27,544 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6642#true} {6642#true} #98#return; {6642#true} is VALID [2022-04-08 05:58:27,544 INFO L272 TraceCheckUtils]: 22: Hoare triple {6642#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6642#true} is VALID [2022-04-08 05:58:27,544 INFO L290 TraceCheckUtils]: 23: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-08 05:58:27,544 INFO L290 TraceCheckUtils]: 24: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-08 05:58:27,545 INFO L290 TraceCheckUtils]: 25: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-08 05:58:27,545 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6642#true} {6642#true} #100#return; {6642#true} is VALID [2022-04-08 05:58:27,545 INFO L290 TraceCheckUtils]: 27: Hoare triple {6642#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {6728#(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 05:58:27,546 INFO L290 TraceCheckUtils]: 28: Hoare triple {6728#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {6728#(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 05:58:27,546 INFO L290 TraceCheckUtils]: 29: Hoare triple {6728#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {6735#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:58:27,547 INFO L290 TraceCheckUtils]: 30: Hoare triple {6735#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {6735#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:58:27,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {6735#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {6742#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:58:27,548 INFO L290 TraceCheckUtils]: 32: Hoare triple {6742#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {6742#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:58:27,548 INFO L272 TraceCheckUtils]: 33: Hoare triple {6742#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6642#true} is VALID [2022-04-08 05:58:27,548 INFO L290 TraceCheckUtils]: 34: Hoare triple {6642#true} ~cond := #in~cond; {6752#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:58:27,549 INFO L290 TraceCheckUtils]: 35: Hoare triple {6752#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:58:27,549 INFO L290 TraceCheckUtils]: 36: Hoare triple {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:58:27,550 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} {6742#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #102#return; {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:58:27,551 INFO L272 TraceCheckUtils]: 38: Hoare triple {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6642#true} is VALID [2022-04-08 05:58:27,551 INFO L290 TraceCheckUtils]: 39: Hoare triple {6642#true} ~cond := #in~cond; {6752#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:58:27,551 INFO L290 TraceCheckUtils]: 40: Hoare triple {6752#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:58:27,552 INFO L290 TraceCheckUtils]: 41: Hoare triple {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:58:27,553 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #104#return; {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:58:27,553 INFO L272 TraceCheckUtils]: 43: Hoare triple {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {6642#true} is VALID [2022-04-08 05:58:27,553 INFO L290 TraceCheckUtils]: 44: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-08 05:58:27,553 INFO L290 TraceCheckUtils]: 45: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-08 05:58:27,553 INFO L290 TraceCheckUtils]: 46: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-08 05:58:27,554 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6642#true} {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #106#return; {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:58:27,554 INFO L272 TraceCheckUtils]: 48: Hoare triple {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {6642#true} is VALID [2022-04-08 05:58:27,554 INFO L290 TraceCheckUtils]: 49: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-08 05:58:27,554 INFO L290 TraceCheckUtils]: 50: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-08 05:58:27,555 INFO L290 TraceCheckUtils]: 51: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-08 05:58:27,556 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6642#true} {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #108#return; {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:58:27,556 INFO L290 TraceCheckUtils]: 53: Hoare triple {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:58:27,557 INFO L290 TraceCheckUtils]: 54: Hoare triple {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {6815#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:58:27,557 INFO L290 TraceCheckUtils]: 55: Hoare triple {6815#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {6815#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:58:27,558 INFO L290 TraceCheckUtils]: 56: Hoare triple {6815#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {6815#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:58:27,559 INFO L290 TraceCheckUtils]: 57: Hoare triple {6815#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {6825#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (+ main_~s~0 1) 0))} is VALID [2022-04-08 05:58:27,559 INFO L290 TraceCheckUtils]: 58: Hoare triple {6825#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (+ main_~s~0 1) 0))} assume !false; {6825#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (+ main_~s~0 1) 0))} is VALID [2022-04-08 05:58:27,560 INFO L290 TraceCheckUtils]: 59: Hoare triple {6825#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (+ main_~s~0 1) 0))} assume !(0 != ~b~0); {6832#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~s~0 1) 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0))} is VALID [2022-04-08 05:58:27,561 INFO L272 TraceCheckUtils]: 60: Hoare triple {6832#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~s~0 1) 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {6836#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:58:27,561 INFO L290 TraceCheckUtils]: 61: Hoare triple {6836#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6840#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:58:27,562 INFO L290 TraceCheckUtils]: 62: Hoare triple {6840#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6643#false} is VALID [2022-04-08 05:58:27,562 INFO L290 TraceCheckUtils]: 63: Hoare triple {6643#false} assume !false; {6643#false} is VALID [2022-04-08 05:58:27,562 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 05:58:27,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:59:06,994 INFO L290 TraceCheckUtils]: 63: Hoare triple {6643#false} assume !false; {6643#false} is VALID [2022-04-08 05:59:06,995 INFO L290 TraceCheckUtils]: 62: Hoare triple {6840#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6643#false} is VALID [2022-04-08 05:59:06,995 INFO L290 TraceCheckUtils]: 61: Hoare triple {6836#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6840#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:59:06,996 INFO L272 TraceCheckUtils]: 60: Hoare triple {6856#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {6836#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:59:06,996 INFO L290 TraceCheckUtils]: 59: Hoare triple {6860#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !(0 != ~b~0); {6856#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:59:06,997 INFO L290 TraceCheckUtils]: 58: Hoare triple {6860#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !false; {6860#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-08 05:59:07,117 INFO L290 TraceCheckUtils]: 57: Hoare triple {6867#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {6860#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-08 05:59:07,118 INFO L290 TraceCheckUtils]: 56: Hoare triple {6867#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {6867#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 05:59:07,119 INFO L290 TraceCheckUtils]: 55: Hoare triple {6867#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {6867#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 05:59:07,302 INFO L290 TraceCheckUtils]: 54: Hoare triple {6877#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {6867#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 05:59:07,303 INFO L290 TraceCheckUtils]: 53: Hoare triple {6877#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= 2 * ~v~0); {6877#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 05:59:07,304 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6642#true} {6877#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #108#return; {6877#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 05:59:07,305 INFO L290 TraceCheckUtils]: 51: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-08 05:59:07,305 INFO L290 TraceCheckUtils]: 50: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-08 05:59:07,305 INFO L290 TraceCheckUtils]: 49: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-08 05:59:07,305 INFO L272 TraceCheckUtils]: 48: Hoare triple {6877#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {6642#true} is VALID [2022-04-08 05:59:07,306 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6642#true} {6877#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #106#return; {6877#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 05:59:07,306 INFO L290 TraceCheckUtils]: 46: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-08 05:59:07,306 INFO L290 TraceCheckUtils]: 45: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-08 05:59:07,306 INFO L290 TraceCheckUtils]: 44: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-08 05:59:07,306 INFO L272 TraceCheckUtils]: 43: Hoare triple {6877#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {6642#true} is VALID [2022-04-08 05:59:07,307 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} {6914#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {6877#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 05:59:07,307 INFO L290 TraceCheckUtils]: 41: Hoare triple {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:59:07,308 INFO L290 TraceCheckUtils]: 40: Hoare triple {6924#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:59:07,308 INFO L290 TraceCheckUtils]: 39: Hoare triple {6642#true} ~cond := #in~cond; {6924#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:59:07,308 INFO L272 TraceCheckUtils]: 38: Hoare triple {6914#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6642#true} is VALID [2022-04-08 05:59:07,309 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} {6931#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #102#return; {6914#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 05:59:07,309 INFO L290 TraceCheckUtils]: 36: Hoare triple {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:59:07,310 INFO L290 TraceCheckUtils]: 35: Hoare triple {6924#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:59:07,310 INFO L290 TraceCheckUtils]: 34: Hoare triple {6642#true} ~cond := #in~cond; {6924#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:59:07,310 INFO L272 TraceCheckUtils]: 33: Hoare triple {6931#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6642#true} is VALID [2022-04-08 05:59:07,311 INFO L290 TraceCheckUtils]: 32: Hoare triple {6931#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {6931#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 05:59:07,312 INFO L290 TraceCheckUtils]: 31: Hoare triple {6950#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {6931#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 05:59:07,312 INFO L290 TraceCheckUtils]: 30: Hoare triple {6950#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} assume !false; {6950#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-08 05:59:07,313 INFO L290 TraceCheckUtils]: 29: Hoare triple {6642#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {6950#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-08 05:59:07,313 INFO L290 TraceCheckUtils]: 28: Hoare triple {6642#true} assume !false; {6642#true} is VALID [2022-04-08 05:59:07,313 INFO L290 TraceCheckUtils]: 27: Hoare triple {6642#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {6642#true} is VALID [2022-04-08 05:59:07,313 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6642#true} {6642#true} #100#return; {6642#true} is VALID [2022-04-08 05:59:07,313 INFO L290 TraceCheckUtils]: 25: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-08 05:59:07,313 INFO L290 TraceCheckUtils]: 24: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-08 05:59:07,313 INFO L290 TraceCheckUtils]: 23: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-08 05:59:07,314 INFO L272 TraceCheckUtils]: 22: Hoare triple {6642#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6642#true} is VALID [2022-04-08 05:59:07,314 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6642#true} {6642#true} #98#return; {6642#true} is VALID [2022-04-08 05:59:07,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-08 05:59:07,314 INFO L290 TraceCheckUtils]: 19: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-08 05:59:07,314 INFO L290 TraceCheckUtils]: 18: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-08 05:59:07,314 INFO L272 TraceCheckUtils]: 17: Hoare triple {6642#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6642#true} is VALID [2022-04-08 05:59:07,314 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6642#true} {6642#true} #96#return; {6642#true} is VALID [2022-04-08 05:59:07,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-08 05:59:07,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-08 05:59:07,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-08 05:59:07,315 INFO L272 TraceCheckUtils]: 12: Hoare triple {6642#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {6642#true} is VALID [2022-04-08 05:59:07,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {6642#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6642#true} is VALID [2022-04-08 05:59:07,315 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6642#true} {6642#true} #94#return; {6642#true} is VALID [2022-04-08 05:59:07,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-08 05:59:07,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-08 05:59:07,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-08 05:59:07,315 INFO L272 TraceCheckUtils]: 6: Hoare triple {6642#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {6642#true} is VALID [2022-04-08 05:59:07,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {6642#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {6642#true} is VALID [2022-04-08 05:59:07,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {6642#true} call #t~ret6 := main(); {6642#true} is VALID [2022-04-08 05:59:07,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6642#true} {6642#true} #112#return; {6642#true} is VALID [2022-04-08 05:59:07,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-08 05:59:07,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {6642#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); {6642#true} is VALID [2022-04-08 05:59:07,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {6642#true} call ULTIMATE.init(); {6642#true} is VALID [2022-04-08 05:59:07,316 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 05:59:07,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:59:07,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939485797] [2022-04-08 05:59:07,316 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:59:07,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859515651] [2022-04-08 05:59:07,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859515651] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:59:07,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:59:07,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2022-04-08 05:59:07,317 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:59:07,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [469269649] [2022-04-08 05:59:07,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [469269649] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:59:07,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:59:07,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 05:59:07,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952440500] [2022-04-08 05:59:07,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:59:07,318 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (11), 2 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 64 [2022-04-08 05:59:07,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:59:07,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (11), 2 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 05:59:07,356 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 05:59:07,356 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 05:59:07,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:59:07,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 05:59:07,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-04-08 05:59:07,357 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (11), 2 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 05:59:09,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:59:09,499 INFO L93 Difference]: Finished difference Result 200 states and 283 transitions. [2022-04-08 05:59:09,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 05:59:09,499 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (11), 2 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 64 [2022-04-08 05:59:09,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:59:09,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (11), 2 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 05:59:09,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 131 transitions. [2022-04-08 05:59:09,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (11), 2 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 05:59:09,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 131 transitions. [2022-04-08 05:59:09,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 131 transitions. [2022-04-08 05:59:09,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:59:09,652 INFO L225 Difference]: With dead ends: 200 [2022-04-08 05:59:09,652 INFO L226 Difference]: Without dead ends: 197 [2022-04-08 05:59:09,654 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-04-08 05:59:09,655 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 48 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 05:59:09,656 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 306 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 05:59:09,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-08 05:59:10,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 193. [2022-04-08 05:59:10,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:59:10,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 193 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 110 states have internal predecessors, (119), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 69 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-08 05:59:10,120 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 193 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 110 states have internal predecessors, (119), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 69 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-08 05:59:10,121 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 193 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 110 states have internal predecessors, (119), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 69 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-08 05:59:10,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:59:10,128 INFO L93 Difference]: Finished difference Result 197 states and 279 transitions. [2022-04-08 05:59:10,129 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 279 transitions. [2022-04-08 05:59:10,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:59:10,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:59:10,130 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 110 states have internal predecessors, (119), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 69 states have call predecessors, (77), 77 states have call successors, (77) Second operand 197 states. [2022-04-08 05:59:10,131 INFO L87 Difference]: Start difference. First operand has 193 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 110 states have internal predecessors, (119), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 69 states have call predecessors, (77), 77 states have call successors, (77) Second operand 197 states. [2022-04-08 05:59:10,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:59:10,138 INFO L93 Difference]: Finished difference Result 197 states and 279 transitions. [2022-04-08 05:59:10,138 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 279 transitions. [2022-04-08 05:59:10,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:59:10,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:59:10,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:59:10,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:59:10,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 110 states have internal predecessors, (119), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 69 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-08 05:59:10,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 275 transitions. [2022-04-08 05:59:10,147 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 275 transitions. Word has length 64 [2022-04-08 05:59:10,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:59:10,147 INFO L478 AbstractCegarLoop]: Abstraction has 193 states and 275 transitions. [2022-04-08 05:59:10,148 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (11), 2 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 05:59:10,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 193 states and 275 transitions. [2022-04-08 05:59:10,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 275 edges. 275 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:59:10,570 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 275 transitions. [2022-04-08 05:59:10,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-08 05:59:10,571 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:59:10,571 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:59:10,597 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 05:59:10,771 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 05:59:10,772 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:59:10,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:59:10,772 INFO L85 PathProgramCache]: Analyzing trace with hash -368004398, now seen corresponding path program 3 times [2022-04-08 05:59:10,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:59:10,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [383551104] [2022-04-08 05:59:10,772 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:59:10,773 INFO L85 PathProgramCache]: Analyzing trace with hash -368004398, now seen corresponding path program 4 times [2022-04-08 05:59:10,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:59:10,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39447687] [2022-04-08 05:59:10,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:59:10,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:59:10,786 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:59:10,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1873694755] [2022-04-08 05:59:10,786 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 05:59:10,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:59:10,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:59:10,787 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 05:59:10,802 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 05:59:10,858 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 05:59:10,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:59:10,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 05:59:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:59:10,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:59:11,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {8234#true} call ULTIMATE.init(); {8234#true} is VALID [2022-04-08 05:59:11,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {8234#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); {8234#true} is VALID [2022-04-08 05:59:11,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-08 05:59:11,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8234#true} {8234#true} #112#return; {8234#true} is VALID [2022-04-08 05:59:11,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {8234#true} call #t~ret6 := main(); {8234#true} is VALID [2022-04-08 05:59:11,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {8234#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {8234#true} is VALID [2022-04-08 05:59:11,121 INFO L272 TraceCheckUtils]: 6: Hoare triple {8234#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {8234#true} is VALID [2022-04-08 05:59:11,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-08 05:59:11,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-08 05:59:11,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-08 05:59:11,121 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8234#true} {8234#true} #94#return; {8234#true} is VALID [2022-04-08 05:59:11,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {8234#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8234#true} is VALID [2022-04-08 05:59:11,121 INFO L272 TraceCheckUtils]: 12: Hoare triple {8234#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {8234#true} is VALID [2022-04-08 05:59:11,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-08 05:59:11,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-08 05:59:11,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-08 05:59:11,122 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8234#true} {8234#true} #96#return; {8234#true} is VALID [2022-04-08 05:59:11,122 INFO L272 TraceCheckUtils]: 17: Hoare triple {8234#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8234#true} is VALID [2022-04-08 05:59:11,122 INFO L290 TraceCheckUtils]: 18: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-08 05:59:11,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-08 05:59:11,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-08 05:59:11,122 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8234#true} {8234#true} #98#return; {8234#true} is VALID [2022-04-08 05:59:11,122 INFO L272 TraceCheckUtils]: 22: Hoare triple {8234#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8234#true} is VALID [2022-04-08 05:59:11,122 INFO L290 TraceCheckUtils]: 23: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-08 05:59:11,122 INFO L290 TraceCheckUtils]: 24: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-08 05:59:11,122 INFO L290 TraceCheckUtils]: 25: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-08 05:59:11,122 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8234#true} {8234#true} #100#return; {8234#true} is VALID [2022-04-08 05:59:11,123 INFO L290 TraceCheckUtils]: 27: Hoare triple {8234#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {8234#true} is VALID [2022-04-08 05:59:11,123 INFO L290 TraceCheckUtils]: 28: Hoare triple {8234#true} assume !false; {8234#true} is VALID [2022-04-08 05:59:11,123 INFO L290 TraceCheckUtils]: 29: Hoare triple {8234#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {8234#true} is VALID [2022-04-08 05:59:11,123 INFO L290 TraceCheckUtils]: 30: Hoare triple {8234#true} assume !false; {8234#true} is VALID [2022-04-08 05:59:11,123 INFO L290 TraceCheckUtils]: 31: Hoare triple {8234#true} assume !(~c~0 >= ~b~0); {8332#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-08 05:59:11,123 INFO L290 TraceCheckUtils]: 32: Hoare triple {8332#(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; {8336#(< main_~b~0 main_~a~0)} is VALID [2022-04-08 05:59:11,124 INFO L290 TraceCheckUtils]: 33: Hoare triple {8336#(< main_~b~0 main_~a~0)} assume !false; {8336#(< main_~b~0 main_~a~0)} is VALID [2022-04-08 05:59:11,124 INFO L290 TraceCheckUtils]: 34: Hoare triple {8336#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {8343#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:59:11,124 INFO L290 TraceCheckUtils]: 35: Hoare triple {8343#(< main_~b~0 main_~c~0)} assume !false; {8343#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:59:11,125 INFO L290 TraceCheckUtils]: 36: Hoare triple {8343#(< main_~b~0 main_~c~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-08 05:59:11,125 INFO L290 TraceCheckUtils]: 37: Hoare triple {8350#(< main_~v~0 main_~c~0)} assume !false; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-08 05:59:11,125 INFO L272 TraceCheckUtils]: 38: Hoare triple {8350#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8234#true} is VALID [2022-04-08 05:59:11,125 INFO L290 TraceCheckUtils]: 39: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-08 05:59:11,125 INFO L290 TraceCheckUtils]: 40: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-08 05:59:11,125 INFO L290 TraceCheckUtils]: 41: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-08 05:59:11,126 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8234#true} {8350#(< main_~v~0 main_~c~0)} #102#return; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-08 05:59:11,126 INFO L272 TraceCheckUtils]: 43: Hoare triple {8350#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8234#true} is VALID [2022-04-08 05:59:11,126 INFO L290 TraceCheckUtils]: 44: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-08 05:59:11,126 INFO L290 TraceCheckUtils]: 45: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-08 05:59:11,126 INFO L290 TraceCheckUtils]: 46: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-08 05:59:11,127 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8234#true} {8350#(< main_~v~0 main_~c~0)} #104#return; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-08 05:59:11,127 INFO L272 TraceCheckUtils]: 48: Hoare triple {8350#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8234#true} is VALID [2022-04-08 05:59:11,127 INFO L290 TraceCheckUtils]: 49: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-08 05:59:11,127 INFO L290 TraceCheckUtils]: 50: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-08 05:59:11,127 INFO L290 TraceCheckUtils]: 51: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-08 05:59:11,128 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8234#true} {8350#(< main_~v~0 main_~c~0)} #106#return; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-08 05:59:11,128 INFO L272 TraceCheckUtils]: 53: Hoare triple {8350#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {8234#true} is VALID [2022-04-08 05:59:11,128 INFO L290 TraceCheckUtils]: 54: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-08 05:59:11,128 INFO L290 TraceCheckUtils]: 55: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-08 05:59:11,128 INFO L290 TraceCheckUtils]: 56: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-08 05:59:11,128 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {8234#true} {8350#(< main_~v~0 main_~c~0)} #108#return; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-08 05:59:11,129 INFO L290 TraceCheckUtils]: 58: Hoare triple {8350#(< main_~v~0 main_~c~0)} assume !(~c~0 >= 2 * ~v~0); {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-08 05:59:11,130 INFO L290 TraceCheckUtils]: 59: Hoare triple {8350#(< main_~v~0 main_~c~0)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {8420#(< 0 main_~c~0)} is VALID [2022-04-08 05:59:11,130 INFO L290 TraceCheckUtils]: 60: Hoare triple {8420#(< 0 main_~c~0)} assume !false; {8420#(< 0 main_~c~0)} is VALID [2022-04-08 05:59:11,130 INFO L290 TraceCheckUtils]: 61: Hoare triple {8420#(< 0 main_~c~0)} assume !(~c~0 >= ~b~0); {8420#(< 0 main_~c~0)} is VALID [2022-04-08 05:59:11,131 INFO L290 TraceCheckUtils]: 62: Hoare triple {8420#(< 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; {8430#(< 0 main_~b~0)} is VALID [2022-04-08 05:59:11,131 INFO L290 TraceCheckUtils]: 63: Hoare triple {8430#(< 0 main_~b~0)} assume !false; {8430#(< 0 main_~b~0)} is VALID [2022-04-08 05:59:11,131 INFO L290 TraceCheckUtils]: 64: Hoare triple {8430#(< 0 main_~b~0)} assume !(0 != ~b~0); {8235#false} is VALID [2022-04-08 05:59:11,131 INFO L272 TraceCheckUtils]: 65: Hoare triple {8235#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {8235#false} is VALID [2022-04-08 05:59:11,131 INFO L290 TraceCheckUtils]: 66: Hoare triple {8235#false} ~cond := #in~cond; {8235#false} is VALID [2022-04-08 05:59:11,131 INFO L290 TraceCheckUtils]: 67: Hoare triple {8235#false} assume 0 == ~cond; {8235#false} is VALID [2022-04-08 05:59:11,132 INFO L290 TraceCheckUtils]: 68: Hoare triple {8235#false} assume !false; {8235#false} is VALID [2022-04-08 05:59:11,132 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-08 05:59:11,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:59:11,355 INFO L290 TraceCheckUtils]: 68: Hoare triple {8235#false} assume !false; {8235#false} is VALID [2022-04-08 05:59:11,355 INFO L290 TraceCheckUtils]: 67: Hoare triple {8235#false} assume 0 == ~cond; {8235#false} is VALID [2022-04-08 05:59:11,355 INFO L290 TraceCheckUtils]: 66: Hoare triple {8235#false} ~cond := #in~cond; {8235#false} is VALID [2022-04-08 05:59:11,355 INFO L272 TraceCheckUtils]: 65: Hoare triple {8235#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {8235#false} is VALID [2022-04-08 05:59:11,355 INFO L290 TraceCheckUtils]: 64: Hoare triple {8430#(< 0 main_~b~0)} assume !(0 != ~b~0); {8235#false} is VALID [2022-04-08 05:59:11,356 INFO L290 TraceCheckUtils]: 63: Hoare triple {8430#(< 0 main_~b~0)} assume !false; {8430#(< 0 main_~b~0)} is VALID [2022-04-08 05:59:11,356 INFO L290 TraceCheckUtils]: 62: Hoare triple {8420#(< 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; {8430#(< 0 main_~b~0)} is VALID [2022-04-08 05:59:11,356 INFO L290 TraceCheckUtils]: 61: Hoare triple {8420#(< 0 main_~c~0)} assume !(~c~0 >= ~b~0); {8420#(< 0 main_~c~0)} is VALID [2022-04-08 05:59:11,357 INFO L290 TraceCheckUtils]: 60: Hoare triple {8420#(< 0 main_~c~0)} assume !false; {8420#(< 0 main_~c~0)} is VALID [2022-04-08 05:59:11,357 INFO L290 TraceCheckUtils]: 59: Hoare triple {8350#(< main_~v~0 main_~c~0)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {8420#(< 0 main_~c~0)} is VALID [2022-04-08 05:59:11,357 INFO L290 TraceCheckUtils]: 58: Hoare triple {8350#(< main_~v~0 main_~c~0)} assume !(~c~0 >= 2 * ~v~0); {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-08 05:59:11,358 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {8234#true} {8350#(< main_~v~0 main_~c~0)} #108#return; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-08 05:59:11,358 INFO L290 TraceCheckUtils]: 56: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-08 05:59:11,358 INFO L290 TraceCheckUtils]: 55: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-08 05:59:11,358 INFO L290 TraceCheckUtils]: 54: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-08 05:59:11,358 INFO L272 TraceCheckUtils]: 53: Hoare triple {8350#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {8234#true} is VALID [2022-04-08 05:59:11,359 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8234#true} {8350#(< main_~v~0 main_~c~0)} #106#return; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-08 05:59:11,359 INFO L290 TraceCheckUtils]: 51: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-08 05:59:11,360 INFO L290 TraceCheckUtils]: 50: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-08 05:59:11,360 INFO L290 TraceCheckUtils]: 49: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-08 05:59:11,360 INFO L272 TraceCheckUtils]: 48: Hoare triple {8350#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8234#true} is VALID [2022-04-08 05:59:11,360 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8234#true} {8350#(< main_~v~0 main_~c~0)} #104#return; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-08 05:59:11,360 INFO L290 TraceCheckUtils]: 46: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-08 05:59:11,360 INFO L290 TraceCheckUtils]: 45: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-08 05:59:11,361 INFO L290 TraceCheckUtils]: 44: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-08 05:59:11,361 INFO L272 TraceCheckUtils]: 43: Hoare triple {8350#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8234#true} is VALID [2022-04-08 05:59:11,361 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8234#true} {8350#(< main_~v~0 main_~c~0)} #102#return; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-08 05:59:11,361 INFO L290 TraceCheckUtils]: 41: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-08 05:59:11,361 INFO L290 TraceCheckUtils]: 40: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-08 05:59:11,362 INFO L290 TraceCheckUtils]: 39: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-08 05:59:11,362 INFO L272 TraceCheckUtils]: 38: Hoare triple {8350#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8234#true} is VALID [2022-04-08 05:59:11,363 INFO L290 TraceCheckUtils]: 37: Hoare triple {8350#(< main_~v~0 main_~c~0)} assume !false; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-08 05:59:11,364 INFO L290 TraceCheckUtils]: 36: Hoare triple {8343#(< main_~b~0 main_~c~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-08 05:59:11,364 INFO L290 TraceCheckUtils]: 35: Hoare triple {8343#(< main_~b~0 main_~c~0)} assume !false; {8343#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:59:11,364 INFO L290 TraceCheckUtils]: 34: Hoare triple {8336#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {8343#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:59:11,365 INFO L290 TraceCheckUtils]: 33: Hoare triple {8336#(< main_~b~0 main_~a~0)} assume !false; {8336#(< main_~b~0 main_~a~0)} is VALID [2022-04-08 05:59:11,365 INFO L290 TraceCheckUtils]: 32: Hoare triple {8332#(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; {8336#(< main_~b~0 main_~a~0)} is VALID [2022-04-08 05:59:11,366 INFO L290 TraceCheckUtils]: 31: Hoare triple {8234#true} assume !(~c~0 >= ~b~0); {8332#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-08 05:59:11,366 INFO L290 TraceCheckUtils]: 30: Hoare triple {8234#true} assume !false; {8234#true} is VALID [2022-04-08 05:59:11,366 INFO L290 TraceCheckUtils]: 29: Hoare triple {8234#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {8234#true} is VALID [2022-04-08 05:59:11,366 INFO L290 TraceCheckUtils]: 28: Hoare triple {8234#true} assume !false; {8234#true} is VALID [2022-04-08 05:59:11,366 INFO L290 TraceCheckUtils]: 27: Hoare triple {8234#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {8234#true} is VALID [2022-04-08 05:59:11,366 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8234#true} {8234#true} #100#return; {8234#true} is VALID [2022-04-08 05:59:11,366 INFO L290 TraceCheckUtils]: 25: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-08 05:59:11,366 INFO L290 TraceCheckUtils]: 24: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-08 05:59:11,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-08 05:59:11,367 INFO L272 TraceCheckUtils]: 22: Hoare triple {8234#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8234#true} is VALID [2022-04-08 05:59:11,367 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8234#true} {8234#true} #98#return; {8234#true} is VALID [2022-04-08 05:59:11,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-08 05:59:11,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-08 05:59:11,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-08 05:59:11,367 INFO L272 TraceCheckUtils]: 17: Hoare triple {8234#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8234#true} is VALID [2022-04-08 05:59:11,367 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8234#true} {8234#true} #96#return; {8234#true} is VALID [2022-04-08 05:59:11,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-08 05:59:11,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-08 05:59:11,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-08 05:59:11,368 INFO L272 TraceCheckUtils]: 12: Hoare triple {8234#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {8234#true} is VALID [2022-04-08 05:59:11,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {8234#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8234#true} is VALID [2022-04-08 05:59:11,368 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8234#true} {8234#true} #94#return; {8234#true} is VALID [2022-04-08 05:59:11,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-08 05:59:11,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-08 05:59:11,368 INFO L290 TraceCheckUtils]: 7: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-08 05:59:11,368 INFO L272 TraceCheckUtils]: 6: Hoare triple {8234#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {8234#true} is VALID [2022-04-08 05:59:11,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {8234#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {8234#true} is VALID [2022-04-08 05:59:11,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {8234#true} call #t~ret6 := main(); {8234#true} is VALID [2022-04-08 05:59:11,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8234#true} {8234#true} #112#return; {8234#true} is VALID [2022-04-08 05:59:11,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-08 05:59:11,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {8234#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); {8234#true} is VALID [2022-04-08 05:59:11,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {8234#true} call ULTIMATE.init(); {8234#true} is VALID [2022-04-08 05:59:11,369 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-08 05:59:11,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:59:11,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39447687] [2022-04-08 05:59:11,369 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:59:11,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873694755] [2022-04-08 05:59:11,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873694755] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:59:11,370 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:59:11,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-08 05:59:11,370 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:59:11,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [383551104] [2022-04-08 05:59:11,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [383551104] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:59:11,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:59:11,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 05:59:11,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146833576] [2022-04-08 05:59:11,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:59:11,371 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 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 69 [2022-04-08 05:59:11,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:59:11,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 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 05:59:11,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:59:11,412 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 05:59:11,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:59:11,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 05:59:11,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-08 05:59:11,413 INFO L87 Difference]: Start difference. First operand 193 states and 275 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 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 05:59:13,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:59:13,383 INFO L93 Difference]: Finished difference Result 288 states and 424 transitions. [2022-04-08 05:59:13,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 05:59:13,384 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 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 69 [2022-04-08 05:59:13,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:59:13,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 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 05:59:13,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 158 transitions. [2022-04-08 05:59:13,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 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 05:59:13,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 158 transitions. [2022-04-08 05:59:13,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 158 transitions. [2022-04-08 05:59:13,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:59:13,525 INFO L225 Difference]: With dead ends: 288 [2022-04-08 05:59:13,525 INFO L226 Difference]: Without dead ends: 281 [2022-04-08 05:59:13,525 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2022-04-08 05:59:13,526 INFO L913 BasicCegarLoop]: 87 mSDtfsCounter, 48 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 05:59:13,526 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 318 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 05:59:13,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-04-08 05:59:14,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 208. [2022-04-08 05:59:14,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:59:14,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 281 states. Second operand has 208 states, 116 states have (on average 1.206896551724138) internal successors, (140), 122 states have internal predecessors, (140), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-08 05:59:14,103 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand has 208 states, 116 states have (on average 1.206896551724138) internal successors, (140), 122 states have internal predecessors, (140), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-08 05:59:14,103 INFO L87 Difference]: Start difference. First operand 281 states. Second operand has 208 states, 116 states have (on average 1.206896551724138) internal successors, (140), 122 states have internal predecessors, (140), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-08 05:59:14,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:59:14,115 INFO L93 Difference]: Finished difference Result 281 states and 417 transitions. [2022-04-08 05:59:14,115 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 417 transitions. [2022-04-08 05:59:14,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:59:14,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:59:14,117 INFO L74 IsIncluded]: Start isIncluded. First operand has 208 states, 116 states have (on average 1.206896551724138) internal successors, (140), 122 states have internal predecessors, (140), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) Second operand 281 states. [2022-04-08 05:59:14,118 INFO L87 Difference]: Start difference. First operand has 208 states, 116 states have (on average 1.206896551724138) internal successors, (140), 122 states have internal predecessors, (140), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) Second operand 281 states. [2022-04-08 05:59:14,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:59:14,129 INFO L93 Difference]: Finished difference Result 281 states and 417 transitions. [2022-04-08 05:59:14,129 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 417 transitions. [2022-04-08 05:59:14,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:59:14,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:59:14,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:59:14,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:59:14,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 116 states have (on average 1.206896551724138) internal successors, (140), 122 states have internal predecessors, (140), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-08 05:59:14,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 296 transitions. [2022-04-08 05:59:14,139 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 296 transitions. Word has length 69 [2022-04-08 05:59:14,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:59:14,140 INFO L478 AbstractCegarLoop]: Abstraction has 208 states and 296 transitions. [2022-04-08 05:59:14,140 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 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 05:59:14,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 208 states and 296 transitions. [2022-04-08 05:59:14,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:59:14,578 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 296 transitions. [2022-04-08 05:59:14,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-08 05:59:14,579 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:59:14,579 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 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 05:59:14,605 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 05:59:14,780 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 05:59:14,781 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:59:14,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:59:14,781 INFO L85 PathProgramCache]: Analyzing trace with hash -298771846, now seen corresponding path program 1 times [2022-04-08 05:59:14,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:59:14,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [638518948] [2022-04-08 05:59:14,782 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:59:14,782 INFO L85 PathProgramCache]: Analyzing trace with hash -298771846, now seen corresponding path program 2 times [2022-04-08 05:59:14,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:59:14,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136152339] [2022-04-08 05:59:14,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:59:14,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:59:14,795 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:59:14,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [460303694] [2022-04-08 05:59:14,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:59:14,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:59:14,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:59:14,797 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 05:59:14,807 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 05:59:14,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:59:14,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:59:14,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 05:59:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:59:14,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:59:16,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {10236#true} call ULTIMATE.init(); {10236#true} is VALID [2022-04-08 05:59:16,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {10236#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); {10236#true} is VALID [2022-04-08 05:59:16,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-08 05:59:16,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10236#true} {10236#true} #112#return; {10236#true} is VALID [2022-04-08 05:59:16,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {10236#true} call #t~ret6 := main(); {10236#true} is VALID [2022-04-08 05:59:16,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {10236#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {10236#true} is VALID [2022-04-08 05:59:16,020 INFO L272 TraceCheckUtils]: 6: Hoare triple {10236#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {10236#true} is VALID [2022-04-08 05:59:16,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {10236#true} ~cond := #in~cond; {10262#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:59:16,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {10262#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {10266#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:59:16,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {10266#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {10266#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:59:16,021 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10266#(not (= |assume_abort_if_not_#in~cond| 0))} {10236#true} #94#return; {10273#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 05:59:16,022 INFO L290 TraceCheckUtils]: 11: Hoare triple {10273#(and (<= 0 main_~x~0) (<= main_~x~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10273#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 05:59:16,022 INFO L272 TraceCheckUtils]: 12: Hoare triple {10273#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {10236#true} is VALID [2022-04-08 05:59:16,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {10236#true} ~cond := #in~cond; {10262#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:59:16,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {10262#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {10266#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:59:16,022 INFO L290 TraceCheckUtils]: 15: Hoare triple {10266#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {10266#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:59:16,023 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10266#(not (= |assume_abort_if_not_#in~cond| 0))} {10273#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #96#return; {10292#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 05:59:16,023 INFO L272 TraceCheckUtils]: 17: Hoare triple {10292#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10236#true} is VALID [2022-04-08 05:59:16,023 INFO L290 TraceCheckUtils]: 18: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-08 05:59:16,023 INFO L290 TraceCheckUtils]: 19: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-08 05:59:16,023 INFO L290 TraceCheckUtils]: 20: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-08 05:59:16,024 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10236#true} {10292#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} #98#return; {10292#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 05:59:16,024 INFO L272 TraceCheckUtils]: 22: Hoare triple {10292#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10236#true} is VALID [2022-04-08 05:59:16,024 INFO L290 TraceCheckUtils]: 23: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-08 05:59:16,024 INFO L290 TraceCheckUtils]: 24: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-08 05:59:16,024 INFO L290 TraceCheckUtils]: 25: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-08 05:59:16,024 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10236#true} {10292#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} #100#return; {10292#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 05:59:16,025 INFO L290 TraceCheckUtils]: 27: Hoare triple {10292#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {10326#(and (<= main_~b~0 2) (<= main_~a~0 2) (<= 0 main_~b~0))} is VALID [2022-04-08 05:59:16,025 INFO L290 TraceCheckUtils]: 28: Hoare triple {10326#(and (<= main_~b~0 2) (<= main_~a~0 2) (<= 0 main_~b~0))} assume !false; {10326#(and (<= main_~b~0 2) (<= main_~a~0 2) (<= 0 main_~b~0))} is VALID [2022-04-08 05:59:16,027 INFO L290 TraceCheckUtils]: 29: Hoare triple {10326#(and (<= main_~b~0 2) (<= main_~a~0 2) (<= 0 main_~b~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {10333#(and (<= main_~b~0 2) (<= main_~c~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-08 05:59:16,031 INFO L290 TraceCheckUtils]: 30: Hoare triple {10333#(and (<= main_~b~0 2) (<= main_~c~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !false; {10333#(and (<= main_~b~0 2) (<= main_~c~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-08 05:59:16,032 INFO L290 TraceCheckUtils]: 31: Hoare triple {10333#(and (<= main_~b~0 2) (<= main_~c~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-08 05:59:16,032 INFO L290 TraceCheckUtils]: 32: Hoare triple {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !false; {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-08 05:59:16,032 INFO L272 TraceCheckUtils]: 33: Hoare triple {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10236#true} is VALID [2022-04-08 05:59:16,032 INFO L290 TraceCheckUtils]: 34: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-08 05:59:16,033 INFO L290 TraceCheckUtils]: 35: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-08 05:59:16,033 INFO L290 TraceCheckUtils]: 36: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-08 05:59:16,034 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {10236#true} {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #102#return; {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-08 05:59:16,034 INFO L272 TraceCheckUtils]: 38: Hoare triple {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10236#true} is VALID [2022-04-08 05:59:16,034 INFO L290 TraceCheckUtils]: 39: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-08 05:59:16,034 INFO L290 TraceCheckUtils]: 40: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-08 05:59:16,034 INFO L290 TraceCheckUtils]: 41: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-08 05:59:16,035 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10236#true} {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #104#return; {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-08 05:59:16,035 INFO L272 TraceCheckUtils]: 43: Hoare triple {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10236#true} is VALID [2022-04-08 05:59:16,035 INFO L290 TraceCheckUtils]: 44: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-08 05:59:16,035 INFO L290 TraceCheckUtils]: 45: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-08 05:59:16,035 INFO L290 TraceCheckUtils]: 46: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-08 05:59:16,036 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10236#true} {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #106#return; {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-08 05:59:16,036 INFO L272 TraceCheckUtils]: 48: Hoare triple {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {10236#true} is VALID [2022-04-08 05:59:16,036 INFO L290 TraceCheckUtils]: 49: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-08 05:59:16,036 INFO L290 TraceCheckUtils]: 50: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-08 05:59:16,036 INFO L290 TraceCheckUtils]: 51: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-08 05:59:16,037 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10236#true} {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #108#return; {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-08 05:59:16,038 INFO L290 TraceCheckUtils]: 53: Hoare triple {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-08 05:59:16,038 INFO L290 TraceCheckUtils]: 54: Hoare triple {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !false; {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-08 05:59:16,038 INFO L272 TraceCheckUtils]: 55: Hoare triple {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10236#true} is VALID [2022-04-08 05:59:16,039 INFO L290 TraceCheckUtils]: 56: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-08 05:59:16,039 INFO L290 TraceCheckUtils]: 57: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-08 05:59:16,039 INFO L290 TraceCheckUtils]: 58: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-08 05:59:16,040 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10236#true} {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #102#return; {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-08 05:59:16,040 INFO L272 TraceCheckUtils]: 60: Hoare triple {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10236#true} is VALID [2022-04-08 05:59:16,040 INFO L290 TraceCheckUtils]: 61: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-08 05:59:16,040 INFO L290 TraceCheckUtils]: 62: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-08 05:59:16,040 INFO L290 TraceCheckUtils]: 63: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-08 05:59:16,041 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {10236#true} {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #104#return; {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-08 05:59:16,041 INFO L272 TraceCheckUtils]: 65: Hoare triple {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10236#true} is VALID [2022-04-08 05:59:16,041 INFO L290 TraceCheckUtils]: 66: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-08 05:59:16,041 INFO L290 TraceCheckUtils]: 67: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-08 05:59:16,041 INFO L290 TraceCheckUtils]: 68: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-08 05:59:16,042 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {10236#true} {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #106#return; {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-08 05:59:16,042 INFO L272 TraceCheckUtils]: 70: Hoare triple {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {10459#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:59:16,043 INFO L290 TraceCheckUtils]: 71: Hoare triple {10459#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10463#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:59:16,043 INFO L290 TraceCheckUtils]: 72: Hoare triple {10463#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10237#false} is VALID [2022-04-08 05:59:16,043 INFO L290 TraceCheckUtils]: 73: Hoare triple {10237#false} assume !false; {10237#false} is VALID [2022-04-08 05:59:16,044 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-04-08 05:59:16,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:59:16,461 INFO L290 TraceCheckUtils]: 73: Hoare triple {10237#false} assume !false; {10237#false} is VALID [2022-04-08 05:59:16,461 INFO L290 TraceCheckUtils]: 72: Hoare triple {10463#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10237#false} is VALID [2022-04-08 05:59:16,462 INFO L290 TraceCheckUtils]: 71: Hoare triple {10459#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10463#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:59:16,463 INFO L272 TraceCheckUtils]: 70: Hoare triple {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {10459#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:59:16,463 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {10236#true} {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} #106#return; {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-08 05:59:16,463 INFO L290 TraceCheckUtils]: 68: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-08 05:59:16,464 INFO L290 TraceCheckUtils]: 67: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-08 05:59:16,464 INFO L290 TraceCheckUtils]: 66: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-08 05:59:16,464 INFO L272 TraceCheckUtils]: 65: Hoare triple {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10236#true} is VALID [2022-04-08 05:59:16,465 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {10236#true} {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} #104#return; {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-08 05:59:16,465 INFO L290 TraceCheckUtils]: 63: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-08 05:59:16,465 INFO L290 TraceCheckUtils]: 62: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-08 05:59:16,465 INFO L290 TraceCheckUtils]: 61: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-08 05:59:16,465 INFO L272 TraceCheckUtils]: 60: Hoare triple {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10236#true} is VALID [2022-04-08 05:59:16,466 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10236#true} {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} #102#return; {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-08 05:59:16,466 INFO L290 TraceCheckUtils]: 58: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-08 05:59:16,466 INFO L290 TraceCheckUtils]: 57: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-08 05:59:16,466 INFO L290 TraceCheckUtils]: 56: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-08 05:59:16,466 INFO L272 TraceCheckUtils]: 55: Hoare triple {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10236#true} is VALID [2022-04-08 05:59:16,467 INFO L290 TraceCheckUtils]: 54: Hoare triple {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} assume !false; {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-08 05:59:16,470 INFO L290 TraceCheckUtils]: 53: Hoare triple {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-08 05:59:16,470 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10236#true} {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} #108#return; {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-08 05:59:16,471 INFO L290 TraceCheckUtils]: 51: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-08 05:59:16,471 INFO L290 TraceCheckUtils]: 50: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-08 05:59:16,471 INFO L290 TraceCheckUtils]: 49: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-08 05:59:16,471 INFO L272 TraceCheckUtils]: 48: Hoare triple {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {10236#true} is VALID [2022-04-08 05:59:16,472 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10236#true} {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} #106#return; {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-08 05:59:16,472 INFO L290 TraceCheckUtils]: 46: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-08 05:59:16,472 INFO L290 TraceCheckUtils]: 45: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-08 05:59:16,472 INFO L290 TraceCheckUtils]: 44: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-08 05:59:16,472 INFO L272 TraceCheckUtils]: 43: Hoare triple {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10236#true} is VALID [2022-04-08 05:59:16,473 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10236#true} {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} #104#return; {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-08 05:59:16,473 INFO L290 TraceCheckUtils]: 41: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-08 05:59:16,473 INFO L290 TraceCheckUtils]: 40: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-08 05:59:16,473 INFO L290 TraceCheckUtils]: 39: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-08 05:59:16,473 INFO L272 TraceCheckUtils]: 38: Hoare triple {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10236#true} is VALID [2022-04-08 05:59:16,474 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {10236#true} {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} #102#return; {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-08 05:59:16,474 INFO L290 TraceCheckUtils]: 36: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-08 05:59:16,474 INFO L290 TraceCheckUtils]: 35: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-08 05:59:16,474 INFO L290 TraceCheckUtils]: 34: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-08 05:59:16,475 INFO L272 TraceCheckUtils]: 33: Hoare triple {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10236#true} is VALID [2022-04-08 05:59:16,475 INFO L290 TraceCheckUtils]: 32: Hoare triple {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} assume !false; {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-08 05:59:16,476 INFO L290 TraceCheckUtils]: 31: Hoare triple {10236#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-08 05:59:16,476 INFO L290 TraceCheckUtils]: 30: Hoare triple {10236#true} assume !false; {10236#true} is VALID [2022-04-08 05:59:16,476 INFO L290 TraceCheckUtils]: 29: Hoare triple {10236#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {10236#true} is VALID [2022-04-08 05:59:16,476 INFO L290 TraceCheckUtils]: 28: Hoare triple {10236#true} assume !false; {10236#true} is VALID [2022-04-08 05:59:16,476 INFO L290 TraceCheckUtils]: 27: Hoare triple {10236#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {10236#true} is VALID [2022-04-08 05:59:16,476 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10236#true} {10236#true} #100#return; {10236#true} is VALID [2022-04-08 05:59:16,476 INFO L290 TraceCheckUtils]: 25: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-08 05:59:16,476 INFO L290 TraceCheckUtils]: 24: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-08 05:59:16,476 INFO L290 TraceCheckUtils]: 23: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-08 05:59:16,476 INFO L272 TraceCheckUtils]: 22: Hoare triple {10236#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10236#true} is VALID [2022-04-08 05:59:16,477 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10236#true} {10236#true} #98#return; {10236#true} is VALID [2022-04-08 05:59:16,477 INFO L290 TraceCheckUtils]: 20: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-08 05:59:16,477 INFO L290 TraceCheckUtils]: 19: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-08 05:59:16,477 INFO L290 TraceCheckUtils]: 18: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-08 05:59:16,477 INFO L272 TraceCheckUtils]: 17: Hoare triple {10236#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10236#true} is VALID [2022-04-08 05:59:16,477 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10236#true} {10236#true} #96#return; {10236#true} is VALID [2022-04-08 05:59:16,477 INFO L290 TraceCheckUtils]: 15: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-08 05:59:16,477 INFO L290 TraceCheckUtils]: 14: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-08 05:59:16,477 INFO L290 TraceCheckUtils]: 13: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-08 05:59:16,477 INFO L272 TraceCheckUtils]: 12: Hoare triple {10236#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {10236#true} is VALID [2022-04-08 05:59:16,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {10236#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10236#true} is VALID [2022-04-08 05:59:16,478 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10236#true} {10236#true} #94#return; {10236#true} is VALID [2022-04-08 05:59:16,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-08 05:59:16,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-08 05:59:16,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-08 05:59:16,478 INFO L272 TraceCheckUtils]: 6: Hoare triple {10236#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {10236#true} is VALID [2022-04-08 05:59:16,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {10236#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {10236#true} is VALID [2022-04-08 05:59:16,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {10236#true} call #t~ret6 := main(); {10236#true} is VALID [2022-04-08 05:59:16,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10236#true} {10236#true} #112#return; {10236#true} is VALID [2022-04-08 05:59:16,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-08 05:59:16,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {10236#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); {10236#true} is VALID [2022-04-08 05:59:16,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {10236#true} call ULTIMATE.init(); {10236#true} is VALID [2022-04-08 05:59:16,479 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-04-08 05:59:16,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:59:16,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136152339] [2022-04-08 05:59:16,479 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:59:16,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460303694] [2022-04-08 05:59:16,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460303694] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 05:59:16,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 05:59:16,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 14 [2022-04-08 05:59:16,480 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:59:16,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [638518948] [2022-04-08 05:59:16,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [638518948] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:59:16,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:59:16,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 05:59:16,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116047575] [2022-04-08 05:59:16,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:59:16,481 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 74 [2022-04-08 05:59:16,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:59:16,481 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-08 05:59:16,528 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 05:59:16,528 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 05:59:16,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:59:16,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 05:59:16,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-08 05:59:16,529 INFO L87 Difference]: Start difference. First operand 208 states and 296 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-08 05:59:17,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:59:17,308 INFO L93 Difference]: Finished difference Result 214 states and 301 transitions. [2022-04-08 05:59:17,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 05:59:17,308 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 74 [2022-04-08 05:59:17,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:59:17,309 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-08 05:59:17,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-08 05:59:17,310 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-08 05:59:17,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-08 05:59:17,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-08 05:59:17,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:59:17,363 INFO L225 Difference]: With dead ends: 214 [2022-04-08 05:59:17,363 INFO L226 Difference]: Without dead ends: 212 [2022-04-08 05:59:17,363 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-04-08 05:59:17,364 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 9 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 05:59:17,364 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 166 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 05:59:17,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-04-08 05:59:17,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2022-04-08 05:59:17,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:59:17,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand has 212 states, 119 states have (on average 1.2016806722689075) internal successors, (143), 125 states have internal predecessors, (143), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-08 05:59:17,951 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand has 212 states, 119 states have (on average 1.2016806722689075) internal successors, (143), 125 states have internal predecessors, (143), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-08 05:59:17,951 INFO L87 Difference]: Start difference. First operand 212 states. Second operand has 212 states, 119 states have (on average 1.2016806722689075) internal successors, (143), 125 states have internal predecessors, (143), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-08 05:59:17,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:59:17,958 INFO L93 Difference]: Finished difference Result 212 states and 299 transitions. [2022-04-08 05:59:17,958 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 299 transitions. [2022-04-08 05:59:17,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:59:17,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:59:17,959 INFO L74 IsIncluded]: Start isIncluded. First operand has 212 states, 119 states have (on average 1.2016806722689075) internal successors, (143), 125 states have internal predecessors, (143), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) Second operand 212 states. [2022-04-08 05:59:17,960 INFO L87 Difference]: Start difference. First operand has 212 states, 119 states have (on average 1.2016806722689075) internal successors, (143), 125 states have internal predecessors, (143), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) Second operand 212 states. [2022-04-08 05:59:17,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:59:17,966 INFO L93 Difference]: Finished difference Result 212 states and 299 transitions. [2022-04-08 05:59:17,966 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 299 transitions. [2022-04-08 05:59:17,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:59:17,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:59:17,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:59:17,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:59:17,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 119 states have (on average 1.2016806722689075) internal successors, (143), 125 states have internal predecessors, (143), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-08 05:59:17,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 299 transitions. [2022-04-08 05:59:17,975 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 299 transitions. Word has length 74 [2022-04-08 05:59:17,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:59:17,975 INFO L478 AbstractCegarLoop]: Abstraction has 212 states and 299 transitions. [2022-04-08 05:59:17,975 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-08 05:59:17,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 212 states and 299 transitions. [2022-04-08 05:59:18,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 299 edges. 299 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:59:18,566 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 299 transitions. [2022-04-08 05:59:18,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-08 05:59:18,566 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:59:18,566 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:59:18,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 05:59:18,771 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 05:59:18,771 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:59:18,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:59:18,772 INFO L85 PathProgramCache]: Analyzing trace with hash -2089538094, now seen corresponding path program 1 times [2022-04-08 05:59:18,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:59:18,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2105914798] [2022-04-08 05:59:18,772 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:59:18,772 INFO L85 PathProgramCache]: Analyzing trace with hash -2089538094, now seen corresponding path program 2 times [2022-04-08 05:59:18,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:59:18,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475519133] [2022-04-08 05:59:18,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:59:18,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:59:18,786 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:59:18,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [675800167] [2022-04-08 05:59:18,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:59:18,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:59:18,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:59:18,787 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 05:59:18,802 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 05:59:18,850 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:59:18,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:59:18,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 05:59:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:59:18,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:59:19,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {11971#true} call ULTIMATE.init(); {11971#true} is VALID [2022-04-08 05:59:19,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {11971#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); {11971#true} is VALID [2022-04-08 05:59:19,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-08 05:59:19,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11971#true} {11971#true} #112#return; {11971#true} is VALID [2022-04-08 05:59:19,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {11971#true} call #t~ret6 := main(); {11971#true} is VALID [2022-04-08 05:59:19,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {11971#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {11971#true} is VALID [2022-04-08 05:59:19,229 INFO L272 TraceCheckUtils]: 6: Hoare triple {11971#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {11971#true} is VALID [2022-04-08 05:59:19,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-08 05:59:19,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-08 05:59:19,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-08 05:59:19,230 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11971#true} {11971#true} #94#return; {11971#true} is VALID [2022-04-08 05:59:19,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {11971#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11971#true} is VALID [2022-04-08 05:59:19,230 INFO L272 TraceCheckUtils]: 12: Hoare triple {11971#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {11971#true} is VALID [2022-04-08 05:59:19,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {11971#true} ~cond := #in~cond; {12015#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:59:19,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {12015#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {12019#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:59:19,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {12019#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {12019#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:59:19,231 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12019#(not (= |assume_abort_if_not_#in~cond| 0))} {11971#true} #96#return; {12026#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 05:59:19,231 INFO L272 TraceCheckUtils]: 17: Hoare triple {12026#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11971#true} is VALID [2022-04-08 05:59:19,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-08 05:59:19,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-08 05:59:19,231 INFO L290 TraceCheckUtils]: 20: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-08 05:59:19,232 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11971#true} {12026#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #98#return; {12026#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 05:59:19,232 INFO L272 TraceCheckUtils]: 22: Hoare triple {12026#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11971#true} is VALID [2022-04-08 05:59:19,232 INFO L290 TraceCheckUtils]: 23: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-08 05:59:19,232 INFO L290 TraceCheckUtils]: 24: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-08 05:59:19,232 INFO L290 TraceCheckUtils]: 25: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-08 05:59:19,232 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11971#true} {12026#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #100#return; {12026#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 05:59:19,233 INFO L290 TraceCheckUtils]: 27: Hoare triple {12026#(and (<= 0 main_~y~0) (<= main_~y~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {12060#(<= main_~b~0 2)} is VALID [2022-04-08 05:59:19,233 INFO L290 TraceCheckUtils]: 28: Hoare triple {12060#(<= main_~b~0 2)} assume !false; {12060#(<= main_~b~0 2)} is VALID [2022-04-08 05:59:19,233 INFO L290 TraceCheckUtils]: 29: Hoare triple {12060#(<= main_~b~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12060#(<= main_~b~0 2)} is VALID [2022-04-08 05:59:19,234 INFO L290 TraceCheckUtils]: 30: Hoare triple {12060#(<= main_~b~0 2)} assume !false; {12060#(<= main_~b~0 2)} is VALID [2022-04-08 05:59:19,234 INFO L290 TraceCheckUtils]: 31: Hoare triple {12060#(<= main_~b~0 2)} assume !(~c~0 >= ~b~0); {12073#(and (<= main_~b~0 2) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-08 05:59:19,235 INFO L290 TraceCheckUtils]: 32: Hoare triple {12073#(and (<= main_~b~0 2) (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; {12077#(and (< main_~b~0 main_~a~0) (< main_~b~0 2))} is VALID [2022-04-08 05:59:19,235 INFO L290 TraceCheckUtils]: 33: Hoare triple {12077#(and (< main_~b~0 main_~a~0) (< main_~b~0 2))} assume !false; {12077#(and (< main_~b~0 main_~a~0) (< main_~b~0 2))} is VALID [2022-04-08 05:59:19,235 INFO L290 TraceCheckUtils]: 34: Hoare triple {12077#(and (< main_~b~0 main_~a~0) (< main_~b~0 2))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12084#(and (< main_~b~0 main_~c~0) (< main_~b~0 2))} is VALID [2022-04-08 05:59:19,236 INFO L290 TraceCheckUtils]: 35: Hoare triple {12084#(and (< main_~b~0 main_~c~0) (< main_~b~0 2))} assume !false; {12084#(and (< main_~b~0 main_~c~0) (< main_~b~0 2))} is VALID [2022-04-08 05:59:19,236 INFO L290 TraceCheckUtils]: 36: Hoare triple {12084#(and (< main_~b~0 main_~c~0) (< main_~b~0 2))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} is VALID [2022-04-08 05:59:19,236 INFO L290 TraceCheckUtils]: 37: Hoare triple {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} assume !false; {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} is VALID [2022-04-08 05:59:19,236 INFO L272 TraceCheckUtils]: 38: Hoare triple {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11971#true} is VALID [2022-04-08 05:59:19,237 INFO L290 TraceCheckUtils]: 39: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-08 05:59:19,237 INFO L290 TraceCheckUtils]: 40: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-08 05:59:19,237 INFO L290 TraceCheckUtils]: 41: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-08 05:59:19,239 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11971#true} {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} #102#return; {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} is VALID [2022-04-08 05:59:19,240 INFO L272 TraceCheckUtils]: 43: Hoare triple {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11971#true} is VALID [2022-04-08 05:59:19,240 INFO L290 TraceCheckUtils]: 44: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-08 05:59:19,240 INFO L290 TraceCheckUtils]: 45: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-08 05:59:19,240 INFO L290 TraceCheckUtils]: 46: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-08 05:59:19,241 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11971#true} {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} #104#return; {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} is VALID [2022-04-08 05:59:19,241 INFO L272 TraceCheckUtils]: 48: Hoare triple {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11971#true} is VALID [2022-04-08 05:59:19,241 INFO L290 TraceCheckUtils]: 49: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-08 05:59:19,241 INFO L290 TraceCheckUtils]: 50: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-08 05:59:19,241 INFO L290 TraceCheckUtils]: 51: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-08 05:59:19,242 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11971#true} {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} #106#return; {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} is VALID [2022-04-08 05:59:19,242 INFO L272 TraceCheckUtils]: 53: Hoare triple {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {11971#true} is VALID [2022-04-08 05:59:19,242 INFO L290 TraceCheckUtils]: 54: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-08 05:59:19,242 INFO L290 TraceCheckUtils]: 55: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-08 05:59:19,242 INFO L290 TraceCheckUtils]: 56: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-08 05:59:19,243 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {11971#true} {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} #108#return; {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} is VALID [2022-04-08 05:59:19,244 INFO L290 TraceCheckUtils]: 58: Hoare triple {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} assume !(~c~0 >= 2 * ~v~0); {11972#false} is VALID [2022-04-08 05:59:19,244 INFO L290 TraceCheckUtils]: 59: Hoare triple {11972#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {11972#false} is VALID [2022-04-08 05:59:19,244 INFO L290 TraceCheckUtils]: 60: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-08 05:59:19,244 INFO L290 TraceCheckUtils]: 61: Hoare triple {11972#false} assume !(~c~0 >= ~b~0); {11972#false} is VALID [2022-04-08 05:59:19,245 INFO L290 TraceCheckUtils]: 62: Hoare triple {11972#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; {11972#false} is VALID [2022-04-08 05:59:19,245 INFO L290 TraceCheckUtils]: 63: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-08 05:59:19,245 INFO L290 TraceCheckUtils]: 64: Hoare triple {11972#false} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11972#false} is VALID [2022-04-08 05:59:19,245 INFO L290 TraceCheckUtils]: 65: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-08 05:59:19,245 INFO L290 TraceCheckUtils]: 66: Hoare triple {11972#false} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {11972#false} is VALID [2022-04-08 05:59:19,245 INFO L290 TraceCheckUtils]: 67: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-08 05:59:19,245 INFO L272 TraceCheckUtils]: 68: Hoare triple {11972#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11972#false} is VALID [2022-04-08 05:59:19,245 INFO L290 TraceCheckUtils]: 69: Hoare triple {11972#false} ~cond := #in~cond; {11972#false} is VALID [2022-04-08 05:59:19,245 INFO L290 TraceCheckUtils]: 70: Hoare triple {11972#false} assume 0 == ~cond; {11972#false} is VALID [2022-04-08 05:59:19,245 INFO L290 TraceCheckUtils]: 71: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-08 05:59:19,246 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-04-08 05:59:19,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:59:19,913 INFO L290 TraceCheckUtils]: 71: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-08 05:59:19,913 INFO L290 TraceCheckUtils]: 70: Hoare triple {11972#false} assume 0 == ~cond; {11972#false} is VALID [2022-04-08 05:59:19,913 INFO L290 TraceCheckUtils]: 69: Hoare triple {11972#false} ~cond := #in~cond; {11972#false} is VALID [2022-04-08 05:59:19,913 INFO L272 TraceCheckUtils]: 68: Hoare triple {11972#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11972#false} is VALID [2022-04-08 05:59:19,914 INFO L290 TraceCheckUtils]: 67: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-08 05:59:19,914 INFO L290 TraceCheckUtils]: 66: Hoare triple {11972#false} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {11972#false} is VALID [2022-04-08 05:59:19,914 INFO L290 TraceCheckUtils]: 65: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-08 05:59:19,914 INFO L290 TraceCheckUtils]: 64: Hoare triple {11972#false} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11972#false} is VALID [2022-04-08 05:59:19,914 INFO L290 TraceCheckUtils]: 63: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-08 05:59:19,914 INFO L290 TraceCheckUtils]: 62: Hoare triple {11972#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; {11972#false} is VALID [2022-04-08 05:59:19,914 INFO L290 TraceCheckUtils]: 61: Hoare triple {11972#false} assume !(~c~0 >= ~b~0); {11972#false} is VALID [2022-04-08 05:59:19,914 INFO L290 TraceCheckUtils]: 60: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-08 05:59:19,914 INFO L290 TraceCheckUtils]: 59: Hoare triple {11972#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {11972#false} is VALID [2022-04-08 05:59:19,914 INFO L290 TraceCheckUtils]: 58: Hoare triple {12236#(<= (* main_~v~0 2) main_~c~0)} assume !(~c~0 >= 2 * ~v~0); {11972#false} is VALID [2022-04-08 05:59:19,915 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {11971#true} {12236#(<= (* main_~v~0 2) main_~c~0)} #108#return; {12236#(<= (* main_~v~0 2) main_~c~0)} is VALID [2022-04-08 05:59:19,915 INFO L290 TraceCheckUtils]: 56: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-08 05:59:19,915 INFO L290 TraceCheckUtils]: 55: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-08 05:59:19,915 INFO L290 TraceCheckUtils]: 54: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-08 05:59:19,915 INFO L272 TraceCheckUtils]: 53: Hoare triple {12236#(<= (* main_~v~0 2) main_~c~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {11971#true} is VALID [2022-04-08 05:59:19,917 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11971#true} {12236#(<= (* main_~v~0 2) main_~c~0)} #106#return; {12236#(<= (* main_~v~0 2) main_~c~0)} is VALID [2022-04-08 05:59:19,917 INFO L290 TraceCheckUtils]: 51: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-08 05:59:19,917 INFO L290 TraceCheckUtils]: 50: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-08 05:59:19,917 INFO L290 TraceCheckUtils]: 49: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-08 05:59:19,917 INFO L272 TraceCheckUtils]: 48: Hoare triple {12236#(<= (* main_~v~0 2) main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11971#true} is VALID [2022-04-08 05:59:19,918 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11971#true} {12236#(<= (* main_~v~0 2) main_~c~0)} #104#return; {12236#(<= (* main_~v~0 2) main_~c~0)} is VALID [2022-04-08 05:59:19,918 INFO L290 TraceCheckUtils]: 46: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-08 05:59:19,918 INFO L290 TraceCheckUtils]: 45: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-08 05:59:19,918 INFO L290 TraceCheckUtils]: 44: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-08 05:59:19,918 INFO L272 TraceCheckUtils]: 43: Hoare triple {12236#(<= (* main_~v~0 2) main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11971#true} is VALID [2022-04-08 05:59:19,919 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11971#true} {12236#(<= (* main_~v~0 2) main_~c~0)} #102#return; {12236#(<= (* main_~v~0 2) main_~c~0)} is VALID [2022-04-08 05:59:19,919 INFO L290 TraceCheckUtils]: 41: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-08 05:59:19,919 INFO L290 TraceCheckUtils]: 40: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-08 05:59:19,919 INFO L290 TraceCheckUtils]: 39: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-08 05:59:19,919 INFO L272 TraceCheckUtils]: 38: Hoare triple {12236#(<= (* main_~v~0 2) main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11971#true} is VALID [2022-04-08 05:59:19,919 INFO L290 TraceCheckUtils]: 37: Hoare triple {12236#(<= (* main_~v~0 2) main_~c~0)} assume !false; {12236#(<= (* main_~v~0 2) main_~c~0)} is VALID [2022-04-08 05:59:19,920 INFO L290 TraceCheckUtils]: 36: Hoare triple {12303#(<= main_~b~0 (div main_~c~0 2))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {12236#(<= (* main_~v~0 2) main_~c~0)} is VALID [2022-04-08 05:59:19,920 INFO L290 TraceCheckUtils]: 35: Hoare triple {12303#(<= main_~b~0 (div main_~c~0 2))} assume !false; {12303#(<= main_~b~0 (div main_~c~0 2))} is VALID [2022-04-08 05:59:19,921 INFO L290 TraceCheckUtils]: 34: Hoare triple {12310#(<= main_~b~0 (+ (div (+ (- 2) main_~a~0) 2) 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12303#(<= main_~b~0 (div main_~c~0 2))} is VALID [2022-04-08 05:59:19,921 INFO L290 TraceCheckUtils]: 33: Hoare triple {12310#(<= main_~b~0 (+ (div (+ (- 2) main_~a~0) 2) 1))} assume !false; {12310#(<= main_~b~0 (+ (div (+ (- 2) main_~a~0) 2) 1))} is VALID [2022-04-08 05:59:19,922 INFO L290 TraceCheckUtils]: 32: Hoare triple {12317#(<= main_~c~0 (+ (div (+ main_~b~0 (- 4)) 2) 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; {12310#(<= main_~b~0 (+ (div (+ (- 2) main_~a~0) 2) 1))} is VALID [2022-04-08 05:59:19,922 INFO L290 TraceCheckUtils]: 31: Hoare triple {12060#(<= main_~b~0 2)} assume !(~c~0 >= ~b~0); {12317#(<= main_~c~0 (+ (div (+ main_~b~0 (- 4)) 2) 2))} is VALID [2022-04-08 05:59:19,922 INFO L290 TraceCheckUtils]: 30: Hoare triple {12060#(<= main_~b~0 2)} assume !false; {12060#(<= main_~b~0 2)} is VALID [2022-04-08 05:59:19,923 INFO L290 TraceCheckUtils]: 29: Hoare triple {12060#(<= main_~b~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12060#(<= main_~b~0 2)} is VALID [2022-04-08 05:59:19,923 INFO L290 TraceCheckUtils]: 28: Hoare triple {12060#(<= main_~b~0 2)} assume !false; {12060#(<= main_~b~0 2)} is VALID [2022-04-08 05:59:19,923 INFO L290 TraceCheckUtils]: 27: Hoare triple {12333#(<= main_~y~0 2)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {12060#(<= main_~b~0 2)} is VALID [2022-04-08 05:59:19,924 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11971#true} {12333#(<= main_~y~0 2)} #100#return; {12333#(<= main_~y~0 2)} is VALID [2022-04-08 05:59:19,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-08 05:59:19,924 INFO L290 TraceCheckUtils]: 24: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-08 05:59:19,924 INFO L290 TraceCheckUtils]: 23: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-08 05:59:19,924 INFO L272 TraceCheckUtils]: 22: Hoare triple {12333#(<= main_~y~0 2)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11971#true} is VALID [2022-04-08 05:59:19,924 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11971#true} {12333#(<= main_~y~0 2)} #98#return; {12333#(<= main_~y~0 2)} is VALID [2022-04-08 05:59:19,925 INFO L290 TraceCheckUtils]: 20: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-08 05:59:19,925 INFO L290 TraceCheckUtils]: 19: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-08 05:59:19,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-08 05:59:19,925 INFO L272 TraceCheckUtils]: 17: Hoare triple {12333#(<= main_~y~0 2)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11971#true} is VALID [2022-04-08 05:59:19,925 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12019#(not (= |assume_abort_if_not_#in~cond| 0))} {11971#true} #96#return; {12333#(<= main_~y~0 2)} is VALID [2022-04-08 05:59:19,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {12019#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {12019#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:59:19,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {12376#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {12019#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:59:19,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {11971#true} ~cond := #in~cond; {12376#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-08 05:59:19,926 INFO L272 TraceCheckUtils]: 12: Hoare triple {11971#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {11971#true} is VALID [2022-04-08 05:59:19,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {11971#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11971#true} is VALID [2022-04-08 05:59:19,926 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11971#true} {11971#true} #94#return; {11971#true} is VALID [2022-04-08 05:59:19,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-08 05:59:19,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-08 05:59:19,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-08 05:59:19,927 INFO L272 TraceCheckUtils]: 6: Hoare triple {11971#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {11971#true} is VALID [2022-04-08 05:59:19,927 INFO L290 TraceCheckUtils]: 5: Hoare triple {11971#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {11971#true} is VALID [2022-04-08 05:59:19,927 INFO L272 TraceCheckUtils]: 4: Hoare triple {11971#true} call #t~ret6 := main(); {11971#true} is VALID [2022-04-08 05:59:19,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11971#true} {11971#true} #112#return; {11971#true} is VALID [2022-04-08 05:59:19,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-08 05:59:19,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {11971#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); {11971#true} is VALID [2022-04-08 05:59:19,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {11971#true} call ULTIMATE.init(); {11971#true} is VALID [2022-04-08 05:59:19,927 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-04-08 05:59:19,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:59:19,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475519133] [2022-04-08 05:59:19,928 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:59:19,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675800167] [2022-04-08 05:59:19,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675800167] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:59:19,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:59:19,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-08 05:59:19,928 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:59:19,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2105914798] [2022-04-08 05:59:19,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2105914798] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:59:19,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:59:19,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 05:59:19,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523911834] [2022-04-08 05:59:19,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:59:19,929 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 72 [2022-04-08 05:59:19,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:59:19,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 05:59:19,971 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 05:59:19,971 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 05:59:19,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:59:19,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 05:59:19,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-04-08 05:59:19,972 INFO L87 Difference]: Start difference. First operand 212 states and 299 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 05:59:21,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:59:21,459 INFO L93 Difference]: Finished difference Result 306 states and 427 transitions. [2022-04-08 05:59:21,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 05:59:21,459 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 72 [2022-04-08 05:59:21,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:59:21,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 05:59:21,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2022-04-08 05:59:21,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 05:59:21,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2022-04-08 05:59:21,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 112 transitions. [2022-04-08 05:59:21,592 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 05:59:21,597 INFO L225 Difference]: With dead ends: 306 [2022-04-08 05:59:21,597 INFO L226 Difference]: Without dead ends: 204 [2022-04-08 05:59:21,598 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2022-04-08 05:59:21,598 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 39 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 05:59:21,599 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 253 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 05:59:21,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-04-08 05:59:22,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 200. [2022-04-08 05:59:22,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:59:22,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 204 states. Second operand has 200 states, 107 states have (on average 1.1682242990654206) internal successors, (125), 113 states have internal predecessors, (125), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-08 05:59:22,336 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand has 200 states, 107 states have (on average 1.1682242990654206) internal successors, (125), 113 states have internal predecessors, (125), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-08 05:59:22,336 INFO L87 Difference]: Start difference. First operand 204 states. Second operand has 200 states, 107 states have (on average 1.1682242990654206) internal successors, (125), 113 states have internal predecessors, (125), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-08 05:59:22,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:59:22,342 INFO L93 Difference]: Finished difference Result 204 states and 285 transitions. [2022-04-08 05:59:22,342 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 285 transitions. [2022-04-08 05:59:22,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:59:22,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:59:22,344 INFO L74 IsIncluded]: Start isIncluded. First operand has 200 states, 107 states have (on average 1.1682242990654206) internal successors, (125), 113 states have internal predecessors, (125), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) Second operand 204 states. [2022-04-08 05:59:22,344 INFO L87 Difference]: Start difference. First operand has 200 states, 107 states have (on average 1.1682242990654206) internal successors, (125), 113 states have internal predecessors, (125), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) Second operand 204 states. [2022-04-08 05:59:22,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:59:22,350 INFO L93 Difference]: Finished difference Result 204 states and 285 transitions. [2022-04-08 05:59:22,350 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 285 transitions. [2022-04-08 05:59:22,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:59:22,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:59:22,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:59:22,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:59:22,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 107 states have (on average 1.1682242990654206) internal successors, (125), 113 states have internal predecessors, (125), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-08 05:59:22,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 281 transitions. [2022-04-08 05:59:22,358 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 281 transitions. Word has length 72 [2022-04-08 05:59:22,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:59:22,358 INFO L478 AbstractCegarLoop]: Abstraction has 200 states and 281 transitions. [2022-04-08 05:59:22,358 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 05:59:22,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 200 states and 281 transitions. [2022-04-08 05:59:22,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:59:22,853 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 281 transitions. [2022-04-08 05:59:22,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-08 05:59:22,854 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:59:22,854 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, 1, 1, 1] [2022-04-08 05:59:22,874 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 05:59:23,067 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 05:59:23,068 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:59:23,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:59:23,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1679616651, now seen corresponding path program 1 times [2022-04-08 05:59:23,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:59:23,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [714477278] [2022-04-08 05:59:23,068 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:59:23,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1679616651, now seen corresponding path program 2 times [2022-04-08 05:59:23,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:59:23,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094016306] [2022-04-08 05:59:23,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:59:23,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:59:23,083 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:59:23,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [53459509] [2022-04-08 05:59:23,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:59:23,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:59:23,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:59:23,085 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 05:59:23,089 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 05:59:23,137 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:59:23,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:59:23,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 63 conjunts are in the unsatisfiable core [2022-04-08 05:59:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:59:23,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:59:24,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {13852#true} call ULTIMATE.init(); {13852#true} is VALID [2022-04-08 05:59:24,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {13852#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); {13852#true} is VALID [2022-04-08 05:59:24,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-08 05:59:24,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13852#true} {13852#true} #112#return; {13852#true} is VALID [2022-04-08 05:59:24,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {13852#true} call #t~ret6 := main(); {13852#true} is VALID [2022-04-08 05:59:24,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {13852#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {13852#true} is VALID [2022-04-08 05:59:24,546 INFO L272 TraceCheckUtils]: 6: Hoare triple {13852#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {13852#true} is VALID [2022-04-08 05:59:24,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {13852#true} ~cond := #in~cond; {13878#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:59:24,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {13878#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {13882#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:59:24,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {13882#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {13882#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:59:24,548 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13882#(not (= |assume_abort_if_not_#in~cond| 0))} {13852#true} #94#return; {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 05:59:24,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 05:59:24,548 INFO L272 TraceCheckUtils]: 12: Hoare triple {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {13852#true} is VALID [2022-04-08 05:59:24,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-08 05:59:24,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-08 05:59:24,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-08 05:59:24,549 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13852#true} {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #96#return; {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 05:59:24,549 INFO L272 TraceCheckUtils]: 17: Hoare triple {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {13852#true} is VALID [2022-04-08 05:59:24,549 INFO L290 TraceCheckUtils]: 18: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-08 05:59:24,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-08 05:59:24,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-08 05:59:24,550 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {13852#true} {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #98#return; {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 05:59:24,550 INFO L272 TraceCheckUtils]: 22: Hoare triple {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {13852#true} is VALID [2022-04-08 05:59:24,550 INFO L290 TraceCheckUtils]: 23: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-08 05:59:24,551 INFO L290 TraceCheckUtils]: 24: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-08 05:59:24,551 INFO L290 TraceCheckUtils]: 25: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-08 05:59:24,551 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {13852#true} {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #100#return; {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 05:59:24,552 INFO L290 TraceCheckUtils]: 27: Hoare triple {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {13941#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 05:59:24,552 INFO L290 TraceCheckUtils]: 28: Hoare triple {13941#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {13941#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 05:59:24,553 INFO L290 TraceCheckUtils]: 29: Hoare triple {13941#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {13948#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 05:59:24,554 INFO L290 TraceCheckUtils]: 30: Hoare triple {13948#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {13948#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 05:59:24,554 INFO L290 TraceCheckUtils]: 31: Hoare triple {13948#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 05:59:24,555 INFO L290 TraceCheckUtils]: 32: Hoare triple {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 05:59:24,555 INFO L272 TraceCheckUtils]: 33: Hoare triple {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13852#true} is VALID [2022-04-08 05:59:24,555 INFO L290 TraceCheckUtils]: 34: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-08 05:59:24,555 INFO L290 TraceCheckUtils]: 35: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-08 05:59:24,555 INFO L290 TraceCheckUtils]: 36: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-08 05:59:24,556 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {13852#true} {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #102#return; {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 05:59:24,556 INFO L272 TraceCheckUtils]: 38: Hoare triple {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13852#true} is VALID [2022-04-08 05:59:24,556 INFO L290 TraceCheckUtils]: 39: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-08 05:59:24,557 INFO L290 TraceCheckUtils]: 40: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-08 05:59:24,557 INFO L290 TraceCheckUtils]: 41: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-08 05:59:24,558 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {13852#true} {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #104#return; {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 05:59:24,558 INFO L272 TraceCheckUtils]: 43: Hoare triple {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13852#true} is VALID [2022-04-08 05:59:24,558 INFO L290 TraceCheckUtils]: 44: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-08 05:59:24,558 INFO L290 TraceCheckUtils]: 45: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-08 05:59:24,558 INFO L290 TraceCheckUtils]: 46: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-08 05:59:24,559 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13852#true} {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #106#return; {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 05:59:24,559 INFO L272 TraceCheckUtils]: 48: Hoare triple {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {13852#true} is VALID [2022-04-08 05:59:24,559 INFO L290 TraceCheckUtils]: 49: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-08 05:59:24,559 INFO L290 TraceCheckUtils]: 50: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-08 05:59:24,559 INFO L290 TraceCheckUtils]: 51: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-08 05:59:24,560 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13852#true} {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #108#return; {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 05:59:24,561 INFO L290 TraceCheckUtils]: 53: Hoare triple {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 05:59:24,562 INFO L290 TraceCheckUtils]: 54: Hoare triple {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 05:59:24,562 INFO L272 TraceCheckUtils]: 55: Hoare triple {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13852#true} is VALID [2022-04-08 05:59:24,562 INFO L290 TraceCheckUtils]: 56: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-08 05:59:24,562 INFO L290 TraceCheckUtils]: 57: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-08 05:59:24,562 INFO L290 TraceCheckUtils]: 58: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-08 05:59:24,563 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13852#true} {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #102#return; {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 05:59:24,563 INFO L272 TraceCheckUtils]: 60: Hoare triple {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13852#true} is VALID [2022-04-08 05:59:24,564 INFO L290 TraceCheckUtils]: 61: Hoare triple {13852#true} ~cond := #in~cond; {14047#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:59:24,564 INFO L290 TraceCheckUtils]: 62: Hoare triple {14047#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {14051#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:59:24,564 INFO L290 TraceCheckUtils]: 63: Hoare triple {14051#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14051#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:59:24,565 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14051#(not (= |__VERIFIER_assert_#in~cond| 0))} {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #104#return; {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 05:59:24,565 INFO L272 TraceCheckUtils]: 65: Hoare triple {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13852#true} is VALID [2022-04-08 05:59:24,565 INFO L290 TraceCheckUtils]: 66: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-08 05:59:24,565 INFO L290 TraceCheckUtils]: 67: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-08 05:59:24,565 INFO L290 TraceCheckUtils]: 68: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-08 05:59:24,566 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {13852#true} {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #106#return; {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 05:59:24,566 INFO L272 TraceCheckUtils]: 70: Hoare triple {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {13852#true} is VALID [2022-04-08 05:59:24,566 INFO L290 TraceCheckUtils]: 71: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-08 05:59:24,566 INFO L290 TraceCheckUtils]: 72: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-08 05:59:24,566 INFO L290 TraceCheckUtils]: 73: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-08 05:59:24,568 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13852#true} {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #108#return; {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 05:59:24,568 INFO L290 TraceCheckUtils]: 75: Hoare triple {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 05:59:24,569 INFO L290 TraceCheckUtils]: 76: Hoare triple {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {14094#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 05:59:24,569 INFO L290 TraceCheckUtils]: 77: Hoare triple {14094#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {14094#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 05:59:24,570 INFO L290 TraceCheckUtils]: 78: Hoare triple {14094#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (<= main_~x~0 2) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {14101#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (< main_~c~0 main_~b~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 05:59:24,571 INFO L290 TraceCheckUtils]: 79: Hoare triple {14101#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (< main_~c~0 main_~b~0) (<= main_~x~0 2) (= 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; {14105#(and (<= (* main_~y~0 2) main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (* main_~p~0 2) main_~q~0) 1) (< main_~x~0 (* main_~y~0 3)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (<= main_~x~0 2) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-08 05:59:24,571 INFO L290 TraceCheckUtils]: 80: Hoare triple {14105#(and (<= (* main_~y~0 2) main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (* main_~p~0 2) main_~q~0) 1) (< main_~x~0 (* main_~y~0 3)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (<= main_~x~0 2) (= (+ main_~s~0 (* main_~r~0 2)) 0))} assume !false; {14105#(and (<= (* main_~y~0 2) main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (* main_~p~0 2) main_~q~0) 1) (< main_~x~0 (* main_~y~0 3)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (<= main_~x~0 2) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-08 05:59:24,572 INFO L290 TraceCheckUtils]: 81: Hoare triple {14105#(and (<= (* main_~y~0 2) main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (* main_~p~0 2) main_~q~0) 1) (< main_~x~0 (* main_~y~0 3)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (<= main_~x~0 2) (= (+ main_~s~0 (* main_~r~0 2)) 0))} assume !(0 != ~b~0); {14112#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (* main_~p~0 2) main_~q~0) 1) (= main_~x~0 (* main_~y~0 2)) (< main_~x~0 (* main_~y~0 3)) (<= main_~x~0 2) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-08 05:59:24,573 INFO L272 TraceCheckUtils]: 82: Hoare triple {14112#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (* main_~p~0 2) main_~q~0) 1) (= main_~x~0 (* main_~y~0 2)) (< main_~x~0 (* main_~y~0 3)) (<= main_~x~0 2) (= (+ main_~s~0 (* main_~r~0 2)) 0))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {14116#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:59:24,573 INFO L290 TraceCheckUtils]: 83: Hoare triple {14116#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14120#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:59:24,573 INFO L290 TraceCheckUtils]: 84: Hoare triple {14120#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13853#false} is VALID [2022-04-08 05:59:24,573 INFO L290 TraceCheckUtils]: 85: Hoare triple {13853#false} assume !false; {13853#false} is VALID [2022-04-08 05:59:24,574 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 30 proven. 26 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-04-08 05:59:24,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:59:46,861 INFO L290 TraceCheckUtils]: 85: Hoare triple {13853#false} assume !false; {13853#false} is VALID [2022-04-08 05:59:46,861 INFO L290 TraceCheckUtils]: 84: Hoare triple {14120#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13853#false} is VALID [2022-04-08 05:59:46,862 INFO L290 TraceCheckUtils]: 83: Hoare triple {14116#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14120#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:59:46,862 INFO L272 TraceCheckUtils]: 82: Hoare triple {14136#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {14116#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:59:46,863 INFO L290 TraceCheckUtils]: 81: Hoare triple {14140#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !(0 != ~b~0); {14136#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:59:46,863 INFO L290 TraceCheckUtils]: 80: Hoare triple {14140#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !false; {14140#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-08 05:59:47,177 INFO L290 TraceCheckUtils]: 79: Hoare triple {14147#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {14140#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-08 05:59:47,177 INFO L290 TraceCheckUtils]: 78: Hoare triple {14151#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {14147#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 05:59:47,178 INFO L290 TraceCheckUtils]: 77: Hoare triple {14151#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {14151#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 05:59:47,437 INFO L290 TraceCheckUtils]: 76: Hoare triple {14158#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {14151#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 05:59:47,438 INFO L290 TraceCheckUtils]: 75: Hoare triple {14158#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= 2 * ~v~0); {14158#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 05:59:47,439 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13852#true} {14158#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #108#return; {14158#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 05:59:47,439 INFO L290 TraceCheckUtils]: 73: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-08 05:59:47,439 INFO L290 TraceCheckUtils]: 72: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-08 05:59:47,439 INFO L290 TraceCheckUtils]: 71: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-08 05:59:47,439 INFO L272 TraceCheckUtils]: 70: Hoare triple {14158#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {13852#true} is VALID [2022-04-08 05:59:47,444 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {13852#true} {14158#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #106#return; {14158#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 05:59:47,444 INFO L290 TraceCheckUtils]: 68: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-08 05:59:47,444 INFO L290 TraceCheckUtils]: 67: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-08 05:59:47,444 INFO L290 TraceCheckUtils]: 66: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-08 05:59:47,444 INFO L272 TraceCheckUtils]: 65: Hoare triple {14158#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13852#true} is VALID [2022-04-08 05:59:47,446 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14051#(not (= |__VERIFIER_assert_#in~cond| 0))} {14195#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {14158#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 05:59:47,446 INFO L290 TraceCheckUtils]: 63: Hoare triple {14051#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14051#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:59:47,447 INFO L290 TraceCheckUtils]: 62: Hoare triple {14205#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {14051#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:59:47,447 INFO L290 TraceCheckUtils]: 61: Hoare triple {13852#true} ~cond := #in~cond; {14205#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:59:47,447 INFO L272 TraceCheckUtils]: 60: Hoare triple {14195#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13852#true} is VALID [2022-04-08 05:59:47,448 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13852#true} {14195#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #102#return; {14195#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 05:59:47,449 INFO L290 TraceCheckUtils]: 58: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-08 05:59:47,449 INFO L290 TraceCheckUtils]: 57: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-08 05:59:47,449 INFO L290 TraceCheckUtils]: 56: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-08 05:59:47,449 INFO L272 TraceCheckUtils]: 55: Hoare triple {14195#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13852#true} is VALID [2022-04-08 05:59:47,450 INFO L290 TraceCheckUtils]: 54: Hoare triple {14195#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {14195#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 05:59:47,456 INFO L290 TraceCheckUtils]: 53: Hoare triple {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {14195#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 05:59:47,457 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13852#true} {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} #108#return; {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} is VALID [2022-04-08 05:59:47,457 INFO L290 TraceCheckUtils]: 51: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-08 05:59:47,457 INFO L290 TraceCheckUtils]: 50: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-08 05:59:47,457 INFO L290 TraceCheckUtils]: 49: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-08 05:59:47,457 INFO L272 TraceCheckUtils]: 48: Hoare triple {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {13852#true} is VALID [2022-04-08 05:59:47,458 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13852#true} {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} #106#return; {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} is VALID [2022-04-08 05:59:47,458 INFO L290 TraceCheckUtils]: 46: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-08 05:59:47,458 INFO L290 TraceCheckUtils]: 45: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-08 05:59:47,458 INFO L290 TraceCheckUtils]: 44: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-08 05:59:47,458 INFO L272 TraceCheckUtils]: 43: Hoare triple {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13852#true} is VALID [2022-04-08 05:59:47,459 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {13852#true} {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} #104#return; {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} is VALID [2022-04-08 05:59:47,460 INFO L290 TraceCheckUtils]: 41: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-08 05:59:47,460 INFO L290 TraceCheckUtils]: 40: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-08 05:59:47,460 INFO L290 TraceCheckUtils]: 39: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-08 05:59:47,460 INFO L272 TraceCheckUtils]: 38: Hoare triple {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13852#true} is VALID [2022-04-08 05:59:47,461 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {13852#true} {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} #102#return; {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} is VALID [2022-04-08 05:59:47,461 INFO L290 TraceCheckUtils]: 36: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-08 05:59:47,461 INFO L290 TraceCheckUtils]: 35: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-08 05:59:47,461 INFO L290 TraceCheckUtils]: 34: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-08 05:59:47,461 INFO L272 TraceCheckUtils]: 33: Hoare triple {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13852#true} is VALID [2022-04-08 05:59:47,462 INFO L290 TraceCheckUtils]: 32: Hoare triple {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} assume !false; {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} is VALID [2022-04-08 05:59:47,463 INFO L290 TraceCheckUtils]: 31: Hoare triple {14297#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} is VALID [2022-04-08 05:59:47,464 INFO L290 TraceCheckUtils]: 30: Hoare triple {14297#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} assume !false; {14297#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} is VALID [2022-04-08 05:59:47,464 INFO L290 TraceCheckUtils]: 29: Hoare triple {14304#(or (not (= main_~a~0 (* main_~b~0 2))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0 0) (* main_~y~0 main_~s~0))))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {14297#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} is VALID [2022-04-08 05:59:47,465 INFO L290 TraceCheckUtils]: 28: Hoare triple {14304#(or (not (= main_~a~0 (* main_~b~0 2))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0 0) (* main_~y~0 main_~s~0))))} assume !false; {14304#(or (not (= main_~a~0 (* main_~b~0 2))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0 0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 05:59:47,466 INFO L290 TraceCheckUtils]: 27: Hoare triple {13852#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {14304#(or (not (= main_~a~0 (* main_~b~0 2))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0 0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 05:59:47,466 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {13852#true} {13852#true} #100#return; {13852#true} is VALID [2022-04-08 05:59:47,466 INFO L290 TraceCheckUtils]: 25: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-08 05:59:47,466 INFO L290 TraceCheckUtils]: 24: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-08 05:59:47,466 INFO L290 TraceCheckUtils]: 23: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-08 05:59:47,466 INFO L272 TraceCheckUtils]: 22: Hoare triple {13852#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {13852#true} is VALID [2022-04-08 05:59:47,467 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {13852#true} {13852#true} #98#return; {13852#true} is VALID [2022-04-08 05:59:47,467 INFO L290 TraceCheckUtils]: 20: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-08 05:59:47,467 INFO L290 TraceCheckUtils]: 19: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-08 05:59:47,467 INFO L290 TraceCheckUtils]: 18: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-08 05:59:47,467 INFO L272 TraceCheckUtils]: 17: Hoare triple {13852#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {13852#true} is VALID [2022-04-08 05:59:47,467 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13852#true} {13852#true} #96#return; {13852#true} is VALID [2022-04-08 05:59:47,467 INFO L290 TraceCheckUtils]: 15: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-08 05:59:47,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-08 05:59:47,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-08 05:59:47,467 INFO L272 TraceCheckUtils]: 12: Hoare triple {13852#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {13852#true} is VALID [2022-04-08 05:59:47,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {13852#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {13852#true} is VALID [2022-04-08 05:59:47,467 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13852#true} {13852#true} #94#return; {13852#true} is VALID [2022-04-08 05:59:47,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-08 05:59:47,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-08 05:59:47,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-08 05:59:47,468 INFO L272 TraceCheckUtils]: 6: Hoare triple {13852#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {13852#true} is VALID [2022-04-08 05:59:47,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {13852#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {13852#true} is VALID [2022-04-08 05:59:47,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {13852#true} call #t~ret6 := main(); {13852#true} is VALID [2022-04-08 05:59:47,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13852#true} {13852#true} #112#return; {13852#true} is VALID [2022-04-08 05:59:47,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-08 05:59:47,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {13852#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); {13852#true} is VALID [2022-04-08 05:59:47,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {13852#true} call ULTIMATE.init(); {13852#true} is VALID [2022-04-08 05:59:47,469 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 30 proven. 17 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-04-08 05:59:47,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:59:47,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094016306] [2022-04-08 05:59:47,469 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:59:47,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53459509] [2022-04-08 05:59:47,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53459509] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:59:47,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:59:47,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 27 [2022-04-08 05:59:47,469 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:59:47,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [714477278] [2022-04-08 05:59:47,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [714477278] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:59:47,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:59:47,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 05:59:47,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132476540] [2022-04-08 05:59:47,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:59:47,470 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 86 [2022-04-08 05:59:47,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:59:47,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 05:59:47,528 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 05:59:47,528 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 05:59:47,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:59:47,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 05:59:47,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2022-04-08 05:59:47,529 INFO L87 Difference]: Start difference. First operand 200 states and 281 transitions. Second operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 05:59:50,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:59:50,983 INFO L93 Difference]: Finished difference Result 285 states and 397 transitions. [2022-04-08 05:59:50,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 05:59:50,983 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 86 [2022-04-08 05:59:50,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:59:50,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 05:59:50,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 151 transitions. [2022-04-08 05:59:50,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 05:59:50,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 151 transitions. [2022-04-08 05:59:50,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 151 transitions. [2022-04-08 05:59:51,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:59:51,192 INFO L225 Difference]: With dead ends: 285 [2022-04-08 05:59:51,192 INFO L226 Difference]: Without dead ends: 231 [2022-04-08 05:59:51,193 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=190, Invalid=1000, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 05:59:51,194 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 59 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 05:59:51,194 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 196 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 05:59:51,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-04-08 05:59:52,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 228. [2022-04-08 05:59:52,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:59:52,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 231 states. Second operand has 228 states, 121 states have (on average 1.165289256198347) internal successors, (141), 128 states have internal predecessors, (141), 91 states have call successors, (91), 16 states have call predecessors, (91), 15 states have return successors, (89), 83 states have call predecessors, (89), 89 states have call successors, (89) [2022-04-08 05:59:52,039 INFO L74 IsIncluded]: Start isIncluded. First operand 231 states. Second operand has 228 states, 121 states have (on average 1.165289256198347) internal successors, (141), 128 states have internal predecessors, (141), 91 states have call successors, (91), 16 states have call predecessors, (91), 15 states have return successors, (89), 83 states have call predecessors, (89), 89 states have call successors, (89) [2022-04-08 05:59:52,040 INFO L87 Difference]: Start difference. First operand 231 states. Second operand has 228 states, 121 states have (on average 1.165289256198347) internal successors, (141), 128 states have internal predecessors, (141), 91 states have call successors, (91), 16 states have call predecessors, (91), 15 states have return successors, (89), 83 states have call predecessors, (89), 89 states have call successors, (89) [2022-04-08 05:59:52,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:59:52,047 INFO L93 Difference]: Finished difference Result 231 states and 324 transitions. [2022-04-08 05:59:52,047 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 324 transitions. [2022-04-08 05:59:52,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:59:52,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:59:52,049 INFO L74 IsIncluded]: Start isIncluded. First operand has 228 states, 121 states have (on average 1.165289256198347) internal successors, (141), 128 states have internal predecessors, (141), 91 states have call successors, (91), 16 states have call predecessors, (91), 15 states have return successors, (89), 83 states have call predecessors, (89), 89 states have call successors, (89) Second operand 231 states. [2022-04-08 05:59:52,049 INFO L87 Difference]: Start difference. First operand has 228 states, 121 states have (on average 1.165289256198347) internal successors, (141), 128 states have internal predecessors, (141), 91 states have call successors, (91), 16 states have call predecessors, (91), 15 states have return successors, (89), 83 states have call predecessors, (89), 89 states have call successors, (89) Second operand 231 states. [2022-04-08 05:59:52,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:59:52,056 INFO L93 Difference]: Finished difference Result 231 states and 324 transitions. [2022-04-08 05:59:52,056 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 324 transitions. [2022-04-08 05:59:52,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:59:52,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:59:52,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:59:52,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:59:52,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 121 states have (on average 1.165289256198347) internal successors, (141), 128 states have internal predecessors, (141), 91 states have call successors, (91), 16 states have call predecessors, (91), 15 states have return successors, (89), 83 states have call predecessors, (89), 89 states have call successors, (89) [2022-04-08 05:59:52,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 321 transitions. [2022-04-08 05:59:52,065 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 321 transitions. Word has length 86 [2022-04-08 05:59:52,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:59:52,065 INFO L478 AbstractCegarLoop]: Abstraction has 228 states and 321 transitions. [2022-04-08 05:59:52,065 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 05:59:52,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 228 states and 321 transitions. [2022-04-08 05:59:52,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 321 edges. 321 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:59:52,780 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 321 transitions. [2022-04-08 05:59:52,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-08 05:59:52,781 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:59:52,781 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, 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 05:59:52,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-08 05:59:52,982 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 05:59:52,982 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:59:52,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:59:52,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1654964248, now seen corresponding path program 5 times [2022-04-08 05:59:52,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:59:52,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1741669771] [2022-04-08 05:59:52,983 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:59:52,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1654964248, now seen corresponding path program 6 times [2022-04-08 05:59:52,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:59:52,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116599042] [2022-04-08 05:59:52,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:59:52,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:59:52,998 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:59:52,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [158914275] [2022-04-08 05:59:52,998 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 05:59:52,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:59:52,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:59:53,003 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 05:59:53,029 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 05:59:53,073 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 05:59:53,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:59:53,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 05:59:53,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:59:53,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:59:53,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {15898#true} call ULTIMATE.init(); {15898#true} is VALID [2022-04-08 05:59:53,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {15898#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); {15898#true} is VALID [2022-04-08 05:59:53,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-08 05:59:53,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15898#true} {15898#true} #112#return; {15898#true} is VALID [2022-04-08 05:59:53,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {15898#true} call #t~ret6 := main(); {15898#true} is VALID [2022-04-08 05:59:53,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {15898#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {15898#true} is VALID [2022-04-08 05:59:53,388 INFO L272 TraceCheckUtils]: 6: Hoare triple {15898#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {15898#true} is VALID [2022-04-08 05:59:53,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-08 05:59:53,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-08 05:59:53,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-08 05:59:53,388 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15898#true} {15898#true} #94#return; {15898#true} is VALID [2022-04-08 05:59:53,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {15898#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {15898#true} is VALID [2022-04-08 05:59:53,388 INFO L272 TraceCheckUtils]: 12: Hoare triple {15898#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {15898#true} is VALID [2022-04-08 05:59:53,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-08 05:59:53,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-08 05:59:53,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-08 05:59:53,389 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15898#true} {15898#true} #96#return; {15898#true} is VALID [2022-04-08 05:59:53,389 INFO L272 TraceCheckUtils]: 17: Hoare triple {15898#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {15898#true} is VALID [2022-04-08 05:59:53,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-08 05:59:53,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-08 05:59:53,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-08 05:59:53,389 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {15898#true} {15898#true} #98#return; {15898#true} is VALID [2022-04-08 05:59:53,389 INFO L272 TraceCheckUtils]: 22: Hoare triple {15898#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {15898#true} is VALID [2022-04-08 05:59:53,389 INFO L290 TraceCheckUtils]: 23: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-08 05:59:53,389 INFO L290 TraceCheckUtils]: 24: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-08 05:59:53,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-08 05:59:53,390 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {15898#true} {15898#true} #100#return; {15898#true} is VALID [2022-04-08 05:59:53,390 INFO L290 TraceCheckUtils]: 27: Hoare triple {15898#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {15898#true} is VALID [2022-04-08 05:59:53,390 INFO L290 TraceCheckUtils]: 28: Hoare triple {15898#true} assume !false; {15898#true} is VALID [2022-04-08 05:59:53,390 INFO L290 TraceCheckUtils]: 29: Hoare triple {15898#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {15898#true} is VALID [2022-04-08 05:59:53,390 INFO L290 TraceCheckUtils]: 30: Hoare triple {15898#true} assume !false; {15898#true} is VALID [2022-04-08 05:59:53,390 INFO L290 TraceCheckUtils]: 31: Hoare triple {15898#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-08 05:59:53,391 INFO L290 TraceCheckUtils]: 32: Hoare triple {15996#(<= main_~v~0 main_~b~0)} assume !false; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-08 05:59:53,391 INFO L272 TraceCheckUtils]: 33: Hoare triple {15996#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {15898#true} is VALID [2022-04-08 05:59:53,391 INFO L290 TraceCheckUtils]: 34: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-08 05:59:53,391 INFO L290 TraceCheckUtils]: 35: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-08 05:59:53,391 INFO L290 TraceCheckUtils]: 36: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-08 05:59:53,391 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {15898#true} {15996#(<= main_~v~0 main_~b~0)} #102#return; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-08 05:59:53,392 INFO L272 TraceCheckUtils]: 38: Hoare triple {15996#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {15898#true} is VALID [2022-04-08 05:59:53,392 INFO L290 TraceCheckUtils]: 39: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-08 05:59:53,392 INFO L290 TraceCheckUtils]: 40: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-08 05:59:53,392 INFO L290 TraceCheckUtils]: 41: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-08 05:59:53,392 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15898#true} {15996#(<= main_~v~0 main_~b~0)} #104#return; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-08 05:59:53,392 INFO L272 TraceCheckUtils]: 43: Hoare triple {15996#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {15898#true} is VALID [2022-04-08 05:59:53,392 INFO L290 TraceCheckUtils]: 44: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-08 05:59:53,393 INFO L290 TraceCheckUtils]: 45: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-08 05:59:53,393 INFO L290 TraceCheckUtils]: 46: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-08 05:59:53,393 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {15898#true} {15996#(<= main_~v~0 main_~b~0)} #106#return; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-08 05:59:53,393 INFO L272 TraceCheckUtils]: 48: Hoare triple {15996#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {15898#true} is VALID [2022-04-08 05:59:53,393 INFO L290 TraceCheckUtils]: 49: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-08 05:59:53,393 INFO L290 TraceCheckUtils]: 50: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-08 05:59:53,393 INFO L290 TraceCheckUtils]: 51: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-08 05:59:53,394 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {15898#true} {15996#(<= main_~v~0 main_~b~0)} #108#return; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-08 05:59:53,394 INFO L290 TraceCheckUtils]: 53: Hoare triple {15996#(<= main_~v~0 main_~b~0)} assume !(~c~0 >= 2 * ~v~0); {16063#(and (<= main_~v~0 main_~b~0) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-08 05:59:53,395 INFO L290 TraceCheckUtils]: 54: Hoare triple {16063#(and (<= main_~v~0 main_~b~0) (not (<= (* main_~v~0 2) main_~c~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {16067#(< main_~c~0 main_~b~0)} is VALID [2022-04-08 05:59:53,395 INFO L290 TraceCheckUtils]: 55: Hoare triple {16067#(< main_~c~0 main_~b~0)} assume !false; {16067#(< main_~c~0 main_~b~0)} is VALID [2022-04-08 05:59:53,396 INFO L290 TraceCheckUtils]: 56: Hoare triple {16067#(< main_~c~0 main_~b~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-08 05:59:53,396 INFO L290 TraceCheckUtils]: 57: Hoare triple {16074#(< main_~c~0 main_~v~0)} assume !false; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-08 05:59:53,396 INFO L272 TraceCheckUtils]: 58: Hoare triple {16074#(< main_~c~0 main_~v~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {15898#true} is VALID [2022-04-08 05:59:53,396 INFO L290 TraceCheckUtils]: 59: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-08 05:59:53,396 INFO L290 TraceCheckUtils]: 60: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-08 05:59:53,396 INFO L290 TraceCheckUtils]: 61: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-08 05:59:53,397 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {15898#true} {16074#(< main_~c~0 main_~v~0)} #102#return; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-08 05:59:53,397 INFO L272 TraceCheckUtils]: 63: Hoare triple {16074#(< main_~c~0 main_~v~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {15898#true} is VALID [2022-04-08 05:59:53,397 INFO L290 TraceCheckUtils]: 64: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-08 05:59:53,397 INFO L290 TraceCheckUtils]: 65: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-08 05:59:53,397 INFO L290 TraceCheckUtils]: 66: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-08 05:59:53,398 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {15898#true} {16074#(< main_~c~0 main_~v~0)} #104#return; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-08 05:59:53,398 INFO L272 TraceCheckUtils]: 68: Hoare triple {16074#(< main_~c~0 main_~v~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {15898#true} is VALID [2022-04-08 05:59:53,398 INFO L290 TraceCheckUtils]: 69: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-08 05:59:53,398 INFO L290 TraceCheckUtils]: 70: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-08 05:59:53,398 INFO L290 TraceCheckUtils]: 71: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-08 05:59:53,398 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {15898#true} {16074#(< main_~c~0 main_~v~0)} #106#return; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-08 05:59:53,399 INFO L272 TraceCheckUtils]: 73: Hoare triple {16074#(< main_~c~0 main_~v~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {15898#true} is VALID [2022-04-08 05:59:53,399 INFO L290 TraceCheckUtils]: 74: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-08 05:59:53,399 INFO L290 TraceCheckUtils]: 75: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-08 05:59:53,399 INFO L290 TraceCheckUtils]: 76: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-08 05:59:53,399 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {15898#true} {16074#(< main_~c~0 main_~v~0)} #108#return; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-08 05:59:53,399 INFO L290 TraceCheckUtils]: 78: Hoare triple {16074#(< main_~c~0 main_~v~0)} assume !(~c~0 >= 2 * ~v~0); {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-08 05:59:53,400 INFO L290 TraceCheckUtils]: 79: Hoare triple {16074#(< main_~c~0 main_~v~0)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {16144#(< main_~c~0 0)} is VALID [2022-04-08 05:59:53,400 INFO L290 TraceCheckUtils]: 80: Hoare triple {16144#(< main_~c~0 0)} assume !false; {16144#(< main_~c~0 0)} is VALID [2022-04-08 05:59:53,401 INFO L290 TraceCheckUtils]: 81: Hoare triple {16144#(< main_~c~0 0)} assume !(~c~0 >= ~b~0); {16144#(< main_~c~0 0)} is VALID [2022-04-08 05:59:53,401 INFO L290 TraceCheckUtils]: 82: Hoare triple {16144#(< main_~c~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; {16154#(< main_~b~0 0)} is VALID [2022-04-08 05:59:53,401 INFO L290 TraceCheckUtils]: 83: Hoare triple {16154#(< main_~b~0 0)} assume !false; {16154#(< main_~b~0 0)} is VALID [2022-04-08 05:59:53,402 INFO L290 TraceCheckUtils]: 84: Hoare triple {16154#(< main_~b~0 0)} assume !(0 != ~b~0); {15899#false} is VALID [2022-04-08 05:59:53,402 INFO L272 TraceCheckUtils]: 85: Hoare triple {15899#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {15899#false} is VALID [2022-04-08 05:59:53,402 INFO L290 TraceCheckUtils]: 86: Hoare triple {15899#false} ~cond := #in~cond; {15899#false} is VALID [2022-04-08 05:59:53,402 INFO L290 TraceCheckUtils]: 87: Hoare triple {15899#false} assume 0 == ~cond; {15899#false} is VALID [2022-04-08 05:59:53,402 INFO L290 TraceCheckUtils]: 88: Hoare triple {15899#false} assume !false; {15899#false} is VALID [2022-04-08 05:59:53,402 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-08 05:59:53,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:59:53,678 INFO L290 TraceCheckUtils]: 88: Hoare triple {15899#false} assume !false; {15899#false} is VALID [2022-04-08 05:59:53,678 INFO L290 TraceCheckUtils]: 87: Hoare triple {15899#false} assume 0 == ~cond; {15899#false} is VALID [2022-04-08 05:59:53,678 INFO L290 TraceCheckUtils]: 86: Hoare triple {15899#false} ~cond := #in~cond; {15899#false} is VALID [2022-04-08 05:59:53,679 INFO L272 TraceCheckUtils]: 85: Hoare triple {15899#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {15899#false} is VALID [2022-04-08 05:59:53,679 INFO L290 TraceCheckUtils]: 84: Hoare triple {16154#(< main_~b~0 0)} assume !(0 != ~b~0); {15899#false} is VALID [2022-04-08 05:59:53,679 INFO L290 TraceCheckUtils]: 83: Hoare triple {16154#(< main_~b~0 0)} assume !false; {16154#(< main_~b~0 0)} is VALID [2022-04-08 05:59:53,680 INFO L290 TraceCheckUtils]: 82: Hoare triple {16144#(< main_~c~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; {16154#(< main_~b~0 0)} is VALID [2022-04-08 05:59:53,680 INFO L290 TraceCheckUtils]: 81: Hoare triple {16144#(< main_~c~0 0)} assume !(~c~0 >= ~b~0); {16144#(< main_~c~0 0)} is VALID [2022-04-08 05:59:53,680 INFO L290 TraceCheckUtils]: 80: Hoare triple {16144#(< main_~c~0 0)} assume !false; {16144#(< main_~c~0 0)} is VALID [2022-04-08 05:59:53,681 INFO L290 TraceCheckUtils]: 79: Hoare triple {16074#(< main_~c~0 main_~v~0)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {16144#(< main_~c~0 0)} is VALID [2022-04-08 05:59:53,681 INFO L290 TraceCheckUtils]: 78: Hoare triple {16074#(< main_~c~0 main_~v~0)} assume !(~c~0 >= 2 * ~v~0); {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-08 05:59:53,682 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {15898#true} {16074#(< main_~c~0 main_~v~0)} #108#return; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-08 05:59:53,682 INFO L290 TraceCheckUtils]: 76: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-08 05:59:53,682 INFO L290 TraceCheckUtils]: 75: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-08 05:59:53,682 INFO L290 TraceCheckUtils]: 74: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-08 05:59:53,682 INFO L272 TraceCheckUtils]: 73: Hoare triple {16074#(< main_~c~0 main_~v~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {15898#true} is VALID [2022-04-08 05:59:53,682 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {15898#true} {16074#(< main_~c~0 main_~v~0)} #106#return; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-08 05:59:53,682 INFO L290 TraceCheckUtils]: 71: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-08 05:59:53,683 INFO L290 TraceCheckUtils]: 70: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-08 05:59:53,683 INFO L290 TraceCheckUtils]: 69: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-08 05:59:53,683 INFO L272 TraceCheckUtils]: 68: Hoare triple {16074#(< main_~c~0 main_~v~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {15898#true} is VALID [2022-04-08 05:59:53,683 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {15898#true} {16074#(< main_~c~0 main_~v~0)} #104#return; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-08 05:59:53,683 INFO L290 TraceCheckUtils]: 66: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-08 05:59:53,683 INFO L290 TraceCheckUtils]: 65: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-08 05:59:53,683 INFO L290 TraceCheckUtils]: 64: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-08 05:59:53,684 INFO L272 TraceCheckUtils]: 63: Hoare triple {16074#(< main_~c~0 main_~v~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {15898#true} is VALID [2022-04-08 05:59:53,684 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {15898#true} {16074#(< main_~c~0 main_~v~0)} #102#return; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-08 05:59:53,684 INFO L290 TraceCheckUtils]: 61: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-08 05:59:53,684 INFO L290 TraceCheckUtils]: 60: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-08 05:59:53,684 INFO L290 TraceCheckUtils]: 59: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-08 05:59:53,684 INFO L272 TraceCheckUtils]: 58: Hoare triple {16074#(< main_~c~0 main_~v~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {15898#true} is VALID [2022-04-08 05:59:53,685 INFO L290 TraceCheckUtils]: 57: Hoare triple {16074#(< main_~c~0 main_~v~0)} assume !false; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-08 05:59:53,685 INFO L290 TraceCheckUtils]: 56: Hoare triple {16067#(< main_~c~0 main_~b~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-08 05:59:53,685 INFO L290 TraceCheckUtils]: 55: Hoare triple {16067#(< main_~c~0 main_~b~0)} assume !false; {16067#(< main_~c~0 main_~b~0)} is VALID [2022-04-08 05:59:53,686 INFO L290 TraceCheckUtils]: 54: Hoare triple {16275#(< main_~c~0 (+ main_~b~0 main_~v~0))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {16067#(< main_~c~0 main_~b~0)} is VALID [2022-04-08 05:59:53,687 INFO L290 TraceCheckUtils]: 53: Hoare triple {15996#(<= main_~v~0 main_~b~0)} assume !(~c~0 >= 2 * ~v~0); {16275#(< main_~c~0 (+ main_~b~0 main_~v~0))} is VALID [2022-04-08 05:59:53,687 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {15898#true} {15996#(<= main_~v~0 main_~b~0)} #108#return; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-08 05:59:53,687 INFO L290 TraceCheckUtils]: 51: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-08 05:59:53,687 INFO L290 TraceCheckUtils]: 50: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-08 05:59:53,687 INFO L290 TraceCheckUtils]: 49: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-08 05:59:53,687 INFO L272 TraceCheckUtils]: 48: Hoare triple {15996#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {15898#true} is VALID [2022-04-08 05:59:53,688 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {15898#true} {15996#(<= main_~v~0 main_~b~0)} #106#return; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-08 05:59:53,688 INFO L290 TraceCheckUtils]: 46: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-08 05:59:53,688 INFO L290 TraceCheckUtils]: 45: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-08 05:59:53,688 INFO L290 TraceCheckUtils]: 44: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-08 05:59:53,688 INFO L272 TraceCheckUtils]: 43: Hoare triple {15996#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {15898#true} is VALID [2022-04-08 05:59:53,689 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15898#true} {15996#(<= main_~v~0 main_~b~0)} #104#return; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-08 05:59:53,689 INFO L290 TraceCheckUtils]: 41: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-08 05:59:53,689 INFO L290 TraceCheckUtils]: 40: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-08 05:59:53,689 INFO L290 TraceCheckUtils]: 39: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-08 05:59:53,689 INFO L272 TraceCheckUtils]: 38: Hoare triple {15996#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {15898#true} is VALID [2022-04-08 05:59:53,690 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {15898#true} {15996#(<= main_~v~0 main_~b~0)} #102#return; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-08 05:59:53,690 INFO L290 TraceCheckUtils]: 36: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-08 05:59:53,690 INFO L290 TraceCheckUtils]: 35: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-08 05:59:53,690 INFO L290 TraceCheckUtils]: 34: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-08 05:59:53,690 INFO L272 TraceCheckUtils]: 33: Hoare triple {15996#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {15898#true} is VALID [2022-04-08 05:59:53,690 INFO L290 TraceCheckUtils]: 32: Hoare triple {15996#(<= main_~v~0 main_~b~0)} assume !false; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-08 05:59:53,691 INFO L290 TraceCheckUtils]: 31: Hoare triple {15898#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-08 05:59:53,691 INFO L290 TraceCheckUtils]: 30: Hoare triple {15898#true} assume !false; {15898#true} is VALID [2022-04-08 05:59:53,691 INFO L290 TraceCheckUtils]: 29: Hoare triple {15898#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {15898#true} is VALID [2022-04-08 05:59:53,691 INFO L290 TraceCheckUtils]: 28: Hoare triple {15898#true} assume !false; {15898#true} is VALID [2022-04-08 05:59:53,691 INFO L290 TraceCheckUtils]: 27: Hoare triple {15898#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {15898#true} is VALID [2022-04-08 05:59:53,691 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {15898#true} {15898#true} #100#return; {15898#true} is VALID [2022-04-08 05:59:53,691 INFO L290 TraceCheckUtils]: 25: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-08 05:59:53,691 INFO L290 TraceCheckUtils]: 24: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-08 05:59:53,691 INFO L290 TraceCheckUtils]: 23: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-08 05:59:53,691 INFO L272 TraceCheckUtils]: 22: Hoare triple {15898#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {15898#true} is VALID [2022-04-08 05:59:53,691 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {15898#true} {15898#true} #98#return; {15898#true} is VALID [2022-04-08 05:59:53,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-08 05:59:53,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-08 05:59:53,692 INFO L290 TraceCheckUtils]: 18: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-08 05:59:53,692 INFO L272 TraceCheckUtils]: 17: Hoare triple {15898#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {15898#true} is VALID [2022-04-08 05:59:53,692 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15898#true} {15898#true} #96#return; {15898#true} is VALID [2022-04-08 05:59:53,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-08 05:59:53,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-08 05:59:53,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-08 05:59:53,692 INFO L272 TraceCheckUtils]: 12: Hoare triple {15898#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {15898#true} is VALID [2022-04-08 05:59:53,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {15898#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {15898#true} is VALID [2022-04-08 05:59:53,692 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15898#true} {15898#true} #94#return; {15898#true} is VALID [2022-04-08 05:59:53,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-08 05:59:53,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-08 05:59:53,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-08 05:59:53,692 INFO L272 TraceCheckUtils]: 6: Hoare triple {15898#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {15898#true} is VALID [2022-04-08 05:59:53,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {15898#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {15898#true} is VALID [2022-04-08 05:59:53,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {15898#true} call #t~ret6 := main(); {15898#true} is VALID [2022-04-08 05:59:53,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15898#true} {15898#true} #112#return; {15898#true} is VALID [2022-04-08 05:59:53,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-08 05:59:53,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {15898#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); {15898#true} is VALID [2022-04-08 05:59:53,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {15898#true} call ULTIMATE.init(); {15898#true} is VALID [2022-04-08 05:59:53,693 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-08 05:59:53,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:59:53,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116599042] [2022-04-08 05:59:53,693 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:59:53,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158914275] [2022-04-08 05:59:53,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158914275] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:59:53,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:59:53,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-08 05:59:53,694 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:59:53,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1741669771] [2022-04-08 05:59:53,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1741669771] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:59:53,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:59:53,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 05:59:53,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272001564] [2022-04-08 05:59:53,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:59:53,694 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 89 [2022-04-08 05:59:53,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:59:53,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-08 05:59:53,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:59:53,741 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 05:59:53,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:59:53,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 05:59:53,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-08 05:59:53,742 INFO L87 Difference]: Start difference. First operand 228 states and 321 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-08 05:59:55,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:59:55,137 INFO L93 Difference]: Finished difference Result 361 states and 505 transitions. [2022-04-08 05:59:55,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 05:59:55,138 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 89 [2022-04-08 05:59:55,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:59:55,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-08 05:59:55,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2022-04-08 05:59:55,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-08 05:59:55,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2022-04-08 05:59:55,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 89 transitions. [2022-04-08 05:59:55,228 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 05:59:55,233 INFO L225 Difference]: With dead ends: 361 [2022-04-08 05:59:55,233 INFO L226 Difference]: Without dead ends: 238 [2022-04-08 05:59:55,234 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-08 05:59:55,235 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 7 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 05:59:55,235 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 260 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 05:59:55,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-04-08 05:59:56,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 225. [2022-04-08 05:59:56,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:59:56,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states. Second operand has 225 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 127 states have internal predecessors, (149), 83 states have call successors, (83), 16 states have call predecessors, (83), 15 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2022-04-08 05:59:56,085 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand has 225 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 127 states have internal predecessors, (149), 83 states have call successors, (83), 16 states have call predecessors, (83), 15 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2022-04-08 05:59:56,085 INFO L87 Difference]: Start difference. First operand 238 states. Second operand has 225 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 127 states have internal predecessors, (149), 83 states have call successors, (83), 16 states have call predecessors, (83), 15 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2022-04-08 05:59:56,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:59:56,096 INFO L93 Difference]: Finished difference Result 238 states and 327 transitions. [2022-04-08 05:59:56,096 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 327 transitions. [2022-04-08 05:59:56,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:59:56,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:59:56,097 INFO L74 IsIncluded]: Start isIncluded. First operand has 225 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 127 states have internal predecessors, (149), 83 states have call successors, (83), 16 states have call predecessors, (83), 15 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) Second operand 238 states. [2022-04-08 05:59:56,098 INFO L87 Difference]: Start difference. First operand has 225 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 127 states have internal predecessors, (149), 83 states have call successors, (83), 16 states have call predecessors, (83), 15 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) Second operand 238 states. [2022-04-08 05:59:56,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:59:56,115 INFO L93 Difference]: Finished difference Result 238 states and 327 transitions. [2022-04-08 05:59:56,115 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 327 transitions. [2022-04-08 05:59:56,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:59:56,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:59:56,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:59:56,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:59:56,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 127 states have internal predecessors, (149), 83 states have call successors, (83), 16 states have call predecessors, (83), 15 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2022-04-08 05:59:56,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 313 transitions. [2022-04-08 05:59:56,125 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 313 transitions. Word has length 89 [2022-04-08 05:59:56,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:59:56,125 INFO L478 AbstractCegarLoop]: Abstraction has 225 states and 313 transitions. [2022-04-08 05:59:56,126 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-08 05:59:56,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 225 states and 313 transitions. [2022-04-08 05:59:56,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 313 edges. 313 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:59:56,864 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 313 transitions. [2022-04-08 05:59:56,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-08 05:59:56,865 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:59:56,865 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, 1, 1] [2022-04-08 05:59:56,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-08 05:59:57,088 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 05:59:57,088 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:59:57,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:59:57,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1455197645, now seen corresponding path program 3 times [2022-04-08 05:59:57,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:59:57,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1545043089] [2022-04-08 05:59:57,089 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:59:57,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1455197645, now seen corresponding path program 4 times [2022-04-08 05:59:57,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:59:57,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899893615] [2022-04-08 05:59:57,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:59:57,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:59:57,101 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:59:57,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [156664296] [2022-04-08 05:59:57,102 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 05:59:57,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:59:57,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:59:57,103 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 05:59:57,103 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 05:59:57,152 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 05:59:57,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:59:57,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 88 conjunts are in the unsatisfiable core [2022-04-08 05:59:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:59:57,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:00:05,141 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 06:00:09,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {18091#true} call ULTIMATE.init(); {18091#true} is VALID [2022-04-08 06:00:09,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {18091#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); {18091#true} is VALID [2022-04-08 06:00:09,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-08 06:00:09,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18091#true} {18091#true} #112#return; {18091#true} is VALID [2022-04-08 06:00:09,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {18091#true} call #t~ret6 := main(); {18091#true} is VALID [2022-04-08 06:00:09,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {18091#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {18091#true} is VALID [2022-04-08 06:00:09,873 INFO L272 TraceCheckUtils]: 6: Hoare triple {18091#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {18091#true} is VALID [2022-04-08 06:00:09,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-08 06:00:09,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-08 06:00:09,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-08 06:00:09,874 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18091#true} {18091#true} #94#return; {18091#true} is VALID [2022-04-08 06:00:09,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {18091#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {18091#true} is VALID [2022-04-08 06:00:09,874 INFO L272 TraceCheckUtils]: 12: Hoare triple {18091#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {18091#true} is VALID [2022-04-08 06:00:09,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {18091#true} ~cond := #in~cond; {18135#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 06:00:09,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {18135#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {18139#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:00:09,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {18139#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {18139#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:00:09,876 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {18139#(not (= |assume_abort_if_not_#in~cond| 0))} {18091#true} #96#return; {18146#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 06:00:09,876 INFO L272 TraceCheckUtils]: 17: Hoare triple {18146#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18091#true} is VALID [2022-04-08 06:00:09,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-08 06:00:09,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-08 06:00:09,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-08 06:00:09,877 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {18091#true} {18146#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #98#return; {18146#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 06:00:09,877 INFO L272 TraceCheckUtils]: 22: Hoare triple {18146#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18091#true} is VALID [2022-04-08 06:00:09,877 INFO L290 TraceCheckUtils]: 23: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-08 06:00:09,877 INFO L290 TraceCheckUtils]: 24: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-08 06:00:09,877 INFO L290 TraceCheckUtils]: 25: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-08 06:00:09,877 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18091#true} {18146#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #100#return; {18146#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 06:00:09,878 INFO L290 TraceCheckUtils]: 27: Hoare triple {18146#(and (<= 0 main_~y~0) (<= main_~y~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {18180#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 06:00:09,878 INFO L290 TraceCheckUtils]: 28: Hoare triple {18180#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !false; {18180#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 06:00:09,879 INFO L290 TraceCheckUtils]: 29: Hoare triple {18180#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {18187#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-08 06:00:09,879 INFO L290 TraceCheckUtils]: 30: Hoare triple {18187#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !false; {18187#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-08 06:00:09,880 INFO L290 TraceCheckUtils]: 31: Hoare triple {18187#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !(~c~0 >= ~b~0); {18194#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-08 06:00:09,881 INFO L290 TraceCheckUtils]: 32: Hoare triple {18194#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~q~0 0) (= 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; {18198#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 06:00:09,881 INFO L290 TraceCheckUtils]: 33: Hoare triple {18198#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !false; {18198#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 06:00:09,882 INFO L290 TraceCheckUtils]: 34: Hoare triple {18198#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {18205#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 06:00:09,882 INFO L290 TraceCheckUtils]: 35: Hoare triple {18205#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !false; {18205#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 06:00:09,883 INFO L290 TraceCheckUtils]: 36: Hoare triple {18205#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 06:00:09,883 INFO L290 TraceCheckUtils]: 37: Hoare triple {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !false; {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 06:00:09,883 INFO L272 TraceCheckUtils]: 38: Hoare triple {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18091#true} is VALID [2022-04-08 06:00:09,884 INFO L290 TraceCheckUtils]: 39: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-08 06:00:09,884 INFO L290 TraceCheckUtils]: 40: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-08 06:00:09,884 INFO L290 TraceCheckUtils]: 41: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-08 06:00:09,885 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {18091#true} {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #102#return; {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 06:00:09,885 INFO L272 TraceCheckUtils]: 43: Hoare triple {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18091#true} is VALID [2022-04-08 06:00:09,885 INFO L290 TraceCheckUtils]: 44: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-08 06:00:09,885 INFO L290 TraceCheckUtils]: 45: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-08 06:00:09,885 INFO L290 TraceCheckUtils]: 46: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-08 06:00:09,886 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18091#true} {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #104#return; {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 06:00:09,886 INFO L272 TraceCheckUtils]: 48: Hoare triple {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18091#true} is VALID [2022-04-08 06:00:09,886 INFO L290 TraceCheckUtils]: 49: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-08 06:00:09,887 INFO L290 TraceCheckUtils]: 50: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-08 06:00:09,887 INFO L290 TraceCheckUtils]: 51: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-08 06:00:09,887 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {18091#true} {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #106#return; {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 06:00:09,888 INFO L272 TraceCheckUtils]: 53: Hoare triple {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {18091#true} is VALID [2022-04-08 06:00:09,888 INFO L290 TraceCheckUtils]: 54: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-08 06:00:09,888 INFO L290 TraceCheckUtils]: 55: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-08 06:00:09,888 INFO L290 TraceCheckUtils]: 56: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-08 06:00:09,889 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {18091#true} {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #108#return; {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 06:00:09,890 INFO L290 TraceCheckUtils]: 58: Hoare triple {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {18279#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-08 06:00:09,891 INFO L290 TraceCheckUtils]: 59: Hoare triple {18279#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} assume !false; {18279#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-08 06:00:09,891 INFO L272 TraceCheckUtils]: 60: Hoare triple {18279#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18091#true} is VALID [2022-04-08 06:00:09,891 INFO L290 TraceCheckUtils]: 61: Hoare triple {18091#true} ~cond := #in~cond; {18289#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:00:09,892 INFO L290 TraceCheckUtils]: 62: Hoare triple {18289#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:00:09,892 INFO L290 TraceCheckUtils]: 63: Hoare triple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:00:09,893 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} {18279#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} #102#return; {18279#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-08 06:00:09,893 INFO L272 TraceCheckUtils]: 65: Hoare triple {18279#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18091#true} is VALID [2022-04-08 06:00:09,894 INFO L290 TraceCheckUtils]: 66: Hoare triple {18091#true} ~cond := #in~cond; {18289#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:00:09,894 INFO L290 TraceCheckUtils]: 67: Hoare triple {18289#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:00:09,894 INFO L290 TraceCheckUtils]: 68: Hoare triple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:00:09,896 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} {18279#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} #104#return; {18315#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-08 06:00:09,896 INFO L272 TraceCheckUtils]: 70: Hoare triple {18315#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18091#true} is VALID [2022-04-08 06:00:09,896 INFO L290 TraceCheckUtils]: 71: Hoare triple {18091#true} ~cond := #in~cond; {18289#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:00:09,897 INFO L290 TraceCheckUtils]: 72: Hoare triple {18289#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:00:09,897 INFO L290 TraceCheckUtils]: 73: Hoare triple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:00:09,898 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} {18315#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} #106#return; {18331#(and (<= 0 main_~y~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-08 06:00:09,898 INFO L272 TraceCheckUtils]: 75: Hoare triple {18331#(and (<= 0 main_~y~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {18091#true} is VALID [2022-04-08 06:00:09,899 INFO L290 TraceCheckUtils]: 76: Hoare triple {18091#true} ~cond := #in~cond; {18289#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:00:09,899 INFO L290 TraceCheckUtils]: 77: Hoare triple {18289#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:00:09,899 INFO L290 TraceCheckUtils]: 78: Hoare triple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:00:09,901 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} {18331#(and (<= 0 main_~y~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} #108#return; {18347#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (<= 0 main_~y~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-08 06:00:09,901 INFO L290 TraceCheckUtils]: 80: Hoare triple {18347#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (<= 0 main_~y~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} assume !(~c~0 >= 2 * ~v~0); {18347#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (<= 0 main_~y~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-08 06:00:09,916 INFO L290 TraceCheckUtils]: 81: Hoare triple {18347#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (<= 0 main_~y~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {18354#(and (<= 0 main_~y~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~y~0 2) (= main_~p~0 0) (= (+ main_~c~0 (* main_~b~0 2)) main_~y~0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} is VALID [2022-04-08 06:00:09,917 INFO L290 TraceCheckUtils]: 82: Hoare triple {18354#(and (<= 0 main_~y~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~y~0 2) (= main_~p~0 0) (= (+ main_~c~0 (* main_~b~0 2)) main_~y~0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} assume !false; {18354#(and (<= 0 main_~y~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~y~0 2) (= main_~p~0 0) (= (+ main_~c~0 (* main_~b~0 2)) main_~y~0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} is VALID [2022-04-08 06:00:09,918 INFO L290 TraceCheckUtils]: 83: Hoare triple {18354#(and (<= 0 main_~y~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~y~0 2) (= main_~p~0 0) (= (+ main_~c~0 (* main_~b~0 2)) main_~y~0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} assume !(~c~0 >= ~b~0); {18361#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~y~0 2) (= main_~p~0 0) (= (+ main_~c~0 (* main_~b~0 2)) main_~y~0) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (< main_~c~0 main_~b~0))} is VALID [2022-04-08 06:00:09,921 INFO L290 TraceCheckUtils]: 84: Hoare triple {18361#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~y~0 2) (= main_~p~0 0) (= (+ main_~c~0 (* main_~b~0 2)) main_~y~0) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (< main_~c~0 main_~b~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; {18365#(and (= main_~r~0 0) (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= main_~y~0 2) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ main_~q~0 (* main_~p~0 (div (* main_~x~0 2) main_~x~0))) 0) (= main_~a~0 main_~x~0) (< main_~y~0 (* main_~x~0 3)))} is VALID [2022-04-08 06:00:09,922 INFO L290 TraceCheckUtils]: 85: Hoare triple {18365#(and (= main_~r~0 0) (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= main_~y~0 2) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ main_~q~0 (* main_~p~0 (div (* main_~x~0 2) main_~x~0))) 0) (= main_~a~0 main_~x~0) (< main_~y~0 (* main_~x~0 3)))} assume !false; {18365#(and (= main_~r~0 0) (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= main_~y~0 2) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ main_~q~0 (* main_~p~0 (div (* main_~x~0 2) main_~x~0))) 0) (= main_~a~0 main_~x~0) (< main_~y~0 (* main_~x~0 3)))} is VALID [2022-04-08 06:00:09,923 INFO L290 TraceCheckUtils]: 86: Hoare triple {18365#(and (= main_~r~0 0) (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= main_~y~0 2) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ main_~q~0 (* main_~p~0 (div (* main_~x~0 2) main_~x~0))) 0) (= main_~a~0 main_~x~0) (< main_~y~0 (* main_~x~0 3)))} assume !(0 != ~b~0); {18372#(and (= main_~r~0 0) (= (* main_~x~0 2) main_~y~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ main_~q~0 (* main_~p~0 (div (* main_~x~0 2) main_~x~0))) 0) (= main_~a~0 main_~x~0) (< main_~y~0 (* main_~x~0 3)))} is VALID [2022-04-08 06:00:09,925 INFO L272 TraceCheckUtils]: 87: Hoare triple {18372#(and (= main_~r~0 0) (= (* main_~x~0 2) main_~y~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ main_~q~0 (* main_~p~0 (div (* main_~x~0 2) main_~x~0))) 0) (= main_~a~0 main_~x~0) (< main_~y~0 (* main_~x~0 3)))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {18376#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:00:09,925 INFO L290 TraceCheckUtils]: 88: Hoare triple {18376#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18380#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:00:09,926 INFO L290 TraceCheckUtils]: 89: Hoare triple {18380#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18092#false} is VALID [2022-04-08 06:00:09,926 INFO L290 TraceCheckUtils]: 90: Hoare triple {18092#false} assume !false; {18092#false} is VALID [2022-04-08 06:00:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 63 proven. 29 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-04-08 06:00:09,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:01:13,221 INFO L290 TraceCheckUtils]: 90: Hoare triple {18092#false} assume !false; {18092#false} is VALID [2022-04-08 06:01:13,222 INFO L290 TraceCheckUtils]: 89: Hoare triple {18380#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18092#false} is VALID [2022-04-08 06:01:13,222 INFO L290 TraceCheckUtils]: 88: Hoare triple {18376#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18380#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:01:13,223 INFO L272 TraceCheckUtils]: 87: Hoare triple {18396#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {18376#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:01:13,223 INFO L290 TraceCheckUtils]: 86: Hoare triple {18400#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !(0 != ~b~0); {18396#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 06:01:13,223 INFO L290 TraceCheckUtils]: 85: Hoare triple {18400#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !false; {18400#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-08 06:01:13,295 INFO L290 TraceCheckUtils]: 84: Hoare triple {18407#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {18400#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-08 06:01:13,296 INFO L290 TraceCheckUtils]: 83: Hoare triple {18411#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {18407#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 06:01:13,297 INFO L290 TraceCheckUtils]: 82: Hoare triple {18411#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {18411#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 06:01:13,411 INFO L290 TraceCheckUtils]: 81: Hoare triple {18418#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {18411#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 06:01:13,412 INFO L290 TraceCheckUtils]: 80: Hoare triple {18418#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= 2 * ~v~0); {18418#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 06:01:13,413 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} {18425#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #108#return; {18418#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 06:01:13,413 INFO L290 TraceCheckUtils]: 78: Hoare triple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:01:13,414 INFO L290 TraceCheckUtils]: 77: Hoare triple {18435#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:01:13,414 INFO L290 TraceCheckUtils]: 76: Hoare triple {18091#true} ~cond := #in~cond; {18435#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 06:01:13,414 INFO L272 TraceCheckUtils]: 75: Hoare triple {18425#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {18091#true} is VALID [2022-04-08 06:01:13,416 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} {18442#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #106#return; {18425#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 06:01:13,416 INFO L290 TraceCheckUtils]: 73: Hoare triple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:01:13,416 INFO L290 TraceCheckUtils]: 72: Hoare triple {18435#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:01:13,417 INFO L290 TraceCheckUtils]: 71: Hoare triple {18091#true} ~cond := #in~cond; {18435#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 06:01:13,417 INFO L272 TraceCheckUtils]: 70: Hoare triple {18442#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18091#true} is VALID [2022-04-08 06:01:13,418 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} {18458#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {18442#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 06:01:13,419 INFO L290 TraceCheckUtils]: 68: Hoare triple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:01:13,419 INFO L290 TraceCheckUtils]: 67: Hoare triple {18435#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:01:13,419 INFO L290 TraceCheckUtils]: 66: Hoare triple {18091#true} ~cond := #in~cond; {18435#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 06:01:13,420 INFO L272 TraceCheckUtils]: 65: Hoare triple {18458#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18091#true} is VALID [2022-04-08 06:01:15,198 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} {18091#true} #102#return; {18458#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 06:01:15,199 INFO L290 TraceCheckUtils]: 63: Hoare triple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:01:15,199 INFO L290 TraceCheckUtils]: 62: Hoare triple {18435#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:01:15,200 INFO L290 TraceCheckUtils]: 61: Hoare triple {18091#true} ~cond := #in~cond; {18435#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 06:01:15,200 INFO L272 TraceCheckUtils]: 60: Hoare triple {18091#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18091#true} is VALID [2022-04-08 06:01:15,200 INFO L290 TraceCheckUtils]: 59: Hoare triple {18091#true} assume !false; {18091#true} is VALID [2022-04-08 06:01:15,200 INFO L290 TraceCheckUtils]: 58: Hoare triple {18091#true} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {18091#true} is VALID [2022-04-08 06:01:15,200 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {18091#true} {18091#true} #108#return; {18091#true} is VALID [2022-04-08 06:01:15,200 INFO L290 TraceCheckUtils]: 56: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-08 06:01:15,200 INFO L290 TraceCheckUtils]: 55: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-08 06:01:15,200 INFO L290 TraceCheckUtils]: 54: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-08 06:01:15,201 INFO L272 TraceCheckUtils]: 53: Hoare triple {18091#true} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {18091#true} is VALID [2022-04-08 06:01:15,201 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {18091#true} {18091#true} #106#return; {18091#true} is VALID [2022-04-08 06:01:15,201 INFO L290 TraceCheckUtils]: 51: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-08 06:01:15,201 INFO L290 TraceCheckUtils]: 50: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-08 06:01:15,201 INFO L290 TraceCheckUtils]: 49: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-08 06:01:15,201 INFO L272 TraceCheckUtils]: 48: Hoare triple {18091#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18091#true} is VALID [2022-04-08 06:01:15,201 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18091#true} {18091#true} #104#return; {18091#true} is VALID [2022-04-08 06:01:15,201 INFO L290 TraceCheckUtils]: 46: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-08 06:01:15,201 INFO L290 TraceCheckUtils]: 45: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-08 06:01:15,201 INFO L290 TraceCheckUtils]: 44: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-08 06:01:15,202 INFO L272 TraceCheckUtils]: 43: Hoare triple {18091#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18091#true} is VALID [2022-04-08 06:01:15,202 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {18091#true} {18091#true} #102#return; {18091#true} is VALID [2022-04-08 06:01:15,202 INFO L290 TraceCheckUtils]: 41: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-08 06:01:15,202 INFO L290 TraceCheckUtils]: 40: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-08 06:01:15,202 INFO L290 TraceCheckUtils]: 39: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-08 06:01:15,202 INFO L272 TraceCheckUtils]: 38: Hoare triple {18091#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18091#true} is VALID [2022-04-08 06:01:15,202 INFO L290 TraceCheckUtils]: 37: Hoare triple {18091#true} assume !false; {18091#true} is VALID [2022-04-08 06:01:15,202 INFO L290 TraceCheckUtils]: 36: Hoare triple {18091#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {18091#true} is VALID [2022-04-08 06:01:15,202 INFO L290 TraceCheckUtils]: 35: Hoare triple {18091#true} assume !false; {18091#true} is VALID [2022-04-08 06:01:15,202 INFO L290 TraceCheckUtils]: 34: Hoare triple {18091#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {18091#true} is VALID [2022-04-08 06:01:15,203 INFO L290 TraceCheckUtils]: 33: Hoare triple {18091#true} assume !false; {18091#true} is VALID [2022-04-08 06:01:15,203 INFO L290 TraceCheckUtils]: 32: Hoare triple {18091#true} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {18091#true} is VALID [2022-04-08 06:01:15,203 INFO L290 TraceCheckUtils]: 31: Hoare triple {18091#true} assume !(~c~0 >= ~b~0); {18091#true} is VALID [2022-04-08 06:01:15,203 INFO L290 TraceCheckUtils]: 30: Hoare triple {18091#true} assume !false; {18091#true} is VALID [2022-04-08 06:01:15,203 INFO L290 TraceCheckUtils]: 29: Hoare triple {18091#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {18091#true} is VALID [2022-04-08 06:01:15,203 INFO L290 TraceCheckUtils]: 28: Hoare triple {18091#true} assume !false; {18091#true} is VALID [2022-04-08 06:01:15,203 INFO L290 TraceCheckUtils]: 27: Hoare triple {18091#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {18091#true} is VALID [2022-04-08 06:01:15,203 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18091#true} {18091#true} #100#return; {18091#true} is VALID [2022-04-08 06:01:15,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-08 06:01:15,203 INFO L290 TraceCheckUtils]: 24: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-08 06:01:15,204 INFO L290 TraceCheckUtils]: 23: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-08 06:01:15,204 INFO L272 TraceCheckUtils]: 22: Hoare triple {18091#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18091#true} is VALID [2022-04-08 06:01:15,204 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {18091#true} {18091#true} #98#return; {18091#true} is VALID [2022-04-08 06:01:15,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-08 06:01:15,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-08 06:01:15,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-08 06:01:15,204 INFO L272 TraceCheckUtils]: 17: Hoare triple {18091#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18091#true} is VALID [2022-04-08 06:01:15,204 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {18091#true} {18091#true} #96#return; {18091#true} is VALID [2022-04-08 06:01:15,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-08 06:01:15,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-08 06:01:15,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-08 06:01:15,205 INFO L272 TraceCheckUtils]: 12: Hoare triple {18091#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {18091#true} is VALID [2022-04-08 06:01:15,205 INFO L290 TraceCheckUtils]: 11: Hoare triple {18091#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {18091#true} is VALID [2022-04-08 06:01:15,205 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18091#true} {18091#true} #94#return; {18091#true} is VALID [2022-04-08 06:01:15,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-08 06:01:15,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-08 06:01:15,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-08 06:01:15,205 INFO L272 TraceCheckUtils]: 6: Hoare triple {18091#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {18091#true} is VALID [2022-04-08 06:01:15,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {18091#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {18091#true} is VALID [2022-04-08 06:01:15,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {18091#true} call #t~ret6 := main(); {18091#true} is VALID [2022-04-08 06:01:15,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18091#true} {18091#true} #112#return; {18091#true} is VALID [2022-04-08 06:01:15,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-08 06:01:15,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {18091#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); {18091#true} is VALID [2022-04-08 06:01:15,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {18091#true} call ULTIMATE.init(); {18091#true} is VALID [2022-04-08 06:01:15,206 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 73 proven. 4 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-04-08 06:01:15,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:01:15,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899893615] [2022-04-08 06:01:15,207 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:01:15,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156664296] [2022-04-08 06:01:15,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156664296] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:01:15,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:01:15,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 14] total 32 [2022-04-08 06:01:15,207 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:01:15,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1545043089] [2022-04-08 06:01:15,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1545043089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:01:15,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:01:15,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 06:01:15,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711760555] [2022-04-08 06:01:15,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:01:15,209 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) Word has length 91 [2022-04-08 06:01:15,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:01:15,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-08 06:01:15,297 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 06:01:15,298 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 06:01:15,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:15,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 06:01:15,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=835, Unknown=1, NotChecked=0, Total=992 [2022-04-08 06:01:15,299 INFO L87 Difference]: Start difference. First operand 225 states and 313 transitions. Second operand has 23 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-08 06:01:22,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:22,529 INFO L93 Difference]: Finished difference Result 328 states and 448 transitions. [2022-04-08 06:01:22,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 06:01:22,530 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) Word has length 91 [2022-04-08 06:01:22,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:01:22,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-08 06:01:22,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 181 transitions. [2022-04-08 06:01:22,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-08 06:01:22,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 181 transitions. [2022-04-08 06:01:22,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 181 transitions. [2022-04-08 06:01:22,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:22,990 INFO L225 Difference]: With dead ends: 328 [2022-04-08 06:01:22,990 INFO L226 Difference]: Without dead ends: 270 [2022-04-08 06:01:22,992 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 149 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=229, Invalid=1330, Unknown=1, NotChecked=0, Total=1560 [2022-04-08 06:01:22,994 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 101 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-08 06:01:22,994 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 283 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-08 06:01:22,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-04-08 06:01:24,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 258. [2022-04-08 06:01:24,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:01:24,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 270 states. Second operand has 258 states, 144 states have (on average 1.1805555555555556) internal successors, (170), 145 states have internal predecessors, (170), 95 states have call successors, (95), 19 states have call predecessors, (95), 18 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2022-04-08 06:01:24,436 INFO L74 IsIncluded]: Start isIncluded. First operand 270 states. Second operand has 258 states, 144 states have (on average 1.1805555555555556) internal successors, (170), 145 states have internal predecessors, (170), 95 states have call successors, (95), 19 states have call predecessors, (95), 18 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2022-04-08 06:01:24,451 INFO L87 Difference]: Start difference. First operand 270 states. Second operand has 258 states, 144 states have (on average 1.1805555555555556) internal successors, (170), 145 states have internal predecessors, (170), 95 states have call successors, (95), 19 states have call predecessors, (95), 18 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2022-04-08 06:01:24,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:24,461 INFO L93 Difference]: Finished difference Result 270 states and 370 transitions. [2022-04-08 06:01:24,461 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 370 transitions. [2022-04-08 06:01:24,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:24,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:24,463 INFO L74 IsIncluded]: Start isIncluded. First operand has 258 states, 144 states have (on average 1.1805555555555556) internal successors, (170), 145 states have internal predecessors, (170), 95 states have call successors, (95), 19 states have call predecessors, (95), 18 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) Second operand 270 states. [2022-04-08 06:01:24,464 INFO L87 Difference]: Start difference. First operand has 258 states, 144 states have (on average 1.1805555555555556) internal successors, (170), 145 states have internal predecessors, (170), 95 states have call successors, (95), 19 states have call predecessors, (95), 18 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) Second operand 270 states. [2022-04-08 06:01:24,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:24,472 INFO L93 Difference]: Finished difference Result 270 states and 370 transitions. [2022-04-08 06:01:24,472 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 370 transitions. [2022-04-08 06:01:24,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:24,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:24,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:01:24,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:01:24,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 144 states have (on average 1.1805555555555556) internal successors, (170), 145 states have internal predecessors, (170), 95 states have call successors, (95), 19 states have call predecessors, (95), 18 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2022-04-08 06:01:24,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 358 transitions. [2022-04-08 06:01:24,482 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 358 transitions. Word has length 91 [2022-04-08 06:01:24,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:01:24,483 INFO L478 AbstractCegarLoop]: Abstraction has 258 states and 358 transitions. [2022-04-08 06:01:24,483 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-08 06:01:24,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 258 states and 358 transitions. [2022-04-08 06:01:25,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 358 edges. 358 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:25,597 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 358 transitions. [2022-04-08 06:01:25,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-08 06:01:25,598 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:01:25,599 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 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, 1, 1, 1, 1] [2022-04-08 06:01:25,624 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 06:01:25,799 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 06:01:25,799 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:01:25,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:01:25,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1948981098, now seen corresponding path program 5 times [2022-04-08 06:01:25,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:25,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [161570787] [2022-04-08 06:01:25,800 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:01:25,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1948981098, now seen corresponding path program 6 times [2022-04-08 06:01:25,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:01:25,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596599202] [2022-04-08 06:01:25,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:01:25,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:01:25,828 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:01:25,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1687337719] [2022-04-08 06:01:25,828 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:01:25,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:25,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:01:25,837 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 06:01:25,838 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 06:01:25,909 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 06:01:25,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:01:25,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-08 06:01:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:01:25,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:01:28,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {20396#true} call ULTIMATE.init(); {20396#true} is VALID [2022-04-08 06:01:28,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {20396#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); {20396#true} is VALID [2022-04-08 06:01:28,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-08 06:01:28,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20396#true} {20396#true} #112#return; {20396#true} is VALID [2022-04-08 06:01:28,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {20396#true} call #t~ret6 := main(); {20396#true} is VALID [2022-04-08 06:01:28,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {20396#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {20396#true} is VALID [2022-04-08 06:01:28,296 INFO L272 TraceCheckUtils]: 6: Hoare triple {20396#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {20396#true} is VALID [2022-04-08 06:01:28,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {20396#true} ~cond := #in~cond; {20422#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 06:01:28,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {20422#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {20426#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:01:28,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {20426#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {20426#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:01:28,298 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20426#(not (= |assume_abort_if_not_#in~cond| 0))} {20396#true} #94#return; {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 06:01:28,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 06:01:28,298 INFO L272 TraceCheckUtils]: 12: Hoare triple {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {20396#true} is VALID [2022-04-08 06:01:28,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-08 06:01:28,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-08 06:01:28,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-08 06:01:28,299 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20396#true} {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #96#return; {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 06:01:28,299 INFO L272 TraceCheckUtils]: 17: Hoare triple {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {20396#true} is VALID [2022-04-08 06:01:28,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-08 06:01:28,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-08 06:01:28,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-08 06:01:28,299 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {20396#true} {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #98#return; {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 06:01:28,300 INFO L272 TraceCheckUtils]: 22: Hoare triple {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {20396#true} is VALID [2022-04-08 06:01:28,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-08 06:01:28,309 INFO L290 TraceCheckUtils]: 24: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-08 06:01:28,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-08 06:01:28,310 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20396#true} {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #100#return; {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 06:01:28,311 INFO L290 TraceCheckUtils]: 27: Hoare triple {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {20485#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 06:01:28,311 INFO L290 TraceCheckUtils]: 28: Hoare triple {20485#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {20485#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 06:01:28,312 INFO L290 TraceCheckUtils]: 29: Hoare triple {20485#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 06:01:28,312 INFO L290 TraceCheckUtils]: 30: Hoare triple {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 06:01:28,313 INFO L290 TraceCheckUtils]: 31: Hoare triple {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 06:01:28,313 INFO L290 TraceCheckUtils]: 32: Hoare triple {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 06:01:28,313 INFO L272 TraceCheckUtils]: 33: Hoare triple {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20396#true} is VALID [2022-04-08 06:01:28,313 INFO L290 TraceCheckUtils]: 34: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-08 06:01:28,314 INFO L290 TraceCheckUtils]: 35: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-08 06:01:28,314 INFO L290 TraceCheckUtils]: 36: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-08 06:01:28,314 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {20396#true} {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #102#return; {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 06:01:28,314 INFO L272 TraceCheckUtils]: 38: Hoare triple {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20396#true} is VALID [2022-04-08 06:01:28,315 INFO L290 TraceCheckUtils]: 39: Hoare triple {20396#true} ~cond := #in~cond; {20523#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:01:28,315 INFO L290 TraceCheckUtils]: 40: Hoare triple {20523#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:01:28,315 INFO L290 TraceCheckUtils]: 41: Hoare triple {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:01:28,316 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #104#return; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 06:01:28,316 INFO L272 TraceCheckUtils]: 43: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20396#true} is VALID [2022-04-08 06:01:28,316 INFO L290 TraceCheckUtils]: 44: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-08 06:01:28,316 INFO L290 TraceCheckUtils]: 45: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-08 06:01:28,316 INFO L290 TraceCheckUtils]: 46: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-08 06:01:28,317 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20396#true} {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #106#return; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 06:01:28,317 INFO L272 TraceCheckUtils]: 48: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {20396#true} is VALID [2022-04-08 06:01:28,317 INFO L290 TraceCheckUtils]: 49: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-08 06:01:28,317 INFO L290 TraceCheckUtils]: 50: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-08 06:01:28,317 INFO L290 TraceCheckUtils]: 51: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-08 06:01:28,318 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {20396#true} {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #108#return; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 06:01:28,319 INFO L290 TraceCheckUtils]: 53: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 06:01:28,319 INFO L290 TraceCheckUtils]: 54: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 06:01:28,319 INFO L272 TraceCheckUtils]: 55: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20396#true} is VALID [2022-04-08 06:01:28,319 INFO L290 TraceCheckUtils]: 56: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-08 06:01:28,319 INFO L290 TraceCheckUtils]: 57: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-08 06:01:28,320 INFO L290 TraceCheckUtils]: 58: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-08 06:01:28,320 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {20396#true} {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #102#return; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 06:01:28,320 INFO L272 TraceCheckUtils]: 60: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20396#true} is VALID [2022-04-08 06:01:28,320 INFO L290 TraceCheckUtils]: 61: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-08 06:01:28,320 INFO L290 TraceCheckUtils]: 62: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-08 06:01:28,321 INFO L290 TraceCheckUtils]: 63: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-08 06:01:28,321 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {20396#true} {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #104#return; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 06:01:28,321 INFO L272 TraceCheckUtils]: 65: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20396#true} is VALID [2022-04-08 06:01:28,321 INFO L290 TraceCheckUtils]: 66: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-08 06:01:28,321 INFO L290 TraceCheckUtils]: 67: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-08 06:01:28,321 INFO L290 TraceCheckUtils]: 68: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-08 06:01:28,322 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {20396#true} {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #106#return; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 06:01:28,322 INFO L272 TraceCheckUtils]: 70: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {20396#true} is VALID [2022-04-08 06:01:28,322 INFO L290 TraceCheckUtils]: 71: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-08 06:01:28,322 INFO L290 TraceCheckUtils]: 72: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-08 06:01:28,322 INFO L290 TraceCheckUtils]: 73: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-08 06:01:28,323 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {20396#true} {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #108#return; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 06:01:28,324 INFO L290 TraceCheckUtils]: 75: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 06:01:28,324 INFO L290 TraceCheckUtils]: 76: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 06:01:28,324 INFO L272 TraceCheckUtils]: 77: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20396#true} is VALID [2022-04-08 06:01:28,324 INFO L290 TraceCheckUtils]: 78: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-08 06:01:28,324 INFO L290 TraceCheckUtils]: 79: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-08 06:01:28,325 INFO L290 TraceCheckUtils]: 80: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-08 06:01:28,328 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {20396#true} {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #102#return; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 06:01:28,328 INFO L272 TraceCheckUtils]: 82: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20396#true} is VALID [2022-04-08 06:01:28,328 INFO L290 TraceCheckUtils]: 83: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-08 06:01:28,328 INFO L290 TraceCheckUtils]: 84: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-08 06:01:28,328 INFO L290 TraceCheckUtils]: 85: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-08 06:01:28,329 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {20396#true} {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #104#return; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 06:01:28,329 INFO L272 TraceCheckUtils]: 87: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20396#true} is VALID [2022-04-08 06:01:28,330 INFO L290 TraceCheckUtils]: 88: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-08 06:01:28,330 INFO L290 TraceCheckUtils]: 89: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-08 06:01:28,330 INFO L290 TraceCheckUtils]: 90: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-08 06:01:28,331 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {20396#true} {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #106#return; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 06:01:28,331 INFO L272 TraceCheckUtils]: 92: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {20396#true} is VALID [2022-04-08 06:01:28,331 INFO L290 TraceCheckUtils]: 93: Hoare triple {20396#true} ~cond := #in~cond; {20523#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:01:28,332 INFO L290 TraceCheckUtils]: 94: Hoare triple {20523#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:01:28,332 INFO L290 TraceCheckUtils]: 95: Hoare triple {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:01:28,334 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #108#return; {20697#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 06:01:28,334 INFO L290 TraceCheckUtils]: 97: Hoare triple {20697#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {20701#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (not (<= (* main_~v~0 2) main_~c~0)) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 06:01:28,337 INFO L290 TraceCheckUtils]: 98: Hoare triple {20701#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (not (<= (* main_~v~0 2) main_~c~0)) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {20705#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (not (<= (* main_~b~0 main_~k~0) main_~c~0)) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 06:01:28,338 INFO L290 TraceCheckUtils]: 99: Hoare triple {20705#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (not (<= (* main_~b~0 main_~k~0) main_~c~0)) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {20705#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (not (<= (* main_~b~0 main_~k~0) main_~c~0)) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 06:01:28,338 INFO L290 TraceCheckUtils]: 100: Hoare triple {20705#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (not (<= (* main_~b~0 main_~k~0) main_~c~0)) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (<= main_~x~0 2) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {20712#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (not (<= (* main_~b~0 main_~k~0) main_~c~0)) (= main_~s~0 1) (<= 0 main_~x~0) (not (<= main_~b~0 main_~c~0)) (= main_~q~0 0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-08 06:01:28,341 INFO L290 TraceCheckUtils]: 101: Hoare triple {20712#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (not (<= (* main_~b~0 main_~k~0) main_~c~0)) (= main_~s~0 1) (<= 0 main_~x~0) (not (<= main_~b~0 main_~c~0)) (= main_~q~0 0) (<= main_~x~0 2) (= 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; {20716#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~p~0 0) (= main_~b~0 (+ main_~x~0 (* main_~a~0 main_~s~0))) (<= 0 main_~x~0) (= main_~r~0 1) (= (+ main_~q~0 (* main_~p~0 (* (- 1) main_~s~0))) 1) (not (<= 0 (+ main_~x~0 (* 2 (* main_~a~0 main_~s~0))))) (not (<= main_~a~0 (+ main_~x~0 (* main_~a~0 main_~s~0)))) (<= main_~x~0 2))} is VALID [2022-04-08 06:01:28,342 INFO L290 TraceCheckUtils]: 102: Hoare triple {20716#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~p~0 0) (= main_~b~0 (+ main_~x~0 (* main_~a~0 main_~s~0))) (<= 0 main_~x~0) (= main_~r~0 1) (= (+ main_~q~0 (* main_~p~0 (* (- 1) main_~s~0))) 1) (not (<= 0 (+ main_~x~0 (* 2 (* main_~a~0 main_~s~0))))) (not (<= main_~a~0 (+ main_~x~0 (* main_~a~0 main_~s~0)))) (<= main_~x~0 2))} assume !false; {20716#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~p~0 0) (= main_~b~0 (+ main_~x~0 (* main_~a~0 main_~s~0))) (<= 0 main_~x~0) (= main_~r~0 1) (= (+ main_~q~0 (* main_~p~0 (* (- 1) main_~s~0))) 1) (not (<= 0 (+ main_~x~0 (* 2 (* main_~a~0 main_~s~0))))) (not (<= main_~a~0 (+ main_~x~0 (* main_~a~0 main_~s~0)))) (<= main_~x~0 2))} is VALID [2022-04-08 06:01:28,342 INFO L290 TraceCheckUtils]: 103: Hoare triple {20716#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~p~0 0) (= main_~b~0 (+ main_~x~0 (* main_~a~0 main_~s~0))) (<= 0 main_~x~0) (= main_~r~0 1) (= (+ main_~q~0 (* main_~p~0 (* (- 1) main_~s~0))) 1) (not (<= 0 (+ main_~x~0 (* 2 (* main_~a~0 main_~s~0))))) (not (<= main_~a~0 (+ main_~x~0 (* main_~a~0 main_~s~0)))) (<= main_~x~0 2))} assume !(0 != ~b~0); {20723#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= (+ main_~x~0 (* main_~a~0 main_~s~0)) 0) (< (+ main_~x~0 (* 2 (* main_~a~0 main_~s~0))) 0) (= main_~p~0 0) (< (+ main_~x~0 (* main_~a~0 main_~s~0)) main_~a~0) (= main_~r~0 1) (= main_~q~0 (+ (* main_~p~0 main_~s~0) 1)) (<= main_~x~0 2))} is VALID [2022-04-08 06:01:28,345 INFO L272 TraceCheckUtils]: 104: Hoare triple {20723#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= (+ main_~x~0 (* main_~a~0 main_~s~0)) 0) (< (+ main_~x~0 (* 2 (* main_~a~0 main_~s~0))) 0) (= main_~p~0 0) (< (+ main_~x~0 (* main_~a~0 main_~s~0)) main_~a~0) (= main_~r~0 1) (= main_~q~0 (+ (* main_~p~0 main_~s~0) 1)) (<= main_~x~0 2))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {20727#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:01:28,346 INFO L290 TraceCheckUtils]: 105: Hoare triple {20727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:01:28,346 INFO L290 TraceCheckUtils]: 106: Hoare triple {20731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20397#false} is VALID [2022-04-08 06:01:28,346 INFO L290 TraceCheckUtils]: 107: Hoare triple {20397#false} assume !false; {20397#false} is VALID [2022-04-08 06:01:28,347 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 63 proven. 42 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2022-04-08 06:01:28,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:01:48,396 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 06:03:38,431 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 06:04:10,744 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 06:05:14,860 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 06:08:11,975 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 06:09:57,146 WARN L232 SmtUtils]: Spent 5.74s on a formula simplification. DAG size of input: 5 DAG size of output: 1 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-08 06:10:34,218 INFO L290 TraceCheckUtils]: 107: Hoare triple {20397#false} assume !false; {20397#false} is VALID [2022-04-08 06:10:34,218 INFO L290 TraceCheckUtils]: 106: Hoare triple {20731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20397#false} is VALID [2022-04-08 06:10:34,218 INFO L290 TraceCheckUtils]: 105: Hoare triple {20727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:10:34,219 INFO L272 TraceCheckUtils]: 104: Hoare triple {20747#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {20727#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:10:34,220 INFO L290 TraceCheckUtils]: 103: Hoare triple {20751#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !(0 != ~b~0); {20747#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 06:10:34,220 INFO L290 TraceCheckUtils]: 102: Hoare triple {20751#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !false; {20751#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-08 06:10:35,076 INFO L290 TraceCheckUtils]: 101: Hoare triple {20758#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {20751#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-08 06:10:35,077 INFO L290 TraceCheckUtils]: 100: Hoare triple {20762#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {20758#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 06:10:35,077 INFO L290 TraceCheckUtils]: 99: Hoare triple {20762#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {20762#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 06:10:35,463 INFO L290 TraceCheckUtils]: 98: Hoare triple {20769#(or (<= (+ main_~b~0 main_~v~0) main_~c~0) (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {20762#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 06:10:35,464 INFO L290 TraceCheckUtils]: 97: Hoare triple {20773#(or (<= (* main_~v~0 2) main_~c~0) (<= (+ main_~b~0 main_~v~0) main_~c~0) (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= 2 * ~v~0); {20769#(or (<= (+ main_~b~0 main_~v~0) main_~c~0) (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 06:10:37,470 WARN L284 TraceCheckUtils]: 96: Hoare quadruple {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #108#return; {20773#(or (<= (* main_~v~0 2) main_~c~0) (<= (+ main_~b~0 main_~v~0) main_~c~0) (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is UNKNOWN [2022-04-08 06:10:37,470 INFO L290 TraceCheckUtils]: 95: Hoare triple {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:10:37,474 INFO L290 TraceCheckUtils]: 94: Hoare triple {20787#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:10:37,478 INFO L290 TraceCheckUtils]: 93: Hoare triple {20396#true} ~cond := #in~cond; {20787#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 06:10:37,478 INFO L272 TraceCheckUtils]: 92: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {20396#true} is VALID [2022-04-08 06:10:37,479 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {20396#true} {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #106#return; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 06:10:37,479 INFO L290 TraceCheckUtils]: 90: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-08 06:10:37,479 INFO L290 TraceCheckUtils]: 89: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-08 06:10:37,479 INFO L290 TraceCheckUtils]: 88: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-08 06:10:37,479 INFO L272 TraceCheckUtils]: 87: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20396#true} is VALID [2022-04-08 06:10:37,480 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {20396#true} {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 06:10:37,480 INFO L290 TraceCheckUtils]: 85: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-08 06:10:37,480 INFO L290 TraceCheckUtils]: 84: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-08 06:10:37,480 INFO L290 TraceCheckUtils]: 83: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-08 06:10:37,481 INFO L272 TraceCheckUtils]: 82: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20396#true} is VALID [2022-04-08 06:10:37,481 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {20396#true} {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #102#return; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 06:10:37,482 INFO L290 TraceCheckUtils]: 80: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-08 06:10:37,482 INFO L290 TraceCheckUtils]: 79: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-08 06:10:37,482 INFO L290 TraceCheckUtils]: 78: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-08 06:10:37,482 INFO L272 TraceCheckUtils]: 77: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20396#true} is VALID [2022-04-08 06:10:37,483 INFO L290 TraceCheckUtils]: 76: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 06:10:37,484 INFO L290 TraceCheckUtils]: 75: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 06:10:37,485 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {20396#true} {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #108#return; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 06:10:37,485 INFO L290 TraceCheckUtils]: 73: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-08 06:10:37,485 INFO L290 TraceCheckUtils]: 72: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-08 06:10:37,485 INFO L290 TraceCheckUtils]: 71: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-08 06:10:37,485 INFO L272 TraceCheckUtils]: 70: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {20396#true} is VALID [2022-04-08 06:10:37,486 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {20396#true} {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #106#return; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 06:10:37,486 INFO L290 TraceCheckUtils]: 68: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-08 06:10:37,486 INFO L290 TraceCheckUtils]: 67: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-08 06:10:37,487 INFO L290 TraceCheckUtils]: 66: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-08 06:10:37,487 INFO L272 TraceCheckUtils]: 65: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20396#true} is VALID [2022-04-08 06:10:37,488 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {20396#true} {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 06:10:37,488 INFO L290 TraceCheckUtils]: 63: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-08 06:10:37,488 INFO L290 TraceCheckUtils]: 62: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-08 06:10:37,488 INFO L290 TraceCheckUtils]: 61: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-08 06:10:37,488 INFO L272 TraceCheckUtils]: 60: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20396#true} is VALID [2022-04-08 06:10:37,489 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {20396#true} {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #102#return; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 06:10:37,489 INFO L290 TraceCheckUtils]: 58: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-08 06:10:37,489 INFO L290 TraceCheckUtils]: 57: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-08 06:10:37,489 INFO L290 TraceCheckUtils]: 56: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-08 06:10:37,490 INFO L272 TraceCheckUtils]: 55: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20396#true} is VALID [2022-04-08 06:10:37,490 INFO L290 TraceCheckUtils]: 54: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 06:10:37,491 INFO L290 TraceCheckUtils]: 53: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 06:10:37,492 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {20396#true} {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #108#return; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 06:10:37,492 INFO L290 TraceCheckUtils]: 51: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-08 06:10:37,492 INFO L290 TraceCheckUtils]: 50: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-08 06:10:37,492 INFO L290 TraceCheckUtils]: 49: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-08 06:10:37,493 INFO L272 TraceCheckUtils]: 48: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {20396#true} is VALID [2022-04-08 06:10:37,507 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20396#true} {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #106#return; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 06:10:37,507 INFO L290 TraceCheckUtils]: 46: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-08 06:10:37,507 INFO L290 TraceCheckUtils]: 45: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-08 06:10:37,507 INFO L290 TraceCheckUtils]: 44: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-08 06:10:37,508 INFO L272 TraceCheckUtils]: 43: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20396#true} is VALID [2022-04-08 06:10:37,513 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 06:10:37,513 INFO L290 TraceCheckUtils]: 41: Hoare triple {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:10:37,514 INFO L290 TraceCheckUtils]: 40: Hoare triple {20787#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:10:37,514 INFO L290 TraceCheckUtils]: 39: Hoare triple {20396#true} ~cond := #in~cond; {20787#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 06:10:37,514 INFO L272 TraceCheckUtils]: 38: Hoare triple {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20396#true} is VALID [2022-04-08 06:10:37,515 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {20396#true} {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #102#return; {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 06:10:37,515 INFO L290 TraceCheckUtils]: 36: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-08 06:10:37,516 INFO L290 TraceCheckUtils]: 35: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-08 06:10:37,516 INFO L290 TraceCheckUtils]: 34: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-08 06:10:37,516 INFO L272 TraceCheckUtils]: 33: Hoare triple {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20396#true} is VALID [2022-04-08 06:10:37,516 INFO L290 TraceCheckUtils]: 32: Hoare triple {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 06:10:37,517 INFO L290 TraceCheckUtils]: 31: Hoare triple {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 06:10:37,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 06:10:37,519 INFO L290 TraceCheckUtils]: 29: Hoare triple {20981#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 0) (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~y~0 main_~s~0 0) (* main_~y~0 main_~s~0) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0)))) (<= main_~a~0 0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 06:10:37,519 INFO L290 TraceCheckUtils]: 28: Hoare triple {20981#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 0) (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~y~0 main_~s~0 0) (* main_~y~0 main_~s~0) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0)))) (<= main_~a~0 0))} assume !false; {20981#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 0) (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~y~0 main_~s~0 0) (* main_~y~0 main_~s~0) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0)))) (<= main_~a~0 0))} is VALID [2022-04-08 06:10:37,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {20396#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {20981#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 0) (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~y~0 main_~s~0 0) (* main_~y~0 main_~s~0) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0)))) (<= main_~a~0 0))} is VALID [2022-04-08 06:10:37,521 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20396#true} {20396#true} #100#return; {20396#true} is VALID [2022-04-08 06:10:37,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-08 06:10:37,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-08 06:10:37,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-08 06:10:37,522 INFO L272 TraceCheckUtils]: 22: Hoare triple {20396#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {20396#true} is VALID [2022-04-08 06:10:37,522 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {20396#true} {20396#true} #98#return; {20396#true} is VALID [2022-04-08 06:10:37,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-08 06:10:37,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-08 06:10:37,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-08 06:10:37,522 INFO L272 TraceCheckUtils]: 17: Hoare triple {20396#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {20396#true} is VALID [2022-04-08 06:10:37,522 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20396#true} {20396#true} #96#return; {20396#true} is VALID [2022-04-08 06:10:37,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-08 06:10:37,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-08 06:10:37,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-08 06:10:37,522 INFO L272 TraceCheckUtils]: 12: Hoare triple {20396#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {20396#true} is VALID [2022-04-08 06:10:37,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {20396#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {20396#true} is VALID [2022-04-08 06:10:37,523 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20396#true} {20396#true} #94#return; {20396#true} is VALID [2022-04-08 06:10:37,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-08 06:10:37,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-08 06:10:37,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-08 06:10:37,523 INFO L272 TraceCheckUtils]: 6: Hoare triple {20396#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {20396#true} is VALID [2022-04-08 06:10:37,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {20396#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {20396#true} is VALID [2022-04-08 06:10:37,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {20396#true} call #t~ret6 := main(); {20396#true} is VALID [2022-04-08 06:10:37,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20396#true} {20396#true} #112#return; {20396#true} is VALID [2022-04-08 06:10:37,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-08 06:10:37,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {20396#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); {20396#true} is VALID [2022-04-08 06:10:37,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {20396#true} call ULTIMATE.init(); {20396#true} is VALID [2022-04-08 06:10:37,524 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 61 proven. 35 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-04-08 06:10:37,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:10:37,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596599202] [2022-04-08 06:10:37,525 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:10:37,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687337719] [2022-04-08 06:10:37,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687337719] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:10:37,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:10:37,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 28 [2022-04-08 06:10:37,525 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:10:37,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [161570787] [2022-04-08 06:10:37,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [161570787] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:10:37,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:10:37,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 06:10:37,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601087791] [2022-04-08 06:10:37,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:10:37,527 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 108 [2022-04-08 06:10:37,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:10:37,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 06:10:37,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:10:37,625 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 06:10:37,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:10:37,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 06:10:37,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2022-04-08 06:10:37,626 INFO L87 Difference]: Start difference. First operand 258 states and 358 transitions. Second operand has 18 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 06:10:42,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:10:42,989 INFO L93 Difference]: Finished difference Result 330 states and 459 transitions. [2022-04-08 06:10:42,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 06:10:42,990 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 108 [2022-04-08 06:10:42,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:10:42,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 06:10:42,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 128 transitions. [2022-04-08 06:10:42,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 06:10:42,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 128 transitions. [2022-04-08 06:10:42,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 128 transitions. [2022-04-08 06:10:43,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:10:43,200 INFO L225 Difference]: With dead ends: 330 [2022-04-08 06:10:43,200 INFO L226 Difference]: Without dead ends: 327 [2022-04-08 06:10:43,201 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=231, Invalid=1175, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 06:10:43,201 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 70 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-08 06:10:43,201 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 256 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-08 06:10:43,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-04-08 06:10:44,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 317. [2022-04-08 06:10:44,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:10:44,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 327 states. Second operand has 317 states, 176 states have (on average 1.1875) internal successors, (209), 177 states have internal predecessors, (209), 119 states have call successors, (119), 22 states have call predecessors, (119), 21 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2022-04-08 06:10:44,652 INFO L74 IsIncluded]: Start isIncluded. First operand 327 states. Second operand has 317 states, 176 states have (on average 1.1875) internal successors, (209), 177 states have internal predecessors, (209), 119 states have call successors, (119), 22 states have call predecessors, (119), 21 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2022-04-08 06:10:44,653 INFO L87 Difference]: Start difference. First operand 327 states. Second operand has 317 states, 176 states have (on average 1.1875) internal successors, (209), 177 states have internal predecessors, (209), 119 states have call successors, (119), 22 states have call predecessors, (119), 21 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2022-04-08 06:10:44,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:10:44,665 INFO L93 Difference]: Finished difference Result 327 states and 455 transitions. [2022-04-08 06:10:44,665 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 455 transitions. [2022-04-08 06:10:44,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:10:44,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:10:44,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 317 states, 176 states have (on average 1.1875) internal successors, (209), 177 states have internal predecessors, (209), 119 states have call successors, (119), 22 states have call predecessors, (119), 21 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) Second operand 327 states. [2022-04-08 06:10:44,668 INFO L87 Difference]: Start difference. First operand has 317 states, 176 states have (on average 1.1875) internal successors, (209), 177 states have internal predecessors, (209), 119 states have call successors, (119), 22 states have call predecessors, (119), 21 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) Second operand 327 states. [2022-04-08 06:10:44,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:10:44,680 INFO L93 Difference]: Finished difference Result 327 states and 455 transitions. [2022-04-08 06:10:44,680 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 455 transitions. [2022-04-08 06:10:44,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:10:44,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:10:44,681 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:10:44,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:10:44,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 176 states have (on average 1.1875) internal successors, (209), 177 states have internal predecessors, (209), 119 states have call successors, (119), 22 states have call predecessors, (119), 21 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2022-04-08 06:10:44,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 445 transitions. [2022-04-08 06:10:44,695 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 445 transitions. Word has length 108 [2022-04-08 06:10:44,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:10:44,695 INFO L478 AbstractCegarLoop]: Abstraction has 317 states and 445 transitions. [2022-04-08 06:10:44,696 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 06:10:44,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 317 states and 445 transitions. [2022-04-08 06:10:45,891 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 06:10:45,892 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 445 transitions. [2022-04-08 06:10:45,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-08 06:10:45,893 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:10:45,893 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 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, 1, 1, 1, 1] [2022-04-08 06:10:45,916 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 06:10:46,093 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 06:10:46,094 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:10:46,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:10:46,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1002671399, now seen corresponding path program 7 times [2022-04-08 06:10:46,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:10:46,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [933827126] [2022-04-08 06:10:46,095 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:10:46,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1002671399, now seen corresponding path program 8 times [2022-04-08 06:10:46,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:10:46,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845788345] [2022-04-08 06:10:46,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:10:46,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:10:46,119 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:10:46,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1123979640] [2022-04-08 06:10:46,119 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:10:46,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:10:46,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:10:46,120 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 06:10:46,122 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 06:10:46,195 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:10:46,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:10:46,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 06:10:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:10:46,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:10:47,141 INFO L272 TraceCheckUtils]: 0: Hoare triple {23039#true} call ULTIMATE.init(); {23039#true} is VALID [2022-04-08 06:10:47,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {23039#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); {23039#true} is VALID [2022-04-08 06:10:47,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-08 06:10:47,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23039#true} {23039#true} #112#return; {23039#true} is VALID [2022-04-08 06:10:47,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {23039#true} call #t~ret6 := main(); {23039#true} is VALID [2022-04-08 06:10:47,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {23039#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {23039#true} is VALID [2022-04-08 06:10:47,141 INFO L272 TraceCheckUtils]: 6: Hoare triple {23039#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {23039#true} is VALID [2022-04-08 06:10:47,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {23039#true} ~cond := #in~cond; {23065#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 06:10:47,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {23065#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {23069#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:10:47,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {23069#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {23069#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:10:47,143 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23069#(not (= |assume_abort_if_not_#in~cond| 0))} {23039#true} #94#return; {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 06:10:47,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 06:10:47,144 INFO L272 TraceCheckUtils]: 12: Hoare triple {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {23039#true} is VALID [2022-04-08 06:10:47,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-08 06:10:47,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-08 06:10:47,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-08 06:10:47,144 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {23039#true} {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #96#return; {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 06:10:47,144 INFO L272 TraceCheckUtils]: 17: Hoare triple {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {23039#true} is VALID [2022-04-08 06:10:47,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-08 06:10:47,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-08 06:10:47,144 INFO L290 TraceCheckUtils]: 20: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-08 06:10:47,145 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {23039#true} {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #98#return; {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 06:10:47,145 INFO L272 TraceCheckUtils]: 22: Hoare triple {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {23039#true} is VALID [2022-04-08 06:10:47,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-08 06:10:47,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-08 06:10:47,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-08 06:10:47,146 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {23039#true} {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #100#return; {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 06:10:47,146 INFO L290 TraceCheckUtils]: 27: Hoare triple {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {23128#(<= main_~a~0 2)} is VALID [2022-04-08 06:10:47,146 INFO L290 TraceCheckUtils]: 28: Hoare triple {23128#(<= main_~a~0 2)} assume !false; {23128#(<= main_~a~0 2)} is VALID [2022-04-08 06:10:47,147 INFO L290 TraceCheckUtils]: 29: Hoare triple {23128#(<= main_~a~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {23135#(<= main_~c~0 2)} is VALID [2022-04-08 06:10:47,147 INFO L290 TraceCheckUtils]: 30: Hoare triple {23135#(<= main_~c~0 2)} assume !false; {23135#(<= main_~c~0 2)} is VALID [2022-04-08 06:10:47,147 INFO L290 TraceCheckUtils]: 31: Hoare triple {23135#(<= main_~c~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-08 06:10:47,148 INFO L290 TraceCheckUtils]: 32: Hoare triple {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} assume !false; {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-08 06:10:47,148 INFO L272 TraceCheckUtils]: 33: Hoare triple {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23039#true} is VALID [2022-04-08 06:10:47,148 INFO L290 TraceCheckUtils]: 34: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-08 06:10:47,148 INFO L290 TraceCheckUtils]: 35: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-08 06:10:47,148 INFO L290 TraceCheckUtils]: 36: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-08 06:10:47,148 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {23039#true} {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} #102#return; {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-08 06:10:47,149 INFO L272 TraceCheckUtils]: 38: Hoare triple {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23039#true} is VALID [2022-04-08 06:10:47,149 INFO L290 TraceCheckUtils]: 39: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-08 06:10:47,149 INFO L290 TraceCheckUtils]: 40: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-08 06:10:47,149 INFO L290 TraceCheckUtils]: 41: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-08 06:10:47,149 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {23039#true} {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} #104#return; {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-08 06:10:47,149 INFO L272 TraceCheckUtils]: 43: Hoare triple {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23039#true} is VALID [2022-04-08 06:10:47,149 INFO L290 TraceCheckUtils]: 44: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-08 06:10:47,150 INFO L290 TraceCheckUtils]: 45: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-08 06:10:47,150 INFO L290 TraceCheckUtils]: 46: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-08 06:10:47,150 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23039#true} {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} #106#return; {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-08 06:10:47,150 INFO L272 TraceCheckUtils]: 48: Hoare triple {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {23039#true} is VALID [2022-04-08 06:10:47,150 INFO L290 TraceCheckUtils]: 49: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-08 06:10:47,150 INFO L290 TraceCheckUtils]: 50: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-08 06:10:47,150 INFO L290 TraceCheckUtils]: 51: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-08 06:10:47,151 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {23039#true} {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} #108#return; {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-08 06:10:47,152 INFO L290 TraceCheckUtils]: 53: Hoare triple {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-08 06:10:47,152 INFO L290 TraceCheckUtils]: 54: Hoare triple {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} assume !false; {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-08 06:10:47,152 INFO L272 TraceCheckUtils]: 55: Hoare triple {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23039#true} is VALID [2022-04-08 06:10:47,152 INFO L290 TraceCheckUtils]: 56: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-08 06:10:47,152 INFO L290 TraceCheckUtils]: 57: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-08 06:10:47,152 INFO L290 TraceCheckUtils]: 58: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-08 06:10:47,153 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {23039#true} {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #102#return; {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-08 06:10:47,153 INFO L272 TraceCheckUtils]: 60: Hoare triple {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23039#true} is VALID [2022-04-08 06:10:47,153 INFO L290 TraceCheckUtils]: 61: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-08 06:10:47,153 INFO L290 TraceCheckUtils]: 62: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-08 06:10:47,153 INFO L290 TraceCheckUtils]: 63: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-08 06:10:47,154 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {23039#true} {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #104#return; {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-08 06:10:47,154 INFO L272 TraceCheckUtils]: 65: Hoare triple {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23039#true} is VALID [2022-04-08 06:10:47,154 INFO L290 TraceCheckUtils]: 66: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-08 06:10:47,154 INFO L290 TraceCheckUtils]: 67: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-08 06:10:47,154 INFO L290 TraceCheckUtils]: 68: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-08 06:10:47,155 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {23039#true} {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #106#return; {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-08 06:10:47,155 INFO L272 TraceCheckUtils]: 70: Hoare triple {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {23039#true} is VALID [2022-04-08 06:10:47,155 INFO L290 TraceCheckUtils]: 71: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-08 06:10:47,155 INFO L290 TraceCheckUtils]: 72: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-08 06:10:47,155 INFO L290 TraceCheckUtils]: 73: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-08 06:10:47,155 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {23039#true} {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #108#return; {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-08 06:10:47,156 INFO L290 TraceCheckUtils]: 75: Hoare triple {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} assume !(~c~0 >= 2 * ~v~0); {23276#(and (<= main_~c~0 2) (not (<= (* main_~v~0 2) main_~c~0)) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-08 06:10:47,157 INFO L290 TraceCheckUtils]: 76: Hoare triple {23276#(and (<= main_~c~0 2) (not (<= (* main_~v~0 2) main_~c~0)) (<= (div (- main_~v~0) (- 2)) main_~b~0))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {23280#(and (< (* main_~c~0 2) 2) (< (div (+ (- 1) (* (- 1) main_~c~0)) (- 2)) (+ main_~b~0 1)))} is VALID [2022-04-08 06:10:47,158 INFO L290 TraceCheckUtils]: 77: Hoare triple {23280#(and (< (* main_~c~0 2) 2) (< (div (+ (- 1) (* (- 1) main_~c~0)) (- 2)) (+ main_~b~0 1)))} assume !false; {23280#(and (< (* main_~c~0 2) 2) (< (div (+ (- 1) (* (- 1) main_~c~0)) (- 2)) (+ main_~b~0 1)))} is VALID [2022-04-08 06:10:47,159 INFO L290 TraceCheckUtils]: 78: Hoare triple {23280#(and (< (* main_~c~0 2) 2) (< (div (+ (- 1) (* (- 1) main_~c~0)) (- 2)) (+ main_~b~0 1)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {23040#false} is VALID [2022-04-08 06:10:47,160 INFO L290 TraceCheckUtils]: 79: Hoare triple {23040#false} assume !false; {23040#false} is VALID [2022-04-08 06:10:47,160 INFO L272 TraceCheckUtils]: 80: Hoare triple {23040#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23040#false} is VALID [2022-04-08 06:10:47,160 INFO L290 TraceCheckUtils]: 81: Hoare triple {23040#false} ~cond := #in~cond; {23040#false} is VALID [2022-04-08 06:10:47,160 INFO L290 TraceCheckUtils]: 82: Hoare triple {23040#false} assume !(0 == ~cond); {23040#false} is VALID [2022-04-08 06:10:47,160 INFO L290 TraceCheckUtils]: 83: Hoare triple {23040#false} assume true; {23040#false} is VALID [2022-04-08 06:10:47,160 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {23040#false} {23040#false} #102#return; {23040#false} is VALID [2022-04-08 06:10:47,160 INFO L272 TraceCheckUtils]: 85: Hoare triple {23040#false} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23040#false} is VALID [2022-04-08 06:10:47,160 INFO L290 TraceCheckUtils]: 86: Hoare triple {23040#false} ~cond := #in~cond; {23040#false} is VALID [2022-04-08 06:10:47,160 INFO L290 TraceCheckUtils]: 87: Hoare triple {23040#false} assume !(0 == ~cond); {23040#false} is VALID [2022-04-08 06:10:47,160 INFO L290 TraceCheckUtils]: 88: Hoare triple {23040#false} assume true; {23040#false} is VALID [2022-04-08 06:10:47,160 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {23040#false} {23040#false} #104#return; {23040#false} is VALID [2022-04-08 06:10:47,160 INFO L272 TraceCheckUtils]: 90: Hoare triple {23040#false} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23040#false} is VALID [2022-04-08 06:10:47,160 INFO L290 TraceCheckUtils]: 91: Hoare triple {23040#false} ~cond := #in~cond; {23040#false} is VALID [2022-04-08 06:10:47,160 INFO L290 TraceCheckUtils]: 92: Hoare triple {23040#false} assume !(0 == ~cond); {23040#false} is VALID [2022-04-08 06:10:47,161 INFO L290 TraceCheckUtils]: 93: Hoare triple {23040#false} assume true; {23040#false} is VALID [2022-04-08 06:10:47,161 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {23040#false} {23040#false} #106#return; {23040#false} is VALID [2022-04-08 06:10:47,161 INFO L272 TraceCheckUtils]: 95: Hoare triple {23040#false} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {23040#false} is VALID [2022-04-08 06:10:47,161 INFO L290 TraceCheckUtils]: 96: Hoare triple {23040#false} ~cond := #in~cond; {23040#false} is VALID [2022-04-08 06:10:47,161 INFO L290 TraceCheckUtils]: 97: Hoare triple {23040#false} assume !(0 == ~cond); {23040#false} is VALID [2022-04-08 06:10:47,161 INFO L290 TraceCheckUtils]: 98: Hoare triple {23040#false} assume true; {23040#false} is VALID [2022-04-08 06:10:47,161 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {23040#false} {23040#false} #108#return; {23040#false} is VALID [2022-04-08 06:10:47,161 INFO L290 TraceCheckUtils]: 100: Hoare triple {23040#false} assume !(~c~0 >= 2 * ~v~0); {23040#false} is VALID [2022-04-08 06:10:47,161 INFO L290 TraceCheckUtils]: 101: Hoare triple {23040#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {23040#false} is VALID [2022-04-08 06:10:47,161 INFO L290 TraceCheckUtils]: 102: Hoare triple {23040#false} assume !false; {23040#false} is VALID [2022-04-08 06:10:47,161 INFO L290 TraceCheckUtils]: 103: Hoare triple {23040#false} assume !(~c~0 >= ~b~0); {23040#false} is VALID [2022-04-08 06:10:47,161 INFO L290 TraceCheckUtils]: 104: Hoare triple {23040#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; {23040#false} is VALID [2022-04-08 06:10:47,161 INFO L290 TraceCheckUtils]: 105: Hoare triple {23040#false} assume !false; {23040#false} is VALID [2022-04-08 06:10:47,161 INFO L290 TraceCheckUtils]: 106: Hoare triple {23040#false} assume !(0 != ~b~0); {23040#false} is VALID [2022-04-08 06:10:47,161 INFO L272 TraceCheckUtils]: 107: Hoare triple {23040#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {23040#false} is VALID [2022-04-08 06:10:47,162 INFO L290 TraceCheckUtils]: 108: Hoare triple {23040#false} ~cond := #in~cond; {23040#false} is VALID [2022-04-08 06:10:47,162 INFO L290 TraceCheckUtils]: 109: Hoare triple {23040#false} assume 0 == ~cond; {23040#false} is VALID [2022-04-08 06:10:47,162 INFO L290 TraceCheckUtils]: 110: Hoare triple {23040#false} assume !false; {23040#false} is VALID [2022-04-08 06:10:47,162 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 165 proven. 15 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2022-04-08 06:10:47,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:10:47,918 INFO L290 TraceCheckUtils]: 110: Hoare triple {23040#false} assume !false; {23040#false} is VALID [2022-04-08 06:10:47,918 INFO L290 TraceCheckUtils]: 109: Hoare triple {23040#false} assume 0 == ~cond; {23040#false} is VALID [2022-04-08 06:10:47,919 INFO L290 TraceCheckUtils]: 108: Hoare triple {23040#false} ~cond := #in~cond; {23040#false} is VALID [2022-04-08 06:10:47,919 INFO L272 TraceCheckUtils]: 107: Hoare triple {23040#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {23040#false} is VALID [2022-04-08 06:10:47,919 INFO L290 TraceCheckUtils]: 106: Hoare triple {23040#false} assume !(0 != ~b~0); {23040#false} is VALID [2022-04-08 06:10:47,919 INFO L290 TraceCheckUtils]: 105: Hoare triple {23040#false} assume !false; {23040#false} is VALID [2022-04-08 06:10:47,919 INFO L290 TraceCheckUtils]: 104: Hoare triple {23040#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; {23040#false} is VALID [2022-04-08 06:10:47,919 INFO L290 TraceCheckUtils]: 103: Hoare triple {23040#false} assume !(~c~0 >= ~b~0); {23040#false} is VALID [2022-04-08 06:10:47,919 INFO L290 TraceCheckUtils]: 102: Hoare triple {23040#false} assume !false; {23040#false} is VALID [2022-04-08 06:10:47,919 INFO L290 TraceCheckUtils]: 101: Hoare triple {23040#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {23040#false} is VALID [2022-04-08 06:10:47,919 INFO L290 TraceCheckUtils]: 100: Hoare triple {23040#false} assume !(~c~0 >= 2 * ~v~0); {23040#false} is VALID [2022-04-08 06:10:47,919 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {23039#true} {23040#false} #108#return; {23040#false} is VALID [2022-04-08 06:10:47,920 INFO L290 TraceCheckUtils]: 98: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-08 06:10:47,920 INFO L290 TraceCheckUtils]: 97: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-08 06:10:47,920 INFO L290 TraceCheckUtils]: 96: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-08 06:10:47,920 INFO L272 TraceCheckUtils]: 95: Hoare triple {23040#false} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {23039#true} is VALID [2022-04-08 06:10:47,920 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {23039#true} {23040#false} #106#return; {23040#false} is VALID [2022-04-08 06:10:47,920 INFO L290 TraceCheckUtils]: 93: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-08 06:10:47,920 INFO L290 TraceCheckUtils]: 92: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-08 06:10:47,920 INFO L290 TraceCheckUtils]: 91: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-08 06:10:47,920 INFO L272 TraceCheckUtils]: 90: Hoare triple {23040#false} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23039#true} is VALID [2022-04-08 06:10:47,920 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {23039#true} {23040#false} #104#return; {23040#false} is VALID [2022-04-08 06:10:47,921 INFO L290 TraceCheckUtils]: 88: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-08 06:10:47,921 INFO L290 TraceCheckUtils]: 87: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-08 06:10:47,921 INFO L290 TraceCheckUtils]: 86: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-08 06:10:47,921 INFO L272 TraceCheckUtils]: 85: Hoare triple {23040#false} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23039#true} is VALID [2022-04-08 06:10:47,921 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {23039#true} {23040#false} #102#return; {23040#false} is VALID [2022-04-08 06:10:47,921 INFO L290 TraceCheckUtils]: 83: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-08 06:10:47,921 INFO L290 TraceCheckUtils]: 82: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-08 06:10:47,921 INFO L290 TraceCheckUtils]: 81: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-08 06:10:47,921 INFO L272 TraceCheckUtils]: 80: Hoare triple {23040#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23039#true} is VALID [2022-04-08 06:10:47,921 INFO L290 TraceCheckUtils]: 79: Hoare triple {23040#false} assume !false; {23040#false} is VALID [2022-04-08 06:10:47,922 INFO L290 TraceCheckUtils]: 78: Hoare triple {23479#(not (<= main_~b~0 main_~c~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {23040#false} is VALID [2022-04-08 06:10:47,922 INFO L290 TraceCheckUtils]: 77: Hoare triple {23479#(not (<= main_~b~0 main_~c~0))} assume !false; {23479#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-08 06:10:47,923 INFO L290 TraceCheckUtils]: 76: Hoare triple {23486#(< main_~c~0 (+ main_~b~0 main_~v~0))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {23479#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-08 06:10:47,924 INFO L290 TraceCheckUtils]: 75: Hoare triple {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} assume !(~c~0 >= 2 * ~v~0); {23486#(< main_~c~0 (+ main_~b~0 main_~v~0))} is VALID [2022-04-08 06:10:47,924 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {23039#true} {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} #108#return; {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-08 06:10:47,925 INFO L290 TraceCheckUtils]: 73: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-08 06:10:47,925 INFO L290 TraceCheckUtils]: 72: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-08 06:10:47,925 INFO L290 TraceCheckUtils]: 71: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-08 06:10:47,925 INFO L272 TraceCheckUtils]: 70: Hoare triple {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {23039#true} is VALID [2022-04-08 06:10:47,926 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {23039#true} {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} #106#return; {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-08 06:10:47,926 INFO L290 TraceCheckUtils]: 68: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-08 06:10:47,926 INFO L290 TraceCheckUtils]: 67: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-08 06:10:47,926 INFO L290 TraceCheckUtils]: 66: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-08 06:10:47,926 INFO L272 TraceCheckUtils]: 65: Hoare triple {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23039#true} is VALID [2022-04-08 06:10:47,927 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {23039#true} {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} #104#return; {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-08 06:10:47,927 INFO L290 TraceCheckUtils]: 63: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-08 06:10:47,927 INFO L290 TraceCheckUtils]: 62: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-08 06:10:47,927 INFO L290 TraceCheckUtils]: 61: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-08 06:10:47,927 INFO L272 TraceCheckUtils]: 60: Hoare triple {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23039#true} is VALID [2022-04-08 06:10:47,928 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {23039#true} {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} #102#return; {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-08 06:10:47,928 INFO L290 TraceCheckUtils]: 58: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-08 06:10:47,928 INFO L290 TraceCheckUtils]: 57: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-08 06:10:47,928 INFO L290 TraceCheckUtils]: 56: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-08 06:10:47,928 INFO L272 TraceCheckUtils]: 55: Hoare triple {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23039#true} is VALID [2022-04-08 06:10:47,929 INFO L290 TraceCheckUtils]: 54: Hoare triple {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} assume !false; {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-08 06:10:47,930 INFO L290 TraceCheckUtils]: 53: Hoare triple {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-08 06:10:47,931 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {23039#true} {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #108#return; {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-08 06:10:47,931 INFO L290 TraceCheckUtils]: 51: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-08 06:10:47,931 INFO L290 TraceCheckUtils]: 50: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-08 06:10:47,931 INFO L290 TraceCheckUtils]: 49: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-08 06:10:47,931 INFO L272 TraceCheckUtils]: 48: Hoare triple {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {23039#true} is VALID [2022-04-08 06:10:47,932 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23039#true} {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #106#return; {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-08 06:10:47,932 INFO L290 TraceCheckUtils]: 46: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-08 06:10:47,932 INFO L290 TraceCheckUtils]: 45: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-08 06:10:47,932 INFO L290 TraceCheckUtils]: 44: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-08 06:10:47,932 INFO L272 TraceCheckUtils]: 43: Hoare triple {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23039#true} is VALID [2022-04-08 06:10:47,933 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {23039#true} {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #104#return; {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-08 06:10:47,933 INFO L290 TraceCheckUtils]: 41: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-08 06:10:47,933 INFO L290 TraceCheckUtils]: 40: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-08 06:10:47,933 INFO L290 TraceCheckUtils]: 39: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-08 06:10:47,933 INFO L272 TraceCheckUtils]: 38: Hoare triple {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23039#true} is VALID [2022-04-08 06:10:47,934 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {23039#true} {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #102#return; {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-08 06:10:47,934 INFO L290 TraceCheckUtils]: 36: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-08 06:10:47,934 INFO L290 TraceCheckUtils]: 35: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-08 06:10:47,935 INFO L290 TraceCheckUtils]: 34: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-08 06:10:47,935 INFO L272 TraceCheckUtils]: 33: Hoare triple {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23039#true} is VALID [2022-04-08 06:10:47,935 INFO L290 TraceCheckUtils]: 32: Hoare triple {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} assume !false; {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-08 06:10:47,936 INFO L290 TraceCheckUtils]: 31: Hoare triple {23624#(<= main_~c~0 (+ (div main_~c~0 2) (div (div main_~c~0 2) 2) 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-08 06:10:47,936 INFO L290 TraceCheckUtils]: 30: Hoare triple {23624#(<= main_~c~0 (+ (div main_~c~0 2) (div (div main_~c~0 2) 2) 1))} assume !false; {23624#(<= main_~c~0 (+ (div main_~c~0 2) (div (div main_~c~0 2) 2) 1))} is VALID [2022-04-08 06:10:47,937 INFO L290 TraceCheckUtils]: 29: Hoare triple {23128#(<= main_~a~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {23624#(<= main_~c~0 (+ (div main_~c~0 2) (div (div main_~c~0 2) 2) 1))} is VALID [2022-04-08 06:10:47,937 INFO L290 TraceCheckUtils]: 28: Hoare triple {23128#(<= main_~a~0 2)} assume !false; {23128#(<= main_~a~0 2)} is VALID [2022-04-08 06:10:47,938 INFO L290 TraceCheckUtils]: 27: Hoare triple {23637#(<= main_~x~0 2)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {23128#(<= main_~a~0 2)} is VALID [2022-04-08 06:10:47,938 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {23039#true} {23637#(<= main_~x~0 2)} #100#return; {23637#(<= main_~x~0 2)} is VALID [2022-04-08 06:10:47,939 INFO L290 TraceCheckUtils]: 25: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-08 06:10:47,939 INFO L290 TraceCheckUtils]: 24: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-08 06:10:47,939 INFO L290 TraceCheckUtils]: 23: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-08 06:10:47,939 INFO L272 TraceCheckUtils]: 22: Hoare triple {23637#(<= main_~x~0 2)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {23039#true} is VALID [2022-04-08 06:10:47,939 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {23039#true} {23637#(<= main_~x~0 2)} #98#return; {23637#(<= main_~x~0 2)} is VALID [2022-04-08 06:10:47,939 INFO L290 TraceCheckUtils]: 20: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-08 06:10:47,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-08 06:10:47,940 INFO L290 TraceCheckUtils]: 18: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-08 06:10:47,940 INFO L272 TraceCheckUtils]: 17: Hoare triple {23637#(<= main_~x~0 2)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {23039#true} is VALID [2022-04-08 06:10:47,940 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {23039#true} {23637#(<= main_~x~0 2)} #96#return; {23637#(<= main_~x~0 2)} is VALID [2022-04-08 06:10:47,940 INFO L290 TraceCheckUtils]: 15: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-08 06:10:47,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-08 06:10:47,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-08 06:10:47,941 INFO L272 TraceCheckUtils]: 12: Hoare triple {23637#(<= main_~x~0 2)} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {23039#true} is VALID [2022-04-08 06:10:47,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {23637#(<= main_~x~0 2)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {23637#(<= main_~x~0 2)} is VALID [2022-04-08 06:10:47,942 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23069#(not (= |assume_abort_if_not_#in~cond| 0))} {23039#true} #94#return; {23637#(<= main_~x~0 2)} is VALID [2022-04-08 06:10:47,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {23069#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {23069#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:10:47,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {23698#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {23069#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:10:47,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {23039#true} ~cond := #in~cond; {23698#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-08 06:10:47,943 INFO L272 TraceCheckUtils]: 6: Hoare triple {23039#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {23039#true} is VALID [2022-04-08 06:10:47,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {23039#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {23039#true} is VALID [2022-04-08 06:10:47,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {23039#true} call #t~ret6 := main(); {23039#true} is VALID [2022-04-08 06:10:47,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23039#true} {23039#true} #112#return; {23039#true} is VALID [2022-04-08 06:10:47,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-08 06:10:47,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {23039#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); {23039#true} is VALID [2022-04-08 06:10:47,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {23039#true} call ULTIMATE.init(); {23039#true} is VALID [2022-04-08 06:10:47,944 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 43 proven. 17 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2022-04-08 06:10:47,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:10:47,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845788345] [2022-04-08 06:10:47,944 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:10:47,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123979640] [2022-04-08 06:10:47,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123979640] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:10:47,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:10:47,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2022-04-08 06:10:47,945 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:10:47,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [933827126] [2022-04-08 06:10:47,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [933827126] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:10:47,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:10:47,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 06:10:47,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597880952] [2022-04-08 06:10:47,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:10:47,946 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 5 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 111 [2022-04-08 06:10:47,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:10:47,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 5 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 06:10:48,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:10:48,021 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 06:10:48,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:10:48,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 06:10:48,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-04-08 06:10:48,021 INFO L87 Difference]: Start difference. First operand 317 states and 445 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 5 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 06:10:50,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:10:50,175 INFO L93 Difference]: Finished difference Result 387 states and 528 transitions. [2022-04-08 06:10:50,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 06:10:50,175 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 5 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 111 [2022-04-08 06:10:50,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:10:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 5 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 06:10:50,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 108 transitions. [2022-04-08 06:10:50,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 5 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 06:10:50,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 108 transitions. [2022-04-08 06:10:50,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 108 transitions. [2022-04-08 06:10:50,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:10:50,300 INFO L225 Difference]: With dead ends: 387 [2022-04-08 06:10:50,300 INFO L226 Difference]: Without dead ends: 271 [2022-04-08 06:10:50,301 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2022-04-08 06:10:50,301 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 47 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 06:10:50,301 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 239 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 06:10:50,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-04-08 06:10:51,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 232. [2022-04-08 06:10:51,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:10:51,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 271 states. Second operand has 232 states, 133 states have (on average 1.150375939849624) internal successors, (153), 134 states have internal predecessors, (153), 79 states have call successors, (79), 20 states have call predecessors, (79), 19 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-08 06:10:51,372 INFO L74 IsIncluded]: Start isIncluded. First operand 271 states. Second operand has 232 states, 133 states have (on average 1.150375939849624) internal successors, (153), 134 states have internal predecessors, (153), 79 states have call successors, (79), 20 states have call predecessors, (79), 19 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-08 06:10:51,373 INFO L87 Difference]: Start difference. First operand 271 states. Second operand has 232 states, 133 states have (on average 1.150375939849624) internal successors, (153), 134 states have internal predecessors, (153), 79 states have call successors, (79), 20 states have call predecessors, (79), 19 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-08 06:10:51,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:10:51,382 INFO L93 Difference]: Finished difference Result 271 states and 367 transitions. [2022-04-08 06:10:51,382 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 367 transitions. [2022-04-08 06:10:51,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:10:51,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:10:51,383 INFO L74 IsIncluded]: Start isIncluded. First operand has 232 states, 133 states have (on average 1.150375939849624) internal successors, (153), 134 states have internal predecessors, (153), 79 states have call successors, (79), 20 states have call predecessors, (79), 19 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) Second operand 271 states. [2022-04-08 06:10:51,384 INFO L87 Difference]: Start difference. First operand has 232 states, 133 states have (on average 1.150375939849624) internal successors, (153), 134 states have internal predecessors, (153), 79 states have call successors, (79), 20 states have call predecessors, (79), 19 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) Second operand 271 states. [2022-04-08 06:10:51,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:10:51,393 INFO L93 Difference]: Finished difference Result 271 states and 367 transitions. [2022-04-08 06:10:51,393 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 367 transitions. [2022-04-08 06:10:51,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:10:51,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:10:51,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:10:51,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:10:51,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 133 states have (on average 1.150375939849624) internal successors, (153), 134 states have internal predecessors, (153), 79 states have call successors, (79), 20 states have call predecessors, (79), 19 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-08 06:10:51,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 309 transitions. [2022-04-08 06:10:51,403 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 309 transitions. Word has length 111 [2022-04-08 06:10:51,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:10:51,404 INFO L478 AbstractCegarLoop]: Abstraction has 232 states and 309 transitions. [2022-04-08 06:10:51,404 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 5 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 06:10:51,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 232 states and 309 transitions. [2022-04-08 06:10:52,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 309 edges. 309 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:10:52,240 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 309 transitions. [2022-04-08 06:10:52,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-08 06:10:52,241 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:10:52,241 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, 1, 1, 1] [2022-04-08 06:10:52,257 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 06:10:52,441 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 06:10:52,442 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:10:52,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:10:52,442 INFO L85 PathProgramCache]: Analyzing trace with hash 890766036, now seen corresponding path program 9 times [2022-04-08 06:10:52,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:10:52,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [132377662] [2022-04-08 06:10:52,443 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:10:52,443 INFO L85 PathProgramCache]: Analyzing trace with hash 890766036, now seen corresponding path program 10 times [2022-04-08 06:10:52,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:10:52,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737377971] [2022-04-08 06:10:52,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:10:52,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:10:52,468 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:10:52,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [620269915] [2022-04-08 06:10:52,468 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:10:52,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:10:52,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:10:52,469 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 06:10:52,471 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 06:10:52,520 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:10:52,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:10:52,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 06:10:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:10:52,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:10:55,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {25518#true} call ULTIMATE.init(); {25518#true} is VALID [2022-04-08 06:10:55,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {25518#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); {25518#true} is VALID [2022-04-08 06:10:55,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-08 06:10:55,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25518#true} {25518#true} #112#return; {25518#true} is VALID [2022-04-08 06:10:55,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {25518#true} call #t~ret6 := main(); {25518#true} is VALID [2022-04-08 06:10:55,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {25518#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {25518#true} is VALID [2022-04-08 06:10:55,635 INFO L272 TraceCheckUtils]: 6: Hoare triple {25518#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {25518#true} is VALID [2022-04-08 06:10:55,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-08 06:10:55,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-08 06:10:55,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-08 06:10:55,635 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25518#true} {25518#true} #94#return; {25518#true} is VALID [2022-04-08 06:10:55,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {25518#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {25518#true} is VALID [2022-04-08 06:10:55,635 INFO L272 TraceCheckUtils]: 12: Hoare triple {25518#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {25518#true} is VALID [2022-04-08 06:10:55,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {25518#true} ~cond := #in~cond; {25562#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 06:10:55,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {25562#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {25566#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:10:55,636 INFO L290 TraceCheckUtils]: 15: Hoare triple {25566#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {25566#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:10:55,636 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {25566#(not (= |assume_abort_if_not_#in~cond| 0))} {25518#true} #96#return; {25573#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 06:10:55,637 INFO L272 TraceCheckUtils]: 17: Hoare triple {25573#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {25518#true} is VALID [2022-04-08 06:10:55,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-08 06:10:55,637 INFO L290 TraceCheckUtils]: 19: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-08 06:10:55,637 INFO L290 TraceCheckUtils]: 20: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-08 06:10:55,637 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {25518#true} {25573#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #98#return; {25573#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 06:10:55,637 INFO L272 TraceCheckUtils]: 22: Hoare triple {25573#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {25518#true} is VALID [2022-04-08 06:10:55,637 INFO L290 TraceCheckUtils]: 23: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-08 06:10:55,637 INFO L290 TraceCheckUtils]: 24: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-08 06:10:55,637 INFO L290 TraceCheckUtils]: 25: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-08 06:10:55,638 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {25518#true} {25573#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #100#return; {25573#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 06:10:55,638 INFO L290 TraceCheckUtils]: 27: Hoare triple {25573#(and (<= 0 main_~y~0) (<= main_~y~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {25607#(<= main_~b~0 2)} is VALID [2022-04-08 06:10:55,638 INFO L290 TraceCheckUtils]: 28: Hoare triple {25607#(<= main_~b~0 2)} assume !false; {25607#(<= main_~b~0 2)} is VALID [2022-04-08 06:10:55,639 INFO L290 TraceCheckUtils]: 29: Hoare triple {25607#(<= main_~b~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {25607#(<= main_~b~0 2)} is VALID [2022-04-08 06:10:55,639 INFO L290 TraceCheckUtils]: 30: Hoare triple {25607#(<= main_~b~0 2)} assume !false; {25607#(<= main_~b~0 2)} is VALID [2022-04-08 06:10:55,639 INFO L290 TraceCheckUtils]: 31: Hoare triple {25607#(<= main_~b~0 2)} assume !(~c~0 >= ~b~0); {25607#(<= main_~b~0 2)} is VALID [2022-04-08 06:10:55,640 INFO L290 TraceCheckUtils]: 32: Hoare triple {25607#(<= main_~b~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {25623#(<= main_~a~0 2)} is VALID [2022-04-08 06:10:55,640 INFO L290 TraceCheckUtils]: 33: Hoare triple {25623#(<= main_~a~0 2)} assume !false; {25623#(<= main_~a~0 2)} is VALID [2022-04-08 06:10:55,640 INFO L290 TraceCheckUtils]: 34: Hoare triple {25623#(<= main_~a~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {25630#(<= main_~c~0 2)} is VALID [2022-04-08 06:10:55,641 INFO L290 TraceCheckUtils]: 35: Hoare triple {25630#(<= main_~c~0 2)} assume !false; {25630#(<= main_~c~0 2)} is VALID [2022-04-08 06:10:55,641 INFO L290 TraceCheckUtils]: 36: Hoare triple {25630#(<= main_~c~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-08 06:10:55,641 INFO L290 TraceCheckUtils]: 37: Hoare triple {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} assume !false; {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-08 06:10:55,641 INFO L272 TraceCheckUtils]: 38: Hoare triple {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {25518#true} is VALID [2022-04-08 06:10:55,641 INFO L290 TraceCheckUtils]: 39: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-08 06:10:55,642 INFO L290 TraceCheckUtils]: 40: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-08 06:10:55,642 INFO L290 TraceCheckUtils]: 41: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-08 06:10:55,642 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {25518#true} {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} #102#return; {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-08 06:10:55,642 INFO L272 TraceCheckUtils]: 43: Hoare triple {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {25518#true} is VALID [2022-04-08 06:10:55,642 INFO L290 TraceCheckUtils]: 44: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-08 06:10:55,642 INFO L290 TraceCheckUtils]: 45: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-08 06:10:55,642 INFO L290 TraceCheckUtils]: 46: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-08 06:10:55,643 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {25518#true} {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} #104#return; {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-08 06:10:55,643 INFO L272 TraceCheckUtils]: 48: Hoare triple {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {25518#true} is VALID [2022-04-08 06:10:55,643 INFO L290 TraceCheckUtils]: 49: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-08 06:10:55,643 INFO L290 TraceCheckUtils]: 50: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-08 06:10:55,643 INFO L290 TraceCheckUtils]: 51: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-08 06:10:55,644 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {25518#true} {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} #106#return; {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-08 06:10:55,644 INFO L272 TraceCheckUtils]: 53: Hoare triple {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {25518#true} is VALID [2022-04-08 06:10:55,644 INFO L290 TraceCheckUtils]: 54: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-08 06:10:55,644 INFO L290 TraceCheckUtils]: 55: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-08 06:10:55,644 INFO L290 TraceCheckUtils]: 56: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-08 06:10:55,645 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {25518#true} {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} #108#return; {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-08 06:10:55,645 INFO L290 TraceCheckUtils]: 58: Hoare triple {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} is VALID [2022-04-08 06:10:55,646 INFO L290 TraceCheckUtils]: 59: Hoare triple {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} assume !false; {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} is VALID [2022-04-08 06:10:55,646 INFO L272 TraceCheckUtils]: 60: Hoare triple {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {25518#true} is VALID [2022-04-08 06:10:55,646 INFO L290 TraceCheckUtils]: 61: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-08 06:10:55,646 INFO L290 TraceCheckUtils]: 62: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-08 06:10:55,646 INFO L290 TraceCheckUtils]: 63: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-08 06:10:55,647 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {25518#true} {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} #102#return; {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} is VALID [2022-04-08 06:10:55,647 INFO L272 TraceCheckUtils]: 65: Hoare triple {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {25518#true} is VALID [2022-04-08 06:10:55,647 INFO L290 TraceCheckUtils]: 66: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-08 06:10:55,647 INFO L290 TraceCheckUtils]: 67: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-08 06:10:55,647 INFO L290 TraceCheckUtils]: 68: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-08 06:10:55,648 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {25518#true} {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} #104#return; {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} is VALID [2022-04-08 06:10:55,648 INFO L272 TraceCheckUtils]: 70: Hoare triple {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {25518#true} is VALID [2022-04-08 06:10:55,648 INFO L290 TraceCheckUtils]: 71: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-08 06:10:55,648 INFO L290 TraceCheckUtils]: 72: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-08 06:10:55,648 INFO L290 TraceCheckUtils]: 73: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-08 06:10:55,648 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {25518#true} {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} #106#return; {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} is VALID [2022-04-08 06:10:55,648 INFO L272 TraceCheckUtils]: 75: Hoare triple {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {25518#true} is VALID [2022-04-08 06:10:55,648 INFO L290 TraceCheckUtils]: 76: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-08 06:10:55,649 INFO L290 TraceCheckUtils]: 77: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-08 06:10:55,649 INFO L290 TraceCheckUtils]: 78: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-08 06:10:55,649 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {25518#true} {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} #108#return; {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} is VALID [2022-04-08 06:10:55,650 INFO L290 TraceCheckUtils]: 80: Hoare triple {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} is VALID [2022-04-08 06:10:55,651 INFO L290 TraceCheckUtils]: 81: Hoare triple {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} assume !false; {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} is VALID [2022-04-08 06:10:55,651 INFO L272 TraceCheckUtils]: 82: Hoare triple {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {25518#true} is VALID [2022-04-08 06:10:55,651 INFO L290 TraceCheckUtils]: 83: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-08 06:10:55,651 INFO L290 TraceCheckUtils]: 84: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-08 06:10:55,651 INFO L290 TraceCheckUtils]: 85: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-08 06:10:55,652 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {25518#true} {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} #102#return; {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} is VALID [2022-04-08 06:10:55,652 INFO L272 TraceCheckUtils]: 87: Hoare triple {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {25518#true} is VALID [2022-04-08 06:10:55,652 INFO L290 TraceCheckUtils]: 88: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-08 06:10:55,652 INFO L290 TraceCheckUtils]: 89: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-08 06:10:55,652 INFO L290 TraceCheckUtils]: 90: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-08 06:10:55,653 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {25518#true} {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} #104#return; {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} is VALID [2022-04-08 06:10:55,653 INFO L272 TraceCheckUtils]: 92: Hoare triple {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {25518#true} is VALID [2022-04-08 06:10:55,653 INFO L290 TraceCheckUtils]: 93: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-08 06:10:55,653 INFO L290 TraceCheckUtils]: 94: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-08 06:10:55,653 INFO L290 TraceCheckUtils]: 95: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-08 06:10:55,653 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {25518#true} {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} #106#return; {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} is VALID [2022-04-08 06:10:55,653 INFO L272 TraceCheckUtils]: 97: Hoare triple {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {25518#true} is VALID [2022-04-08 06:10:55,654 INFO L290 TraceCheckUtils]: 98: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-08 06:10:55,654 INFO L290 TraceCheckUtils]: 99: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-08 06:10:55,654 INFO L290 TraceCheckUtils]: 100: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-08 06:10:55,654 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {25518#true} {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} #108#return; {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} is VALID [2022-04-08 06:10:55,655 INFO L290 TraceCheckUtils]: 102: Hoare triple {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} assume !(~c~0 >= 2 * ~v~0); {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} is VALID [2022-04-08 06:10:55,655 INFO L290 TraceCheckUtils]: 103: Hoare triple {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {25841#(and (<= main_~b~0 0) (< 0 (+ (div main_~c~0 2) 1)))} is VALID [2022-04-08 06:10:55,656 INFO L290 TraceCheckUtils]: 104: Hoare triple {25841#(and (<= main_~b~0 0) (< 0 (+ (div main_~c~0 2) 1)))} assume !false; {25841#(and (<= main_~b~0 0) (< 0 (+ (div main_~c~0 2) 1)))} is VALID [2022-04-08 06:10:55,656 INFO L290 TraceCheckUtils]: 105: Hoare triple {25841#(and (<= main_~b~0 0) (< 0 (+ (div main_~c~0 2) 1)))} assume !(~c~0 >= ~b~0); {25519#false} is VALID [2022-04-08 06:10:55,656 INFO L290 TraceCheckUtils]: 106: Hoare triple {25519#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; {25519#false} is VALID [2022-04-08 06:10:55,657 INFO L290 TraceCheckUtils]: 107: Hoare triple {25519#false} assume !false; {25519#false} is VALID [2022-04-08 06:10:55,657 INFO L290 TraceCheckUtils]: 108: Hoare triple {25519#false} assume !(0 != ~b~0); {25519#false} is VALID [2022-04-08 06:10:55,657 INFO L272 TraceCheckUtils]: 109: Hoare triple {25519#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {25519#false} is VALID [2022-04-08 06:10:55,657 INFO L290 TraceCheckUtils]: 110: Hoare triple {25519#false} ~cond := #in~cond; {25519#false} is VALID [2022-04-08 06:10:55,657 INFO L290 TraceCheckUtils]: 111: Hoare triple {25519#false} assume 0 == ~cond; {25519#false} is VALID [2022-04-08 06:10:55,657 INFO L290 TraceCheckUtils]: 112: Hoare triple {25519#false} assume !false; {25519#false} is VALID [2022-04-08 06:10:55,657 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 34 proven. 30 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2022-04-08 06:10:55,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:11:03,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:11:03,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737377971] [2022-04-08 06:11:03,267 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:11:03,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620269915] [2022-04-08 06:11:03,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620269915] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 06:11:03,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 06:11:03,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-08 06:11:03,268 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:11:03,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [132377662] [2022-04-08 06:11:03,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [132377662] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:11:03,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:11:03,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 06:11:03,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423305182] [2022-04-08 06:11:03,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:11:03,269 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 113 [2022-04-08 06:11:03,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:11:03,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 06:11:03,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:11:03,352 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 06:11:03,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:11:03,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 06:11:03,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2022-04-08 06:11:03,353 INFO L87 Difference]: Start difference. First operand 232 states and 309 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 06:11:07,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:07,236 INFO L93 Difference]: Finished difference Result 349 states and 486 transitions. [2022-04-08 06:11:07,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 06:11:07,237 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 113 [2022-04-08 06:11:07,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:11:07,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 06:11:07,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 138 transitions. [2022-04-08 06:11:07,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 06:11:07,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 138 transitions. [2022-04-08 06:11:07,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 138 transitions. [2022-04-08 06:11:07,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:11:07,522 INFO L225 Difference]: With dead ends: 349 [2022-04-08 06:11:07,522 INFO L226 Difference]: Without dead ends: 295 [2022-04-08 06:11:07,523 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 177 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=192, Invalid=678, Unknown=0, NotChecked=0, Total=870 [2022-04-08 06:11:07,524 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 45 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 06:11:07,524 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 303 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 06:11:07,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-04-08 06:11:09,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 253. [2022-04-08 06:11:09,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:11:09,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 295 states. Second operand has 253 states, 146 states have (on average 1.1506849315068493) internal successors, (168), 147 states have internal predecessors, (168), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-04-08 06:11:09,500 INFO L74 IsIncluded]: Start isIncluded. First operand 295 states. Second operand has 253 states, 146 states have (on average 1.1506849315068493) internal successors, (168), 147 states have internal predecessors, (168), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-04-08 06:11:09,501 INFO L87 Difference]: Start difference. First operand 295 states. Second operand has 253 states, 146 states have (on average 1.1506849315068493) internal successors, (168), 147 states have internal predecessors, (168), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-04-08 06:11:09,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:09,521 INFO L93 Difference]: Finished difference Result 295 states and 412 transitions. [2022-04-08 06:11:09,521 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 412 transitions. [2022-04-08 06:11:09,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:11:09,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:11:09,523 INFO L74 IsIncluded]: Start isIncluded. First operand has 253 states, 146 states have (on average 1.1506849315068493) internal successors, (168), 147 states have internal predecessors, (168), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) Second operand 295 states. [2022-04-08 06:11:09,523 INFO L87 Difference]: Start difference. First operand has 253 states, 146 states have (on average 1.1506849315068493) internal successors, (168), 147 states have internal predecessors, (168), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) Second operand 295 states. [2022-04-08 06:11:09,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:09,541 INFO L93 Difference]: Finished difference Result 295 states and 412 transitions. [2022-04-08 06:11:09,542 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 412 transitions. [2022-04-08 06:11:09,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:11:09,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:11:09,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:11:09,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:11:09,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 146 states have (on average 1.1506849315068493) internal successors, (168), 147 states have internal predecessors, (168), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-04-08 06:11:09,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 340 transitions. [2022-04-08 06:11:09,556 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 340 transitions. Word has length 113 [2022-04-08 06:11:09,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:11:09,556 INFO L478 AbstractCegarLoop]: Abstraction has 253 states and 340 transitions. [2022-04-08 06:11:09,556 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 06:11:09,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 253 states and 340 transitions. [2022-04-08 06:11:11,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 340 edges. 340 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:11:11,038 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 340 transitions. [2022-04-08 06:11:11,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-08 06:11:11,039 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:11:11,039 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:11:11,064 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 06:11:11,240 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 06:11:11,240 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:11:11,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:11:11,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1938711081, now seen corresponding path program 11 times [2022-04-08 06:11:11,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:11:11,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1237130975] [2022-04-08 06:11:11,241 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:11:11,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1938711081, now seen corresponding path program 12 times [2022-04-08 06:11:11,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:11:11,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512419070] [2022-04-08 06:11:11,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:11:11,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:11:11,256 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:11:11,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [933744444] [2022-04-08 06:11:11,257 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:11:11,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:11:11,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:11:11,262 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 06:11:11,265 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 06:11:11,341 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 06:11:11,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:11:11,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 06:11:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:11:11,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:11:11,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {27951#true} call ULTIMATE.init(); {27951#true} is VALID [2022-04-08 06:11:11,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {27951#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); {27951#true} is VALID [2022-04-08 06:11:11,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-08 06:11:11,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27951#true} {27951#true} #112#return; {27951#true} is VALID [2022-04-08 06:11:11,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {27951#true} call #t~ret6 := main(); {27951#true} is VALID [2022-04-08 06:11:11,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {27951#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {27951#true} is VALID [2022-04-08 06:11:11,911 INFO L272 TraceCheckUtils]: 6: Hoare triple {27951#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {27951#true} is VALID [2022-04-08 06:11:11,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-08 06:11:11,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-08 06:11:11,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-08 06:11:11,912 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {27951#true} {27951#true} #94#return; {27951#true} is VALID [2022-04-08 06:11:11,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {27951#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {27951#true} is VALID [2022-04-08 06:11:11,912 INFO L272 TraceCheckUtils]: 12: Hoare triple {27951#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {27951#true} is VALID [2022-04-08 06:11:11,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {27951#true} ~cond := #in~cond; {27995#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 06:11:11,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {27995#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {27999#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:11:11,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {27999#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {27999#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:11:11,914 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {27999#(not (= |assume_abort_if_not_#in~cond| 0))} {27951#true} #96#return; {28006#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 06:11:11,914 INFO L272 TraceCheckUtils]: 17: Hoare triple {28006#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {27951#true} is VALID [2022-04-08 06:11:11,914 INFO L290 TraceCheckUtils]: 18: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-08 06:11:11,914 INFO L290 TraceCheckUtils]: 19: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-08 06:11:11,914 INFO L290 TraceCheckUtils]: 20: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-08 06:11:11,914 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {27951#true} {28006#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #98#return; {28006#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 06:11:11,915 INFO L272 TraceCheckUtils]: 22: Hoare triple {28006#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {27951#true} is VALID [2022-04-08 06:11:11,915 INFO L290 TraceCheckUtils]: 23: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-08 06:11:11,915 INFO L290 TraceCheckUtils]: 24: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-08 06:11:11,915 INFO L290 TraceCheckUtils]: 25: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-08 06:11:11,915 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {27951#true} {28006#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #100#return; {28006#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 06:11:11,916 INFO L290 TraceCheckUtils]: 27: Hoare triple {28006#(and (<= 0 main_~y~0) (<= main_~y~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {28040#(<= main_~b~0 2)} is VALID [2022-04-08 06:11:11,916 INFO L290 TraceCheckUtils]: 28: Hoare triple {28040#(<= main_~b~0 2)} assume !false; {28040#(<= main_~b~0 2)} is VALID [2022-04-08 06:11:11,916 INFO L290 TraceCheckUtils]: 29: Hoare triple {28040#(<= main_~b~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {28040#(<= main_~b~0 2)} is VALID [2022-04-08 06:11:11,917 INFO L290 TraceCheckUtils]: 30: Hoare triple {28040#(<= main_~b~0 2)} assume !false; {28040#(<= main_~b~0 2)} is VALID [2022-04-08 06:11:11,917 INFO L290 TraceCheckUtils]: 31: Hoare triple {28040#(<= main_~b~0 2)} assume !(~c~0 >= ~b~0); {28040#(<= main_~b~0 2)} is VALID [2022-04-08 06:11:11,917 INFO L290 TraceCheckUtils]: 32: Hoare triple {28040#(<= main_~b~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {28056#(<= main_~a~0 2)} is VALID [2022-04-08 06:11:11,918 INFO L290 TraceCheckUtils]: 33: Hoare triple {28056#(<= main_~a~0 2)} assume !false; {28056#(<= main_~a~0 2)} is VALID [2022-04-08 06:11:11,918 INFO L290 TraceCheckUtils]: 34: Hoare triple {28056#(<= main_~a~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {28063#(<= main_~c~0 2)} is VALID [2022-04-08 06:11:11,919 INFO L290 TraceCheckUtils]: 35: Hoare triple {28063#(<= main_~c~0 2)} assume !false; {28063#(<= main_~c~0 2)} is VALID [2022-04-08 06:11:11,919 INFO L290 TraceCheckUtils]: 36: Hoare triple {28063#(<= main_~c~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {28063#(<= main_~c~0 2)} is VALID [2022-04-08 06:11:11,919 INFO L290 TraceCheckUtils]: 37: Hoare triple {28063#(<= main_~c~0 2)} assume !false; {28063#(<= main_~c~0 2)} is VALID [2022-04-08 06:11:11,919 INFO L272 TraceCheckUtils]: 38: Hoare triple {28063#(<= main_~c~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {27951#true} is VALID [2022-04-08 06:11:11,919 INFO L290 TraceCheckUtils]: 39: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-08 06:11:11,919 INFO L290 TraceCheckUtils]: 40: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-08 06:11:11,920 INFO L290 TraceCheckUtils]: 41: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-08 06:11:11,920 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {27951#true} {28063#(<= main_~c~0 2)} #102#return; {28063#(<= main_~c~0 2)} is VALID [2022-04-08 06:11:11,920 INFO L272 TraceCheckUtils]: 43: Hoare triple {28063#(<= main_~c~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {27951#true} is VALID [2022-04-08 06:11:11,920 INFO L290 TraceCheckUtils]: 44: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-08 06:11:11,921 INFO L290 TraceCheckUtils]: 45: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-08 06:11:11,921 INFO L290 TraceCheckUtils]: 46: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-08 06:11:11,921 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {27951#true} {28063#(<= main_~c~0 2)} #104#return; {28063#(<= main_~c~0 2)} is VALID [2022-04-08 06:11:11,921 INFO L272 TraceCheckUtils]: 48: Hoare triple {28063#(<= main_~c~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {27951#true} is VALID [2022-04-08 06:11:11,921 INFO L290 TraceCheckUtils]: 49: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-08 06:11:11,922 INFO L290 TraceCheckUtils]: 50: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-08 06:11:11,922 INFO L290 TraceCheckUtils]: 51: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-08 06:11:11,922 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {27951#true} {28063#(<= main_~c~0 2)} #106#return; {28063#(<= main_~c~0 2)} is VALID [2022-04-08 06:11:11,922 INFO L272 TraceCheckUtils]: 53: Hoare triple {28063#(<= main_~c~0 2)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {27951#true} is VALID [2022-04-08 06:11:11,922 INFO L290 TraceCheckUtils]: 54: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-08 06:11:11,922 INFO L290 TraceCheckUtils]: 55: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-08 06:11:11,923 INFO L290 TraceCheckUtils]: 56: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-08 06:11:11,923 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {27951#true} {28063#(<= main_~c~0 2)} #108#return; {28063#(<= main_~c~0 2)} is VALID [2022-04-08 06:11:11,923 INFO L290 TraceCheckUtils]: 58: Hoare triple {28063#(<= main_~c~0 2)} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {28063#(<= main_~c~0 2)} is VALID [2022-04-08 06:11:11,924 INFO L290 TraceCheckUtils]: 59: Hoare triple {28063#(<= main_~c~0 2)} assume !false; {28063#(<= main_~c~0 2)} is VALID [2022-04-08 06:11:11,924 INFO L272 TraceCheckUtils]: 60: Hoare triple {28063#(<= main_~c~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {27951#true} is VALID [2022-04-08 06:11:11,924 INFO L290 TraceCheckUtils]: 61: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-08 06:11:11,924 INFO L290 TraceCheckUtils]: 62: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-08 06:11:11,924 INFO L290 TraceCheckUtils]: 63: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-08 06:11:11,925 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {27951#true} {28063#(<= main_~c~0 2)} #102#return; {28063#(<= main_~c~0 2)} is VALID [2022-04-08 06:11:11,925 INFO L272 TraceCheckUtils]: 65: Hoare triple {28063#(<= main_~c~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {27951#true} is VALID [2022-04-08 06:11:11,925 INFO L290 TraceCheckUtils]: 66: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-08 06:11:11,925 INFO L290 TraceCheckUtils]: 67: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-08 06:11:11,925 INFO L290 TraceCheckUtils]: 68: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-08 06:11:11,926 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {27951#true} {28063#(<= main_~c~0 2)} #104#return; {28063#(<= main_~c~0 2)} is VALID [2022-04-08 06:11:11,926 INFO L272 TraceCheckUtils]: 70: Hoare triple {28063#(<= main_~c~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {27951#true} is VALID [2022-04-08 06:11:11,926 INFO L290 TraceCheckUtils]: 71: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-08 06:11:11,926 INFO L290 TraceCheckUtils]: 72: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-08 06:11:11,926 INFO L290 TraceCheckUtils]: 73: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-08 06:11:11,927 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {27951#true} {28063#(<= main_~c~0 2)} #106#return; {28063#(<= main_~c~0 2)} is VALID [2022-04-08 06:11:11,927 INFO L272 TraceCheckUtils]: 75: Hoare triple {28063#(<= main_~c~0 2)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {27951#true} is VALID [2022-04-08 06:11:11,927 INFO L290 TraceCheckUtils]: 76: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-08 06:11:11,927 INFO L290 TraceCheckUtils]: 77: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-08 06:11:11,927 INFO L290 TraceCheckUtils]: 78: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-08 06:11:11,928 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {27951#true} {28063#(<= main_~c~0 2)} #108#return; {28063#(<= main_~c~0 2)} is VALID [2022-04-08 06:11:11,928 INFO L290 TraceCheckUtils]: 80: Hoare triple {28063#(<= main_~c~0 2)} assume !(~c~0 >= 2 * ~v~0); {28202#(and (<= main_~c~0 2) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-08 06:11:11,929 INFO L290 TraceCheckUtils]: 81: Hoare triple {28202#(and (<= main_~c~0 2) (not (<= (* main_~v~0 2) main_~c~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {28206#(< (* main_~c~0 2) 2)} is VALID [2022-04-08 06:11:11,929 INFO L290 TraceCheckUtils]: 82: Hoare triple {28206#(< (* main_~c~0 2) 2)} assume !false; {28206#(< (* main_~c~0 2) 2)} is VALID [2022-04-08 06:11:11,931 INFO L290 TraceCheckUtils]: 83: Hoare triple {28206#(< (* main_~c~0 2) 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {28213#(< main_~b~0 1)} is VALID [2022-04-08 06:11:11,931 INFO L290 TraceCheckUtils]: 84: Hoare triple {28213#(< main_~b~0 1)} assume !false; {28213#(< main_~b~0 1)} is VALID [2022-04-08 06:11:11,931 INFO L272 TraceCheckUtils]: 85: Hoare triple {28213#(< main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {27951#true} is VALID [2022-04-08 06:11:11,931 INFO L290 TraceCheckUtils]: 86: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-08 06:11:11,931 INFO L290 TraceCheckUtils]: 87: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-08 06:11:11,931 INFO L290 TraceCheckUtils]: 88: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-08 06:11:11,932 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {27951#true} {28213#(< main_~b~0 1)} #102#return; {28213#(< main_~b~0 1)} is VALID [2022-04-08 06:11:11,932 INFO L272 TraceCheckUtils]: 90: Hoare triple {28213#(< main_~b~0 1)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {27951#true} is VALID [2022-04-08 06:11:11,932 INFO L290 TraceCheckUtils]: 91: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-08 06:11:11,932 INFO L290 TraceCheckUtils]: 92: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-08 06:11:11,932 INFO L290 TraceCheckUtils]: 93: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-08 06:11:11,933 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {27951#true} {28213#(< main_~b~0 1)} #104#return; {28213#(< main_~b~0 1)} is VALID [2022-04-08 06:11:11,933 INFO L272 TraceCheckUtils]: 95: Hoare triple {28213#(< main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {27951#true} is VALID [2022-04-08 06:11:11,933 INFO L290 TraceCheckUtils]: 96: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-08 06:11:11,933 INFO L290 TraceCheckUtils]: 97: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-08 06:11:11,933 INFO L290 TraceCheckUtils]: 98: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-08 06:11:11,934 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {27951#true} {28213#(< main_~b~0 1)} #106#return; {28213#(< main_~b~0 1)} is VALID [2022-04-08 06:11:11,934 INFO L272 TraceCheckUtils]: 100: Hoare triple {28213#(< main_~b~0 1)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {27951#true} is VALID [2022-04-08 06:11:11,934 INFO L290 TraceCheckUtils]: 101: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-08 06:11:11,934 INFO L290 TraceCheckUtils]: 102: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-08 06:11:11,934 INFO L290 TraceCheckUtils]: 103: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-08 06:11:11,935 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {27951#true} {28213#(< main_~b~0 1)} #108#return; {28213#(< main_~b~0 1)} is VALID [2022-04-08 06:11:11,935 INFO L290 TraceCheckUtils]: 105: Hoare triple {28213#(< main_~b~0 1)} assume !(~c~0 >= 2 * ~v~0); {28213#(< main_~b~0 1)} is VALID [2022-04-08 06:11:11,935 INFO L290 TraceCheckUtils]: 106: Hoare triple {28213#(< main_~b~0 1)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {28213#(< main_~b~0 1)} is VALID [2022-04-08 06:11:11,936 INFO L290 TraceCheckUtils]: 107: Hoare triple {28213#(< main_~b~0 1)} assume !false; {28213#(< main_~b~0 1)} is VALID [2022-04-08 06:11:11,937 INFO L290 TraceCheckUtils]: 108: Hoare triple {28213#(< main_~b~0 1)} assume !(~c~0 >= ~b~0); {28289#(< main_~c~0 0)} is VALID [2022-04-08 06:11:11,937 INFO L290 TraceCheckUtils]: 109: Hoare triple {28289#(< main_~c~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; {28293#(< main_~b~0 0)} is VALID [2022-04-08 06:11:11,937 INFO L290 TraceCheckUtils]: 110: Hoare triple {28293#(< main_~b~0 0)} assume !false; {28293#(< main_~b~0 0)} is VALID [2022-04-08 06:11:11,938 INFO L290 TraceCheckUtils]: 111: Hoare triple {28293#(< main_~b~0 0)} assume !(0 != ~b~0); {27952#false} is VALID [2022-04-08 06:11:11,938 INFO L272 TraceCheckUtils]: 112: Hoare triple {27952#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {27952#false} is VALID [2022-04-08 06:11:11,938 INFO L290 TraceCheckUtils]: 113: Hoare triple {27952#false} ~cond := #in~cond; {27952#false} is VALID [2022-04-08 06:11:11,938 INFO L290 TraceCheckUtils]: 114: Hoare triple {27952#false} assume 0 == ~cond; {27952#false} is VALID [2022-04-08 06:11:11,938 INFO L290 TraceCheckUtils]: 115: Hoare triple {27952#false} assume !false; {27952#false} is VALID [2022-04-08 06:11:11,939 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 33 proven. 32 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2022-04-08 06:11:11,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:11:13,181 INFO L290 TraceCheckUtils]: 115: Hoare triple {27952#false} assume !false; {27952#false} is VALID [2022-04-08 06:11:13,181 INFO L290 TraceCheckUtils]: 114: Hoare triple {27952#false} assume 0 == ~cond; {27952#false} is VALID [2022-04-08 06:11:13,182 INFO L290 TraceCheckUtils]: 113: Hoare triple {27952#false} ~cond := #in~cond; {27952#false} is VALID [2022-04-08 06:11:13,182 INFO L272 TraceCheckUtils]: 112: Hoare triple {27952#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {27952#false} is VALID [2022-04-08 06:11:13,182 INFO L290 TraceCheckUtils]: 111: Hoare triple {28293#(< main_~b~0 0)} assume !(0 != ~b~0); {27952#false} is VALID [2022-04-08 06:11:13,182 INFO L290 TraceCheckUtils]: 110: Hoare triple {28293#(< main_~b~0 0)} assume !false; {28293#(< main_~b~0 0)} is VALID [2022-04-08 06:11:13,183 INFO L290 TraceCheckUtils]: 109: Hoare triple {28289#(< main_~c~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; {28293#(< main_~b~0 0)} is VALID [2022-04-08 06:11:13,184 INFO L290 TraceCheckUtils]: 108: Hoare triple {28213#(< main_~b~0 1)} assume !(~c~0 >= ~b~0); {28289#(< main_~c~0 0)} is VALID [2022-04-08 06:11:13,185 INFO L290 TraceCheckUtils]: 107: Hoare triple {28213#(< main_~b~0 1)} assume !false; {28213#(< main_~b~0 1)} is VALID [2022-04-08 06:11:13,185 INFO L290 TraceCheckUtils]: 106: Hoare triple {28213#(< main_~b~0 1)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {28213#(< main_~b~0 1)} is VALID [2022-04-08 06:11:13,185 INFO L290 TraceCheckUtils]: 105: Hoare triple {28213#(< main_~b~0 1)} assume !(~c~0 >= 2 * ~v~0); {28213#(< main_~b~0 1)} is VALID [2022-04-08 06:11:13,186 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {27951#true} {28213#(< main_~b~0 1)} #108#return; {28213#(< main_~b~0 1)} is VALID [2022-04-08 06:11:13,186 INFO L290 TraceCheckUtils]: 103: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-08 06:11:13,186 INFO L290 TraceCheckUtils]: 102: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-08 06:11:13,186 INFO L290 TraceCheckUtils]: 101: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-08 06:11:13,186 INFO L272 TraceCheckUtils]: 100: Hoare triple {28213#(< main_~b~0 1)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {27951#true} is VALID [2022-04-08 06:11:13,187 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {27951#true} {28213#(< main_~b~0 1)} #106#return; {28213#(< main_~b~0 1)} is VALID [2022-04-08 06:11:13,187 INFO L290 TraceCheckUtils]: 98: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-08 06:11:13,187 INFO L290 TraceCheckUtils]: 97: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-08 06:11:13,187 INFO L290 TraceCheckUtils]: 96: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-08 06:11:13,187 INFO L272 TraceCheckUtils]: 95: Hoare triple {28213#(< main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {27951#true} is VALID [2022-04-08 06:11:13,188 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {27951#true} {28213#(< main_~b~0 1)} #104#return; {28213#(< main_~b~0 1)} is VALID [2022-04-08 06:11:13,188 INFO L290 TraceCheckUtils]: 93: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-08 06:11:13,188 INFO L290 TraceCheckUtils]: 92: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-08 06:11:13,188 INFO L290 TraceCheckUtils]: 91: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-08 06:11:13,188 INFO L272 TraceCheckUtils]: 90: Hoare triple {28213#(< main_~b~0 1)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {27951#true} is VALID [2022-04-08 06:11:13,189 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {27951#true} {28213#(< main_~b~0 1)} #102#return; {28213#(< main_~b~0 1)} is VALID [2022-04-08 06:11:13,189 INFO L290 TraceCheckUtils]: 88: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-08 06:11:13,189 INFO L290 TraceCheckUtils]: 87: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-08 06:11:13,189 INFO L290 TraceCheckUtils]: 86: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-08 06:11:13,189 INFO L272 TraceCheckUtils]: 85: Hoare triple {28213#(< main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {27951#true} is VALID [2022-04-08 06:11:13,189 INFO L290 TraceCheckUtils]: 84: Hoare triple {28213#(< main_~b~0 1)} assume !false; {28213#(< main_~b~0 1)} is VALID [2022-04-08 06:11:13,190 INFO L290 TraceCheckUtils]: 83: Hoare triple {28408#(or (< main_~b~0 1) (not (<= main_~b~0 main_~c~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {28213#(< main_~b~0 1)} is VALID [2022-04-08 06:11:13,190 INFO L290 TraceCheckUtils]: 82: Hoare triple {28408#(or (< main_~b~0 1) (not (<= main_~b~0 main_~c~0)))} assume !false; {28408#(or (< main_~b~0 1) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-08 06:11:13,191 INFO L290 TraceCheckUtils]: 81: Hoare triple {28415#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (< main_~b~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {28408#(or (< main_~b~0 1) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-08 06:11:13,192 INFO L290 TraceCheckUtils]: 80: Hoare triple {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} assume !(~c~0 >= 2 * ~v~0); {28415#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (< main_~b~0 1))} is VALID [2022-04-08 06:11:13,193 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {27951#true} {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #108#return; {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-08 06:11:13,193 INFO L290 TraceCheckUtils]: 78: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-08 06:11:13,193 INFO L290 TraceCheckUtils]: 77: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-08 06:11:13,193 INFO L290 TraceCheckUtils]: 76: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-08 06:11:13,193 INFO L272 TraceCheckUtils]: 75: Hoare triple {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {27951#true} is VALID [2022-04-08 06:11:13,194 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {27951#true} {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #106#return; {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-08 06:11:13,194 INFO L290 TraceCheckUtils]: 73: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-08 06:11:13,194 INFO L290 TraceCheckUtils]: 72: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-08 06:11:13,194 INFO L290 TraceCheckUtils]: 71: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-08 06:11:13,194 INFO L272 TraceCheckUtils]: 70: Hoare triple {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {27951#true} is VALID [2022-04-08 06:11:13,194 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {27951#true} {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #104#return; {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-08 06:11:13,195 INFO L290 TraceCheckUtils]: 68: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-08 06:11:13,195 INFO L290 TraceCheckUtils]: 67: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-08 06:11:13,195 INFO L290 TraceCheckUtils]: 66: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-08 06:11:13,195 INFO L272 TraceCheckUtils]: 65: Hoare triple {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {27951#true} is VALID [2022-04-08 06:11:13,196 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {27951#true} {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #102#return; {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-08 06:11:13,196 INFO L290 TraceCheckUtils]: 63: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-08 06:11:13,196 INFO L290 TraceCheckUtils]: 62: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-08 06:11:13,196 INFO L290 TraceCheckUtils]: 61: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-08 06:11:13,196 INFO L272 TraceCheckUtils]: 60: Hoare triple {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {27951#true} is VALID [2022-04-08 06:11:13,196 INFO L290 TraceCheckUtils]: 59: Hoare triple {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} assume !false; {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-08 06:11:13,197 INFO L290 TraceCheckUtils]: 58: Hoare triple {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-08 06:11:13,197 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {27951#true} {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #108#return; {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-08 06:11:13,197 INFO L290 TraceCheckUtils]: 56: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-08 06:11:13,197 INFO L290 TraceCheckUtils]: 55: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-08 06:11:13,207 INFO L290 TraceCheckUtils]: 54: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-08 06:11:13,207 INFO L272 TraceCheckUtils]: 53: Hoare triple {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {27951#true} is VALID [2022-04-08 06:11:13,208 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {27951#true} {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #106#return; {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-08 06:11:13,208 INFO L290 TraceCheckUtils]: 51: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-08 06:11:13,208 INFO L290 TraceCheckUtils]: 50: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-08 06:11:13,208 INFO L290 TraceCheckUtils]: 49: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-08 06:11:13,208 INFO L272 TraceCheckUtils]: 48: Hoare triple {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {27951#true} is VALID [2022-04-08 06:11:13,209 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {27951#true} {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #104#return; {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-08 06:11:13,209 INFO L290 TraceCheckUtils]: 46: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-08 06:11:13,209 INFO L290 TraceCheckUtils]: 45: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-08 06:11:13,209 INFO L290 TraceCheckUtils]: 44: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-08 06:11:13,209 INFO L272 TraceCheckUtils]: 43: Hoare triple {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {27951#true} is VALID [2022-04-08 06:11:13,210 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {27951#true} {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #102#return; {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-08 06:11:13,210 INFO L290 TraceCheckUtils]: 41: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-08 06:11:13,210 INFO L290 TraceCheckUtils]: 40: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-08 06:11:13,210 INFO L290 TraceCheckUtils]: 39: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-08 06:11:13,210 INFO L272 TraceCheckUtils]: 38: Hoare triple {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {27951#true} is VALID [2022-04-08 06:11:13,210 INFO L290 TraceCheckUtils]: 37: Hoare triple {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} assume !false; {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-08 06:11:13,211 INFO L290 TraceCheckUtils]: 36: Hoare triple {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-08 06:11:13,211 INFO L290 TraceCheckUtils]: 35: Hoare triple {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} assume !false; {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-08 06:11:13,212 INFO L290 TraceCheckUtils]: 34: Hoare triple {28558#(or (< main_~b~0 1) (<= main_~a~0 (* main_~b~0 2)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-08 06:11:13,212 INFO L290 TraceCheckUtils]: 33: Hoare triple {28558#(or (< main_~b~0 1) (<= main_~a~0 (* main_~b~0 2)))} assume !false; {28558#(or (< main_~b~0 1) (<= main_~a~0 (* main_~b~0 2)))} is VALID [2022-04-08 06:11:13,213 INFO L290 TraceCheckUtils]: 32: Hoare triple {28565#(or (< main_~c~0 1) (<= main_~b~0 (* main_~c~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; {28558#(or (< main_~b~0 1) (<= main_~a~0 (* main_~b~0 2)))} is VALID [2022-04-08 06:11:13,213 INFO L290 TraceCheckUtils]: 31: Hoare triple {28565#(or (< main_~c~0 1) (<= main_~b~0 (* main_~c~0 2)))} assume !(~c~0 >= ~b~0); {28565#(or (< main_~c~0 1) (<= main_~b~0 (* main_~c~0 2)))} is VALID [2022-04-08 06:11:13,214 INFO L290 TraceCheckUtils]: 30: Hoare triple {28565#(or (< main_~c~0 1) (<= main_~b~0 (* main_~c~0 2)))} assume !false; {28565#(or (< main_~c~0 1) (<= main_~b~0 (* main_~c~0 2)))} is VALID [2022-04-08 06:11:13,214 INFO L290 TraceCheckUtils]: 29: Hoare triple {28575#(or (< main_~a~0 1) (<= main_~b~0 (* main_~a~0 2)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {28565#(or (< main_~c~0 1) (<= main_~b~0 (* main_~c~0 2)))} is VALID [2022-04-08 06:11:13,215 INFO L290 TraceCheckUtils]: 28: Hoare triple {28575#(or (< main_~a~0 1) (<= main_~b~0 (* main_~a~0 2)))} assume !false; {28575#(or (< main_~a~0 1) (<= main_~b~0 (* main_~a~0 2)))} is VALID [2022-04-08 06:11:13,215 INFO L290 TraceCheckUtils]: 27: Hoare triple {28582#(<= (div (- main_~y~0) (- 2)) 1)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {28575#(or (< main_~a~0 1) (<= main_~b~0 (* main_~a~0 2)))} is VALID [2022-04-08 06:11:13,216 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {27951#true} {28582#(<= (div (- main_~y~0) (- 2)) 1)} #100#return; {28582#(<= (div (- main_~y~0) (- 2)) 1)} is VALID [2022-04-08 06:11:13,216 INFO L290 TraceCheckUtils]: 25: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-08 06:11:13,216 INFO L290 TraceCheckUtils]: 24: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-08 06:11:13,216 INFO L290 TraceCheckUtils]: 23: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-08 06:11:13,216 INFO L272 TraceCheckUtils]: 22: Hoare triple {28582#(<= (div (- main_~y~0) (- 2)) 1)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {27951#true} is VALID [2022-04-08 06:11:13,217 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {27951#true} {28582#(<= (div (- main_~y~0) (- 2)) 1)} #98#return; {28582#(<= (div (- main_~y~0) (- 2)) 1)} is VALID [2022-04-08 06:11:13,217 INFO L290 TraceCheckUtils]: 20: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-08 06:11:13,217 INFO L290 TraceCheckUtils]: 19: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-08 06:11:13,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-08 06:11:13,217 INFO L272 TraceCheckUtils]: 17: Hoare triple {28582#(<= (div (- main_~y~0) (- 2)) 1)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {27951#true} is VALID [2022-04-08 06:11:13,218 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {27999#(not (= |assume_abort_if_not_#in~cond| 0))} {27951#true} #96#return; {28582#(<= (div (- main_~y~0) (- 2)) 1)} is VALID [2022-04-08 06:11:13,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {27999#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {27999#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:11:13,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {28625#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {27999#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:11:13,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {27951#true} ~cond := #in~cond; {28625#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-08 06:11:13,219 INFO L272 TraceCheckUtils]: 12: Hoare triple {27951#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {27951#true} is VALID [2022-04-08 06:11:13,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {27951#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {27951#true} is VALID [2022-04-08 06:11:13,219 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {27951#true} {27951#true} #94#return; {27951#true} is VALID [2022-04-08 06:11:13,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-08 06:11:13,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-08 06:11:13,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-08 06:11:13,220 INFO L272 TraceCheckUtils]: 6: Hoare triple {27951#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {27951#true} is VALID [2022-04-08 06:11:13,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {27951#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {27951#true} is VALID [2022-04-08 06:11:13,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {27951#true} call #t~ret6 := main(); {27951#true} is VALID [2022-04-08 06:11:13,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27951#true} {27951#true} #112#return; {27951#true} is VALID [2022-04-08 06:11:13,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-08 06:11:13,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {27951#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); {27951#true} is VALID [2022-04-08 06:11:13,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {27951#true} call ULTIMATE.init(); {27951#true} is VALID [2022-04-08 06:11:13,221 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 53 proven. 12 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2022-04-08 06:11:13,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:11:13,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512419070] [2022-04-08 06:11:13,221 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:11:13,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933744444] [2022-04-08 06:11:13,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933744444] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:11:13,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:11:13,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 21 [2022-04-08 06:11:13,222 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:11:13,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1237130975] [2022-04-08 06:11:13,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1237130975] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:11:13,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:11:13,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 06:11:13,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785727562] [2022-04-08 06:11:13,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:11:13,223 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 116 [2022-04-08 06:11:13,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:11:13,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 06:11:13,287 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 06:11:13,287 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 06:11:13,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:11:13,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 06:11:13,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-04-08 06:11:13,288 INFO L87 Difference]: Start difference. First operand 253 states and 340 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 06:11:17,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:17,247 INFO L93 Difference]: Finished difference Result 317 states and 438 transitions. [2022-04-08 06:11:17,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 06:11:17,247 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 116 [2022-04-08 06:11:17,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:11:17,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 06:11:17,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 136 transitions. [2022-04-08 06:11:17,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 06:11:17,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 136 transitions. [2022-04-08 06:11:17,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 136 transitions. [2022-04-08 06:11:17,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:11:17,476 INFO L225 Difference]: With dead ends: 317 [2022-04-08 06:11:17,476 INFO L226 Difference]: Without dead ends: 310 [2022-04-08 06:11:17,477 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 210 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=347, Invalid=913, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 06:11:17,477 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 57 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 06:11:17,478 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 344 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 06:11:17,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-04-08 06:11:19,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 259. [2022-04-08 06:11:19,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:11:19,604 INFO L82 GeneralOperation]: Start isEquivalent. First operand 310 states. Second operand has 259 states, 152 states have (on average 1.1513157894736843) internal successors, (175), 153 states have internal predecessors, (175), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-04-08 06:11:19,604 INFO L74 IsIncluded]: Start isIncluded. First operand 310 states. Second operand has 259 states, 152 states have (on average 1.1513157894736843) internal successors, (175), 153 states have internal predecessors, (175), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-04-08 06:11:19,605 INFO L87 Difference]: Start difference. First operand 310 states. Second operand has 259 states, 152 states have (on average 1.1513157894736843) internal successors, (175), 153 states have internal predecessors, (175), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-04-08 06:11:19,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:19,613 INFO L93 Difference]: Finished difference Result 310 states and 431 transitions. [2022-04-08 06:11:19,613 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 431 transitions. [2022-04-08 06:11:19,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:11:19,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:11:19,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 259 states, 152 states have (on average 1.1513157894736843) internal successors, (175), 153 states have internal predecessors, (175), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) Second operand 310 states. [2022-04-08 06:11:19,627 INFO L87 Difference]: Start difference. First operand has 259 states, 152 states have (on average 1.1513157894736843) internal successors, (175), 153 states have internal predecessors, (175), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) Second operand 310 states. [2022-04-08 06:11:19,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:19,644 INFO L93 Difference]: Finished difference Result 310 states and 431 transitions. [2022-04-08 06:11:19,644 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 431 transitions. [2022-04-08 06:11:19,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:11:19,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:11:19,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:11:19,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:11:19,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 152 states have (on average 1.1513157894736843) internal successors, (175), 153 states have internal predecessors, (175), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-04-08 06:11:19,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 347 transitions. [2022-04-08 06:11:19,655 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 347 transitions. Word has length 116 [2022-04-08 06:11:19,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:11:19,655 INFO L478 AbstractCegarLoop]: Abstraction has 259 states and 347 transitions. [2022-04-08 06:11:19,656 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 06:11:19,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 259 states and 347 transitions. [2022-04-08 06:11:20,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 347 edges. 347 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:11:20,907 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 347 transitions. [2022-04-08 06:11:20,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-08 06:11:20,908 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:11:20,909 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:11:20,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-08 06:11:21,109 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 06:11:21,109 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:11:21,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:11:21,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1687072417, now seen corresponding path program 13 times [2022-04-08 06:11:21,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:11:21,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1037392866] [2022-04-08 06:11:21,110 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:11:21,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1687072417, now seen corresponding path program 14 times [2022-04-08 06:11:21,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:11:21,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784107568] [2022-04-08 06:11:21,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:11:21,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:11:21,127 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:11:21,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [11528698] [2022-04-08 06:11:21,127 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:11:21,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:11:21,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:11:21,147 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 06:11:21,179 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 06:11:21,236 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:11:21,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:11:21,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 06:11:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:11:21,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:11:23,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {30469#true} call ULTIMATE.init(); {30469#true} is VALID [2022-04-08 06:11:23,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {30469#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); {30469#true} is VALID [2022-04-08 06:11:23,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-08 06:11:23,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30469#true} {30469#true} #112#return; {30469#true} is VALID [2022-04-08 06:11:23,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {30469#true} call #t~ret6 := main(); {30469#true} is VALID [2022-04-08 06:11:23,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {30469#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {30469#true} is VALID [2022-04-08 06:11:23,446 INFO L272 TraceCheckUtils]: 6: Hoare triple {30469#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {30469#true} is VALID [2022-04-08 06:11:23,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {30469#true} ~cond := #in~cond; {30495#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 06:11:23,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {30495#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {30499#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:11:23,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {30499#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {30499#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:11:23,448 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {30499#(not (= |assume_abort_if_not_#in~cond| 0))} {30469#true} #94#return; {30506#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 06:11:23,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {30506#(and (<= 0 main_~x~0) (<= main_~x~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {30506#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 06:11:23,448 INFO L272 TraceCheckUtils]: 12: Hoare triple {30506#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {30469#true} is VALID [2022-04-08 06:11:23,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-08 06:11:23,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-08 06:11:23,449 INFO L290 TraceCheckUtils]: 15: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-08 06:11:23,449 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {30469#true} {30506#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #96#return; {30506#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 06:11:23,449 INFO L272 TraceCheckUtils]: 17: Hoare triple {30506#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {30469#true} is VALID [2022-04-08 06:11:23,449 INFO L290 TraceCheckUtils]: 18: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-08 06:11:23,449 INFO L290 TraceCheckUtils]: 19: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-08 06:11:23,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-08 06:11:23,450 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {30469#true} {30506#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #98#return; {30506#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 06:11:23,450 INFO L272 TraceCheckUtils]: 22: Hoare triple {30506#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {30469#true} is VALID [2022-04-08 06:11:23,450 INFO L290 TraceCheckUtils]: 23: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-08 06:11:23,450 INFO L290 TraceCheckUtils]: 24: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-08 06:11:23,450 INFO L290 TraceCheckUtils]: 25: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-08 06:11:23,451 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {30469#true} {30506#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #100#return; {30506#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 06:11:23,451 INFO L290 TraceCheckUtils]: 27: Hoare triple {30506#(and (<= 0 main_~x~0) (<= main_~x~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {30558#(<= main_~a~0 2)} is VALID [2022-04-08 06:11:23,452 INFO L290 TraceCheckUtils]: 28: Hoare triple {30558#(<= main_~a~0 2)} assume !false; {30558#(<= main_~a~0 2)} is VALID [2022-04-08 06:11:23,452 INFO L290 TraceCheckUtils]: 29: Hoare triple {30558#(<= main_~a~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {30565#(<= main_~c~0 2)} is VALID [2022-04-08 06:11:23,452 INFO L290 TraceCheckUtils]: 30: Hoare triple {30565#(<= main_~c~0 2)} assume !false; {30565#(<= main_~c~0 2)} is VALID [2022-04-08 06:11:23,453 INFO L290 TraceCheckUtils]: 31: Hoare triple {30565#(<= main_~c~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {30572#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-08 06:11:23,453 INFO L290 TraceCheckUtils]: 32: Hoare triple {30572#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} assume !false; {30572#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-08 06:11:23,453 INFO L272 TraceCheckUtils]: 33: Hoare triple {30572#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {30469#true} is VALID [2022-04-08 06:11:23,453 INFO L290 TraceCheckUtils]: 34: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-08 06:11:23,453 INFO L290 TraceCheckUtils]: 35: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-08 06:11:23,453 INFO L290 TraceCheckUtils]: 36: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-08 06:11:23,454 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {30469#true} {30572#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} #102#return; {30572#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-08 06:11:23,454 INFO L272 TraceCheckUtils]: 38: Hoare triple {30572#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {30469#true} is VALID [2022-04-08 06:11:23,454 INFO L290 TraceCheckUtils]: 39: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-08 06:11:23,454 INFO L290 TraceCheckUtils]: 40: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-08 06:11:23,455 INFO L290 TraceCheckUtils]: 41: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-08 06:11:23,455 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {30469#true} {30572#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} #104#return; {30572#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-08 06:11:23,455 INFO L272 TraceCheckUtils]: 43: Hoare triple {30572#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {30469#true} is VALID [2022-04-08 06:11:23,455 INFO L290 TraceCheckUtils]: 44: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-08 06:11:23,456 INFO L290 TraceCheckUtils]: 45: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-08 06:11:23,456 INFO L290 TraceCheckUtils]: 46: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-08 06:11:23,456 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {30469#true} {30572#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} #106#return; {30572#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-08 06:11:23,456 INFO L272 TraceCheckUtils]: 48: Hoare triple {30572#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {30469#true} is VALID [2022-04-08 06:11:23,456 INFO L290 TraceCheckUtils]: 49: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-08 06:11:23,456 INFO L290 TraceCheckUtils]: 50: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-08 06:11:23,457 INFO L290 TraceCheckUtils]: 51: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-08 06:11:23,457 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {30469#true} {30572#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} #108#return; {30572#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-08 06:11:23,458 INFO L290 TraceCheckUtils]: 53: Hoare triple {30572#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} assume !(~c~0 >= 2 * ~v~0); {30639#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-08 06:11:23,459 INFO L290 TraceCheckUtils]: 54: Hoare triple {30639#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2) (not (<= (* main_~v~0 2) main_~c~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {30643#(and (< (* main_~c~0 2) 2) (< main_~c~0 main_~b~0))} is VALID [2022-04-08 06:11:23,459 INFO L290 TraceCheckUtils]: 55: Hoare triple {30643#(and (< (* main_~c~0 2) 2) (< main_~c~0 main_~b~0))} assume !false; {30643#(and (< (* main_~c~0 2) 2) (< main_~c~0 main_~b~0))} is VALID [2022-04-08 06:11:23,459 INFO L290 TraceCheckUtils]: 56: Hoare triple {30643#(and (< (* main_~c~0 2) 2) (< main_~c~0 main_~b~0))} assume !(~c~0 >= ~b~0); {30643#(and (< (* main_~c~0 2) 2) (< main_~c~0 main_~b~0))} is VALID [2022-04-08 06:11:23,460 INFO L290 TraceCheckUtils]: 57: Hoare triple {30643#(and (< (* main_~c~0 2) 2) (< main_~c~0 main_~b~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; {30653#(and (< main_~b~0 main_~a~0) (< main_~b~0 1))} is VALID [2022-04-08 06:11:23,460 INFO L290 TraceCheckUtils]: 58: Hoare triple {30653#(and (< main_~b~0 main_~a~0) (< main_~b~0 1))} assume !false; {30653#(and (< main_~b~0 main_~a~0) (< main_~b~0 1))} is VALID [2022-04-08 06:11:23,461 INFO L290 TraceCheckUtils]: 59: Hoare triple {30653#(and (< main_~b~0 main_~a~0) (< main_~b~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {30660#(and (< main_~b~0 1) (< main_~b~0 main_~c~0))} is VALID [2022-04-08 06:11:23,461 INFO L290 TraceCheckUtils]: 60: Hoare triple {30660#(and (< main_~b~0 1) (< main_~b~0 main_~c~0))} assume !false; {30660#(and (< main_~b~0 1) (< main_~b~0 main_~c~0))} is VALID [2022-04-08 06:11:23,462 INFO L290 TraceCheckUtils]: 61: Hoare triple {30660#(and (< main_~b~0 1) (< main_~b~0 main_~c~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {30667#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} is VALID [2022-04-08 06:11:23,462 INFO L290 TraceCheckUtils]: 62: Hoare triple {30667#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} assume !false; {30667#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} is VALID [2022-04-08 06:11:23,462 INFO L272 TraceCheckUtils]: 63: Hoare triple {30667#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {30469#true} is VALID [2022-04-08 06:11:23,462 INFO L290 TraceCheckUtils]: 64: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-08 06:11:23,462 INFO L290 TraceCheckUtils]: 65: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-08 06:11:23,463 INFO L290 TraceCheckUtils]: 66: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-08 06:11:23,463 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {30469#true} {30667#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} #102#return; {30667#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} is VALID [2022-04-08 06:11:23,463 INFO L272 TraceCheckUtils]: 68: Hoare triple {30667#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {30469#true} is VALID [2022-04-08 06:11:23,463 INFO L290 TraceCheckUtils]: 69: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-08 06:11:23,464 INFO L290 TraceCheckUtils]: 70: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-08 06:11:23,464 INFO L290 TraceCheckUtils]: 71: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-08 06:11:23,464 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {30469#true} {30667#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} #104#return; {30667#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} is VALID [2022-04-08 06:11:23,464 INFO L272 TraceCheckUtils]: 73: Hoare triple {30667#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {30469#true} is VALID [2022-04-08 06:11:23,465 INFO L290 TraceCheckUtils]: 74: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-08 06:11:23,465 INFO L290 TraceCheckUtils]: 75: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-08 06:11:23,465 INFO L290 TraceCheckUtils]: 76: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-08 06:11:23,465 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {30469#true} {30667#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} #106#return; {30667#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} is VALID [2022-04-08 06:11:23,465 INFO L272 TraceCheckUtils]: 78: Hoare triple {30667#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {30469#true} is VALID [2022-04-08 06:11:23,466 INFO L290 TraceCheckUtils]: 79: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-08 06:11:23,466 INFO L290 TraceCheckUtils]: 80: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-08 06:11:23,466 INFO L290 TraceCheckUtils]: 81: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-08 06:11:23,466 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {30469#true} {30667#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} #108#return; {30667#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} is VALID [2022-04-08 06:11:23,468 INFO L290 TraceCheckUtils]: 83: Hoare triple {30667#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-08 06:11:23,469 INFO L290 TraceCheckUtils]: 84: Hoare triple {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} assume !false; {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-08 06:11:23,469 INFO L272 TraceCheckUtils]: 85: Hoare triple {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {30469#true} is VALID [2022-04-08 06:11:23,469 INFO L290 TraceCheckUtils]: 86: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-08 06:11:23,469 INFO L290 TraceCheckUtils]: 87: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-08 06:11:23,469 INFO L290 TraceCheckUtils]: 88: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-08 06:11:23,470 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {30469#true} {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #102#return; {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-08 06:11:23,470 INFO L272 TraceCheckUtils]: 90: Hoare triple {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {30469#true} is VALID [2022-04-08 06:11:23,470 INFO L290 TraceCheckUtils]: 91: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-08 06:11:23,470 INFO L290 TraceCheckUtils]: 92: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-08 06:11:23,470 INFO L290 TraceCheckUtils]: 93: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-08 06:11:23,471 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {30469#true} {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #104#return; {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-08 06:11:23,471 INFO L272 TraceCheckUtils]: 95: Hoare triple {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {30469#true} is VALID [2022-04-08 06:11:23,471 INFO L290 TraceCheckUtils]: 96: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-08 06:11:23,471 INFO L290 TraceCheckUtils]: 97: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-08 06:11:23,471 INFO L290 TraceCheckUtils]: 98: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-08 06:11:23,472 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {30469#true} {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #106#return; {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-08 06:11:23,472 INFO L272 TraceCheckUtils]: 100: Hoare triple {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {30469#true} is VALID [2022-04-08 06:11:23,472 INFO L290 TraceCheckUtils]: 101: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-08 06:11:23,472 INFO L290 TraceCheckUtils]: 102: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-08 06:11:23,472 INFO L290 TraceCheckUtils]: 103: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-08 06:11:23,473 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {30469#true} {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #108#return; {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-08 06:11:23,484 INFO L290 TraceCheckUtils]: 105: Hoare triple {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} assume !(~c~0 >= 2 * ~v~0); {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-08 06:11:23,485 INFO L290 TraceCheckUtils]: 106: Hoare triple {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {30804#(and (< main_~b~0 1) (< (div (+ (- 1) main_~c~0 (* (- 1) main_~b~0)) (- 2)) (+ main_~b~0 1)))} is VALID [2022-04-08 06:11:23,486 INFO L290 TraceCheckUtils]: 107: Hoare triple {30804#(and (< main_~b~0 1) (< (div (+ (- 1) main_~c~0 (* (- 1) main_~b~0)) (- 2)) (+ main_~b~0 1)))} assume !false; {30804#(and (< main_~b~0 1) (< (div (+ (- 1) main_~c~0 (* (- 1) main_~b~0)) (- 2)) (+ main_~b~0 1)))} is VALID [2022-04-08 06:11:23,487 INFO L290 TraceCheckUtils]: 108: Hoare triple {30804#(and (< main_~b~0 1) (< (div (+ (- 1) main_~c~0 (* (- 1) main_~b~0)) (- 2)) (+ main_~b~0 1)))} assume !(~c~0 >= ~b~0); {30470#false} is VALID [2022-04-08 06:11:23,487 INFO L290 TraceCheckUtils]: 109: Hoare triple {30470#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; {30470#false} is VALID [2022-04-08 06:11:23,487 INFO L290 TraceCheckUtils]: 110: Hoare triple {30470#false} assume !false; {30470#false} is VALID [2022-04-08 06:11:23,488 INFO L290 TraceCheckUtils]: 111: Hoare triple {30470#false} assume !(0 != ~b~0); {30470#false} is VALID [2022-04-08 06:11:23,488 INFO L272 TraceCheckUtils]: 112: Hoare triple {30470#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {30470#false} is VALID [2022-04-08 06:11:23,488 INFO L290 TraceCheckUtils]: 113: Hoare triple {30470#false} ~cond := #in~cond; {30470#false} is VALID [2022-04-08 06:11:23,488 INFO L290 TraceCheckUtils]: 114: Hoare triple {30470#false} assume 0 == ~cond; {30470#false} is VALID [2022-04-08 06:11:23,488 INFO L290 TraceCheckUtils]: 115: Hoare triple {30470#false} assume !false; {30470#false} is VALID [2022-04-08 06:11:23,488 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 39 proven. 32 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2022-04-08 06:11:23,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:11:30,393 INFO L290 TraceCheckUtils]: 115: Hoare triple {30470#false} assume !false; {30470#false} is VALID [2022-04-08 06:11:30,393 INFO L290 TraceCheckUtils]: 114: Hoare triple {30470#false} assume 0 == ~cond; {30470#false} is VALID [2022-04-08 06:11:30,394 INFO L290 TraceCheckUtils]: 113: Hoare triple {30470#false} ~cond := #in~cond; {30470#false} is VALID [2022-04-08 06:11:30,394 INFO L272 TraceCheckUtils]: 112: Hoare triple {30470#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {30470#false} is VALID [2022-04-08 06:11:30,394 INFO L290 TraceCheckUtils]: 111: Hoare triple {30470#false} assume !(0 != ~b~0); {30470#false} is VALID [2022-04-08 06:11:30,394 INFO L290 TraceCheckUtils]: 110: Hoare triple {30470#false} assume !false; {30470#false} is VALID [2022-04-08 06:11:30,394 INFO L290 TraceCheckUtils]: 109: Hoare triple {30470#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; {30470#false} is VALID [2022-04-08 06:11:30,394 INFO L290 TraceCheckUtils]: 108: Hoare triple {30853#(<= main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {30470#false} is VALID [2022-04-08 06:11:30,395 INFO L290 TraceCheckUtils]: 107: Hoare triple {30853#(<= main_~b~0 main_~c~0)} assume !false; {30853#(<= main_~b~0 main_~c~0)} is VALID [2022-04-08 06:11:30,396 INFO L290 TraceCheckUtils]: 106: Hoare triple {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {30853#(<= main_~b~0 main_~c~0)} is VALID [2022-04-08 06:11:30,396 INFO L290 TraceCheckUtils]: 105: Hoare triple {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} assume !(~c~0 >= 2 * ~v~0); {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} is VALID [2022-04-08 06:11:30,397 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {30469#true} {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} #108#return; {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} is VALID [2022-04-08 06:11:30,397 INFO L290 TraceCheckUtils]: 103: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-08 06:11:30,397 INFO L290 TraceCheckUtils]: 102: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-08 06:11:30,397 INFO L290 TraceCheckUtils]: 101: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-08 06:11:30,397 INFO L272 TraceCheckUtils]: 100: Hoare triple {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {30469#true} is VALID [2022-04-08 06:11:30,398 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {30469#true} {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} #106#return; {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} is VALID [2022-04-08 06:11:30,398 INFO L290 TraceCheckUtils]: 98: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-08 06:11:30,398 INFO L290 TraceCheckUtils]: 97: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-08 06:11:30,398 INFO L290 TraceCheckUtils]: 96: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-08 06:11:30,398 INFO L272 TraceCheckUtils]: 95: Hoare triple {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {30469#true} is VALID [2022-04-08 06:11:30,399 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {30469#true} {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} #104#return; {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} is VALID [2022-04-08 06:11:30,399 INFO L290 TraceCheckUtils]: 93: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-08 06:11:30,399 INFO L290 TraceCheckUtils]: 92: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-08 06:11:30,399 INFO L290 TraceCheckUtils]: 91: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-08 06:11:30,399 INFO L272 TraceCheckUtils]: 90: Hoare triple {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {30469#true} is VALID [2022-04-08 06:11:30,402 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {30469#true} {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} #102#return; {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} is VALID [2022-04-08 06:11:30,402 INFO L290 TraceCheckUtils]: 88: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-08 06:11:30,403 INFO L290 TraceCheckUtils]: 87: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-08 06:11:30,403 INFO L290 TraceCheckUtils]: 86: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-08 06:11:30,403 INFO L272 TraceCheckUtils]: 85: Hoare triple {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {30469#true} is VALID [2022-04-08 06:11:30,403 INFO L290 TraceCheckUtils]: 84: Hoare triple {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} assume !false; {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} is VALID [2022-04-08 06:11:30,405 INFO L290 TraceCheckUtils]: 83: Hoare triple {30930#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} is VALID [2022-04-08 06:11:30,405 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {30469#true} {30930#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} #108#return; {30930#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} is VALID [2022-04-08 06:11:30,405 INFO L290 TraceCheckUtils]: 81: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-08 06:11:30,406 INFO L290 TraceCheckUtils]: 80: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-08 06:11:30,406 INFO L290 TraceCheckUtils]: 79: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-08 06:11:30,406 INFO L272 TraceCheckUtils]: 78: Hoare triple {30930#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {30469#true} is VALID [2022-04-08 06:11:30,406 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {30469#true} {30930#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} #106#return; {30930#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} is VALID [2022-04-08 06:11:30,406 INFO L290 TraceCheckUtils]: 76: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-08 06:11:30,407 INFO L290 TraceCheckUtils]: 75: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-08 06:11:30,407 INFO L290 TraceCheckUtils]: 74: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-08 06:11:30,407 INFO L272 TraceCheckUtils]: 73: Hoare triple {30930#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {30469#true} is VALID [2022-04-08 06:11:30,407 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {30469#true} {30930#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} #104#return; {30930#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} is VALID [2022-04-08 06:11:30,408 INFO L290 TraceCheckUtils]: 71: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-08 06:11:30,408 INFO L290 TraceCheckUtils]: 70: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-08 06:11:30,408 INFO L290 TraceCheckUtils]: 69: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-08 06:11:30,408 INFO L272 TraceCheckUtils]: 68: Hoare triple {30930#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {30469#true} is VALID [2022-04-08 06:11:30,409 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {30469#true} {30930#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} #102#return; {30930#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} is VALID [2022-04-08 06:11:30,409 INFO L290 TraceCheckUtils]: 66: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-08 06:11:30,409 INFO L290 TraceCheckUtils]: 65: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-08 06:11:30,409 INFO L290 TraceCheckUtils]: 64: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-08 06:11:30,409 INFO L272 TraceCheckUtils]: 63: Hoare triple {30930#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {30469#true} is VALID [2022-04-08 06:11:30,409 INFO L290 TraceCheckUtils]: 62: Hoare triple {30930#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} assume !false; {30930#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} is VALID [2022-04-08 06:11:30,411 INFO L290 TraceCheckUtils]: 61: Hoare triple {30997#(<= main_~b~0 (div (+ main_~c~0 (* (- 1) main_~b~0)) 2))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {30930#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} is VALID [2022-04-08 06:11:30,412 INFO L290 TraceCheckUtils]: 60: Hoare triple {30997#(<= main_~b~0 (div (+ main_~c~0 (* (- 1) main_~b~0)) 2))} assume !false; {30997#(<= main_~b~0 (div (+ main_~c~0 (* (- 1) main_~b~0)) 2))} is VALID [2022-04-08 06:11:30,413 INFO L290 TraceCheckUtils]: 59: Hoare triple {31004#(<= main_~b~0 (+ (div (+ (- 2) main_~a~0 (* (- 1) main_~b~0)) 2) 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {30997#(<= main_~b~0 (div (+ main_~c~0 (* (- 1) main_~b~0)) 2))} is VALID [2022-04-08 06:11:30,414 INFO L290 TraceCheckUtils]: 58: Hoare triple {31004#(<= main_~b~0 (+ (div (+ (- 2) main_~a~0 (* (- 1) main_~b~0)) 2) 1))} assume !false; {31004#(<= main_~b~0 (+ (div (+ (- 2) main_~a~0 (* (- 1) main_~b~0)) 2) 1))} is VALID [2022-04-08 06:11:30,415 INFO L290 TraceCheckUtils]: 57: Hoare triple {31011#(<= main_~c~0 (+ 2 (div (+ (* (- 1) main_~c~0) main_~b~0 (- 4)) 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; {31004#(<= main_~b~0 (+ (div (+ (- 2) main_~a~0 (* (- 1) main_~b~0)) 2) 1))} is VALID [2022-04-08 06:11:30,415 INFO L290 TraceCheckUtils]: 56: Hoare triple {31011#(<= main_~c~0 (+ 2 (div (+ (* (- 1) main_~c~0) main_~b~0 (- 4)) 2)))} assume !(~c~0 >= ~b~0); {31011#(<= main_~c~0 (+ 2 (div (+ (* (- 1) main_~c~0) main_~b~0 (- 4)) 2)))} is VALID [2022-04-08 06:11:30,416 INFO L290 TraceCheckUtils]: 55: Hoare triple {31011#(<= main_~c~0 (+ 2 (div (+ (* (- 1) main_~c~0) main_~b~0 (- 4)) 2)))} assume !false; {31011#(<= main_~c~0 (+ 2 (div (+ (* (- 1) main_~c~0) main_~b~0 (- 4)) 2)))} is VALID [2022-04-08 06:11:30,417 INFO L290 TraceCheckUtils]: 54: Hoare triple {31021#(<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {31011#(<= main_~c~0 (+ 2 (div (+ (* (- 1) main_~c~0) main_~b~0 (- 4)) 2)))} is VALID [2022-04-08 06:11:30,417 INFO L290 TraceCheckUtils]: 53: Hoare triple {31025#(or (<= (* main_~v~0 2) main_~c~0) (<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3)))} assume !(~c~0 >= 2 * ~v~0); {31021#(<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3))} is VALID [2022-04-08 06:11:30,418 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {30469#true} {31025#(or (<= (* main_~v~0 2) main_~c~0) (<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3)))} #108#return; {31025#(or (<= (* main_~v~0 2) main_~c~0) (<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3)))} is VALID [2022-04-08 06:11:30,418 INFO L290 TraceCheckUtils]: 51: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-08 06:11:30,418 INFO L290 TraceCheckUtils]: 50: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-08 06:11:30,418 INFO L290 TraceCheckUtils]: 49: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-08 06:11:30,418 INFO L272 TraceCheckUtils]: 48: Hoare triple {31025#(or (<= (* main_~v~0 2) main_~c~0) (<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {30469#true} is VALID [2022-04-08 06:11:30,419 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {30469#true} {31025#(or (<= (* main_~v~0 2) main_~c~0) (<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3)))} #106#return; {31025#(or (<= (* main_~v~0 2) main_~c~0) (<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3)))} is VALID [2022-04-08 06:11:30,419 INFO L290 TraceCheckUtils]: 46: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-08 06:11:30,419 INFO L290 TraceCheckUtils]: 45: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-08 06:11:30,419 INFO L290 TraceCheckUtils]: 44: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-08 06:11:30,419 INFO L272 TraceCheckUtils]: 43: Hoare triple {31025#(or (<= (* main_~v~0 2) main_~c~0) (<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {30469#true} is VALID [2022-04-08 06:11:30,420 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {30469#true} {31025#(or (<= (* main_~v~0 2) main_~c~0) (<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3)))} #104#return; {31025#(or (<= (* main_~v~0 2) main_~c~0) (<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3)))} is VALID [2022-04-08 06:11:30,420 INFO L290 TraceCheckUtils]: 41: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-08 06:11:30,420 INFO L290 TraceCheckUtils]: 40: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-08 06:11:30,420 INFO L290 TraceCheckUtils]: 39: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-08 06:11:30,420 INFO L272 TraceCheckUtils]: 38: Hoare triple {31025#(or (<= (* main_~v~0 2) main_~c~0) (<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {30469#true} is VALID [2022-04-08 06:11:30,421 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {30469#true} {31025#(or (<= (* main_~v~0 2) main_~c~0) (<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3)))} #102#return; {31025#(or (<= (* main_~v~0 2) main_~c~0) (<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3)))} is VALID [2022-04-08 06:11:30,421 INFO L290 TraceCheckUtils]: 36: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-08 06:11:30,421 INFO L290 TraceCheckUtils]: 35: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-08 06:11:30,421 INFO L290 TraceCheckUtils]: 34: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-08 06:11:30,421 INFO L272 TraceCheckUtils]: 33: Hoare triple {31025#(or (<= (* main_~v~0 2) main_~c~0) (<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {30469#true} is VALID [2022-04-08 06:11:30,422 INFO L290 TraceCheckUtils]: 32: Hoare triple {31025#(or (<= (* main_~v~0 2) main_~c~0) (<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3)))} assume !false; {31025#(or (<= (* main_~v~0 2) main_~c~0) (<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3)))} is VALID [2022-04-08 06:11:30,423 INFO L290 TraceCheckUtils]: 31: Hoare triple {31092#(<= 0 (+ (* (div (+ (* (- 1) main_~c~0) (- 12)) 2) 2) (div (+ main_~c~0 6) 2) 11))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {31025#(or (<= (* main_~v~0 2) main_~c~0) (<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3)))} is VALID [2022-04-08 06:11:30,423 INFO L290 TraceCheckUtils]: 30: Hoare triple {31092#(<= 0 (+ (* (div (+ (* (- 1) main_~c~0) (- 12)) 2) 2) (div (+ main_~c~0 6) 2) 11))} assume !false; {31092#(<= 0 (+ (* (div (+ (* (- 1) main_~c~0) (- 12)) 2) 2) (div (+ main_~c~0 6) 2) 11))} is VALID [2022-04-08 06:11:30,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {30558#(<= main_~a~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {31092#(<= 0 (+ (* (div (+ (* (- 1) main_~c~0) (- 12)) 2) 2) (div (+ main_~c~0 6) 2) 11))} is VALID [2022-04-08 06:11:30,425 INFO L290 TraceCheckUtils]: 28: Hoare triple {30558#(<= main_~a~0 2)} assume !false; {30558#(<= main_~a~0 2)} is VALID [2022-04-08 06:11:30,425 INFO L290 TraceCheckUtils]: 27: Hoare triple {31105#(<= main_~x~0 2)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {30558#(<= main_~a~0 2)} is VALID [2022-04-08 06:11:30,425 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {30469#true} {31105#(<= main_~x~0 2)} #100#return; {31105#(<= main_~x~0 2)} is VALID [2022-04-08 06:11:30,426 INFO L290 TraceCheckUtils]: 25: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-08 06:11:30,426 INFO L290 TraceCheckUtils]: 24: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-08 06:11:30,426 INFO L290 TraceCheckUtils]: 23: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-08 06:11:30,426 INFO L272 TraceCheckUtils]: 22: Hoare triple {31105#(<= main_~x~0 2)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {30469#true} is VALID [2022-04-08 06:11:30,426 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {30469#true} {31105#(<= main_~x~0 2)} #98#return; {31105#(<= main_~x~0 2)} is VALID [2022-04-08 06:11:30,426 INFO L290 TraceCheckUtils]: 20: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-08 06:11:30,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-08 06:11:30,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-08 06:11:30,427 INFO L272 TraceCheckUtils]: 17: Hoare triple {31105#(<= main_~x~0 2)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {30469#true} is VALID [2022-04-08 06:11:30,427 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {30469#true} {31105#(<= main_~x~0 2)} #96#return; {31105#(<= main_~x~0 2)} is VALID [2022-04-08 06:11:30,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-08 06:11:30,427 INFO L290 TraceCheckUtils]: 14: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-08 06:11:30,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-08 06:11:30,427 INFO L272 TraceCheckUtils]: 12: Hoare triple {31105#(<= main_~x~0 2)} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {30469#true} is VALID [2022-04-08 06:11:30,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {31105#(<= main_~x~0 2)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {31105#(<= main_~x~0 2)} is VALID [2022-04-08 06:11:30,428 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {30499#(not (= |assume_abort_if_not_#in~cond| 0))} {30469#true} #94#return; {31105#(<= main_~x~0 2)} is VALID [2022-04-08 06:11:30,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {30499#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {30499#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:11:30,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {31166#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {30499#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:11:30,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {30469#true} ~cond := #in~cond; {31166#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-08 06:11:30,429 INFO L272 TraceCheckUtils]: 6: Hoare triple {30469#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {30469#true} is VALID [2022-04-08 06:11:30,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {30469#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {30469#true} is VALID [2022-04-08 06:11:30,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {30469#true} call #t~ret6 := main(); {30469#true} is VALID [2022-04-08 06:11:30,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30469#true} {30469#true} #112#return; {30469#true} is VALID [2022-04-08 06:11:30,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-08 06:11:30,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {30469#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); {30469#true} is VALID [2022-04-08 06:11:30,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {30469#true} call ULTIMATE.init(); {30469#true} is VALID [2022-04-08 06:11:30,431 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 29 proven. 42 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2022-04-08 06:11:30,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:11:30,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784107568] [2022-04-08 06:11:30,431 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:11:30,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11528698] [2022-04-08 06:11:30,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11528698] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:11:30,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:11:30,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2022-04-08 06:11:30,432 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:11:30,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1037392866] [2022-04-08 06:11:30,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1037392866] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:11:30,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:11:30,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 06:11:30,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428925531] [2022-04-08 06:11:30,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:11:30,445 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 116 [2022-04-08 06:11:30,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:11:30,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 06:11:30,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:11:30,538 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 06:11:30,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:11:30,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 06:11:30,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2022-04-08 06:11:30,539 INFO L87 Difference]: Start difference. First operand 259 states and 347 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 06:11:34,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:34,096 INFO L93 Difference]: Finished difference Result 376 states and 511 transitions. [2022-04-08 06:11:34,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 06:11:34,097 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 116 [2022-04-08 06:11:34,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:11:34,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 06:11:34,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 132 transitions. [2022-04-08 06:11:34,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 06:11:34,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 132 transitions. [2022-04-08 06:11:34,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 132 transitions. [2022-04-08 06:11:34,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:11:34,275 INFO L225 Difference]: With dead ends: 376 [2022-04-08 06:11:34,275 INFO L226 Difference]: Without dead ends: 259 [2022-04-08 06:11:34,276 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 206 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=200, Invalid=1132, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 06:11:34,277 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 52 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 06:11:34,277 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 346 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 06:11:34,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-08 06:11:35,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2022-04-08 06:11:35,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:11:35,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 259 states, 152 states have (on average 1.144736842105263) internal successors, (174), 153 states have internal predecessors, (174), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-04-08 06:11:35,773 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 259 states, 152 states have (on average 1.144736842105263) internal successors, (174), 153 states have internal predecessors, (174), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-04-08 06:11:35,773 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 259 states, 152 states have (on average 1.144736842105263) internal successors, (174), 153 states have internal predecessors, (174), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-04-08 06:11:35,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:35,779 INFO L93 Difference]: Finished difference Result 259 states and 346 transitions. [2022-04-08 06:11:35,780 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 346 transitions. [2022-04-08 06:11:35,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:11:35,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:11:35,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 259 states, 152 states have (on average 1.144736842105263) internal successors, (174), 153 states have internal predecessors, (174), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) Second operand 259 states. [2022-04-08 06:11:35,781 INFO L87 Difference]: Start difference. First operand has 259 states, 152 states have (on average 1.144736842105263) internal successors, (174), 153 states have internal predecessors, (174), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) Second operand 259 states. [2022-04-08 06:11:35,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:35,787 INFO L93 Difference]: Finished difference Result 259 states and 346 transitions. [2022-04-08 06:11:35,787 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 346 transitions. [2022-04-08 06:11:35,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:11:35,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:11:35,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:11:35,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:11:35,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 152 states have (on average 1.144736842105263) internal successors, (174), 153 states have internal predecessors, (174), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-04-08 06:11:35,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 346 transitions. [2022-04-08 06:11:35,795 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 346 transitions. Word has length 116 [2022-04-08 06:11:35,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:11:35,796 INFO L478 AbstractCegarLoop]: Abstraction has 259 states and 346 transitions. [2022-04-08 06:11:35,796 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 06:11:35,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 259 states and 346 transitions. [2022-04-08 06:11:36,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 346 edges. 346 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:11:36,700 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 346 transitions. [2022-04-08 06:11:36,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-08 06:11:36,701 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:11:36,701 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 5, 4, 4, 4, 4, 4, 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] [2022-04-08 06:11:36,717 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 06:11:36,901 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 06:11:36,901 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:11:36,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:11:36,902 INFO L85 PathProgramCache]: Analyzing trace with hash 2089528091, now seen corresponding path program 1 times [2022-04-08 06:11:36,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:11:36,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [347642678] [2022-04-08 06:11:36,903 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:11:36,903 INFO L85 PathProgramCache]: Analyzing trace with hash 2089528091, now seen corresponding path program 2 times [2022-04-08 06:11:36,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:11:36,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007647520] [2022-04-08 06:11:36,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:11:36,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:11:36,923 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:11:36,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1885418359] [2022-04-08 06:11:36,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:11:36,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:11:36,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:11:36,924 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 06:11:36,931 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 06:11:36,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:11:36,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:11:36,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 06:11:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:11:37,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:11:37,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {33000#true} call ULTIMATE.init(); {33000#true} is VALID [2022-04-08 06:11:37,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {33000#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); {33000#true} is VALID [2022-04-08 06:11:37,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-08 06:11:37,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33000#true} {33000#true} #112#return; {33000#true} is VALID [2022-04-08 06:11:37,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {33000#true} call #t~ret6 := main(); {33000#true} is VALID [2022-04-08 06:11:37,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {33000#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {33000#true} is VALID [2022-04-08 06:11:37,898 INFO L272 TraceCheckUtils]: 6: Hoare triple {33000#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {33000#true} is VALID [2022-04-08 06:11:37,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-08 06:11:37,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-08 06:11:37,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-08 06:11:37,898 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33000#true} {33000#true} #94#return; {33000#true} is VALID [2022-04-08 06:11:37,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {33000#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {33000#true} is VALID [2022-04-08 06:11:37,898 INFO L272 TraceCheckUtils]: 12: Hoare triple {33000#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {33000#true} is VALID [2022-04-08 06:11:37,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {33000#true} ~cond := #in~cond; {33044#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 06:11:37,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {33044#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {33048#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:11:37,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {33048#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {33048#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:11:37,900 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {33048#(not (= |assume_abort_if_not_#in~cond| 0))} {33000#true} #96#return; {33055#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 06:11:37,900 INFO L272 TraceCheckUtils]: 17: Hoare triple {33055#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {33000#true} is VALID [2022-04-08 06:11:37,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-08 06:11:37,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-08 06:11:37,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-08 06:11:37,900 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {33000#true} {33055#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #98#return; {33055#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 06:11:37,900 INFO L272 TraceCheckUtils]: 22: Hoare triple {33055#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {33000#true} is VALID [2022-04-08 06:11:37,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-08 06:11:37,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-08 06:11:37,901 INFO L290 TraceCheckUtils]: 25: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-08 06:11:37,901 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {33000#true} {33055#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #100#return; {33055#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 06:11:37,901 INFO L290 TraceCheckUtils]: 27: Hoare triple {33055#(and (<= 0 main_~y~0) (<= main_~y~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {33089#(<= main_~b~0 2)} is VALID [2022-04-08 06:11:37,902 INFO L290 TraceCheckUtils]: 28: Hoare triple {33089#(<= main_~b~0 2)} assume !false; {33089#(<= main_~b~0 2)} is VALID [2022-04-08 06:11:37,902 INFO L290 TraceCheckUtils]: 29: Hoare triple {33089#(<= main_~b~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {33089#(<= main_~b~0 2)} is VALID [2022-04-08 06:11:37,902 INFO L290 TraceCheckUtils]: 30: Hoare triple {33089#(<= main_~b~0 2)} assume !false; {33089#(<= main_~b~0 2)} is VALID [2022-04-08 06:11:37,902 INFO L290 TraceCheckUtils]: 31: Hoare triple {33089#(<= main_~b~0 2)} assume !(~c~0 >= ~b~0); {33089#(<= main_~b~0 2)} is VALID [2022-04-08 06:11:37,910 INFO L290 TraceCheckUtils]: 32: Hoare triple {33089#(<= main_~b~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {33105#(<= main_~a~0 2)} is VALID [2022-04-08 06:11:37,911 INFO L290 TraceCheckUtils]: 33: Hoare triple {33105#(<= main_~a~0 2)} assume !false; {33105#(<= main_~a~0 2)} is VALID [2022-04-08 06:11:37,911 INFO L290 TraceCheckUtils]: 34: Hoare triple {33105#(<= main_~a~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {33112#(<= main_~c~0 2)} is VALID [2022-04-08 06:11:37,912 INFO L290 TraceCheckUtils]: 35: Hoare triple {33112#(<= main_~c~0 2)} assume !false; {33112#(<= main_~c~0 2)} is VALID [2022-04-08 06:11:37,912 INFO L290 TraceCheckUtils]: 36: Hoare triple {33112#(<= main_~c~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {33119#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-08 06:11:37,913 INFO L290 TraceCheckUtils]: 37: Hoare triple {33119#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} assume !false; {33119#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-08 06:11:37,913 INFO L272 TraceCheckUtils]: 38: Hoare triple {33119#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {33000#true} is VALID [2022-04-08 06:11:37,913 INFO L290 TraceCheckUtils]: 39: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-08 06:11:37,913 INFO L290 TraceCheckUtils]: 40: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-08 06:11:37,913 INFO L290 TraceCheckUtils]: 41: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-08 06:11:37,914 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {33000#true} {33119#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} #102#return; {33119#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-08 06:11:37,914 INFO L272 TraceCheckUtils]: 43: Hoare triple {33119#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {33000#true} is VALID [2022-04-08 06:11:37,914 INFO L290 TraceCheckUtils]: 44: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-08 06:11:37,914 INFO L290 TraceCheckUtils]: 45: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-08 06:11:37,914 INFO L290 TraceCheckUtils]: 46: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-08 06:11:37,915 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {33000#true} {33119#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} #104#return; {33119#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-08 06:11:37,915 INFO L272 TraceCheckUtils]: 48: Hoare triple {33119#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {33000#true} is VALID [2022-04-08 06:11:37,915 INFO L290 TraceCheckUtils]: 49: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-08 06:11:37,915 INFO L290 TraceCheckUtils]: 50: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-08 06:11:37,915 INFO L290 TraceCheckUtils]: 51: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-08 06:11:37,916 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {33000#true} {33119#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} #106#return; {33119#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-08 06:11:37,916 INFO L272 TraceCheckUtils]: 53: Hoare triple {33119#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {33000#true} is VALID [2022-04-08 06:11:37,916 INFO L290 TraceCheckUtils]: 54: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-08 06:11:37,916 INFO L290 TraceCheckUtils]: 55: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-08 06:11:37,916 INFO L290 TraceCheckUtils]: 56: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-08 06:11:37,917 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {33000#true} {33119#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} #108#return; {33119#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-08 06:11:37,918 INFO L290 TraceCheckUtils]: 58: Hoare triple {33119#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {33186#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-08 06:11:37,918 INFO L290 TraceCheckUtils]: 59: Hoare triple {33186#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} assume !false; {33186#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-08 06:11:37,918 INFO L272 TraceCheckUtils]: 60: Hoare triple {33186#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {33000#true} is VALID [2022-04-08 06:11:37,918 INFO L290 TraceCheckUtils]: 61: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-08 06:11:37,918 INFO L290 TraceCheckUtils]: 62: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-08 06:11:37,918 INFO L290 TraceCheckUtils]: 63: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-08 06:11:37,919 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {33000#true} {33186#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #102#return; {33186#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-08 06:11:37,919 INFO L272 TraceCheckUtils]: 65: Hoare triple {33186#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {33000#true} is VALID [2022-04-08 06:11:37,919 INFO L290 TraceCheckUtils]: 66: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-08 06:11:37,919 INFO L290 TraceCheckUtils]: 67: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-08 06:11:37,919 INFO L290 TraceCheckUtils]: 68: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-08 06:11:37,920 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {33000#true} {33186#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #104#return; {33186#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-08 06:11:37,920 INFO L272 TraceCheckUtils]: 70: Hoare triple {33186#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {33000#true} is VALID [2022-04-08 06:11:37,920 INFO L290 TraceCheckUtils]: 71: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-08 06:11:37,920 INFO L290 TraceCheckUtils]: 72: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-08 06:11:37,920 INFO L290 TraceCheckUtils]: 73: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-08 06:11:37,920 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {33000#true} {33186#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #106#return; {33186#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-08 06:11:37,921 INFO L272 TraceCheckUtils]: 75: Hoare triple {33186#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {33000#true} is VALID [2022-04-08 06:11:37,921 INFO L290 TraceCheckUtils]: 76: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-08 06:11:37,921 INFO L290 TraceCheckUtils]: 77: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-08 06:11:37,921 INFO L290 TraceCheckUtils]: 78: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-08 06:11:37,921 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {33000#true} {33186#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #108#return; {33186#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-08 06:11:37,922 INFO L290 TraceCheckUtils]: 80: Hoare triple {33186#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} assume !(~c~0 >= 2 * ~v~0); {33253#(and (<= main_~c~0 2) (not (<= (* main_~v~0 2) main_~c~0)) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-08 06:11:37,923 INFO L290 TraceCheckUtils]: 81: Hoare triple {33253#(and (<= main_~c~0 2) (not (<= (* main_~v~0 2) main_~c~0)) (<= (div (- main_~v~0) (- 2)) main_~b~0))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {33257#(and (< (* main_~c~0 2) 2) (< (div (+ (- 1) (* (- 1) main_~c~0)) (- 2)) (+ main_~b~0 1)))} is VALID [2022-04-08 06:11:37,923 INFO L290 TraceCheckUtils]: 82: Hoare triple {33257#(and (< (* main_~c~0 2) 2) (< (div (+ (- 1) (* (- 1) main_~c~0)) (- 2)) (+ main_~b~0 1)))} assume !false; {33257#(and (< (* main_~c~0 2) 2) (< (div (+ (- 1) (* (- 1) main_~c~0)) (- 2)) (+ main_~b~0 1)))} is VALID [2022-04-08 06:11:37,925 INFO L290 TraceCheckUtils]: 83: Hoare triple {33257#(and (< (* main_~c~0 2) 2) (< (div (+ (- 1) (* (- 1) main_~c~0)) (- 2)) (+ main_~b~0 1)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {33001#false} is VALID [2022-04-08 06:11:37,925 INFO L290 TraceCheckUtils]: 84: Hoare triple {33001#false} assume !false; {33001#false} is VALID [2022-04-08 06:11:37,925 INFO L272 TraceCheckUtils]: 85: Hoare triple {33001#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {33001#false} is VALID [2022-04-08 06:11:37,925 INFO L290 TraceCheckUtils]: 86: Hoare triple {33001#false} ~cond := #in~cond; {33001#false} is VALID [2022-04-08 06:11:37,925 INFO L290 TraceCheckUtils]: 87: Hoare triple {33001#false} assume !(0 == ~cond); {33001#false} is VALID [2022-04-08 06:11:37,925 INFO L290 TraceCheckUtils]: 88: Hoare triple {33001#false} assume true; {33001#false} is VALID [2022-04-08 06:11:37,925 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {33001#false} {33001#false} #102#return; {33001#false} is VALID [2022-04-08 06:11:37,925 INFO L272 TraceCheckUtils]: 90: Hoare triple {33001#false} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {33001#false} is VALID [2022-04-08 06:11:37,925 INFO L290 TraceCheckUtils]: 91: Hoare triple {33001#false} ~cond := #in~cond; {33001#false} is VALID [2022-04-08 06:11:37,925 INFO L290 TraceCheckUtils]: 92: Hoare triple {33001#false} assume !(0 == ~cond); {33001#false} is VALID [2022-04-08 06:11:37,925 INFO L290 TraceCheckUtils]: 93: Hoare triple {33001#false} assume true; {33001#false} is VALID [2022-04-08 06:11:37,925 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {33001#false} {33001#false} #104#return; {33001#false} is VALID [2022-04-08 06:11:37,925 INFO L272 TraceCheckUtils]: 95: Hoare triple {33001#false} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {33001#false} is VALID [2022-04-08 06:11:37,926 INFO L290 TraceCheckUtils]: 96: Hoare triple {33001#false} ~cond := #in~cond; {33001#false} is VALID [2022-04-08 06:11:37,926 INFO L290 TraceCheckUtils]: 97: Hoare triple {33001#false} assume !(0 == ~cond); {33001#false} is VALID [2022-04-08 06:11:37,926 INFO L290 TraceCheckUtils]: 98: Hoare triple {33001#false} assume true; {33001#false} is VALID [2022-04-08 06:11:37,926 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {33001#false} {33001#false} #106#return; {33001#false} is VALID [2022-04-08 06:11:37,926 INFO L272 TraceCheckUtils]: 100: Hoare triple {33001#false} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {33001#false} is VALID [2022-04-08 06:11:37,926 INFO L290 TraceCheckUtils]: 101: Hoare triple {33001#false} ~cond := #in~cond; {33001#false} is VALID [2022-04-08 06:11:37,926 INFO L290 TraceCheckUtils]: 102: Hoare triple {33001#false} assume !(0 == ~cond); {33001#false} is VALID [2022-04-08 06:11:37,926 INFO L290 TraceCheckUtils]: 103: Hoare triple {33001#false} assume true; {33001#false} is VALID [2022-04-08 06:11:37,926 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {33001#false} {33001#false} #108#return; {33001#false} is VALID [2022-04-08 06:11:37,926 INFO L290 TraceCheckUtils]: 105: Hoare triple {33001#false} assume !(~c~0 >= 2 * ~v~0); {33001#false} is VALID [2022-04-08 06:11:37,926 INFO L290 TraceCheckUtils]: 106: Hoare triple {33001#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {33001#false} is VALID [2022-04-08 06:11:37,926 INFO L290 TraceCheckUtils]: 107: Hoare triple {33001#false} assume !false; {33001#false} is VALID [2022-04-08 06:11:37,926 INFO L290 TraceCheckUtils]: 108: Hoare triple {33001#false} assume !(~c~0 >= ~b~0); {33001#false} is VALID [2022-04-08 06:11:37,926 INFO L290 TraceCheckUtils]: 109: Hoare triple {33001#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; {33001#false} is VALID [2022-04-08 06:11:37,927 INFO L290 TraceCheckUtils]: 110: Hoare triple {33001#false} assume !false; {33001#false} is VALID [2022-04-08 06:11:37,927 INFO L290 TraceCheckUtils]: 111: Hoare triple {33001#false} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {33001#false} is VALID [2022-04-08 06:11:37,927 INFO L290 TraceCheckUtils]: 112: Hoare triple {33001#false} assume !false; {33001#false} is VALID [2022-04-08 06:11:37,927 INFO L290 TraceCheckUtils]: 113: Hoare triple {33001#false} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {33001#false} is VALID [2022-04-08 06:11:37,927 INFO L290 TraceCheckUtils]: 114: Hoare triple {33001#false} assume !false; {33001#false} is VALID [2022-04-08 06:11:37,927 INFO L272 TraceCheckUtils]: 115: Hoare triple {33001#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {33001#false} is VALID [2022-04-08 06:11:37,927 INFO L290 TraceCheckUtils]: 116: Hoare triple {33001#false} ~cond := #in~cond; {33001#false} is VALID [2022-04-08 06:11:37,927 INFO L290 TraceCheckUtils]: 117: Hoare triple {33001#false} assume 0 == ~cond; {33001#false} is VALID [2022-04-08 06:11:37,927 INFO L290 TraceCheckUtils]: 118: Hoare triple {33001#false} assume !false; {33001#false} is VALID [2022-04-08 06:11:37,928 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 183 proven. 18 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2022-04-08 06:11:37,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:11:38,693 INFO L290 TraceCheckUtils]: 118: Hoare triple {33001#false} assume !false; {33001#false} is VALID [2022-04-08 06:11:38,693 INFO L290 TraceCheckUtils]: 117: Hoare triple {33001#false} assume 0 == ~cond; {33001#false} is VALID [2022-04-08 06:11:38,693 INFO L290 TraceCheckUtils]: 116: Hoare triple {33001#false} ~cond := #in~cond; {33001#false} is VALID [2022-04-08 06:11:38,693 INFO L272 TraceCheckUtils]: 115: Hoare triple {33001#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {33001#false} is VALID [2022-04-08 06:11:38,693 INFO L290 TraceCheckUtils]: 114: Hoare triple {33001#false} assume !false; {33001#false} is VALID [2022-04-08 06:11:38,693 INFO L290 TraceCheckUtils]: 113: Hoare triple {33001#false} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {33001#false} is VALID [2022-04-08 06:11:38,693 INFO L290 TraceCheckUtils]: 112: Hoare triple {33001#false} assume !false; {33001#false} is VALID [2022-04-08 06:11:38,693 INFO L290 TraceCheckUtils]: 111: Hoare triple {33001#false} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {33001#false} is VALID [2022-04-08 06:11:38,693 INFO L290 TraceCheckUtils]: 110: Hoare triple {33001#false} assume !false; {33001#false} is VALID [2022-04-08 06:11:38,693 INFO L290 TraceCheckUtils]: 109: Hoare triple {33001#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; {33001#false} is VALID [2022-04-08 06:11:38,693 INFO L290 TraceCheckUtils]: 108: Hoare triple {33001#false} assume !(~c~0 >= ~b~0); {33001#false} is VALID [2022-04-08 06:11:38,693 INFO L290 TraceCheckUtils]: 107: Hoare triple {33001#false} assume !false; {33001#false} is VALID [2022-04-08 06:11:38,694 INFO L290 TraceCheckUtils]: 106: Hoare triple {33001#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {33001#false} is VALID [2022-04-08 06:11:38,694 INFO L290 TraceCheckUtils]: 105: Hoare triple {33001#false} assume !(~c~0 >= 2 * ~v~0); {33001#false} is VALID [2022-04-08 06:11:38,694 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {33000#true} {33001#false} #108#return; {33001#false} is VALID [2022-04-08 06:11:38,694 INFO L290 TraceCheckUtils]: 103: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-08 06:11:38,694 INFO L290 TraceCheckUtils]: 102: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-08 06:11:38,694 INFO L290 TraceCheckUtils]: 101: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-08 06:11:38,694 INFO L272 TraceCheckUtils]: 100: Hoare triple {33001#false} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {33000#true} is VALID [2022-04-08 06:11:38,694 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {33000#true} {33001#false} #106#return; {33001#false} is VALID [2022-04-08 06:11:38,694 INFO L290 TraceCheckUtils]: 98: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-08 06:11:38,694 INFO L290 TraceCheckUtils]: 97: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-08 06:11:38,694 INFO L290 TraceCheckUtils]: 96: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-08 06:11:38,694 INFO L272 TraceCheckUtils]: 95: Hoare triple {33001#false} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {33000#true} is VALID [2022-04-08 06:11:38,694 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {33000#true} {33001#false} #104#return; {33001#false} is VALID [2022-04-08 06:11:38,694 INFO L290 TraceCheckUtils]: 93: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-08 06:11:38,695 INFO L290 TraceCheckUtils]: 92: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-08 06:11:38,695 INFO L290 TraceCheckUtils]: 91: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-08 06:11:38,695 INFO L272 TraceCheckUtils]: 90: Hoare triple {33001#false} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {33000#true} is VALID [2022-04-08 06:11:38,695 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {33000#true} {33001#false} #102#return; {33001#false} is VALID [2022-04-08 06:11:38,695 INFO L290 TraceCheckUtils]: 88: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-08 06:11:38,695 INFO L290 TraceCheckUtils]: 87: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-08 06:11:38,695 INFO L290 TraceCheckUtils]: 86: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-08 06:11:38,695 INFO L272 TraceCheckUtils]: 85: Hoare triple {33001#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {33000#true} is VALID [2022-04-08 06:11:38,695 INFO L290 TraceCheckUtils]: 84: Hoare triple {33001#false} assume !false; {33001#false} is VALID [2022-04-08 06:11:38,695 INFO L290 TraceCheckUtils]: 83: Hoare triple {33474#(not (<= main_~b~0 main_~c~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {33001#false} is VALID [2022-04-08 06:11:38,696 INFO L290 TraceCheckUtils]: 82: Hoare triple {33474#(not (<= main_~b~0 main_~c~0))} assume !false; {33474#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-08 06:11:38,696 INFO L290 TraceCheckUtils]: 81: Hoare triple {33481#(< main_~c~0 (+ main_~b~0 main_~v~0))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {33474#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-08 06:11:38,697 INFO L290 TraceCheckUtils]: 80: Hoare triple {33485#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} assume !(~c~0 >= 2 * ~v~0); {33481#(< main_~c~0 (+ main_~b~0 main_~v~0))} is VALID [2022-04-08 06:11:38,697 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {33000#true} {33485#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} #108#return; {33485#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-08 06:11:38,697 INFO L290 TraceCheckUtils]: 78: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-08 06:11:38,697 INFO L290 TraceCheckUtils]: 77: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-08 06:11:38,698 INFO L290 TraceCheckUtils]: 76: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-08 06:11:38,698 INFO L272 TraceCheckUtils]: 75: Hoare triple {33485#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {33000#true} is VALID [2022-04-08 06:11:38,698 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {33000#true} {33485#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} #106#return; {33485#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-08 06:11:38,698 INFO L290 TraceCheckUtils]: 73: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-08 06:11:38,698 INFO L290 TraceCheckUtils]: 72: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-08 06:11:38,698 INFO L290 TraceCheckUtils]: 71: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-08 06:11:38,698 INFO L272 TraceCheckUtils]: 70: Hoare triple {33485#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {33000#true} is VALID [2022-04-08 06:11:38,699 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {33000#true} {33485#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} #104#return; {33485#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-08 06:11:38,699 INFO L290 TraceCheckUtils]: 68: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-08 06:11:38,699 INFO L290 TraceCheckUtils]: 67: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-08 06:11:38,699 INFO L290 TraceCheckUtils]: 66: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-08 06:11:38,699 INFO L272 TraceCheckUtils]: 65: Hoare triple {33485#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {33000#true} is VALID [2022-04-08 06:11:38,700 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {33000#true} {33485#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} #102#return; {33485#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-08 06:11:38,700 INFO L290 TraceCheckUtils]: 63: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-08 06:11:38,700 INFO L290 TraceCheckUtils]: 62: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-08 06:11:38,700 INFO L290 TraceCheckUtils]: 61: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-08 06:11:38,700 INFO L272 TraceCheckUtils]: 60: Hoare triple {33485#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {33000#true} is VALID [2022-04-08 06:11:38,701 INFO L290 TraceCheckUtils]: 59: Hoare triple {33485#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} assume !false; {33485#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-08 06:11:38,702 INFO L290 TraceCheckUtils]: 58: Hoare triple {33552#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {33485#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-08 06:11:38,702 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {33000#true} {33552#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #108#return; {33552#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-08 06:11:38,702 INFO L290 TraceCheckUtils]: 56: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-08 06:11:38,702 INFO L290 TraceCheckUtils]: 55: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-08 06:11:38,702 INFO L290 TraceCheckUtils]: 54: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-08 06:11:38,702 INFO L272 TraceCheckUtils]: 53: Hoare triple {33552#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {33000#true} is VALID [2022-04-08 06:11:38,703 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {33000#true} {33552#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #106#return; {33552#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-08 06:11:38,703 INFO L290 TraceCheckUtils]: 51: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-08 06:11:38,703 INFO L290 TraceCheckUtils]: 50: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-08 06:11:38,703 INFO L290 TraceCheckUtils]: 49: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-08 06:11:38,703 INFO L272 TraceCheckUtils]: 48: Hoare triple {33552#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {33000#true} is VALID [2022-04-08 06:11:38,704 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {33000#true} {33552#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #104#return; {33552#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-08 06:11:38,704 INFO L290 TraceCheckUtils]: 46: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-08 06:11:38,704 INFO L290 TraceCheckUtils]: 45: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-08 06:11:38,704 INFO L290 TraceCheckUtils]: 44: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-08 06:11:38,704 INFO L272 TraceCheckUtils]: 43: Hoare triple {33552#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {33000#true} is VALID [2022-04-08 06:11:38,705 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {33000#true} {33552#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #102#return; {33552#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-08 06:11:38,705 INFO L290 TraceCheckUtils]: 41: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-08 06:11:38,705 INFO L290 TraceCheckUtils]: 40: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-08 06:11:38,705 INFO L290 TraceCheckUtils]: 39: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-08 06:11:38,705 INFO L272 TraceCheckUtils]: 38: Hoare triple {33552#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {33000#true} is VALID [2022-04-08 06:11:38,705 INFO L290 TraceCheckUtils]: 37: Hoare triple {33552#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} assume !false; {33552#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-08 06:11:38,707 INFO L290 TraceCheckUtils]: 36: Hoare triple {33619#(<= main_~c~0 (+ (div main_~c~0 2) (div (div main_~c~0 2) 2) 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {33552#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-08 06:11:38,707 INFO L290 TraceCheckUtils]: 35: Hoare triple {33619#(<= main_~c~0 (+ (div main_~c~0 2) (div (div main_~c~0 2) 2) 1))} assume !false; {33619#(<= main_~c~0 (+ (div main_~c~0 2) (div (div main_~c~0 2) 2) 1))} is VALID [2022-04-08 06:11:38,707 INFO L290 TraceCheckUtils]: 34: Hoare triple {33105#(<= main_~a~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {33619#(<= main_~c~0 (+ (div main_~c~0 2) (div (div main_~c~0 2) 2) 1))} is VALID [2022-04-08 06:11:38,708 INFO L290 TraceCheckUtils]: 33: Hoare triple {33105#(<= main_~a~0 2)} assume !false; {33105#(<= main_~a~0 2)} is VALID [2022-04-08 06:11:38,708 INFO L290 TraceCheckUtils]: 32: Hoare triple {33089#(<= main_~b~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {33105#(<= main_~a~0 2)} is VALID [2022-04-08 06:11:38,708 INFO L290 TraceCheckUtils]: 31: Hoare triple {33089#(<= main_~b~0 2)} assume !(~c~0 >= ~b~0); {33089#(<= main_~b~0 2)} is VALID [2022-04-08 06:11:38,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {33089#(<= main_~b~0 2)} assume !false; {33089#(<= main_~b~0 2)} is VALID [2022-04-08 06:11:38,709 INFO L290 TraceCheckUtils]: 29: Hoare triple {33089#(<= main_~b~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {33089#(<= main_~b~0 2)} is VALID [2022-04-08 06:11:38,709 INFO L290 TraceCheckUtils]: 28: Hoare triple {33089#(<= main_~b~0 2)} assume !false; {33089#(<= main_~b~0 2)} is VALID [2022-04-08 06:11:38,710 INFO L290 TraceCheckUtils]: 27: Hoare triple {33647#(<= main_~y~0 2)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {33089#(<= main_~b~0 2)} is VALID [2022-04-08 06:11:38,710 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {33000#true} {33647#(<= main_~y~0 2)} #100#return; {33647#(<= main_~y~0 2)} is VALID [2022-04-08 06:11:38,710 INFO L290 TraceCheckUtils]: 25: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-08 06:11:38,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-08 06:11:38,710 INFO L290 TraceCheckUtils]: 23: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-08 06:11:38,710 INFO L272 TraceCheckUtils]: 22: Hoare triple {33647#(<= main_~y~0 2)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {33000#true} is VALID [2022-04-08 06:11:38,711 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {33000#true} {33647#(<= main_~y~0 2)} #98#return; {33647#(<= main_~y~0 2)} is VALID [2022-04-08 06:11:38,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-08 06:11:38,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-08 06:11:38,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-08 06:11:38,711 INFO L272 TraceCheckUtils]: 17: Hoare triple {33647#(<= main_~y~0 2)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {33000#true} is VALID [2022-04-08 06:11:38,711 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {33048#(not (= |assume_abort_if_not_#in~cond| 0))} {33000#true} #96#return; {33647#(<= main_~y~0 2)} is VALID [2022-04-08 06:11:38,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {33048#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {33048#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:11:38,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {33690#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {33048#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:11:38,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {33000#true} ~cond := #in~cond; {33690#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-08 06:11:38,712 INFO L272 TraceCheckUtils]: 12: Hoare triple {33000#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {33000#true} is VALID [2022-04-08 06:11:38,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {33000#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {33000#true} is VALID [2022-04-08 06:11:38,713 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33000#true} {33000#true} #94#return; {33000#true} is VALID [2022-04-08 06:11:38,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-08 06:11:38,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-08 06:11:38,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-08 06:11:38,713 INFO L272 TraceCheckUtils]: 6: Hoare triple {33000#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {33000#true} is VALID [2022-04-08 06:11:38,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {33000#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {33000#true} is VALID [2022-04-08 06:11:38,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {33000#true} call #t~ret6 := main(); {33000#true} is VALID [2022-04-08 06:11:38,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33000#true} {33000#true} #112#return; {33000#true} is VALID [2022-04-08 06:11:38,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-08 06:11:38,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {33000#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); {33000#true} is VALID [2022-04-08 06:11:38,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {33000#true} call ULTIMATE.init(); {33000#true} is VALID [2022-04-08 06:11:38,721 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 61 proven. 20 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2022-04-08 06:11:38,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:11:38,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007647520] [2022-04-08 06:11:38,721 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:11:38,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885418359] [2022-04-08 06:11:38,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885418359] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:11:38,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:11:38,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-04-08 06:11:38,722 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:11:38,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [347642678] [2022-04-08 06:11:38,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [347642678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:11:38,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:11:38,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 06:11:38,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234254445] [2022-04-08 06:11:38,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:11:38,723 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 5 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 119 [2022-04-08 06:11:38,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:11:38,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 5 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 06:11:38,793 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 06:11:38,793 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 06:11:38,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:11:38,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 06:11:38,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-04-08 06:11:38,794 INFO L87 Difference]: Start difference. First operand 259 states and 346 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 5 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 06:11:40,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:40,979 INFO L93 Difference]: Finished difference Result 318 states and 413 transitions. [2022-04-08 06:11:40,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 06:11:40,980 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 5 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 119 [2022-04-08 06:11:40,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:11:40,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 5 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 06:11:40,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 97 transitions. [2022-04-08 06:11:40,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 5 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 06:11:40,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 97 transitions. [2022-04-08 06:11:40,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 97 transitions. [2022-04-08 06:11:41,100 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 06:11:41,103 INFO L225 Difference]: With dead ends: 318 [2022-04-08 06:11:41,103 INFO L226 Difference]: Without dead ends: 141 [2022-04-08 06:11:41,104 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2022-04-08 06:11:41,104 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 37 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 06:11:41,104 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 249 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 06:11:41,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-04-08 06:11:41,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-04-08 06:11:41,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:11:41,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 141 states, 87 states have (on average 1.0459770114942528) internal successors, (91), 88 states have internal predecessors, (91), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 06:11:41,841 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 141 states, 87 states have (on average 1.0459770114942528) internal successors, (91), 88 states have internal predecessors, (91), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 06:11:41,841 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 141 states, 87 states have (on average 1.0459770114942528) internal successors, (91), 88 states have internal predecessors, (91), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 06:11:41,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:41,843 INFO L93 Difference]: Finished difference Result 141 states and 167 transitions. [2022-04-08 06:11:41,843 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 167 transitions. [2022-04-08 06:11:41,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:11:41,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:11:41,844 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 87 states have (on average 1.0459770114942528) internal successors, (91), 88 states have internal predecessors, (91), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 141 states. [2022-04-08 06:11:41,855 INFO L87 Difference]: Start difference. First operand has 141 states, 87 states have (on average 1.0459770114942528) internal successors, (91), 88 states have internal predecessors, (91), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 141 states. [2022-04-08 06:11:41,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:41,858 INFO L93 Difference]: Finished difference Result 141 states and 167 transitions. [2022-04-08 06:11:41,858 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 167 transitions. [2022-04-08 06:11:41,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:11:41,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:11:41,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:11:41,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:11:41,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 87 states have (on average 1.0459770114942528) internal successors, (91), 88 states have internal predecessors, (91), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 06:11:41,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 167 transitions. [2022-04-08 06:11:41,861 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 167 transitions. Word has length 119 [2022-04-08 06:11:41,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:11:41,862 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 167 transitions. [2022-04-08 06:11:41,862 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 5 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 06:11:41,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 141 states and 167 transitions. [2022-04-08 06:11:42,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:11:42,988 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 167 transitions. [2022-04-08 06:11:42,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-04-08 06:11:42,989 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:11:42,989 INFO L499 BasicCegarLoop]: trace histogram [21, 20, 20, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 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 06:11:43,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-08 06:11:43,189 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 06:11:43,190 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:11:43,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:11:43,190 INFO L85 PathProgramCache]: Analyzing trace with hash 2097211745, now seen corresponding path program 15 times [2022-04-08 06:11:43,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:11:43,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1217770937] [2022-04-08 06:11:43,191 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:11:43,191 INFO L85 PathProgramCache]: Analyzing trace with hash 2097211745, now seen corresponding path program 16 times [2022-04-08 06:11:43,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:11:43,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894916755] [2022-04-08 06:11:43,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:11:43,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:11:43,215 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:11:43,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1731357439] [2022-04-08 06:11:43,215 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:11:43,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:11:43,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:11:43,216 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 06:11:43,218 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 06:11:43,305 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:11:43,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:11:43,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 06:11:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:11:43,336 INFO L286 TraceCheckSpWp]: Computing forward predicates...