/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/egcd-ll_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 05:42:27,134 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 05:42:27,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 05:42:27,169 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 05:42:27,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 05:42:27,170 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 05:42:27,171 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 05:42:27,172 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 05:42:27,173 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 05:42:27,174 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 05:42:27,174 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 05:42:27,175 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 05:42:27,175 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 05:42:27,176 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 05:42:27,176 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 05:42:27,177 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 05:42:27,177 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 05:42:27,178 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 05:42:27,179 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 05:42:27,180 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 05:42:27,181 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 05:42:27,182 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 05:42:27,183 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 05:42:27,184 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 05:42:27,184 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 05:42:27,186 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 05:42:27,187 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 05:42:27,187 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 05:42:27,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 05:42:27,188 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 05:42:27,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 05:42:27,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 05:42:27,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 05:42:27,189 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 05:42:27,190 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 05:42:27,191 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 05:42:27,191 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 05:42:27,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 05:42:27,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 05:42:27,192 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 05:42:27,192 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 05:42:27,193 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 05:42:27,193 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:42:27,199 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 05:42:27,199 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 05:42:27,200 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 05:42:27,200 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 05:42:27,201 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 05:42:27,201 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 05:42:27,201 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 05:42:27,201 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 05:42:27,201 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 05:42:27,201 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 05:42:27,201 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 05:42:27,202 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 05:42:27,202 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 05:42:27,202 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 05:42:27,202 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 05:42:27,202 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 05:42:27,202 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 05:42:27,202 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 05:42:27,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 05:42:27,203 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 05:42:27,203 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 05:42:27,203 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 05:42:27,203 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 05:42:27,203 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 05:42:27,203 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 05:42:27,203 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:42:27,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 05:42:27,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 05:42:27,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 05:42:27,383 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 05:42:27,384 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 05:42:27,385 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound5.c [2022-04-08 05:42:27,422 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f722a471/a156a05c174c4c8680f5b90348f7112f/FLAG90e1bb430 [2022-04-08 05:42:27,772 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 05:42:27,772 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound5.c [2022-04-08 05:42:27,776 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f722a471/a156a05c174c4c8680f5b90348f7112f/FLAG90e1bb430 [2022-04-08 05:42:27,783 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f722a471/a156a05c174c4c8680f5b90348f7112f [2022-04-08 05:42:27,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 05:42:27,786 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 05:42:27,786 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 05:42:27,786 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 05:42:27,788 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 05:42:27,789 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 05:42:27" (1/1) ... [2022-04-08 05:42:27,790 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b66bfdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:42:27, skipping insertion in model container [2022-04-08 05:42:27,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 05:42:27" (1/1) ... [2022-04-08 05:42:27,797 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 05:42:27,805 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 05:42:27,924 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/egcd-ll_valuebound5.c[489,502] [2022-04-08 05:42:27,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 05:42:27,944 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 05:42:27,952 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/egcd-ll_valuebound5.c[489,502] [2022-04-08 05:42:27,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 05:42:27,974 INFO L208 MainTranslator]: Completed translation [2022-04-08 05:42:27,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:42:27 WrapperNode [2022-04-08 05:42:27,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 05:42:27,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 05:42:27,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 05:42:27,975 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 05:42:27,984 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:42:27" (1/1) ... [2022-04-08 05:42:27,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:42:27" (1/1) ... [2022-04-08 05:42:27,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:42:27" (1/1) ... [2022-04-08 05:42:27,989 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:42:27" (1/1) ... [2022-04-08 05:42:28,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:42:27" (1/1) ... [2022-04-08 05:42:28,009 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:42:27" (1/1) ... [2022-04-08 05:42:28,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:42:27" (1/1) ... [2022-04-08 05:42:28,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 05:42:28,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 05:42:28,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 05:42:28,012 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 05:42:28,013 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:42:27" (1/1) ... [2022-04-08 05:42:28,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 05:42:28,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:42:28,035 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:42:28,036 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:42:28,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 05:42:28,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 05:42:28,057 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 05:42:28,057 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 05:42:28,057 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 05:42:28,057 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 05:42:28,057 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 05:42:28,057 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 05:42:28,058 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 05:42:28,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 05:42:28,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 05:42:28,058 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 05:42:28,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 05:42:28,058 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 05:42:28,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 05:42:28,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 05:42:28,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 05:42:28,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 05:42:28,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 05:42:28,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 05:42:28,101 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 05:42:28,102 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 05:42:28,248 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 05:42:28,255 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 05:42:28,255 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 05:42:28,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 05:42:28 BoogieIcfgContainer [2022-04-08 05:42:28,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 05:42:28,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 05:42:28,257 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 05:42:28,259 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 05:42:28,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 05:42:27" (1/3) ... [2022-04-08 05:42:28,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3484e719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 05:42:28, skipping insertion in model container [2022-04-08 05:42:28,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:42:27" (2/3) ... [2022-04-08 05:42:28,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3484e719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 05:42:28, skipping insertion in model container [2022-04-08 05:42:28,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 05:42:28" (3/3) ... [2022-04-08 05:42:28,261 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd-ll_valuebound5.c [2022-04-08 05:42:28,264 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 05:42:28,264 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 05:42:28,290 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 05:42:28,294 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:42:28,294 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 05:42:28,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 05:42:28,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 05:42:28,311 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:42:28,311 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:42:28,312 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:42:28,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:42:28,315 INFO L85 PathProgramCache]: Analyzing trace with hash 870870740, now seen corresponding path program 1 times [2022-04-08 05:42:28,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:42:28,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1339980215] [2022-04-08 05:42:28,327 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:42:28,327 INFO L85 PathProgramCache]: Analyzing trace with hash 870870740, now seen corresponding path program 2 times [2022-04-08 05:42:28,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:42:28,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622784713] [2022-04-08 05:42:28,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:42:28,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:42:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:42:28,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 05:42:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:42:28,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {61#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40#true} is VALID [2022-04-08 05:42:28,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-08 05:42:28,485 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #88#return; {40#true} is VALID [2022-04-08 05:42:28,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 05:42:28,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:42:28,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 05:42:28,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 05:42:28,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 05:42:28,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #66#return; {41#false} is VALID [2022-04-08 05:42:28,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 05:42:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:42:28,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 05:42:28,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 05:42:28,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 05:42:28,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #68#return; {41#false} is VALID [2022-04-08 05:42:28,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 05:42:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:42:28,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 05:42:28,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 05:42:28,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 05:42:28,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #70#return; {41#false} is VALID [2022-04-08 05:42:28,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-08 05:42:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:42:28,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 05:42:28,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 05:42:28,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 05:42:28,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #72#return; {41#false} is VALID [2022-04-08 05:42:28,527 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {61#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 05:42:28,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {61#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40#true} is VALID [2022-04-08 05:42:28,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-08 05:42:28,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #88#return; {40#true} is VALID [2022-04-08 05:42:28,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret6 := main(); {40#true} is VALID [2022-04-08 05:42:28,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {40#true} is VALID [2022-04-08 05:42:28,528 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {40#true} is VALID [2022-04-08 05:42:28,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 05:42:28,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 05:42:28,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 05:42:28,530 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #66#return; {41#false} is VALID [2022-04-08 05:42:28,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {41#false} is VALID [2022-04-08 05:42:28,530 INFO L272 TraceCheckUtils]: 12: Hoare triple {41#false} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {40#true} is VALID [2022-04-08 05:42:28,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 05:42:28,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 05:42:28,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 05:42:28,531 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {41#false} {41#false} #68#return; {41#false} is VALID [2022-04-08 05:42:28,531 INFO L272 TraceCheckUtils]: 17: Hoare triple {41#false} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {40#true} is VALID [2022-04-08 05:42:28,532 INFO L290 TraceCheckUtils]: 18: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 05:42:28,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 05:42:28,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 05:42:28,533 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {41#false} {41#false} #70#return; {41#false} is VALID [2022-04-08 05:42:28,533 INFO L272 TraceCheckUtils]: 22: Hoare triple {41#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {40#true} is VALID [2022-04-08 05:42:28,533 INFO L290 TraceCheckUtils]: 23: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 05:42:28,534 INFO L290 TraceCheckUtils]: 24: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 05:42:28,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 05:42:28,535 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {41#false} {41#false} #72#return; {41#false} is VALID [2022-04-08 05:42:28,535 INFO L290 TraceCheckUtils]: 27: Hoare triple {41#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {41#false} is VALID [2022-04-08 05:42:28,535 INFO L290 TraceCheckUtils]: 28: Hoare triple {41#false} assume false; {41#false} is VALID [2022-04-08 05:42:28,537 INFO L272 TraceCheckUtils]: 29: Hoare triple {41#false} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {41#false} is VALID [2022-04-08 05:42:28,538 INFO L290 TraceCheckUtils]: 30: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-08 05:42:28,538 INFO L290 TraceCheckUtils]: 31: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-08 05:42:28,538 INFO L290 TraceCheckUtils]: 32: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-08 05:42:28,538 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:42:28,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:42:28,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622784713] [2022-04-08 05:42:28,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622784713] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:42:28,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:42:28,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 05:42:28,541 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:42:28,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1339980215] [2022-04-08 05:42:28,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1339980215] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:42:28,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:42:28,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 05:42:28,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136527279] [2022-04-08 05:42:28,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:42:28,546 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:42:28,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:42:28,551 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:42:28,590 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:42:28,591 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 05:42:28,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:42:28,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 05:42:28,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 05:42:28,618 INFO L87 Difference]: Start difference. First operand has 37 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) 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:42:28,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:42:28,803 INFO L93 Difference]: Finished difference Result 67 states and 105 transitions. [2022-04-08 05:42:28,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 05:42:28,803 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:42:28,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:42:28,805 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:42:28,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2022-04-08 05:42:28,820 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:42:28,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2022-04-08 05:42:28,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 105 transitions. [2022-04-08 05:42:28,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:42:28,950 INFO L225 Difference]: With dead ends: 67 [2022-04-08 05:42:28,950 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 05:42:28,959 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:42:28,962 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 05:42:28,963 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 39 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:42:28,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 05:42:28,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 05:42:29,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:42:29,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 05:42:29,001 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 05:42:29,001 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 05:42:29,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:42:29,009 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-08 05:42:29,010 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 05:42:29,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:42:29,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:42:29,011 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-08 05:42:29,012 INFO L87 Difference]: Start difference. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-08 05:42:29,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:42:29,017 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-08 05:42:29,017 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 05:42:29,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:42:29,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:42:29,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:42:29,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:42:29,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 05:42:29,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-08 05:42:29,026 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 33 [2022-04-08 05:42:29,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:42:29,027 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-08 05:42:29,027 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:42:29,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-08 05:42:29,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:42:29,083 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 05:42:29,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 05:42:29,085 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:42:29,085 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:42:29,086 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 05:42:29,086 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:42:29,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:42:29,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1006914976, now seen corresponding path program 1 times [2022-04-08 05:42:29,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:42:29,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [349718720] [2022-04-08 05:42:29,090 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:42:29,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1006914976, now seen corresponding path program 2 times [2022-04-08 05:42:29,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:42:29,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979978155] [2022-04-08 05:42:29,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:42:29,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:42:29,117 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:42:29,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [876601612] [2022-04-08 05:42:29,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:42:29,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:42:29,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:42:29,119 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:42:29,125 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:42:29,166 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 05:42:29,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:42:29,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 05:42:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:42:29,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:42:29,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {326#true} call ULTIMATE.init(); {326#true} is VALID [2022-04-08 05:42:29,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {326#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {326#true} is VALID [2022-04-08 05:42:29,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-08 05:42:29,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {326#true} {326#true} #88#return; {326#true} is VALID [2022-04-08 05:42:29,359 INFO L272 TraceCheckUtils]: 4: Hoare triple {326#true} call #t~ret6 := main(); {326#true} is VALID [2022-04-08 05:42:29,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {326#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {326#true} is VALID [2022-04-08 05:42:29,359 INFO L272 TraceCheckUtils]: 6: Hoare triple {326#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {326#true} is VALID [2022-04-08 05:42:29,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID [2022-04-08 05:42:29,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID [2022-04-08 05:42:29,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-08 05:42:29,360 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {326#true} {326#true} #66#return; {326#true} is VALID [2022-04-08 05:42:29,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {326#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {326#true} is VALID [2022-04-08 05:42:29,360 INFO L272 TraceCheckUtils]: 12: Hoare triple {326#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {326#true} is VALID [2022-04-08 05:42:29,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID [2022-04-08 05:42:29,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID [2022-04-08 05:42:29,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-08 05:42:29,361 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {326#true} {326#true} #68#return; {326#true} is VALID [2022-04-08 05:42:29,361 INFO L272 TraceCheckUtils]: 17: Hoare triple {326#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {326#true} is VALID [2022-04-08 05:42:29,361 INFO L290 TraceCheckUtils]: 18: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID [2022-04-08 05:42:29,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID [2022-04-08 05:42:29,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-08 05:42:29,362 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {326#true} {326#true} #70#return; {326#true} is VALID [2022-04-08 05:42:29,362 INFO L272 TraceCheckUtils]: 22: Hoare triple {326#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {326#true} is VALID [2022-04-08 05:42:29,362 INFO L290 TraceCheckUtils]: 23: Hoare triple {326#true} ~cond := #in~cond; {326#true} is VALID [2022-04-08 05:42:29,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {326#true} assume !(0 == ~cond); {326#true} is VALID [2022-04-08 05:42:29,363 INFO L290 TraceCheckUtils]: 25: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-08 05:42:29,363 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {326#true} {326#true} #72#return; {326#true} is VALID [2022-04-08 05:42:29,364 INFO L290 TraceCheckUtils]: 27: Hoare triple {326#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {412#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-08 05:42:29,365 INFO L290 TraceCheckUtils]: 28: Hoare triple {412#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} assume !false; {412#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-08 05:42:29,366 INFO L272 TraceCheckUtils]: 29: Hoare triple {412#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {419#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:42:29,366 INFO L290 TraceCheckUtils]: 30: Hoare triple {419#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {423#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:42:29,367 INFO L290 TraceCheckUtils]: 31: Hoare triple {423#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {327#false} is VALID [2022-04-08 05:42:29,367 INFO L290 TraceCheckUtils]: 32: Hoare triple {327#false} assume !false; {327#false} is VALID [2022-04-08 05:42:29,368 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:42:29,368 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:42:29,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:42:29,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979978155] [2022-04-08 05:42:29,368 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:42:29,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876601612] [2022-04-08 05:42:29,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876601612] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:42:29,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:42:29,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:42:29,370 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:42:29,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [349718720] [2022-04-08 05:42:29,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [349718720] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:42:29,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:42:29,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:42:29,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777305219] [2022-04-08 05:42:29,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:42:29,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 33 [2022-04-08 05:42:29,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:42:29,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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:42:29,389 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:42:29,390 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 05:42:29,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:42:29,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 05:42:29,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 05:42:29,391 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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:42:29,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:42:29,593 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-04-08 05:42:29,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 05:42:29,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 33 [2022-04-08 05:42:29,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:42:29,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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:42:29,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 05:42:29,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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:42:29,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 05:42:29,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-08 05:42:29,643 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:42:29,644 INFO L225 Difference]: With dead ends: 48 [2022-04-08 05:42:29,644 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 05:42:29,645 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 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:42:29,646 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 05:42:29,646 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 143 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:42:29,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 05:42:29,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-04-08 05:42:29,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:42:29,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 05:42:29,665 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 05:42:29,666 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 05:42:29,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:42:29,674 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-04-08 05:42:29,674 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-04-08 05:42:29,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:42:29,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:42:29,681 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 46 states. [2022-04-08 05:42:29,682 INFO L87 Difference]: Start difference. First operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 46 states. [2022-04-08 05:42:29,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:42:29,689 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-04-08 05:42:29,689 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-04-08 05:42:29,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:42:29,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:42:29,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:42:29,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:42:29,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 05:42:29,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2022-04-08 05:42:29,692 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 33 [2022-04-08 05:42:29,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:42:29,692 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2022-04-08 05:42:29,692 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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:42:29,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 62 transitions. [2022-04-08 05:42:29,761 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:42:29,761 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-08 05:42:29,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 05:42:29,762 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:42:29,762 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] [2022-04-08 05:42:29,783 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:42:29,981 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:42:29,982 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:42:29,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:42:29,982 INFO L85 PathProgramCache]: Analyzing trace with hash -124657161, now seen corresponding path program 1 times [2022-04-08 05:42:29,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:42:29,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [326991115] [2022-04-08 05:42:29,983 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:42:29,983 INFO L85 PathProgramCache]: Analyzing trace with hash -124657161, now seen corresponding path program 2 times [2022-04-08 05:42:29,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:42:29,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206552411] [2022-04-08 05:42:29,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:42:29,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:42:30,002 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:42:30,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2027399574] [2022-04-08 05:42:30,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:42:30,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:42:30,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:42:30,020 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:42:30,021 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:42:30,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:42:30,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:42:30,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 05:42:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:42:30,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:42:30,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {709#true} call ULTIMATE.init(); {709#true} is VALID [2022-04-08 05:42:30,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {709#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(10, 2);call #Ultimate.allocInit(12, 3); {709#true} is VALID [2022-04-08 05:42:30,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {709#true} assume true; {709#true} is VALID [2022-04-08 05:42:30,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {709#true} {709#true} #88#return; {709#true} is VALID [2022-04-08 05:42:30,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {709#true} call #t~ret6 := main(); {709#true} is VALID [2022-04-08 05:42:30,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {709#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {709#true} is VALID [2022-04-08 05:42:30,213 INFO L272 TraceCheckUtils]: 6: Hoare triple {709#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {709#true} is VALID [2022-04-08 05:42:30,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {709#true} ~cond := #in~cond; {709#true} is VALID [2022-04-08 05:42:30,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {709#true} assume !(0 == ~cond); {709#true} is VALID [2022-04-08 05:42:30,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {709#true} assume true; {709#true} is VALID [2022-04-08 05:42:30,214 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {709#true} {709#true} #66#return; {709#true} is VALID [2022-04-08 05:42:30,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {709#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {709#true} is VALID [2022-04-08 05:42:30,214 INFO L272 TraceCheckUtils]: 12: Hoare triple {709#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {709#true} is VALID [2022-04-08 05:42:30,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {709#true} ~cond := #in~cond; {709#true} is VALID [2022-04-08 05:42:30,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {709#true} assume !(0 == ~cond); {709#true} is VALID [2022-04-08 05:42:30,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {709#true} assume true; {709#true} is VALID [2022-04-08 05:42:30,214 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {709#true} {709#true} #68#return; {709#true} is VALID [2022-04-08 05:42:30,215 INFO L272 TraceCheckUtils]: 17: Hoare triple {709#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {709#true} is VALID [2022-04-08 05:42:30,215 INFO L290 TraceCheckUtils]: 18: Hoare triple {709#true} ~cond := #in~cond; {709#true} is VALID [2022-04-08 05:42:30,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {709#true} assume !(0 == ~cond); {709#true} is VALID [2022-04-08 05:42:30,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {709#true} assume true; {709#true} is VALID [2022-04-08 05:42:30,215 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {709#true} {709#true} #70#return; {709#true} is VALID [2022-04-08 05:42:30,215 INFO L272 TraceCheckUtils]: 22: Hoare triple {709#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {709#true} is VALID [2022-04-08 05:42:30,215 INFO L290 TraceCheckUtils]: 23: Hoare triple {709#true} ~cond := #in~cond; {709#true} is VALID [2022-04-08 05:42:30,215 INFO L290 TraceCheckUtils]: 24: Hoare triple {709#true} assume !(0 == ~cond); {709#true} is VALID [2022-04-08 05:42:30,215 INFO L290 TraceCheckUtils]: 25: Hoare triple {709#true} assume true; {709#true} is VALID [2022-04-08 05:42:30,216 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {709#true} {709#true} #72#return; {709#true} is VALID [2022-04-08 05:42:30,216 INFO L290 TraceCheckUtils]: 27: Hoare triple {709#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {795#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:42:30,217 INFO L290 TraceCheckUtils]: 28: Hoare triple {795#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {795#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:42:30,217 INFO L272 TraceCheckUtils]: 29: Hoare triple {795#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {709#true} is VALID [2022-04-08 05:42:30,217 INFO L290 TraceCheckUtils]: 30: Hoare triple {709#true} ~cond := #in~cond; {709#true} is VALID [2022-04-08 05:42:30,217 INFO L290 TraceCheckUtils]: 31: Hoare triple {709#true} assume !(0 == ~cond); {709#true} is VALID [2022-04-08 05:42:30,217 INFO L290 TraceCheckUtils]: 32: Hoare triple {709#true} assume true; {709#true} is VALID [2022-04-08 05:42:30,218 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {709#true} {795#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #74#return; {795#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:42:30,219 INFO L272 TraceCheckUtils]: 34: Hoare triple {795#(and (= main_~r~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)); {817#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:42:30,222 INFO L290 TraceCheckUtils]: 35: Hoare triple {817#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {821#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:42:30,223 INFO L290 TraceCheckUtils]: 36: Hoare triple {821#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {710#false} is VALID [2022-04-08 05:42:30,223 INFO L290 TraceCheckUtils]: 37: Hoare triple {710#false} assume !false; {710#false} is VALID [2022-04-08 05:42:30,223 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 05:42:30,223 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:42:30,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:42:30,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206552411] [2022-04-08 05:42:30,223 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:42:30,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027399574] [2022-04-08 05:42:30,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027399574] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:42:30,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:42:30,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:42:30,224 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:42:30,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [326991115] [2022-04-08 05:42:30,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [326991115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:42:30,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:42:30,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:42:30,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009051332] [2022-04-08 05:42:30,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:42:30,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2022-04-08 05:42:30,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:42:30,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 05:42:30,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:42:30,261 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 05:42:30,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:42:30,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 05:42:30,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 05:42:30,262 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 05:42:30,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:42:30,443 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2022-04-08 05:42:30,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 05:42:30,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2022-04-08 05:42:30,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:42:30,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 05:42:30,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 05:42:30,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 05:42:30,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 05:42:30,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-08 05:42:30,495 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:42:30,497 INFO L225 Difference]: With dead ends: 52 [2022-04-08 05:42:30,497 INFO L226 Difference]: Without dead ends: 50 [2022-04-08 05:42:30,497 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 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:42:30,498 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 05:42:30,498 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 140 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:42:30,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-08 05:42:30,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-04-08 05:42:30,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:42:30,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 05:42:30,510 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 05:42:30,510 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 05:42:30,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:42:30,512 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-08 05:42:30,512 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-08 05:42:30,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:42:30,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:42:30,513 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 50 states. [2022-04-08 05:42:30,513 INFO L87 Difference]: Start difference. First operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 50 states. [2022-04-08 05:42:30,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:42:30,515 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-08 05:42:30,515 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-08 05:42:30,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:42:30,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:42:30,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:42:30,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:42:30,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 05:42:30,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2022-04-08 05:42:30,518 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 38 [2022-04-08 05:42:30,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:42:30,518 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2022-04-08 05:42:30,518 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 05:42:30,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 65 transitions. [2022-04-08 05:42:30,579 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:42:30,579 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-08 05:42:30,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 05:42:30,580 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:42:30,580 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] [2022-04-08 05:42:30,598 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:42:30,795 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:42:30,795 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:42:30,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:42:30,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1732898944, now seen corresponding path program 1 times [2022-04-08 05:42:30,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:42:30,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2015556332] [2022-04-08 05:42:30,797 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:42:30,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1732898944, now seen corresponding path program 2 times [2022-04-08 05:42:30,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:42:30,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59848831] [2022-04-08 05:42:30,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:42:30,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:42:30,843 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:42:30,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1387913362] [2022-04-08 05:42:30,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:42:30,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:42:30,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:42:30,850 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:42:30,851 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:42:30,891 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:42:30,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:42:30,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 05:42:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:42:30,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:42:31,018 INFO L272 TraceCheckUtils]: 0: Hoare triple {1131#true} call ULTIMATE.init(); {1131#true} is VALID [2022-04-08 05:42:31,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {1131#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(10, 2);call #Ultimate.allocInit(12, 3); {1131#true} is VALID [2022-04-08 05:42:31,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {1131#true} assume true; {1131#true} is VALID [2022-04-08 05:42:31,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1131#true} {1131#true} #88#return; {1131#true} is VALID [2022-04-08 05:42:31,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {1131#true} call #t~ret6 := main(); {1131#true} is VALID [2022-04-08 05:42:31,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {1131#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1131#true} is VALID [2022-04-08 05:42:31,019 INFO L272 TraceCheckUtils]: 6: Hoare triple {1131#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {1131#true} is VALID [2022-04-08 05:42:31,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {1131#true} ~cond := #in~cond; {1131#true} is VALID [2022-04-08 05:42:31,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {1131#true} assume !(0 == ~cond); {1131#true} is VALID [2022-04-08 05:42:31,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {1131#true} assume true; {1131#true} is VALID [2022-04-08 05:42:31,020 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1131#true} {1131#true} #66#return; {1131#true} is VALID [2022-04-08 05:42:31,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {1131#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1131#true} is VALID [2022-04-08 05:42:31,020 INFO L272 TraceCheckUtils]: 12: Hoare triple {1131#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {1131#true} is VALID [2022-04-08 05:42:31,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {1131#true} ~cond := #in~cond; {1131#true} is VALID [2022-04-08 05:42:31,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {1131#true} assume !(0 == ~cond); {1131#true} is VALID [2022-04-08 05:42:31,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {1131#true} assume true; {1131#true} is VALID [2022-04-08 05:42:31,020 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1131#true} {1131#true} #68#return; {1131#true} is VALID [2022-04-08 05:42:31,020 INFO L272 TraceCheckUtils]: 17: Hoare triple {1131#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1131#true} is VALID [2022-04-08 05:42:31,020 INFO L290 TraceCheckUtils]: 18: Hoare triple {1131#true} ~cond := #in~cond; {1131#true} is VALID [2022-04-08 05:42:31,020 INFO L290 TraceCheckUtils]: 19: Hoare triple {1131#true} assume !(0 == ~cond); {1131#true} is VALID [2022-04-08 05:42:31,020 INFO L290 TraceCheckUtils]: 20: Hoare triple {1131#true} assume true; {1131#true} is VALID [2022-04-08 05:42:31,021 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1131#true} {1131#true} #70#return; {1131#true} is VALID [2022-04-08 05:42:31,021 INFO L272 TraceCheckUtils]: 22: Hoare triple {1131#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1131#true} is VALID [2022-04-08 05:42:31,021 INFO L290 TraceCheckUtils]: 23: Hoare triple {1131#true} ~cond := #in~cond; {1131#true} is VALID [2022-04-08 05:42:31,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {1131#true} assume !(0 == ~cond); {1131#true} is VALID [2022-04-08 05:42:31,021 INFO L290 TraceCheckUtils]: 25: Hoare triple {1131#true} assume true; {1131#true} is VALID [2022-04-08 05:42:31,021 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1131#true} {1131#true} #72#return; {1131#true} is VALID [2022-04-08 05:42:31,021 INFO L290 TraceCheckUtils]: 27: Hoare triple {1131#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1217#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:42:31,022 INFO L290 TraceCheckUtils]: 28: Hoare triple {1217#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {1217#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:42:31,022 INFO L272 TraceCheckUtils]: 29: Hoare triple {1217#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {1131#true} is VALID [2022-04-08 05:42:31,022 INFO L290 TraceCheckUtils]: 30: Hoare triple {1131#true} ~cond := #in~cond; {1131#true} is VALID [2022-04-08 05:42:31,022 INFO L290 TraceCheckUtils]: 31: Hoare triple {1131#true} assume !(0 == ~cond); {1131#true} is VALID [2022-04-08 05:42:31,022 INFO L290 TraceCheckUtils]: 32: Hoare triple {1131#true} assume true; {1131#true} is VALID [2022-04-08 05:42:31,023 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1131#true} {1217#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #74#return; {1217#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:42:31,023 INFO L272 TraceCheckUtils]: 34: Hoare triple {1217#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1131#true} is VALID [2022-04-08 05:42:31,023 INFO L290 TraceCheckUtils]: 35: Hoare triple {1131#true} ~cond := #in~cond; {1131#true} is VALID [2022-04-08 05:42:31,023 INFO L290 TraceCheckUtils]: 36: Hoare triple {1131#true} assume !(0 == ~cond); {1131#true} is VALID [2022-04-08 05:42:31,023 INFO L290 TraceCheckUtils]: 37: Hoare triple {1131#true} assume true; {1131#true} is VALID [2022-04-08 05:42:31,024 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1131#true} {1217#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #76#return; {1217#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:42:31,024 INFO L272 TraceCheckUtils]: 39: Hoare triple {1217#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {1254#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:42:31,025 INFO L290 TraceCheckUtils]: 40: Hoare triple {1254#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1258#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:42:31,025 INFO L290 TraceCheckUtils]: 41: Hoare triple {1258#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1132#false} is VALID [2022-04-08 05:42:31,025 INFO L290 TraceCheckUtils]: 42: Hoare triple {1132#false} assume !false; {1132#false} is VALID [2022-04-08 05:42:31,026 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:42:31,026 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:42:31,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:42:31,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59848831] [2022-04-08 05:42:31,026 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:42:31,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387913362] [2022-04-08 05:42:31,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387913362] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:42:31,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:42:31,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:42:31,026 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:42:31,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2015556332] [2022-04-08 05:42:31,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2015556332] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:42:31,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:42:31,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:42:31,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892972563] [2022-04-08 05:42:31,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:42:31,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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 43 [2022-04-08 05:42:31,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:42:31,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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:42:31,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:42:31,047 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 05:42:31,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:42:31,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 05:42:31,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 05:42:31,048 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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:42:31,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:42:31,213 INFO L93 Difference]: Finished difference Result 74 states and 105 transitions. [2022-04-08 05:42:31,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 05:42:31,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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 43 [2022-04-08 05:42:31,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:42:31,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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:42:31,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 05:42:31,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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:42:31,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 05:42:31,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-08 05:42:31,264 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:42:31,265 INFO L225 Difference]: With dead ends: 74 [2022-04-08 05:42:31,265 INFO L226 Difference]: Without dead ends: 70 [2022-04-08 05:42:31,266 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 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:42:31,266 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 05:42:31,267 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 139 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:42:31,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-08 05:42:31,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-08 05:42:31,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:42:31,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 05:42:31,290 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 05:42:31,292 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 05:42:31,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:42:31,296 INFO L93 Difference]: Finished difference Result 70 states and 98 transitions. [2022-04-08 05:42:31,296 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2022-04-08 05:42:31,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:42:31,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:42:31,297 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 70 states. [2022-04-08 05:42:31,298 INFO L87 Difference]: Start difference. First operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 70 states. [2022-04-08 05:42:31,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:42:31,301 INFO L93 Difference]: Finished difference Result 70 states and 98 transitions. [2022-04-08 05:42:31,301 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2022-04-08 05:42:31,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:42:31,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:42:31,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:42:31,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:42:31,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 05:42:31,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2022-04-08 05:42:31,306 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 43 [2022-04-08 05:42:31,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:42:31,306 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2022-04-08 05:42:31,307 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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:42:31,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 98 transitions. [2022-04-08 05:42:31,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:42:31,386 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2022-04-08 05:42:31,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 05:42:31,386 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:42:31,386 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:42:31,402 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:42:31,599 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:42:31,599 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:42:31,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:42:31,600 INFO L85 PathProgramCache]: Analyzing trace with hash -301191846, now seen corresponding path program 1 times [2022-04-08 05:42:31,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:42:31,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [168625598] [2022-04-08 05:42:31,600 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:42:31,600 INFO L85 PathProgramCache]: Analyzing trace with hash -301191846, now seen corresponding path program 2 times [2022-04-08 05:42:31,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:42:31,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285869747] [2022-04-08 05:42:31,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:42:31,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:42:31,613 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:42:31,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2068176412] [2022-04-08 05:42:31,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:42:31,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:42:31,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:42:31,614 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:42:31,615 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:42:31,654 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:42:31,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:42:31,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 05:42:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:42:31,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:42:31,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {1694#true} call ULTIMATE.init(); {1694#true} is VALID [2022-04-08 05:42:31,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {1694#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(10, 2);call #Ultimate.allocInit(12, 3); {1694#true} is VALID [2022-04-08 05:42:31,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {1694#true} assume true; {1694#true} is VALID [2022-04-08 05:42:31,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1694#true} {1694#true} #88#return; {1694#true} is VALID [2022-04-08 05:42:31,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {1694#true} call #t~ret6 := main(); {1694#true} is VALID [2022-04-08 05:42:31,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {1694#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1694#true} is VALID [2022-04-08 05:42:31,753 INFO L272 TraceCheckUtils]: 6: Hoare triple {1694#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {1694#true} is VALID [2022-04-08 05:42:31,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {1694#true} ~cond := #in~cond; {1694#true} is VALID [2022-04-08 05:42:31,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {1694#true} assume !(0 == ~cond); {1694#true} is VALID [2022-04-08 05:42:31,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {1694#true} assume true; {1694#true} is VALID [2022-04-08 05:42:31,754 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1694#true} {1694#true} #66#return; {1694#true} is VALID [2022-04-08 05:42:31,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {1694#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1694#true} is VALID [2022-04-08 05:42:31,755 INFO L272 TraceCheckUtils]: 12: Hoare triple {1694#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {1694#true} is VALID [2022-04-08 05:42:31,755 INFO L290 TraceCheckUtils]: 13: Hoare triple {1694#true} ~cond := #in~cond; {1694#true} is VALID [2022-04-08 05:42:31,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {1694#true} assume !(0 == ~cond); {1694#true} is VALID [2022-04-08 05:42:31,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {1694#true} assume true; {1694#true} is VALID [2022-04-08 05:42:31,756 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1694#true} {1694#true} #68#return; {1694#true} is VALID [2022-04-08 05:42:31,756 INFO L272 TraceCheckUtils]: 17: Hoare triple {1694#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1694#true} is VALID [2022-04-08 05:42:31,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {1694#true} ~cond := #in~cond; {1694#true} is VALID [2022-04-08 05:42:31,756 INFO L290 TraceCheckUtils]: 19: Hoare triple {1694#true} assume !(0 == ~cond); {1694#true} is VALID [2022-04-08 05:42:31,756 INFO L290 TraceCheckUtils]: 20: Hoare triple {1694#true} assume true; {1694#true} is VALID [2022-04-08 05:42:31,757 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1694#true} {1694#true} #70#return; {1694#true} is VALID [2022-04-08 05:42:31,757 INFO L272 TraceCheckUtils]: 22: Hoare triple {1694#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1694#true} is VALID [2022-04-08 05:42:31,757 INFO L290 TraceCheckUtils]: 23: Hoare triple {1694#true} ~cond := #in~cond; {1694#true} is VALID [2022-04-08 05:42:31,757 INFO L290 TraceCheckUtils]: 24: Hoare triple {1694#true} assume !(0 == ~cond); {1694#true} is VALID [2022-04-08 05:42:31,757 INFO L290 TraceCheckUtils]: 25: Hoare triple {1694#true} assume true; {1694#true} is VALID [2022-04-08 05:42:31,757 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1694#true} {1694#true} #72#return; {1694#true} is VALID [2022-04-08 05:42:31,757 INFO L290 TraceCheckUtils]: 27: Hoare triple {1694#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1694#true} is VALID [2022-04-08 05:42:31,757 INFO L290 TraceCheckUtils]: 28: Hoare triple {1694#true} assume !false; {1694#true} is VALID [2022-04-08 05:42:31,757 INFO L272 TraceCheckUtils]: 29: Hoare triple {1694#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {1694#true} is VALID [2022-04-08 05:42:31,757 INFO L290 TraceCheckUtils]: 30: Hoare triple {1694#true} ~cond := #in~cond; {1694#true} is VALID [2022-04-08 05:42:31,757 INFO L290 TraceCheckUtils]: 31: Hoare triple {1694#true} assume !(0 == ~cond); {1694#true} is VALID [2022-04-08 05:42:31,757 INFO L290 TraceCheckUtils]: 32: Hoare triple {1694#true} assume true; {1694#true} is VALID [2022-04-08 05:42:31,758 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1694#true} {1694#true} #74#return; {1694#true} is VALID [2022-04-08 05:42:31,758 INFO L272 TraceCheckUtils]: 34: Hoare triple {1694#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1694#true} is VALID [2022-04-08 05:42:31,758 INFO L290 TraceCheckUtils]: 35: Hoare triple {1694#true} ~cond := #in~cond; {1694#true} is VALID [2022-04-08 05:42:31,758 INFO L290 TraceCheckUtils]: 36: Hoare triple {1694#true} assume !(0 == ~cond); {1694#true} is VALID [2022-04-08 05:42:31,758 INFO L290 TraceCheckUtils]: 37: Hoare triple {1694#true} assume true; {1694#true} is VALID [2022-04-08 05:42:31,758 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1694#true} {1694#true} #76#return; {1694#true} is VALID [2022-04-08 05:42:31,758 INFO L272 TraceCheckUtils]: 39: Hoare triple {1694#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {1694#true} is VALID [2022-04-08 05:42:31,758 INFO L290 TraceCheckUtils]: 40: Hoare triple {1694#true} ~cond := #in~cond; {1694#true} is VALID [2022-04-08 05:42:31,758 INFO L290 TraceCheckUtils]: 41: Hoare triple {1694#true} assume !(0 == ~cond); {1694#true} is VALID [2022-04-08 05:42:31,758 INFO L290 TraceCheckUtils]: 42: Hoare triple {1694#true} assume true; {1694#true} is VALID [2022-04-08 05:42:31,759 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1694#true} {1694#true} #78#return; {1694#true} is VALID [2022-04-08 05:42:31,759 INFO L290 TraceCheckUtils]: 44: Hoare triple {1694#true} assume !(~a~0 != ~b~0); {1831#(= main_~b~0 main_~a~0)} is VALID [2022-04-08 05:42:31,760 INFO L272 TraceCheckUtils]: 45: Hoare triple {1831#(= main_~b~0 main_~a~0)} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {1835#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:42:31,760 INFO L290 TraceCheckUtils]: 46: Hoare triple {1835#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1839#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:42:31,761 INFO L290 TraceCheckUtils]: 47: Hoare triple {1839#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1695#false} is VALID [2022-04-08 05:42:31,761 INFO L290 TraceCheckUtils]: 48: Hoare triple {1695#false} assume !false; {1695#false} is VALID [2022-04-08 05:42:31,761 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:42:31,761 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:42:31,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:42:31,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285869747] [2022-04-08 05:42:31,763 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:42:31,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068176412] [2022-04-08 05:42:31,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068176412] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:42:31,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:42:31,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:42:31,763 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:42:31,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [168625598] [2022-04-08 05:42:31,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [168625598] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:42:31,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:42:31,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:42:31,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163104189] [2022-04-08 05:42:31,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:42:31,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 49 [2022-04-08 05:42:31,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:42:31,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-08 05:42:31,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:42:31,783 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 05:42:31,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:42:31,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 05:42:31,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 05:42:31,784 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-08 05:42:31,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:42:31,911 INFO L93 Difference]: Finished difference Result 76 states and 103 transitions. [2022-04-08 05:42:31,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 05:42:31,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 49 [2022-04-08 05:42:31,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:42:31,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-08 05:42:31,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 05:42:31,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-08 05:42:31,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 05:42:31,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-08 05:42:31,941 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:42:31,945 INFO L225 Difference]: With dead ends: 76 [2022-04-08 05:42:31,945 INFO L226 Difference]: Without dead ends: 74 [2022-04-08 05:42:31,945 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 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:42:31,948 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 5 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 05:42:31,948 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 139 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:42:31,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-08 05:42:31,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-04-08 05:42:31,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:42:31,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 05:42:31,983 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 05:42:31,984 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 05:42:31,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:42:31,987 INFO L93 Difference]: Finished difference Result 74 states and 101 transitions. [2022-04-08 05:42:31,987 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 101 transitions. [2022-04-08 05:42:31,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:42:31,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:42:31,987 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 74 states. [2022-04-08 05:42:31,988 INFO L87 Difference]: Start difference. First operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 74 states. [2022-04-08 05:42:31,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:42:31,990 INFO L93 Difference]: Finished difference Result 74 states and 101 transitions. [2022-04-08 05:42:31,990 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 101 transitions. [2022-04-08 05:42:31,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:42:31,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:42:31,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:42:31,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:42:31,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 05:42:31,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 101 transitions. [2022-04-08 05:42:31,994 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 101 transitions. Word has length 49 [2022-04-08 05:42:31,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:42:31,994 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 101 transitions. [2022-04-08 05:42:31,994 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-08 05:42:31,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 101 transitions. [2022-04-08 05:42:32,080 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:42:32,081 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 101 transitions. [2022-04-08 05:42:32,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-08 05:42:32,081 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:42:32,081 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:42:32,100 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:42:32,295 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:42:32,295 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:42:32,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:42:32,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1164909737, now seen corresponding path program 1 times [2022-04-08 05:42:32,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:42:32,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1435890456] [2022-04-08 05:42:32,296 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:42:32,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1164909737, now seen corresponding path program 2 times [2022-04-08 05:42:32,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:42:32,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601511469] [2022-04-08 05:42:32,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:42:32,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:42:32,315 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:42:32,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1807612520] [2022-04-08 05:42:32,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:42:32,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:42:32,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:42:32,316 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:42:32,317 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:42:32,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:42:32,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:42:32,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 05:42:32,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:42:32,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:42:32,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {2295#true} call ULTIMATE.init(); {2295#true} is VALID [2022-04-08 05:42:32,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {2295#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(10, 2);call #Ultimate.allocInit(12, 3); {2295#true} is VALID [2022-04-08 05:42:32,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {2295#true} assume true; {2295#true} is VALID [2022-04-08 05:42:32,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2295#true} {2295#true} #88#return; {2295#true} is VALID [2022-04-08 05:42:32,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {2295#true} call #t~ret6 := main(); {2295#true} is VALID [2022-04-08 05:42:32,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {2295#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2295#true} is VALID [2022-04-08 05:42:32,526 INFO L272 TraceCheckUtils]: 6: Hoare triple {2295#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {2295#true} is VALID [2022-04-08 05:42:32,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {2295#true} ~cond := #in~cond; {2295#true} is VALID [2022-04-08 05:42:32,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {2295#true} assume !(0 == ~cond); {2295#true} is VALID [2022-04-08 05:42:32,527 INFO L290 TraceCheckUtils]: 9: Hoare triple {2295#true} assume true; {2295#true} is VALID [2022-04-08 05:42:32,527 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2295#true} {2295#true} #66#return; {2295#true} is VALID [2022-04-08 05:42:32,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {2295#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2295#true} is VALID [2022-04-08 05:42:32,527 INFO L272 TraceCheckUtils]: 12: Hoare triple {2295#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {2295#true} is VALID [2022-04-08 05:42:32,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {2295#true} ~cond := #in~cond; {2295#true} is VALID [2022-04-08 05:42:32,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {2295#true} assume !(0 == ~cond); {2295#true} is VALID [2022-04-08 05:42:32,527 INFO L290 TraceCheckUtils]: 15: Hoare triple {2295#true} assume true; {2295#true} is VALID [2022-04-08 05:42:32,527 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2295#true} {2295#true} #68#return; {2295#true} is VALID [2022-04-08 05:42:32,527 INFO L272 TraceCheckUtils]: 17: Hoare triple {2295#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2295#true} is VALID [2022-04-08 05:42:32,527 INFO L290 TraceCheckUtils]: 18: Hoare triple {2295#true} ~cond := #in~cond; {2295#true} is VALID [2022-04-08 05:42:32,527 INFO L290 TraceCheckUtils]: 19: Hoare triple {2295#true} assume !(0 == ~cond); {2295#true} is VALID [2022-04-08 05:42:32,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {2295#true} assume true; {2295#true} is VALID [2022-04-08 05:42:32,528 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2295#true} {2295#true} #70#return; {2295#true} is VALID [2022-04-08 05:42:32,528 INFO L272 TraceCheckUtils]: 22: Hoare triple {2295#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2295#true} is VALID [2022-04-08 05:42:32,528 INFO L290 TraceCheckUtils]: 23: Hoare triple {2295#true} ~cond := #in~cond; {2295#true} is VALID [2022-04-08 05:42:32,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {2295#true} assume !(0 == ~cond); {2295#true} is VALID [2022-04-08 05:42:32,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {2295#true} assume true; {2295#true} is VALID [2022-04-08 05:42:32,528 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2295#true} {2295#true} #72#return; {2295#true} is VALID [2022-04-08 05:42:32,528 INFO L290 TraceCheckUtils]: 27: Hoare triple {2295#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:42:32,533 INFO L290 TraceCheckUtils]: 28: Hoare triple {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:42:32,533 INFO L272 TraceCheckUtils]: 29: Hoare triple {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {2295#true} is VALID [2022-04-08 05:42:32,533 INFO L290 TraceCheckUtils]: 30: Hoare triple {2295#true} ~cond := #in~cond; {2295#true} is VALID [2022-04-08 05:42:32,533 INFO L290 TraceCheckUtils]: 31: Hoare triple {2295#true} assume !(0 == ~cond); {2295#true} is VALID [2022-04-08 05:42:32,533 INFO L290 TraceCheckUtils]: 32: Hoare triple {2295#true} assume true; {2295#true} is VALID [2022-04-08 05:42:32,534 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2295#true} {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #74#return; {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:42:32,534 INFO L272 TraceCheckUtils]: 34: Hoare triple {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2295#true} is VALID [2022-04-08 05:42:32,534 INFO L290 TraceCheckUtils]: 35: Hoare triple {2295#true} ~cond := #in~cond; {2295#true} is VALID [2022-04-08 05:42:32,534 INFO L290 TraceCheckUtils]: 36: Hoare triple {2295#true} assume !(0 == ~cond); {2295#true} is VALID [2022-04-08 05:42:32,534 INFO L290 TraceCheckUtils]: 37: Hoare triple {2295#true} assume true; {2295#true} is VALID [2022-04-08 05:42:32,535 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2295#true} {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #76#return; {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:42:32,535 INFO L272 TraceCheckUtils]: 39: Hoare triple {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2295#true} is VALID [2022-04-08 05:42:32,535 INFO L290 TraceCheckUtils]: 40: Hoare triple {2295#true} ~cond := #in~cond; {2295#true} is VALID [2022-04-08 05:42:32,535 INFO L290 TraceCheckUtils]: 41: Hoare triple {2295#true} assume !(0 == ~cond); {2295#true} is VALID [2022-04-08 05:42:32,535 INFO L290 TraceCheckUtils]: 42: Hoare triple {2295#true} assume true; {2295#true} is VALID [2022-04-08 05:42:32,535 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2295#true} {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #78#return; {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:42:32,536 INFO L290 TraceCheckUtils]: 44: Hoare triple {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:42:32,536 INFO L290 TraceCheckUtils]: 45: Hoare triple {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:42:32,537 INFO L290 TraceCheckUtils]: 46: Hoare triple {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:42:32,537 INFO L272 TraceCheckUtils]: 47: Hoare triple {2381#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {2442#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:42:32,537 INFO L290 TraceCheckUtils]: 48: Hoare triple {2442#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2446#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:42:32,538 INFO L290 TraceCheckUtils]: 49: Hoare triple {2446#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2296#false} is VALID [2022-04-08 05:42:32,538 INFO L290 TraceCheckUtils]: 50: Hoare triple {2296#false} assume !false; {2296#false} is VALID [2022-04-08 05:42:32,538 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-08 05:42:32,538 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:42:32,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:42:32,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601511469] [2022-04-08 05:42:32,538 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:42:32,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807612520] [2022-04-08 05:42:32,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807612520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:42:32,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:42:32,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:42:32,539 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:42:32,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1435890456] [2022-04-08 05:42:32,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1435890456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:42:32,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:42:32,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:42:32,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298327538] [2022-04-08 05:42:32,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:42:32,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (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 51 [2022-04-08 05:42:32,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:42:32,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (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:42:32,561 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:42:32,561 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 05:42:32,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:42:32,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 05:42:32,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 05:42:32,562 INFO L87 Difference]: Start difference. First operand 74 states and 101 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (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:42:32,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:42:32,730 INFO L93 Difference]: Finished difference Result 84 states and 109 transitions. [2022-04-08 05:42:32,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 05:42:32,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (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 51 [2022-04-08 05:42:32,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:42:32,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (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:42:32,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-08 05:42:32,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (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:42:32,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-08 05:42:32,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-04-08 05:42:32,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:42:32,780 INFO L225 Difference]: With dead ends: 84 [2022-04-08 05:42:32,780 INFO L226 Difference]: Without dead ends: 81 [2022-04-08 05:42:32,780 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 1 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:42:32,781 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 05:42:32,781 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 146 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:42:32,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-08 05:42:32,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2022-04-08 05:42:32,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:42:32,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 05:42:32,804 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 05:42:32,804 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 05:42:32,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:42:32,807 INFO L93 Difference]: Finished difference Result 81 states and 105 transitions. [2022-04-08 05:42:32,807 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2022-04-08 05:42:32,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:42:32,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:42:32,807 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 81 states. [2022-04-08 05:42:32,807 INFO L87 Difference]: Start difference. First operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 81 states. [2022-04-08 05:42:32,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:42:32,810 INFO L93 Difference]: Finished difference Result 81 states and 105 transitions. [2022-04-08 05:42:32,810 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2022-04-08 05:42:32,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:42:32,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:42:32,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:42:32,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:42:32,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 05:42:32,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2022-04-08 05:42:32,813 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 51 [2022-04-08 05:42:32,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:42:32,813 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions. [2022-04-08 05:42:32,813 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (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:42:32,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 102 transitions. [2022-04-08 05:42:32,896 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:42:32,897 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2022-04-08 05:42:32,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-08 05:42:32,897 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:42:32,897 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:42:32,916 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:42:33,107 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:42:33,108 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:42:33,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:42:33,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1924168317, now seen corresponding path program 1 times [2022-04-08 05:42:33,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:42:33,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [778891093] [2022-04-08 05:42:33,109 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:42:33,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1924168317, now seen corresponding path program 2 times [2022-04-08 05:42:33,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:42:33,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475974427] [2022-04-08 05:42:33,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:42:33,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:42:33,132 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:42:33,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [229203349] [2022-04-08 05:42:33,132 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:42:33,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:42:33,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:42:33,133 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:42:33,164 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:42:33,189 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:42:33,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:42:33,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 05:42:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:42:33,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:42:33,366 INFO L272 TraceCheckUtils]: 0: Hoare triple {2942#true} call ULTIMATE.init(); {2942#true} is VALID [2022-04-08 05:42:33,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {2942#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(10, 2);call #Ultimate.allocInit(12, 3); {2942#true} is VALID [2022-04-08 05:42:33,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-08 05:42:33,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2942#true} {2942#true} #88#return; {2942#true} is VALID [2022-04-08 05:42:33,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {2942#true} call #t~ret6 := main(); {2942#true} is VALID [2022-04-08 05:42:33,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {2942#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2942#true} is VALID [2022-04-08 05:42:33,366 INFO L272 TraceCheckUtils]: 6: Hoare triple {2942#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {2942#true} is VALID [2022-04-08 05:42:33,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-08 05:42:33,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-08 05:42:33,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-08 05:42:33,367 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2942#true} {2942#true} #66#return; {2942#true} is VALID [2022-04-08 05:42:33,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {2942#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2942#true} is VALID [2022-04-08 05:42:33,367 INFO L272 TraceCheckUtils]: 12: Hoare triple {2942#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {2942#true} is VALID [2022-04-08 05:42:33,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-08 05:42:33,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-08 05:42:33,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-08 05:42:33,367 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2942#true} {2942#true} #68#return; {2942#true} is VALID [2022-04-08 05:42:33,367 INFO L272 TraceCheckUtils]: 17: Hoare triple {2942#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2942#true} is VALID [2022-04-08 05:42:33,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-08 05:42:33,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-08 05:42:33,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-08 05:42:33,367 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2942#true} {2942#true} #70#return; {2942#true} is VALID [2022-04-08 05:42:33,367 INFO L272 TraceCheckUtils]: 22: Hoare triple {2942#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2942#true} is VALID [2022-04-08 05:42:33,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-08 05:42:33,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-08 05:42:33,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-08 05:42:33,368 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2942#true} {2942#true} #72#return; {2942#true} is VALID [2022-04-08 05:42:33,368 INFO L290 TraceCheckUtils]: 27: Hoare triple {2942#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2942#true} is VALID [2022-04-08 05:42:33,368 INFO L290 TraceCheckUtils]: 28: Hoare triple {2942#true} assume !false; {2942#true} is VALID [2022-04-08 05:42:33,368 INFO L272 TraceCheckUtils]: 29: Hoare triple {2942#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {2942#true} is VALID [2022-04-08 05:42:33,368 INFO L290 TraceCheckUtils]: 30: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-08 05:42:33,368 INFO L290 TraceCheckUtils]: 31: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-08 05:42:33,368 INFO L290 TraceCheckUtils]: 32: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-08 05:42:33,368 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2942#true} {2942#true} #74#return; {2942#true} is VALID [2022-04-08 05:42:33,368 INFO L272 TraceCheckUtils]: 34: Hoare triple {2942#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2942#true} is VALID [2022-04-08 05:42:33,369 INFO L290 TraceCheckUtils]: 35: Hoare triple {2942#true} ~cond := #in~cond; {3052#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:42:33,369 INFO L290 TraceCheckUtils]: 36: Hoare triple {3052#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3056#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:42:33,369 INFO L290 TraceCheckUtils]: 37: Hoare triple {3056#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3056#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:42:33,388 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3056#(not (= |__VERIFIER_assert_#in~cond| 0))} {2942#true} #76#return; {3063#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:42:33,388 INFO L272 TraceCheckUtils]: 39: Hoare triple {3063#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2942#true} is VALID [2022-04-08 05:42:33,388 INFO L290 TraceCheckUtils]: 40: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-08 05:42:33,388 INFO L290 TraceCheckUtils]: 41: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-08 05:42:33,389 INFO L290 TraceCheckUtils]: 42: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-08 05:42:33,389 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2942#true} {3063#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #78#return; {3063#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:42:33,390 INFO L290 TraceCheckUtils]: 44: Hoare triple {3063#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !(~a~0 != ~b~0); {3082#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:42:33,390 INFO L272 TraceCheckUtils]: 45: Hoare triple {3082#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {2942#true} is VALID [2022-04-08 05:42:33,390 INFO L290 TraceCheckUtils]: 46: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-08 05:42:33,390 INFO L290 TraceCheckUtils]: 47: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-08 05:42:33,390 INFO L290 TraceCheckUtils]: 48: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-08 05:42:33,391 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2942#true} {3082#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #80#return; {3082#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:42:33,392 INFO L272 TraceCheckUtils]: 50: Hoare triple {3082#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~p~0 * ~x~0 + ~r~0 * ~y~0 - ~b~0 then 1 else 0)); {3101#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:42:33,392 INFO L290 TraceCheckUtils]: 51: Hoare triple {3101#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3105#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:42:33,393 INFO L290 TraceCheckUtils]: 52: Hoare triple {3105#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2943#false} is VALID [2022-04-08 05:42:33,393 INFO L290 TraceCheckUtils]: 53: Hoare triple {2943#false} assume !false; {2943#false} is VALID [2022-04-08 05:42:33,393 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-08 05:42:33,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:42:50,092 INFO L290 TraceCheckUtils]: 53: Hoare triple {2943#false} assume !false; {2943#false} is VALID [2022-04-08 05:42:50,092 INFO L290 TraceCheckUtils]: 52: Hoare triple {3105#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2943#false} is VALID [2022-04-08 05:42:50,093 INFO L290 TraceCheckUtils]: 51: Hoare triple {3101#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3105#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:42:50,093 INFO L272 TraceCheckUtils]: 50: Hoare triple {3082#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~p~0 * ~x~0 + ~r~0 * ~y~0 - ~b~0 then 1 else 0)); {3101#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:42:50,094 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2942#true} {3082#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #80#return; {3082#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:42:50,094 INFO L290 TraceCheckUtils]: 48: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-08 05:42:50,094 INFO L290 TraceCheckUtils]: 47: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-08 05:42:50,094 INFO L290 TraceCheckUtils]: 46: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-08 05:42:50,094 INFO L272 TraceCheckUtils]: 45: Hoare triple {3082#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {2942#true} is VALID [2022-04-08 05:42:50,094 INFO L290 TraceCheckUtils]: 44: Hoare triple {3063#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !(~a~0 != ~b~0); {3082#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:42:50,095 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2942#true} {3063#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #78#return; {3063#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:42:50,095 INFO L290 TraceCheckUtils]: 42: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-08 05:42:50,095 INFO L290 TraceCheckUtils]: 41: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-08 05:42:50,095 INFO L290 TraceCheckUtils]: 40: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-08 05:42:50,095 INFO L272 TraceCheckUtils]: 39: Hoare triple {3063#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2942#true} is VALID [2022-04-08 05:42:50,097 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3056#(not (= |__VERIFIER_assert_#in~cond| 0))} {2942#true} #76#return; {3063#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:42:50,097 INFO L290 TraceCheckUtils]: 37: Hoare triple {3056#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3056#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:42:50,099 INFO L290 TraceCheckUtils]: 36: Hoare triple {3166#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3056#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:42:50,099 INFO L290 TraceCheckUtils]: 35: Hoare triple {2942#true} ~cond := #in~cond; {3166#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:42:50,100 INFO L272 TraceCheckUtils]: 34: Hoare triple {2942#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2942#true} is VALID [2022-04-08 05:42:50,100 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2942#true} {2942#true} #74#return; {2942#true} is VALID [2022-04-08 05:42:50,100 INFO L290 TraceCheckUtils]: 32: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-08 05:42:50,100 INFO L290 TraceCheckUtils]: 31: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-08 05:42:50,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-08 05:42:50,100 INFO L272 TraceCheckUtils]: 29: Hoare triple {2942#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {2942#true} is VALID [2022-04-08 05:42:50,100 INFO L290 TraceCheckUtils]: 28: Hoare triple {2942#true} assume !false; {2942#true} is VALID [2022-04-08 05:42:50,100 INFO L290 TraceCheckUtils]: 27: Hoare triple {2942#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2942#true} is VALID [2022-04-08 05:42:50,100 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2942#true} {2942#true} #72#return; {2942#true} is VALID [2022-04-08 05:42:50,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-08 05:42:50,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-08 05:42:50,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-08 05:42:50,100 INFO L272 TraceCheckUtils]: 22: Hoare triple {2942#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2942#true} is VALID [2022-04-08 05:42:50,100 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2942#true} {2942#true} #70#return; {2942#true} is VALID [2022-04-08 05:42:50,101 INFO L290 TraceCheckUtils]: 20: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-08 05:42:50,101 INFO L290 TraceCheckUtils]: 19: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-08 05:42:50,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-08 05:42:50,101 INFO L272 TraceCheckUtils]: 17: Hoare triple {2942#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2942#true} is VALID [2022-04-08 05:42:50,101 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2942#true} {2942#true} #68#return; {2942#true} is VALID [2022-04-08 05:42:50,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-08 05:42:50,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-08 05:42:50,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-08 05:42:50,101 INFO L272 TraceCheckUtils]: 12: Hoare triple {2942#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {2942#true} is VALID [2022-04-08 05:42:50,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {2942#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2942#true} is VALID [2022-04-08 05:42:50,101 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2942#true} {2942#true} #66#return; {2942#true} is VALID [2022-04-08 05:42:50,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-08 05:42:50,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {2942#true} assume !(0 == ~cond); {2942#true} is VALID [2022-04-08 05:42:50,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {2942#true} ~cond := #in~cond; {2942#true} is VALID [2022-04-08 05:42:50,101 INFO L272 TraceCheckUtils]: 6: Hoare triple {2942#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {2942#true} is VALID [2022-04-08 05:42:50,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {2942#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2942#true} is VALID [2022-04-08 05:42:50,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {2942#true} call #t~ret6 := main(); {2942#true} is VALID [2022-04-08 05:42:50,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2942#true} {2942#true} #88#return; {2942#true} is VALID [2022-04-08 05:42:50,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {2942#true} assume true; {2942#true} is VALID [2022-04-08 05:42:50,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {2942#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(10, 2);call #Ultimate.allocInit(12, 3); {2942#true} is VALID [2022-04-08 05:42:50,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {2942#true} call ULTIMATE.init(); {2942#true} is VALID [2022-04-08 05:42:50,102 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-08 05:42:50,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:42:50,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475974427] [2022-04-08 05:42:50,102 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:42:50,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229203349] [2022-04-08 05:42:50,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229203349] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:42:50,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:42:50,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-08 05:42:50,103 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:42:50,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [778891093] [2022-04-08 05:42:50,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [778891093] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:42:50,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:42:50,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 05:42:50,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373852620] [2022-04-08 05:42:50,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:42:50,103 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 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 54 [2022-04-08 05:42:50,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:42:50,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 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:42:50,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:42:50,136 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 05:42:50,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:42:50,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 05:42:50,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-08 05:42:50,137 INFO L87 Difference]: Start difference. First operand 79 states and 102 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 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:42:50,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:42:50,607 INFO L93 Difference]: Finished difference Result 88 states and 112 transitions. [2022-04-08 05:42:50,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 05:42:50,607 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 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 54 [2022-04-08 05:42:50,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:42:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 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:42:50,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-04-08 05:42:50,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 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:42:50,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-04-08 05:42:50,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 52 transitions. [2022-04-08 05:42:50,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:42:50,663 INFO L225 Difference]: With dead ends: 88 [2022-04-08 05:42:50,663 INFO L226 Difference]: Without dead ends: 84 [2022-04-08 05:42:50,664 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-08 05:42:50,664 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 14 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 05:42:50,664 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 129 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 05:42:50,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-08 05:42:50,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-04-08 05:42:50,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:42:50,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 05:42:50,697 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 05:42:50,699 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 05:42:50,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:42:50,702 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2022-04-08 05:42:50,702 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2022-04-08 05:42:50,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:42:50,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:42:50,703 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 84 states. [2022-04-08 05:42:50,703 INFO L87 Difference]: Start difference. First operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 84 states. [2022-04-08 05:42:50,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:42:50,707 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2022-04-08 05:42:50,707 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2022-04-08 05:42:50,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:42:50,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:42:50,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:42:50,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:42:50,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 05:42:50,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 105 transitions. [2022-04-08 05:42:50,711 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 105 transitions. Word has length 54 [2022-04-08 05:42:50,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:42:50,711 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 105 transitions. [2022-04-08 05:42:50,711 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 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:42:50,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 105 transitions. [2022-04-08 05:42:50,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:42:50,834 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2022-04-08 05:42:50,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-08 05:42:50,835 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:42:50,835 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 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] [2022-04-08 05:42:50,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-08 05:42:51,035 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:42:51,036 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:42:51,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:42:51,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1698149216, now seen corresponding path program 3 times [2022-04-08 05:42:51,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:42:51,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [615154771] [2022-04-08 05:42:51,037 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:42:51,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1698149216, now seen corresponding path program 4 times [2022-04-08 05:42:51,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:42:51,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395659487] [2022-04-08 05:42:51,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:42:51,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:42:51,049 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:42:51,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [296980168] [2022-04-08 05:42:51,049 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 05:42:51,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:42:51,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:42:51,050 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:42:51,051 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:42:51,089 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 05:42:51,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:42:51,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 05:42:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:42:51,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:42:51,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {3792#true} call ULTIMATE.init(); {3792#true} is VALID [2022-04-08 05:42:51,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {3792#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(10, 2);call #Ultimate.allocInit(12, 3); {3792#true} is VALID [2022-04-08 05:42:51,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 05:42:51,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3792#true} {3792#true} #88#return; {3792#true} is VALID [2022-04-08 05:42:51,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {3792#true} call #t~ret6 := main(); {3792#true} is VALID [2022-04-08 05:42:51,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {3792#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3792#true} is VALID [2022-04-08 05:42:51,462 INFO L272 TraceCheckUtils]: 6: Hoare triple {3792#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {3792#true} is VALID [2022-04-08 05:42:51,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-08 05:42:51,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-08 05:42:51,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 05:42:51,462 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3792#true} {3792#true} #66#return; {3792#true} is VALID [2022-04-08 05:42:51,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {3792#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3792#true} is VALID [2022-04-08 05:42:51,462 INFO L272 TraceCheckUtils]: 12: Hoare triple {3792#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {3792#true} is VALID [2022-04-08 05:42:51,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-08 05:42:51,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-08 05:42:51,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 05:42:51,462 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3792#true} {3792#true} #68#return; {3792#true} is VALID [2022-04-08 05:42:51,462 INFO L272 TraceCheckUtils]: 17: Hoare triple {3792#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3792#true} is VALID [2022-04-08 05:42:51,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-08 05:42:51,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-08 05:42:51,463 INFO L290 TraceCheckUtils]: 20: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 05:42:51,463 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3792#true} {3792#true} #70#return; {3792#true} is VALID [2022-04-08 05:42:51,463 INFO L272 TraceCheckUtils]: 22: Hoare triple {3792#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3792#true} is VALID [2022-04-08 05:42:51,471 INFO L290 TraceCheckUtils]: 23: Hoare triple {3792#true} ~cond := #in~cond; {3866#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:42:51,472 INFO L290 TraceCheckUtils]: 24: Hoare triple {3866#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3870#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:42:51,472 INFO L290 TraceCheckUtils]: 25: Hoare triple {3870#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3870#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:42:51,473 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3870#(not (= |assume_abort_if_not_#in~cond| 0))} {3792#true} #72#return; {3877#(<= 1 main_~y~0)} is VALID [2022-04-08 05:42:51,473 INFO L290 TraceCheckUtils]: 27: Hoare triple {3877#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3881#(and (= main_~r~0 0) (= 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:42:51,473 INFO L290 TraceCheckUtils]: 28: Hoare triple {3881#(and (= main_~r~0 0) (= 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; {3881#(and (= main_~r~0 0) (= 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:42:51,473 INFO L272 TraceCheckUtils]: 29: Hoare triple {3881#(and (= main_~r~0 0) (= 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))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3792#true} is VALID [2022-04-08 05:42:51,473 INFO L290 TraceCheckUtils]: 30: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-08 05:42:51,474 INFO L290 TraceCheckUtils]: 31: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-08 05:42:51,474 INFO L290 TraceCheckUtils]: 32: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 05:42:51,474 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3792#true} {3881#(and (= main_~r~0 0) (= 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))} #74#return; {3881#(and (= main_~r~0 0) (= 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:42:51,474 INFO L272 TraceCheckUtils]: 34: Hoare triple {3881#(and (= main_~r~0 0) (= 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))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3792#true} is VALID [2022-04-08 05:42:51,474 INFO L290 TraceCheckUtils]: 35: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-08 05:42:51,475 INFO L290 TraceCheckUtils]: 36: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-08 05:42:51,475 INFO L290 TraceCheckUtils]: 37: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 05:42:51,475 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3792#true} {3881#(and (= main_~r~0 0) (= 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))} #76#return; {3881#(and (= main_~r~0 0) (= 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:42:51,475 INFO L272 TraceCheckUtils]: 39: Hoare triple {3881#(and (= main_~r~0 0) (= 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))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3792#true} is VALID [2022-04-08 05:42:51,475 INFO L290 TraceCheckUtils]: 40: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-08 05:42:51,475 INFO L290 TraceCheckUtils]: 41: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-08 05:42:51,475 INFO L290 TraceCheckUtils]: 42: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 05:42:51,476 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3792#true} {3881#(and (= main_~r~0 0) (= 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))} #78#return; {3881#(and (= main_~r~0 0) (= 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:42:51,476 INFO L290 TraceCheckUtils]: 44: Hoare triple {3881#(and (= main_~r~0 0) (= 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 !!(~a~0 != ~b~0); {3881#(and (= main_~r~0 0) (= 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:42:51,477 INFO L290 TraceCheckUtils]: 45: Hoare triple {3881#(and (= main_~r~0 0) (= 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 ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {3936#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0) (<= 1 main_~y~0))} is VALID [2022-04-08 05:42:51,477 INFO L290 TraceCheckUtils]: 46: Hoare triple {3936#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0) (<= 1 main_~y~0))} assume !false; {3936#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0) (<= 1 main_~y~0))} is VALID [2022-04-08 05:42:51,477 INFO L272 TraceCheckUtils]: 47: Hoare triple {3936#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3792#true} is VALID [2022-04-08 05:42:51,477 INFO L290 TraceCheckUtils]: 48: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-08 05:42:51,477 INFO L290 TraceCheckUtils]: 49: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-08 05:42:51,477 INFO L290 TraceCheckUtils]: 50: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 05:42:51,478 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3792#true} {3936#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0) (<= 1 main_~y~0))} #74#return; {3936#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0) (<= 1 main_~y~0))} is VALID [2022-04-08 05:42:51,479 INFO L272 TraceCheckUtils]: 52: Hoare triple {3936#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3958#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:42:51,479 INFO L290 TraceCheckUtils]: 53: Hoare triple {3958#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3962#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:42:51,479 INFO L290 TraceCheckUtils]: 54: Hoare triple {3962#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3793#false} is VALID [2022-04-08 05:42:51,479 INFO L290 TraceCheckUtils]: 55: Hoare triple {3793#false} assume !false; {3793#false} is VALID [2022-04-08 05:42:51,479 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-08 05:42:51,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:42:51,719 INFO L290 TraceCheckUtils]: 55: Hoare triple {3793#false} assume !false; {3793#false} is VALID [2022-04-08 05:42:51,719 INFO L290 TraceCheckUtils]: 54: Hoare triple {3962#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3793#false} is VALID [2022-04-08 05:42:51,720 INFO L290 TraceCheckUtils]: 53: Hoare triple {3958#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3962#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:42:51,721 INFO L272 TraceCheckUtils]: 52: Hoare triple {3978#(= 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)); {3958#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:42:51,721 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3792#true} {3978#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #74#return; {3978#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:42:51,721 INFO L290 TraceCheckUtils]: 50: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 05:42:51,721 INFO L290 TraceCheckUtils]: 49: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-08 05:42:51,722 INFO L290 TraceCheckUtils]: 48: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-08 05:42:51,722 INFO L272 TraceCheckUtils]: 47: Hoare triple {3978#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3792#true} is VALID [2022-04-08 05:42:51,722 INFO L290 TraceCheckUtils]: 46: Hoare triple {3978#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {3978#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:42:52,265 INFO L290 TraceCheckUtils]: 45: Hoare triple {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {3978#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:42:52,266 INFO L290 TraceCheckUtils]: 44: Hoare triple {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} assume !!(~a~0 != ~b~0); {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-08 05:42:52,267 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3792#true} {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} #78#return; {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-08 05:42:52,267 INFO L290 TraceCheckUtils]: 42: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 05:42:52,267 INFO L290 TraceCheckUtils]: 41: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-08 05:42:52,267 INFO L290 TraceCheckUtils]: 40: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-08 05:42:52,267 INFO L272 TraceCheckUtils]: 39: Hoare triple {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3792#true} is VALID [2022-04-08 05:42:52,268 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3792#true} {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} #76#return; {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-08 05:42:52,268 INFO L290 TraceCheckUtils]: 37: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 05:42:52,268 INFO L290 TraceCheckUtils]: 36: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-08 05:42:52,268 INFO L290 TraceCheckUtils]: 35: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-08 05:42:52,268 INFO L272 TraceCheckUtils]: 34: Hoare triple {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3792#true} is VALID [2022-04-08 05:42:52,268 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3792#true} {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} #74#return; {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-08 05:42:52,269 INFO L290 TraceCheckUtils]: 32: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 05:42:52,269 INFO L290 TraceCheckUtils]: 31: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-08 05:42:52,269 INFO L290 TraceCheckUtils]: 30: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-08 05:42:52,269 INFO L272 TraceCheckUtils]: 29: Hoare triple {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3792#true} is VALID [2022-04-08 05:42:52,269 INFO L290 TraceCheckUtils]: 28: Hoare triple {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} assume !false; {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-08 05:42:52,269 INFO L290 TraceCheckUtils]: 27: Hoare triple {3792#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4000#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-08 05:42:52,270 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3792#true} {3792#true} #72#return; {3792#true} is VALID [2022-04-08 05:42:52,270 INFO L290 TraceCheckUtils]: 25: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 05:42:52,270 INFO L290 TraceCheckUtils]: 24: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-08 05:42:52,270 INFO L290 TraceCheckUtils]: 23: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-08 05:42:52,270 INFO L272 TraceCheckUtils]: 22: Hoare triple {3792#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3792#true} is VALID [2022-04-08 05:42:52,270 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3792#true} {3792#true} #70#return; {3792#true} is VALID [2022-04-08 05:42:52,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 05:42:52,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-08 05:42:52,270 INFO L290 TraceCheckUtils]: 18: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-08 05:42:52,270 INFO L272 TraceCheckUtils]: 17: Hoare triple {3792#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3792#true} is VALID [2022-04-08 05:42:52,270 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3792#true} {3792#true} #68#return; {3792#true} is VALID [2022-04-08 05:42:52,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 05:42:52,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-08 05:42:52,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-08 05:42:52,270 INFO L272 TraceCheckUtils]: 12: Hoare triple {3792#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {3792#true} is VALID [2022-04-08 05:42:52,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {3792#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3792#true} is VALID [2022-04-08 05:42:52,270 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3792#true} {3792#true} #66#return; {3792#true} is VALID [2022-04-08 05:42:52,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 05:42:52,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {3792#true} assume !(0 == ~cond); {3792#true} is VALID [2022-04-08 05:42:52,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {3792#true} ~cond := #in~cond; {3792#true} is VALID [2022-04-08 05:42:52,271 INFO L272 TraceCheckUtils]: 6: Hoare triple {3792#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {3792#true} is VALID [2022-04-08 05:42:52,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {3792#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3792#true} is VALID [2022-04-08 05:42:52,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {3792#true} call #t~ret6 := main(); {3792#true} is VALID [2022-04-08 05:42:52,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3792#true} {3792#true} #88#return; {3792#true} is VALID [2022-04-08 05:42:52,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {3792#true} assume true; {3792#true} is VALID [2022-04-08 05:42:52,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {3792#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(10, 2);call #Ultimate.allocInit(12, 3); {3792#true} is VALID [2022-04-08 05:42:52,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {3792#true} call ULTIMATE.init(); {3792#true} is VALID [2022-04-08 05:42:52,271 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-08 05:42:52,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:42:52,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395659487] [2022-04-08 05:42:52,271 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:42:52,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296980168] [2022-04-08 05:42:52,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296980168] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:42:52,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:42:52,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2022-04-08 05:42:52,272 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:42:52,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [615154771] [2022-04-08 05:42:52,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [615154771] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:42:52,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:42:52,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 05:42:52,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544092014] [2022-04-08 05:42:52,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:42:52,273 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 56 [2022-04-08 05:42:52,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:42:52,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 05:42:52,315 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:42:52,315 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 05:42:52,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:42:52,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 05:42:52,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-08 05:42:52,316 INFO L87 Difference]: Start difference. First operand 84 states and 105 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 05:42:53,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:42:53,113 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2022-04-08 05:42:53,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 05:42:53,113 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 56 [2022-04-08 05:42:53,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:42:53,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 05:42:53,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2022-04-08 05:42:53,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 05:42:53,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2022-04-08 05:42:53,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 75 transitions. [2022-04-08 05:42:53,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:42:53,177 INFO L225 Difference]: With dead ends: 118 [2022-04-08 05:42:53,177 INFO L226 Difference]: Without dead ends: 116 [2022-04-08 05:42:53,178 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-04-08 05:42:53,178 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 19 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 05:42:53,178 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 184 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 05:42:53,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-08 05:42:53,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2022-04-08 05:42:53,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:42:53,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 112 states, 64 states have (on average 1.15625) internal successors, (74), 67 states have internal predecessors, (74), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-08 05:42:53,242 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 112 states, 64 states have (on average 1.15625) internal successors, (74), 67 states have internal predecessors, (74), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-08 05:42:53,242 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 112 states, 64 states have (on average 1.15625) internal successors, (74), 67 states have internal predecessors, (74), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-08 05:42:53,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:42:53,245 INFO L93 Difference]: Finished difference Result 116 states and 145 transitions. [2022-04-08 05:42:53,245 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions. [2022-04-08 05:42:53,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:42:53,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:42:53,246 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 64 states have (on average 1.15625) internal successors, (74), 67 states have internal predecessors, (74), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) Second operand 116 states. [2022-04-08 05:42:53,246 INFO L87 Difference]: Start difference. First operand has 112 states, 64 states have (on average 1.15625) internal successors, (74), 67 states have internal predecessors, (74), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) Second operand 116 states. [2022-04-08 05:42:53,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:42:53,250 INFO L93 Difference]: Finished difference Result 116 states and 145 transitions. [2022-04-08 05:42:53,250 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions. [2022-04-08 05:42:53,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:42:53,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:42:53,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:42:53,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:42:53,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 64 states have (on average 1.15625) internal successors, (74), 67 states have internal predecessors, (74), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-08 05:42:53,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 138 transitions. [2022-04-08 05:42:53,254 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 138 transitions. Word has length 56 [2022-04-08 05:42:53,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:42:53,254 INFO L478 AbstractCegarLoop]: Abstraction has 112 states and 138 transitions. [2022-04-08 05:42:53,254 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 05:42:53,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 112 states and 138 transitions. [2022-04-08 05:42:53,394 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 05:42:53,394 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2022-04-08 05:42:53,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-08 05:42:53,395 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:42:53,395 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:42:53,411 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:42:53,595 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:42:53,595 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:42:53,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:42:53,596 INFO L85 PathProgramCache]: Analyzing trace with hash 888099957, now seen corresponding path program 1 times [2022-04-08 05:42:53,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:42:53,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2082246856] [2022-04-08 05:42:53,596 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:42:53,596 INFO L85 PathProgramCache]: Analyzing trace with hash 888099957, now seen corresponding path program 2 times [2022-04-08 05:42:53,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:42:53,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806862493] [2022-04-08 05:42:53,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:42:53,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:42:53,610 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:42:53,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1527680818] [2022-04-08 05:42:53,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:42:53,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:42:53,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:42:53,617 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:42:53,618 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:42:53,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:42:53,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:42:53,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 05:42:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:42:53,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:42:53,950 INFO L272 TraceCheckUtils]: 0: Hoare triple {4834#true} call ULTIMATE.init(); {4834#true} is VALID [2022-04-08 05:42:53,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {4834#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(10, 2);call #Ultimate.allocInit(12, 3); {4834#true} is VALID [2022-04-08 05:42:53,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 05:42:53,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4834#true} {4834#true} #88#return; {4834#true} is VALID [2022-04-08 05:42:53,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {4834#true} call #t~ret6 := main(); {4834#true} is VALID [2022-04-08 05:42:53,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {4834#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4834#true} is VALID [2022-04-08 05:42:53,951 INFO L272 TraceCheckUtils]: 6: Hoare triple {4834#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {4834#true} is VALID [2022-04-08 05:42:53,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 05:42:53,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 05:42:53,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 05:42:53,951 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4834#true} {4834#true} #66#return; {4834#true} is VALID [2022-04-08 05:42:53,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {4834#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4834#true} is VALID [2022-04-08 05:42:53,951 INFO L272 TraceCheckUtils]: 12: Hoare triple {4834#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {4834#true} is VALID [2022-04-08 05:42:53,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 05:42:53,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 05:42:53,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 05:42:53,951 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4834#true} {4834#true} #68#return; {4834#true} is VALID [2022-04-08 05:42:53,953 INFO L272 TraceCheckUtils]: 17: Hoare triple {4834#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4834#true} is VALID [2022-04-08 05:42:53,953 INFO L290 TraceCheckUtils]: 18: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 05:42:53,953 INFO L290 TraceCheckUtils]: 19: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 05:42:53,953 INFO L290 TraceCheckUtils]: 20: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 05:42:53,953 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4834#true} {4834#true} #70#return; {4834#true} is VALID [2022-04-08 05:42:53,954 INFO L272 TraceCheckUtils]: 22: Hoare triple {4834#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4834#true} is VALID [2022-04-08 05:42:53,954 INFO L290 TraceCheckUtils]: 23: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 05:42:53,954 INFO L290 TraceCheckUtils]: 24: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 05:42:53,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 05:42:53,955 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4834#true} {4834#true} #72#return; {4834#true} is VALID [2022-04-08 05:42:53,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {4834#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4920#(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:42:53,956 INFO L290 TraceCheckUtils]: 28: Hoare triple {4920#(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; {4920#(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:42:53,956 INFO L272 TraceCheckUtils]: 29: Hoare triple {4920#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {4834#true} is VALID [2022-04-08 05:42:53,956 INFO L290 TraceCheckUtils]: 30: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 05:42:53,956 INFO L290 TraceCheckUtils]: 31: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 05:42:53,956 INFO L290 TraceCheckUtils]: 32: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 05:42:53,957 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4834#true} {4920#(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))} #74#return; {4920#(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:42:53,957 INFO L272 TraceCheckUtils]: 34: Hoare triple {4920#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4834#true} is VALID [2022-04-08 05:42:53,957 INFO L290 TraceCheckUtils]: 35: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 05:42:53,957 INFO L290 TraceCheckUtils]: 36: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 05:42:53,957 INFO L290 TraceCheckUtils]: 37: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 05:42:53,958 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4834#true} {4920#(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))} #76#return; {4920#(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:42:53,958 INFO L272 TraceCheckUtils]: 39: Hoare triple {4920#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4834#true} is VALID [2022-04-08 05:42:53,959 INFO L290 TraceCheckUtils]: 40: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 05:42:53,959 INFO L290 TraceCheckUtils]: 41: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 05:42:53,959 INFO L290 TraceCheckUtils]: 42: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 05:42:53,960 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4834#true} {4920#(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))} #78#return; {4920#(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:42:53,960 INFO L290 TraceCheckUtils]: 44: Hoare triple {4920#(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 !!(~a~0 != ~b~0); {4920#(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:42:53,960 INFO L290 TraceCheckUtils]: 45: Hoare triple {4920#(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 !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {4975#(and (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-08 05:42:53,961 INFO L290 TraceCheckUtils]: 46: Hoare triple {4975#(and (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} assume !false; {4975#(and (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-08 05:42:53,961 INFO L272 TraceCheckUtils]: 47: Hoare triple {4975#(and (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {4834#true} is VALID [2022-04-08 05:42:53,961 INFO L290 TraceCheckUtils]: 48: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 05:42:53,961 INFO L290 TraceCheckUtils]: 49: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 05:42:53,961 INFO L290 TraceCheckUtils]: 50: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 05:42:53,961 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4834#true} {4975#(and (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} #74#return; {4975#(and (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-08 05:42:53,962 INFO L272 TraceCheckUtils]: 52: Hoare triple {4975#(and (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4834#true} is VALID [2022-04-08 05:42:53,962 INFO L290 TraceCheckUtils]: 53: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 05:42:53,962 INFO L290 TraceCheckUtils]: 54: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 05:42:53,962 INFO L290 TraceCheckUtils]: 55: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 05:42:53,963 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4834#true} {4975#(and (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} #76#return; {4975#(and (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-08 05:42:53,963 INFO L272 TraceCheckUtils]: 57: Hoare triple {4975#(and (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (= (* (- 1) main_~q~0) 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {5012#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:42:53,964 INFO L290 TraceCheckUtils]: 58: Hoare triple {5012#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5016#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:42:53,964 INFO L290 TraceCheckUtils]: 59: Hoare triple {5016#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4835#false} is VALID [2022-04-08 05:42:53,964 INFO L290 TraceCheckUtils]: 60: Hoare triple {4835#false} assume !false; {4835#false} is VALID [2022-04-08 05:42:53,964 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-08 05:42:53,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:42:54,157 INFO L290 TraceCheckUtils]: 60: Hoare triple {4835#false} assume !false; {4835#false} is VALID [2022-04-08 05:42:54,158 INFO L290 TraceCheckUtils]: 59: Hoare triple {5016#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4835#false} is VALID [2022-04-08 05:42:54,159 INFO L290 TraceCheckUtils]: 58: Hoare triple {5012#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5016#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:42:54,159 INFO L272 TraceCheckUtils]: 57: Hoare triple {5032#(= 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)); {5012#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:42:54,160 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4834#true} {5032#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #76#return; {5032#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:42:54,160 INFO L290 TraceCheckUtils]: 55: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 05:42:54,160 INFO L290 TraceCheckUtils]: 54: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 05:42:54,160 INFO L290 TraceCheckUtils]: 53: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 05:42:54,160 INFO L272 TraceCheckUtils]: 52: Hoare triple {5032#(= 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)); {4834#true} is VALID [2022-04-08 05:42:54,162 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4834#true} {5032#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #74#return; {5032#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:42:54,162 INFO L290 TraceCheckUtils]: 50: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 05:42:54,162 INFO L290 TraceCheckUtils]: 49: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 05:42:54,162 INFO L290 TraceCheckUtils]: 48: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 05:42:54,162 INFO L272 TraceCheckUtils]: 47: Hoare triple {5032#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {4834#true} is VALID [2022-04-08 05:42:54,162 INFO L290 TraceCheckUtils]: 46: Hoare triple {5032#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {5032#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:42:54,380 INFO L290 TraceCheckUtils]: 45: Hoare triple {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {5032#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:42:54,381 INFO L290 TraceCheckUtils]: 44: Hoare triple {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} assume !!(~a~0 != ~b~0); {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} is VALID [2022-04-08 05:42:54,382 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4834#true} {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} #78#return; {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} is VALID [2022-04-08 05:42:54,382 INFO L290 TraceCheckUtils]: 42: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 05:42:54,382 INFO L290 TraceCheckUtils]: 41: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 05:42:54,382 INFO L290 TraceCheckUtils]: 40: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 05:42:54,382 INFO L272 TraceCheckUtils]: 39: Hoare triple {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4834#true} is VALID [2022-04-08 05:42:54,382 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4834#true} {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} #76#return; {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} is VALID [2022-04-08 05:42:54,382 INFO L290 TraceCheckUtils]: 37: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 05:42:54,383 INFO L290 TraceCheckUtils]: 36: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 05:42:54,383 INFO L290 TraceCheckUtils]: 35: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 05:42:54,383 INFO L272 TraceCheckUtils]: 34: Hoare triple {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4834#true} is VALID [2022-04-08 05:42:54,383 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4834#true} {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} #74#return; {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} is VALID [2022-04-08 05:42:54,383 INFO L290 TraceCheckUtils]: 32: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 05:42:54,383 INFO L290 TraceCheckUtils]: 31: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 05:42:54,383 INFO L290 TraceCheckUtils]: 30: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 05:42:54,383 INFO L272 TraceCheckUtils]: 29: Hoare triple {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {4834#true} is VALID [2022-04-08 05:42:54,384 INFO L290 TraceCheckUtils]: 28: Hoare triple {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} assume !false; {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} is VALID [2022-04-08 05:42:54,384 INFO L290 TraceCheckUtils]: 27: Hoare triple {4834#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {5069#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} is VALID [2022-04-08 05:42:54,384 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4834#true} {4834#true} #72#return; {4834#true} is VALID [2022-04-08 05:42:54,384 INFO L290 TraceCheckUtils]: 25: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 05:42:54,384 INFO L290 TraceCheckUtils]: 24: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 05:42:54,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 05:42:54,384 INFO L272 TraceCheckUtils]: 22: Hoare triple {4834#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4834#true} is VALID [2022-04-08 05:42:54,384 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4834#true} {4834#true} #70#return; {4834#true} is VALID [2022-04-08 05:42:54,385 INFO L290 TraceCheckUtils]: 20: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 05:42:54,385 INFO L290 TraceCheckUtils]: 19: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 05:42:54,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 05:42:54,385 INFO L272 TraceCheckUtils]: 17: Hoare triple {4834#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4834#true} is VALID [2022-04-08 05:42:54,385 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4834#true} {4834#true} #68#return; {4834#true} is VALID [2022-04-08 05:42:54,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 05:42:54,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 05:42:54,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 05:42:54,385 INFO L272 TraceCheckUtils]: 12: Hoare triple {4834#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {4834#true} is VALID [2022-04-08 05:42:54,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {4834#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4834#true} is VALID [2022-04-08 05:42:54,385 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4834#true} {4834#true} #66#return; {4834#true} is VALID [2022-04-08 05:42:54,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 05:42:54,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {4834#true} assume !(0 == ~cond); {4834#true} is VALID [2022-04-08 05:42:54,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {4834#true} ~cond := #in~cond; {4834#true} is VALID [2022-04-08 05:42:54,385 INFO L272 TraceCheckUtils]: 6: Hoare triple {4834#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {4834#true} is VALID [2022-04-08 05:42:54,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {4834#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4834#true} is VALID [2022-04-08 05:42:54,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {4834#true} call #t~ret6 := main(); {4834#true} is VALID [2022-04-08 05:42:54,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4834#true} {4834#true} #88#return; {4834#true} is VALID [2022-04-08 05:42:54,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {4834#true} assume true; {4834#true} is VALID [2022-04-08 05:42:54,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {4834#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(10, 2);call #Ultimate.allocInit(12, 3); {4834#true} is VALID [2022-04-08 05:42:54,386 INFO L272 TraceCheckUtils]: 0: Hoare triple {4834#true} call ULTIMATE.init(); {4834#true} is VALID [2022-04-08 05:42:54,386 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-08 05:42:54,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:42:54,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806862493] [2022-04-08 05:42:54,386 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:42:54,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527680818] [2022-04-08 05:42:54,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527680818] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:42:54,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:42:54,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-08 05:42:54,387 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:42:54,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2082246856] [2022-04-08 05:42:54,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2082246856] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:42:54,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:42:54,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 05:42:54,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384192898] [2022-04-08 05:42:54,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:42:54,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 61 [2022-04-08 05:42:54,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:42:54,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-08 05:42:54,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:42:54,416 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 05:42:54,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:42:54,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 05:42:54,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-08 05:42:54,416 INFO L87 Difference]: Start difference. First operand 112 states and 138 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-08 05:42:54,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:42:54,796 INFO L93 Difference]: Finished difference Result 137 states and 178 transitions. [2022-04-08 05:42:54,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 05:42:54,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 61 [2022-04-08 05:42:54,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:42:54,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-08 05:42:54,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-08 05:42:54,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-08 05:42:54,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-08 05:42:54,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2022-04-08 05:42:54,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:42:54,858 INFO L225 Difference]: With dead ends: 137 [2022-04-08 05:42:54,858 INFO L226 Difference]: Without dead ends: 131 [2022-04-08 05:42:54,859 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-08 05:42:54,859 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 05:42:54,859 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 160 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 05:42:54,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-08 05:42:54,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-04-08 05:42:54,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:42:54,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 131 states, 73 states have (on average 1.178082191780822) internal successors, (86), 77 states have internal predecessors, (86), 42 states have call successors, (42), 16 states have call predecessors, (42), 15 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-08 05:42:54,936 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 131 states, 73 states have (on average 1.178082191780822) internal successors, (86), 77 states have internal predecessors, (86), 42 states have call successors, (42), 16 states have call predecessors, (42), 15 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-08 05:42:54,936 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 131 states, 73 states have (on average 1.178082191780822) internal successors, (86), 77 states have internal predecessors, (86), 42 states have call successors, (42), 16 states have call predecessors, (42), 15 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-08 05:42:54,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:42:54,939 INFO L93 Difference]: Finished difference Result 131 states and 167 transitions. [2022-04-08 05:42:54,939 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 167 transitions. [2022-04-08 05:42:54,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:42:54,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:42:54,940 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 73 states have (on average 1.178082191780822) internal successors, (86), 77 states have internal predecessors, (86), 42 states have call successors, (42), 16 states have call predecessors, (42), 15 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) Second operand 131 states. [2022-04-08 05:42:54,940 INFO L87 Difference]: Start difference. First operand has 131 states, 73 states have (on average 1.178082191780822) internal successors, (86), 77 states have internal predecessors, (86), 42 states have call successors, (42), 16 states have call predecessors, (42), 15 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) Second operand 131 states. [2022-04-08 05:42:54,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:42:54,944 INFO L93 Difference]: Finished difference Result 131 states and 167 transitions. [2022-04-08 05:42:54,945 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 167 transitions. [2022-04-08 05:42:54,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:42:54,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:42:54,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:42:54,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:42:54,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 73 states have (on average 1.178082191780822) internal successors, (86), 77 states have internal predecessors, (86), 42 states have call successors, (42), 16 states have call predecessors, (42), 15 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-08 05:42:54,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 167 transitions. [2022-04-08 05:42:54,948 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 167 transitions. Word has length 61 [2022-04-08 05:42:54,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:42:54,949 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 167 transitions. [2022-04-08 05:42:54,950 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-08 05:42:54,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 167 transitions. [2022-04-08 05:42:55,124 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 05:42:55,125 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 167 transitions. [2022-04-08 05:42:55,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-08 05:42:55,125 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:42:55,125 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 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 05:42:55,143 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:42:55,326 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:42:55,326 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:42:55,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:42:55,327 INFO L85 PathProgramCache]: Analyzing trace with hash 2064127436, now seen corresponding path program 1 times [2022-04-08 05:42:55,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:42:55,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1329510848] [2022-04-08 05:42:55,327 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:42:55,327 INFO L85 PathProgramCache]: Analyzing trace with hash 2064127436, now seen corresponding path program 2 times [2022-04-08 05:42:55,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:42:55,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567311334] [2022-04-08 05:42:55,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:42:55,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:42:55,338 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:42:55,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1842586401] [2022-04-08 05:42:55,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:42:55,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:42:55,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:42:55,339 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:42:55,349 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:42:55,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:42:55,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:42:55,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 05:42:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:42:55,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:42:55,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {6007#true} call ULTIMATE.init(); {6007#true} is VALID [2022-04-08 05:42:55,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {6007#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(10, 2);call #Ultimate.allocInit(12, 3); {6007#true} is VALID [2022-04-08 05:42:55,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 05:42:55,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6007#true} {6007#true} #88#return; {6007#true} is VALID [2022-04-08 05:42:55,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {6007#true} call #t~ret6 := main(); {6007#true} is VALID [2022-04-08 05:42:55,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {6007#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {6007#true} is VALID [2022-04-08 05:42:55,734 INFO L272 TraceCheckUtils]: 6: Hoare triple {6007#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {6007#true} is VALID [2022-04-08 05:42:55,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 05:42:55,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 05:42:55,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 05:42:55,735 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6007#true} {6007#true} #66#return; {6007#true} is VALID [2022-04-08 05:42:55,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {6007#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6007#true} is VALID [2022-04-08 05:42:55,735 INFO L272 TraceCheckUtils]: 12: Hoare triple {6007#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {6007#true} is VALID [2022-04-08 05:42:55,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 05:42:55,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 05:42:55,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 05:42:55,735 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6007#true} {6007#true} #68#return; {6007#true} is VALID [2022-04-08 05:42:55,735 INFO L272 TraceCheckUtils]: 17: Hoare triple {6007#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6007#true} is VALID [2022-04-08 05:42:55,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 05:42:55,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 05:42:55,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 05:42:55,735 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6007#true} {6007#true} #70#return; {6007#true} is VALID [2022-04-08 05:42:55,735 INFO L272 TraceCheckUtils]: 22: Hoare triple {6007#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6007#true} is VALID [2022-04-08 05:42:55,735 INFO L290 TraceCheckUtils]: 23: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 05:42:55,735 INFO L290 TraceCheckUtils]: 24: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 05:42:55,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 05:42:55,736 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6007#true} {6007#true} #72#return; {6007#true} is VALID [2022-04-08 05:42:55,736 INFO L290 TraceCheckUtils]: 27: Hoare triple {6007#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:42:55,736 INFO L290 TraceCheckUtils]: 28: Hoare triple {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:42:55,736 INFO L272 TraceCheckUtils]: 29: Hoare triple {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {6007#true} is VALID [2022-04-08 05:42:55,736 INFO L290 TraceCheckUtils]: 30: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 05:42:55,736 INFO L290 TraceCheckUtils]: 31: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 05:42:55,736 INFO L290 TraceCheckUtils]: 32: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 05:42:55,738 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6007#true} {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #74#return; {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:42:55,738 INFO L272 TraceCheckUtils]: 34: Hoare triple {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6007#true} is VALID [2022-04-08 05:42:55,738 INFO L290 TraceCheckUtils]: 35: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 05:42:55,738 INFO L290 TraceCheckUtils]: 36: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 05:42:55,738 INFO L290 TraceCheckUtils]: 37: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 05:42:55,738 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6007#true} {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #76#return; {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:42:55,738 INFO L272 TraceCheckUtils]: 39: Hoare triple {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6007#true} is VALID [2022-04-08 05:42:55,738 INFO L290 TraceCheckUtils]: 40: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 05:42:55,739 INFO L290 TraceCheckUtils]: 41: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 05:42:55,739 INFO L290 TraceCheckUtils]: 42: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 05:42:55,739 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6007#true} {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #78#return; {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:42:55,739 INFO L290 TraceCheckUtils]: 44: Hoare triple {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:42:55,740 INFO L290 TraceCheckUtils]: 45: Hoare triple {6093#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-08 05:42:55,740 INFO L290 TraceCheckUtils]: 46: Hoare triple {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} assume !false; {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-08 05:42:55,740 INFO L272 TraceCheckUtils]: 47: Hoare triple {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {6007#true} is VALID [2022-04-08 05:42:55,740 INFO L290 TraceCheckUtils]: 48: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 05:42:55,740 INFO L290 TraceCheckUtils]: 49: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 05:42:55,740 INFO L290 TraceCheckUtils]: 50: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 05:42:55,741 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {6007#true} {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} #74#return; {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-08 05:42:55,741 INFO L272 TraceCheckUtils]: 52: Hoare triple {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6007#true} is VALID [2022-04-08 05:42:55,741 INFO L290 TraceCheckUtils]: 53: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 05:42:55,741 INFO L290 TraceCheckUtils]: 54: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 05:42:55,741 INFO L290 TraceCheckUtils]: 55: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 05:42:55,743 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {6007#true} {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} #76#return; {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-08 05:42:55,744 INFO L272 TraceCheckUtils]: 57: Hoare triple {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6007#true} is VALID [2022-04-08 05:42:55,744 INFO L290 TraceCheckUtils]: 58: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 05:42:55,744 INFO L290 TraceCheckUtils]: 59: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 05:42:55,744 INFO L290 TraceCheckUtils]: 60: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 05:42:55,744 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {6007#true} {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} #78#return; {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-08 05:42:55,745 INFO L290 TraceCheckUtils]: 62: Hoare triple {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} assume !!(~a~0 != ~b~0); {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-08 05:42:55,745 INFO L290 TraceCheckUtils]: 63: Hoare triple {6148#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {6203#(and (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID [2022-04-08 05:42:55,745 INFO L290 TraceCheckUtils]: 64: Hoare triple {6203#(and (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} assume !false; {6203#(and (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID [2022-04-08 05:42:55,746 INFO L272 TraceCheckUtils]: 65: Hoare triple {6203#(and (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {6210#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:42:55,746 INFO L290 TraceCheckUtils]: 66: Hoare triple {6210#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6214#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:42:55,746 INFO L290 TraceCheckUtils]: 67: Hoare triple {6214#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6008#false} is VALID [2022-04-08 05:42:55,746 INFO L290 TraceCheckUtils]: 68: Hoare triple {6008#false} assume !false; {6008#false} is VALID [2022-04-08 05:42:55,747 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 05:42:55,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:42:55,982 INFO L290 TraceCheckUtils]: 68: Hoare triple {6008#false} assume !false; {6008#false} is VALID [2022-04-08 05:42:55,982 INFO L290 TraceCheckUtils]: 67: Hoare triple {6214#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6008#false} is VALID [2022-04-08 05:42:55,983 INFO L290 TraceCheckUtils]: 66: Hoare triple {6210#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6214#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:42:55,983 INFO L272 TraceCheckUtils]: 65: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {6210#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:42:55,984 INFO L290 TraceCheckUtils]: 64: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !false; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 05:42:55,986 INFO L290 TraceCheckUtils]: 63: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 05:42:55,986 INFO L290 TraceCheckUtils]: 62: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !!(~a~0 != ~b~0); {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 05:42:55,987 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {6007#true} {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #78#return; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 05:42:55,987 INFO L290 TraceCheckUtils]: 60: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 05:42:55,987 INFO L290 TraceCheckUtils]: 59: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 05:42:55,987 INFO L290 TraceCheckUtils]: 58: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 05:42:55,987 INFO L272 TraceCheckUtils]: 57: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6007#true} is VALID [2022-04-08 05:42:55,987 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {6007#true} {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #76#return; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 05:42:55,987 INFO L290 TraceCheckUtils]: 55: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 05:42:55,988 INFO L290 TraceCheckUtils]: 54: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 05:42:55,988 INFO L290 TraceCheckUtils]: 53: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 05:42:55,988 INFO L272 TraceCheckUtils]: 52: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6007#true} is VALID [2022-04-08 05:42:55,988 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {6007#true} {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #74#return; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 05:42:55,988 INFO L290 TraceCheckUtils]: 50: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 05:42:55,988 INFO L290 TraceCheckUtils]: 49: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 05:42:55,988 INFO L290 TraceCheckUtils]: 48: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 05:42:55,988 INFO L272 TraceCheckUtils]: 47: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {6007#true} is VALID [2022-04-08 05:42:55,989 INFO L290 TraceCheckUtils]: 46: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !false; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 05:42:55,991 INFO L290 TraceCheckUtils]: 45: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 05:42:55,991 INFO L290 TraceCheckUtils]: 44: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !!(~a~0 != ~b~0); {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 05:42:55,991 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6007#true} {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #78#return; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 05:42:55,991 INFO L290 TraceCheckUtils]: 42: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 05:42:55,992 INFO L290 TraceCheckUtils]: 41: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 05:42:55,992 INFO L290 TraceCheckUtils]: 40: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 05:42:55,992 INFO L272 TraceCheckUtils]: 39: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6007#true} is VALID [2022-04-08 05:42:55,994 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6007#true} {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #76#return; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 05:42:55,994 INFO L290 TraceCheckUtils]: 37: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 05:42:55,994 INFO L290 TraceCheckUtils]: 36: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 05:42:55,994 INFO L290 TraceCheckUtils]: 35: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 05:42:55,994 INFO L272 TraceCheckUtils]: 34: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6007#true} is VALID [2022-04-08 05:42:56,003 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6007#true} {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #74#return; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 05:42:56,004 INFO L290 TraceCheckUtils]: 32: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 05:42:56,004 INFO L290 TraceCheckUtils]: 31: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 05:42:56,004 INFO L290 TraceCheckUtils]: 30: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 05:42:56,004 INFO L272 TraceCheckUtils]: 29: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {6007#true} is VALID [2022-04-08 05:42:56,004 INFO L290 TraceCheckUtils]: 28: Hoare triple {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !false; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 05:42:56,005 INFO L290 TraceCheckUtils]: 27: Hoare triple {6007#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {6230#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-08 05:42:56,005 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6007#true} {6007#true} #72#return; {6007#true} is VALID [2022-04-08 05:42:56,005 INFO L290 TraceCheckUtils]: 25: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 05:42:56,005 INFO L290 TraceCheckUtils]: 24: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 05:42:56,005 INFO L290 TraceCheckUtils]: 23: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 05:42:56,005 INFO L272 TraceCheckUtils]: 22: Hoare triple {6007#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6007#true} is VALID [2022-04-08 05:42:56,005 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6007#true} {6007#true} #70#return; {6007#true} is VALID [2022-04-08 05:42:56,005 INFO L290 TraceCheckUtils]: 20: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 05:42:56,005 INFO L290 TraceCheckUtils]: 19: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 05:42:56,005 INFO L290 TraceCheckUtils]: 18: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 05:42:56,005 INFO L272 TraceCheckUtils]: 17: Hoare triple {6007#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6007#true} is VALID [2022-04-08 05:42:56,005 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6007#true} {6007#true} #68#return; {6007#true} is VALID [2022-04-08 05:42:56,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 05:42:56,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 05:42:56,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 05:42:56,006 INFO L272 TraceCheckUtils]: 12: Hoare triple {6007#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {6007#true} is VALID [2022-04-08 05:42:56,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {6007#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6007#true} is VALID [2022-04-08 05:42:56,006 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6007#true} {6007#true} #66#return; {6007#true} is VALID [2022-04-08 05:42:56,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 05:42:56,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {6007#true} assume !(0 == ~cond); {6007#true} is VALID [2022-04-08 05:42:56,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {6007#true} ~cond := #in~cond; {6007#true} is VALID [2022-04-08 05:42:56,006 INFO L272 TraceCheckUtils]: 6: Hoare triple {6007#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {6007#true} is VALID [2022-04-08 05:42:56,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {6007#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {6007#true} is VALID [2022-04-08 05:42:56,006 INFO L272 TraceCheckUtils]: 4: Hoare triple {6007#true} call #t~ret6 := main(); {6007#true} is VALID [2022-04-08 05:42:56,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6007#true} {6007#true} #88#return; {6007#true} is VALID [2022-04-08 05:42:56,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {6007#true} assume true; {6007#true} is VALID [2022-04-08 05:42:56,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {6007#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(10, 2);call #Ultimate.allocInit(12, 3); {6007#true} is VALID [2022-04-08 05:42:56,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {6007#true} call ULTIMATE.init(); {6007#true} is VALID [2022-04-08 05:42:56,006 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-04-08 05:42:56,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:42:56,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567311334] [2022-04-08 05:42:56,007 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:42:56,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842586401] [2022-04-08 05:42:56,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842586401] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 05:42:56,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 05:42:56,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2022-04-08 05:42:56,007 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:42:56,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1329510848] [2022-04-08 05:42:56,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1329510848] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:42:56,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:42:56,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:42:56,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530185073] [2022-04-08 05:42:56,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:42:56,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (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 69 [2022-04-08 05:42:56,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:42:56,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (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:42:56,040 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:42:56,041 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 05:42:56,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:42:56,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 05:42:56,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-08 05:42:56,041 INFO L87 Difference]: Start difference. First operand 131 states and 167 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (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:42:56,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:42:56,248 INFO L93 Difference]: Finished difference Result 137 states and 172 transitions. [2022-04-08 05:42:56,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 05:42:56,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (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 69 [2022-04-08 05:42:56,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:42:56,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (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:42:56,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 05:42:56,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (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:42:56,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 05:42:56,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-08 05:42:56,288 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:42:56,290 INFO L225 Difference]: With dead ends: 137 [2022-04-08 05:42:56,291 INFO L226 Difference]: Without dead ends: 132 [2022-04-08 05:42:56,291 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-08 05:42:56,291 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 05:42:56,292 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 116 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:42:56,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-08 05:42:56,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-04-08 05:42:56,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:42:56,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 132 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 79 states have internal predecessors, (88), 39 states have call successors, (39), 17 states have call predecessors, (39), 16 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 05:42:56,355 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 132 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 79 states have internal predecessors, (88), 39 states have call successors, (39), 17 states have call predecessors, (39), 16 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 05:42:56,355 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 132 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 79 states have internal predecessors, (88), 39 states have call successors, (39), 17 states have call predecessors, (39), 16 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 05:42:56,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:42:56,358 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2022-04-08 05:42:56,358 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2022-04-08 05:42:56,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:42:56,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:42:56,358 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 79 states have internal predecessors, (88), 39 states have call successors, (39), 17 states have call predecessors, (39), 16 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) Second operand 132 states. [2022-04-08 05:42:56,359 INFO L87 Difference]: Start difference. First operand has 132 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 79 states have internal predecessors, (88), 39 states have call successors, (39), 17 states have call predecessors, (39), 16 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) Second operand 132 states. [2022-04-08 05:42:56,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:42:56,361 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2022-04-08 05:42:56,361 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2022-04-08 05:42:56,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:42:56,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:42:56,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:42:56,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:42:56,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 79 states have internal predecessors, (88), 39 states have call successors, (39), 17 states have call predecessors, (39), 16 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 05:42:56,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 164 transitions. [2022-04-08 05:42:56,364 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 164 transitions. Word has length 69 [2022-04-08 05:42:56,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:42:56,364 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 164 transitions. [2022-04-08 05:42:56,364 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (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:42:56,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 164 transitions. [2022-04-08 05:42:56,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:42:56,568 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2022-04-08 05:42:56,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-08 05:42:56,569 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:42:56,569 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 3, 3, 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] [2022-04-08 05:42:56,585 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:42:56,783 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:42:56,783 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:42:56,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:42:56,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1196252297, now seen corresponding path program 5 times [2022-04-08 05:42:56,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:42:56,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [98844605] [2022-04-08 05:42:56,784 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:42:56,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1196252297, now seen corresponding path program 6 times [2022-04-08 05:42:56,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:42:56,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840957649] [2022-04-08 05:42:56,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:42:56,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:42:56,799 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:42:56,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [646578050] [2022-04-08 05:42:56,799 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 05:42:56,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:42:56,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:42:56,800 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 05:42:56,803 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:42:56,854 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 05:42:56,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:42:56,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-08 05:42:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:42:56,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:42:58,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {7232#true} call ULTIMATE.init(); {7232#true} is VALID [2022-04-08 05:42:58,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {7232#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(10, 2);call #Ultimate.allocInit(12, 3); {7232#true} is VALID [2022-04-08 05:42:58,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-08 05:42:58,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7232#true} {7232#true} #88#return; {7232#true} is VALID [2022-04-08 05:42:58,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {7232#true} call #t~ret6 := main(); {7232#true} is VALID [2022-04-08 05:42:58,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {7232#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {7232#true} is VALID [2022-04-08 05:42:58,900 INFO L272 TraceCheckUtils]: 6: Hoare triple {7232#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {7232#true} is VALID [2022-04-08 05:42:58,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {7232#true} ~cond := #in~cond; {7258#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:42:58,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {7258#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {7262#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:42:58,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {7262#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {7262#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:42:58,902 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7262#(not (= |assume_abort_if_not_#in~cond| 0))} {7232#true} #66#return; {7269#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 05:42:58,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {7269#(and (<= 0 main_~x~0) (<= main_~x~0 5))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7269#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 05:42:58,902 INFO L272 TraceCheckUtils]: 12: Hoare triple {7269#(and (<= 0 main_~x~0) (<= main_~x~0 5))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {7232#true} is VALID [2022-04-08 05:42:58,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID [2022-04-08 05:42:58,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID [2022-04-08 05:42:58,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-08 05:42:58,903 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7232#true} {7269#(and (<= 0 main_~x~0) (<= main_~x~0 5))} #68#return; {7269#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 05:42:58,903 INFO L272 TraceCheckUtils]: 17: Hoare triple {7269#(and (<= 0 main_~x~0) (<= main_~x~0 5))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7232#true} is VALID [2022-04-08 05:42:58,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID [2022-04-08 05:42:58,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID [2022-04-08 05:42:58,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-08 05:42:58,903 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7232#true} {7269#(and (<= 0 main_~x~0) (<= main_~x~0 5))} #70#return; {7269#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 05:42:58,903 INFO L272 TraceCheckUtils]: 22: Hoare triple {7269#(and (<= 0 main_~x~0) (<= main_~x~0 5))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7232#true} is VALID [2022-04-08 05:42:58,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {7232#true} ~cond := #in~cond; {7258#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:42:58,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {7258#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {7262#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:42:58,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {7262#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {7262#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:42:58,905 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7262#(not (= |assume_abort_if_not_#in~cond| 0))} {7269#(and (<= 0 main_~x~0) (<= main_~x~0 5))} #72#return; {7318#(and (<= 0 main_~x~0) (<= main_~x~0 5) (<= 1 main_~y~0))} is VALID [2022-04-08 05:42:58,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {7318#(and (<= 0 main_~x~0) (<= main_~x~0 5) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {7322#(and (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} is VALID [2022-04-08 05:42:58,906 INFO L290 TraceCheckUtils]: 28: Hoare triple {7322#(and (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} assume !false; {7322#(and (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} is VALID [2022-04-08 05:42:58,906 INFO L272 TraceCheckUtils]: 29: Hoare triple {7322#(and (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {7232#true} is VALID [2022-04-08 05:42:58,906 INFO L290 TraceCheckUtils]: 30: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID [2022-04-08 05:42:58,906 INFO L290 TraceCheckUtils]: 31: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID [2022-04-08 05:42:58,906 INFO L290 TraceCheckUtils]: 32: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-08 05:42:58,907 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {7232#true} {7322#(and (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} #74#return; {7322#(and (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} is VALID [2022-04-08 05:42:58,907 INFO L272 TraceCheckUtils]: 34: Hoare triple {7322#(and (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7232#true} is VALID [2022-04-08 05:42:58,907 INFO L290 TraceCheckUtils]: 35: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID [2022-04-08 05:42:58,907 INFO L290 TraceCheckUtils]: 36: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID [2022-04-08 05:42:58,907 INFO L290 TraceCheckUtils]: 37: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-08 05:42:58,908 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7232#true} {7322#(and (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} #76#return; {7322#(and (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} is VALID [2022-04-08 05:42:58,908 INFO L272 TraceCheckUtils]: 39: Hoare triple {7322#(and (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7232#true} is VALID [2022-04-08 05:42:58,908 INFO L290 TraceCheckUtils]: 40: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID [2022-04-08 05:42:58,908 INFO L290 TraceCheckUtils]: 41: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID [2022-04-08 05:42:58,908 INFO L290 TraceCheckUtils]: 42: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-08 05:42:58,909 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7232#true} {7322#(and (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} #78#return; {7322#(and (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} is VALID [2022-04-08 05:42:58,909 INFO L290 TraceCheckUtils]: 44: Hoare triple {7322#(and (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {7322#(and (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} is VALID [2022-04-08 05:42:58,910 INFO L290 TraceCheckUtils]: 45: Hoare triple {7322#(and (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {7377#(and (<= main_~x~0 (+ main_~b~0 main_~a~0)) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= (+ main_~s~0 main_~r~0) 0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 05:42:58,910 INFO L290 TraceCheckUtils]: 46: Hoare triple {7377#(and (<= main_~x~0 (+ main_~b~0 main_~a~0)) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= (+ main_~s~0 main_~r~0) 0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !false; {7377#(and (<= main_~x~0 (+ main_~b~0 main_~a~0)) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= (+ main_~s~0 main_~r~0) 0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 05:42:58,911 INFO L272 TraceCheckUtils]: 47: Hoare triple {7377#(and (<= main_~x~0 (+ main_~b~0 main_~a~0)) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= (+ main_~s~0 main_~r~0) 0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {7232#true} is VALID [2022-04-08 05:42:58,911 INFO L290 TraceCheckUtils]: 48: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID [2022-04-08 05:42:58,911 INFO L290 TraceCheckUtils]: 49: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID [2022-04-08 05:42:58,911 INFO L290 TraceCheckUtils]: 50: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-08 05:42:58,911 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {7232#true} {7377#(and (<= main_~x~0 (+ main_~b~0 main_~a~0)) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= (+ main_~s~0 main_~r~0) 0) (= main_~q~0 0) (<= 1 main_~y~0))} #74#return; {7377#(and (<= main_~x~0 (+ main_~b~0 main_~a~0)) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= (+ main_~s~0 main_~r~0) 0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 05:42:58,911 INFO L272 TraceCheckUtils]: 52: Hoare triple {7377#(and (<= main_~x~0 (+ main_~b~0 main_~a~0)) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= (+ main_~s~0 main_~r~0) 0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7232#true} is VALID [2022-04-08 05:42:58,912 INFO L290 TraceCheckUtils]: 53: Hoare triple {7232#true} ~cond := #in~cond; {7402#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:42:58,912 INFO L290 TraceCheckUtils]: 54: Hoare triple {7402#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7406#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:42:58,912 INFO L290 TraceCheckUtils]: 55: Hoare triple {7406#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7406#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:42:58,913 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {7406#(not (= |__VERIFIER_assert_#in~cond| 0))} {7377#(and (<= main_~x~0 (+ main_~b~0 main_~a~0)) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= (+ main_~s~0 main_~r~0) 0) (= main_~q~0 0) (<= 1 main_~y~0))} #76#return; {7413#(and (<= main_~x~0 (+ main_~b~0 main_~a~0)) (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= 0 main_~x~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= (+ main_~s~0 main_~r~0) 0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 05:42:58,913 INFO L272 TraceCheckUtils]: 57: Hoare triple {7413#(and (<= main_~x~0 (+ main_~b~0 main_~a~0)) (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= 0 main_~x~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= (+ main_~s~0 main_~r~0) 0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7232#true} is VALID [2022-04-08 05:42:58,913 INFO L290 TraceCheckUtils]: 58: Hoare triple {7232#true} ~cond := #in~cond; {7232#true} is VALID [2022-04-08 05:42:58,913 INFO L290 TraceCheckUtils]: 59: Hoare triple {7232#true} assume !(0 == ~cond); {7232#true} is VALID [2022-04-08 05:42:58,913 INFO L290 TraceCheckUtils]: 60: Hoare triple {7232#true} assume true; {7232#true} is VALID [2022-04-08 05:42:58,914 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {7232#true} {7413#(and (<= main_~x~0 (+ main_~b~0 main_~a~0)) (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= 0 main_~x~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= (+ main_~s~0 main_~r~0) 0) (= main_~q~0 0) (<= 1 main_~y~0))} #78#return; {7413#(and (<= main_~x~0 (+ main_~b~0 main_~a~0)) (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= 0 main_~x~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= (+ main_~s~0 main_~r~0) 0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 05:42:58,915 INFO L290 TraceCheckUtils]: 62: Hoare triple {7413#(and (<= main_~x~0 (+ main_~b~0 main_~a~0)) (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= 0 main_~x~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= (+ main_~s~0 main_~r~0) 0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(~a~0 != ~b~0); {7413#(and (<= main_~x~0 (+ main_~b~0 main_~a~0)) (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= 0 main_~x~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= (+ main_~s~0 main_~r~0) 0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 05:42:58,917 INFO L290 TraceCheckUtils]: 63: Hoare triple {7413#(and (<= main_~x~0 (+ main_~b~0 main_~a~0)) (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= 0 main_~x~0) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= (+ main_~s~0 main_~r~0) 0) (= main_~q~0 0) (<= 1 main_~y~0))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {7435#(and (<= (+ main_~r~0 (* main_~s~0 2)) 0) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (<= main_~x~0 5) (= (+ (* main_~q~0 main_~x~0) main_~a~0 main_~y~0) (+ (* main_~y~0 main_~r~0) main_~x~0 (* main_~y~0 main_~s~0))) (< 0 main_~a~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= (+ (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* 2 (* main_~y~0 main_~s~0)) main_~x~0 (* (* main_~y~0 main_~r~0) 2))))} is VALID [2022-04-08 05:42:58,917 INFO L290 TraceCheckUtils]: 64: Hoare triple {7435#(and (<= (+ main_~r~0 (* main_~s~0 2)) 0) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (<= main_~x~0 5) (= (+ (* main_~q~0 main_~x~0) main_~a~0 main_~y~0) (+ (* main_~y~0 main_~r~0) main_~x~0 (* main_~y~0 main_~s~0))) (< 0 main_~a~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= (+ (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* 2 (* main_~y~0 main_~s~0)) main_~x~0 (* (* main_~y~0 main_~r~0) 2))))} assume !false; {7435#(and (<= (+ main_~r~0 (* main_~s~0 2)) 0) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (<= main_~x~0 5) (= (+ (* main_~q~0 main_~x~0) main_~a~0 main_~y~0) (+ (* main_~y~0 main_~r~0) main_~x~0 (* main_~y~0 main_~s~0))) (< 0 main_~a~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= (+ (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* 2 (* main_~y~0 main_~s~0)) main_~x~0 (* (* main_~y~0 main_~r~0) 2))))} is VALID [2022-04-08 05:42:58,917 INFO L272 TraceCheckUtils]: 65: Hoare triple {7435#(and (<= (+ main_~r~0 (* main_~s~0 2)) 0) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (<= main_~x~0 5) (= (+ (* main_~q~0 main_~x~0) main_~a~0 main_~y~0) (+ (* main_~y~0 main_~r~0) main_~x~0 (* main_~y~0 main_~s~0))) (< 0 main_~a~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= (+ (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* 2 (* main_~y~0 main_~s~0)) main_~x~0 (* (* main_~y~0 main_~r~0) 2))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {7232#true} is VALID [2022-04-08 05:42:58,918 INFO L290 TraceCheckUtils]: 66: Hoare triple {7232#true} ~cond := #in~cond; {7402#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:42:58,918 INFO L290 TraceCheckUtils]: 67: Hoare triple {7402#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7406#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:42:58,918 INFO L290 TraceCheckUtils]: 68: Hoare triple {7406#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7406#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:42:58,920 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {7406#(not (= |__VERIFIER_assert_#in~cond| 0))} {7435#(and (<= (+ main_~r~0 (* main_~s~0 2)) 0) (= main_~s~0 1) (= (+ main_~p~0 (* main_~q~0 2)) 1) (<= main_~x~0 5) (= (+ (* main_~q~0 main_~x~0) main_~a~0 main_~y~0) (+ (* main_~y~0 main_~r~0) main_~x~0 (* main_~y~0 main_~s~0))) (< 0 main_~a~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= (+ (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* 2 (* main_~y~0 main_~s~0)) main_~x~0 (* (* main_~y~0 main_~r~0) 2))))} #74#return; {7454#(and (= (+ main_~a~0 main_~y~0) (+ (* main_~y~0 main_~r~0) main_~y~0 main_~x~0)) (<= (+ main_~r~0 2) 0) (<= main_~a~0 (+ main_~x~0 (* (* main_~y~0 main_~r~0) 2) (* main_~y~0 2))) (<= main_~x~0 5) (< 0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} is VALID [2022-04-08 05:42:58,922 INFO L272 TraceCheckUtils]: 70: Hoare triple {7454#(and (= (+ main_~a~0 main_~y~0) (+ (* main_~y~0 main_~r~0) main_~y~0 main_~x~0)) (<= (+ main_~r~0 2) 0) (<= main_~a~0 (+ main_~x~0 (* (* main_~y~0 main_~r~0) 2) (* main_~y~0 2))) (<= main_~x~0 5) (< 0 main_~a~0) (<= 1 main_~y~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7458#(exists ((v_main_~y~0_BEFORE_CALL_41 Int) (v_main_~r~0_BEFORE_CALL_47 Int) (v_main_~a~0_BEFORE_CALL_30 Int)) (and (<= (+ v_main_~r~0_BEFORE_CALL_47 2) 0) (< 0 v_main_~a~0_BEFORE_CALL_30) (<= 1 v_main_~y~0_BEFORE_CALL_41) (<= v_main_~a~0_BEFORE_CALL_30 (+ (* v_main_~r~0_BEFORE_CALL_47 v_main_~y~0_BEFORE_CALL_41) 5)) (<= 1 |__VERIFIER_assert_#in~cond|) (<= 0 (+ (* v_main_~r~0_BEFORE_CALL_47 v_main_~y~0_BEFORE_CALL_41) (* 2 v_main_~y~0_BEFORE_CALL_41)))))} is VALID [2022-04-08 05:42:58,923 INFO L290 TraceCheckUtils]: 71: Hoare triple {7458#(exists ((v_main_~y~0_BEFORE_CALL_41 Int) (v_main_~r~0_BEFORE_CALL_47 Int) (v_main_~a~0_BEFORE_CALL_30 Int)) (and (<= (+ v_main_~r~0_BEFORE_CALL_47 2) 0) (< 0 v_main_~a~0_BEFORE_CALL_30) (<= 1 v_main_~y~0_BEFORE_CALL_41) (<= v_main_~a~0_BEFORE_CALL_30 (+ (* v_main_~r~0_BEFORE_CALL_47 v_main_~y~0_BEFORE_CALL_41) 5)) (<= 1 |__VERIFIER_assert_#in~cond|) (<= 0 (+ (* v_main_~r~0_BEFORE_CALL_47 v_main_~y~0_BEFORE_CALL_41) (* 2 v_main_~y~0_BEFORE_CALL_41)))))} ~cond := #in~cond; {7462#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:42:58,923 INFO L290 TraceCheckUtils]: 72: Hoare triple {7462#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7233#false} is VALID [2022-04-08 05:42:58,923 INFO L290 TraceCheckUtils]: 73: Hoare triple {7233#false} assume !false; {7233#false} is VALID [2022-04-08 05:42:58,923 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 45 proven. 23 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-08 05:42:58,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:45:12,734 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 05:45:19,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:45:19,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840957649] [2022-04-08 05:45:19,949 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:45:19,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646578050] [2022-04-08 05:45:19,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646578050] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 05:45:19,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 05:45:19,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-08 05:45:19,950 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:45:19,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [98844605] [2022-04-08 05:45:19,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [98844605] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:45:19,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:45:19,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 05:45:19,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26417514] [2022-04-08 05:45:19,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:45:19,950 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) Word has length 74 [2022-04-08 05:45:19,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:45:19,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-08 05:45:19,994 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:45:19,995 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 05:45:19,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:45:19,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 05:45:19,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=381, Unknown=3, NotChecked=0, Total=462 [2022-04-08 05:45:19,995 INFO L87 Difference]: Start difference. First operand 132 states and 164 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-08 05:45:22,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:45:22,353 INFO L93 Difference]: Finished difference Result 162 states and 204 transitions. [2022-04-08 05:45:22,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 05:45:22,353 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) Word has length 74 [2022-04-08 05:45:22,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:45:22,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-08 05:45:22,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 97 transitions. [2022-04-08 05:45:22,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-08 05:45:22,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 97 transitions. [2022-04-08 05:45:22,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 97 transitions. [2022-04-08 05:45:22,467 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 05:45:22,469 INFO L225 Difference]: With dead ends: 162 [2022-04-08 05:45:22,469 INFO L226 Difference]: Without dead ends: 160 [2022-04-08 05:45:22,469 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=96, Invalid=501, Unknown=3, NotChecked=0, Total=600 [2022-04-08 05:45:22,470 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 36 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-08 05:45:22,470 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 157 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 498 Invalid, 0 Unknown, 9 Unchecked, 1.1s Time] [2022-04-08 05:45:22,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-08 05:45:22,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 142. [2022-04-08 05:45:22,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:45:22,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 142 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 85 states have internal predecessors, (95), 42 states have call successors, (42), 18 states have call predecessors, (42), 17 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-08 05:45:22,620 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 142 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 85 states have internal predecessors, (95), 42 states have call successors, (42), 18 states have call predecessors, (42), 17 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-08 05:45:22,621 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 142 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 85 states have internal predecessors, (95), 42 states have call successors, (42), 18 states have call predecessors, (42), 17 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-08 05:45:22,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:45:22,623 INFO L93 Difference]: Finished difference Result 160 states and 202 transitions. [2022-04-08 05:45:22,623 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 202 transitions. [2022-04-08 05:45:22,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:45:22,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:45:22,624 INFO L74 IsIncluded]: Start isIncluded. First operand has 142 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 85 states have internal predecessors, (95), 42 states have call successors, (42), 18 states have call predecessors, (42), 17 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) Second operand 160 states. [2022-04-08 05:45:22,625 INFO L87 Difference]: Start difference. First operand has 142 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 85 states have internal predecessors, (95), 42 states have call successors, (42), 18 states have call predecessors, (42), 17 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) Second operand 160 states. [2022-04-08 05:45:22,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:45:22,627 INFO L93 Difference]: Finished difference Result 160 states and 202 transitions. [2022-04-08 05:45:22,627 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 202 transitions. [2022-04-08 05:45:22,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:45:22,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:45:22,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:45:22,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:45:22,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 85 states have internal predecessors, (95), 42 states have call successors, (42), 18 states have call predecessors, (42), 17 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-08 05:45:22,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 177 transitions. [2022-04-08 05:45:22,630 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 177 transitions. Word has length 74 [2022-04-08 05:45:22,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:45:22,630 INFO L478 AbstractCegarLoop]: Abstraction has 142 states and 177 transitions. [2022-04-08 05:45:22,631 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-08 05:45:22,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 142 states and 177 transitions. [2022-04-08 05:45:22,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:45:22,845 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 177 transitions. [2022-04-08 05:45:22,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-08 05:45:22,846 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:45:22,846 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:45:22,862 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:45:23,046 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:45:23,047 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:45:23,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:45:23,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1712511605, now seen corresponding path program 3 times [2022-04-08 05:45:23,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:45:23,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [301163882] [2022-04-08 05:45:23,048 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:45:23,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1712511605, now seen corresponding path program 4 times [2022-04-08 05:45:23,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:45:23,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541005355] [2022-04-08 05:45:23,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:45:23,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:45:23,058 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:45:23,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [569371856] [2022-04-08 05:45:23,059 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 05:45:23,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:45:23,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:45:23,059 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:45:23,060 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:45:23,100 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 05:45:23,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:45:23,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 05:45:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:45:23,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:45:24,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {8503#true} call ULTIMATE.init(); {8503#true} is VALID [2022-04-08 05:45:24,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {8503#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(10, 2);call #Ultimate.allocInit(12, 3); {8503#true} is VALID [2022-04-08 05:45:24,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 05:45:24,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8503#true} {8503#true} #88#return; {8503#true} is VALID [2022-04-08 05:45:24,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {8503#true} call #t~ret6 := main(); {8503#true} is VALID [2022-04-08 05:45:24,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {8503#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {8503#true} is VALID [2022-04-08 05:45:24,059 INFO L272 TraceCheckUtils]: 6: Hoare triple {8503#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {8503#true} is VALID [2022-04-08 05:45:24,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 05:45:24,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 05:45:24,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 05:45:24,059 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8503#true} {8503#true} #66#return; {8503#true} is VALID [2022-04-08 05:45:24,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {8503#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8503#true} is VALID [2022-04-08 05:45:24,059 INFO L272 TraceCheckUtils]: 12: Hoare triple {8503#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {8503#true} is VALID [2022-04-08 05:45:24,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 05:45:24,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 05:45:24,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 05:45:24,059 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8503#true} {8503#true} #68#return; {8503#true} is VALID [2022-04-08 05:45:24,059 INFO L272 TraceCheckUtils]: 17: Hoare triple {8503#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8503#true} is VALID [2022-04-08 05:45:24,060 INFO L290 TraceCheckUtils]: 18: Hoare triple {8503#true} ~cond := #in~cond; {8562#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:45:24,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {8562#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {8566#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:45:24,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {8566#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {8566#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:45:24,060 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8566#(not (= |assume_abort_if_not_#in~cond| 0))} {8503#true} #70#return; {8573#(<= 1 main_~x~0)} is VALID [2022-04-08 05:45:24,061 INFO L272 TraceCheckUtils]: 22: Hoare triple {8573#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8503#true} is VALID [2022-04-08 05:45:24,061 INFO L290 TraceCheckUtils]: 23: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 05:45:24,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 05:45:24,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 05:45:24,061 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8503#true} {8573#(<= 1 main_~x~0)} #72#return; {8573#(<= 1 main_~x~0)} is VALID [2022-04-08 05:45:24,061 INFO L290 TraceCheckUtils]: 27: Hoare triple {8573#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {8592#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:45:24,062 INFO L290 TraceCheckUtils]: 28: Hoare triple {8592#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {8592#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:45:24,062 INFO L272 TraceCheckUtils]: 29: Hoare triple {8592#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {8503#true} is VALID [2022-04-08 05:45:24,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 05:45:24,062 INFO L290 TraceCheckUtils]: 31: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 05:45:24,062 INFO L290 TraceCheckUtils]: 32: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 05:45:24,063 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {8503#true} {8592#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #74#return; {8592#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:45:24,063 INFO L272 TraceCheckUtils]: 34: Hoare triple {8592#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8503#true} is VALID [2022-04-08 05:45:24,063 INFO L290 TraceCheckUtils]: 35: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 05:45:24,063 INFO L290 TraceCheckUtils]: 36: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 05:45:24,063 INFO L290 TraceCheckUtils]: 37: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 05:45:24,063 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8503#true} {8592#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #76#return; {8592#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:45:24,063 INFO L272 TraceCheckUtils]: 39: Hoare triple {8592#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8503#true} is VALID [2022-04-08 05:45:24,063 INFO L290 TraceCheckUtils]: 40: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 05:45:24,063 INFO L290 TraceCheckUtils]: 41: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 05:45:24,064 INFO L290 TraceCheckUtils]: 42: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 05:45:24,064 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {8503#true} {8592#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #78#return; {8592#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:45:24,064 INFO L290 TraceCheckUtils]: 44: Hoare triple {8592#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {8644#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (= main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:45:24,065 INFO L290 TraceCheckUtils]: 45: Hoare triple {8644#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (= main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {8648#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 05:45:24,066 INFO L290 TraceCheckUtils]: 46: Hoare triple {8648#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !false; {8648#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 05:45:24,066 INFO L272 TraceCheckUtils]: 47: Hoare triple {8648#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {8503#true} is VALID [2022-04-08 05:45:24,066 INFO L290 TraceCheckUtils]: 48: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 05:45:24,066 INFO L290 TraceCheckUtils]: 49: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 05:45:24,066 INFO L290 TraceCheckUtils]: 50: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 05:45:24,066 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8503#true} {8648#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #74#return; {8648#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 05:45:24,066 INFO L272 TraceCheckUtils]: 52: Hoare triple {8648#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8503#true} is VALID [2022-04-08 05:45:24,066 INFO L290 TraceCheckUtils]: 53: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 05:45:24,067 INFO L290 TraceCheckUtils]: 54: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 05:45:24,067 INFO L290 TraceCheckUtils]: 55: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 05:45:24,068 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {8503#true} {8648#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #76#return; {8648#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 05:45:24,068 INFO L272 TraceCheckUtils]: 57: Hoare triple {8648#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8503#true} is VALID [2022-04-08 05:45:24,068 INFO L290 TraceCheckUtils]: 58: Hoare triple {8503#true} ~cond := #in~cond; {8688#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:45:24,068 INFO L290 TraceCheckUtils]: 59: Hoare triple {8688#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8692#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:45:24,068 INFO L290 TraceCheckUtils]: 60: Hoare triple {8692#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8692#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:45:24,069 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {8692#(not (= |__VERIFIER_assert_#in~cond| 0))} {8648#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #78#return; {8648#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 05:45:24,069 INFO L290 TraceCheckUtils]: 62: Hoare triple {8648#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {8648#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 05:45:24,070 INFO L290 TraceCheckUtils]: 63: Hoare triple {8648#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= 1 main_~x~0) (not (= main_~a~0 (+ main_~b~0 main_~a~0))) (not (< main_~b~0 0)) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {8705#(and (< main_~y~0 (* main_~x~0 2)) (<= main_~x~0 main_~y~0) (= (+ main_~r~0 1) 0) (= main_~p~0 2) (not (= main_~y~0 main_~x~0)) (= (* main_~x~0 2) (+ main_~a~0 main_~y~0)))} is VALID [2022-04-08 05:45:24,071 INFO L290 TraceCheckUtils]: 64: Hoare triple {8705#(and (< main_~y~0 (* main_~x~0 2)) (<= main_~x~0 main_~y~0) (= (+ main_~r~0 1) 0) (= main_~p~0 2) (not (= main_~y~0 main_~x~0)) (= (* main_~x~0 2) (+ main_~a~0 main_~y~0)))} assume !false; {8705#(and (< main_~y~0 (* main_~x~0 2)) (<= main_~x~0 main_~y~0) (= (+ main_~r~0 1) 0) (= main_~p~0 2) (not (= main_~y~0 main_~x~0)) (= (* main_~x~0 2) (+ main_~a~0 main_~y~0)))} is VALID [2022-04-08 05:45:24,071 INFO L272 TraceCheckUtils]: 65: Hoare triple {8705#(and (< main_~y~0 (* main_~x~0 2)) (<= main_~x~0 main_~y~0) (= (+ main_~r~0 1) 0) (= main_~p~0 2) (not (= main_~y~0 main_~x~0)) (= (* main_~x~0 2) (+ main_~a~0 main_~y~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {8503#true} is VALID [2022-04-08 05:45:24,071 INFO L290 TraceCheckUtils]: 66: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 05:45:24,071 INFO L290 TraceCheckUtils]: 67: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 05:45:24,071 INFO L290 TraceCheckUtils]: 68: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 05:45:24,072 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {8503#true} {8705#(and (< main_~y~0 (* main_~x~0 2)) (<= main_~x~0 main_~y~0) (= (+ main_~r~0 1) 0) (= main_~p~0 2) (not (= main_~y~0 main_~x~0)) (= (* main_~x~0 2) (+ main_~a~0 main_~y~0)))} #74#return; {8705#(and (< main_~y~0 (* main_~x~0 2)) (<= main_~x~0 main_~y~0) (= (+ main_~r~0 1) 0) (= main_~p~0 2) (not (= main_~y~0 main_~x~0)) (= (* main_~x~0 2) (+ main_~a~0 main_~y~0)))} is VALID [2022-04-08 05:45:24,072 INFO L272 TraceCheckUtils]: 70: Hoare triple {8705#(and (< main_~y~0 (* main_~x~0 2)) (<= main_~x~0 main_~y~0) (= (+ main_~r~0 1) 0) (= main_~p~0 2) (not (= main_~y~0 main_~x~0)) (= (* main_~x~0 2) (+ main_~a~0 main_~y~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8727#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:45:24,072 INFO L290 TraceCheckUtils]: 71: Hoare triple {8727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:45:24,073 INFO L290 TraceCheckUtils]: 72: Hoare triple {8731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8504#false} is VALID [2022-04-08 05:45:24,073 INFO L290 TraceCheckUtils]: 73: Hoare triple {8504#false} assume !false; {8504#false} is VALID [2022-04-08 05:45:24,073 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 34 proven. 19 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-08 05:45:24,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:45:51,032 INFO L290 TraceCheckUtils]: 73: Hoare triple {8504#false} assume !false; {8504#false} is VALID [2022-04-08 05:45:51,033 INFO L290 TraceCheckUtils]: 72: Hoare triple {8731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8504#false} is VALID [2022-04-08 05:45:51,041 INFO L290 TraceCheckUtils]: 71: Hoare triple {8727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:45:51,042 INFO L272 TraceCheckUtils]: 70: Hoare triple {8747#(= 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)); {8727#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:45:51,043 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {8503#true} {8747#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #74#return; {8747#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:45:51,043 INFO L290 TraceCheckUtils]: 68: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 05:45:51,043 INFO L290 TraceCheckUtils]: 67: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 05:45:51,043 INFO L290 TraceCheckUtils]: 66: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 05:45:51,043 INFO L272 TraceCheckUtils]: 65: Hoare triple {8747#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {8503#true} is VALID [2022-04-08 05:45:51,043 INFO L290 TraceCheckUtils]: 64: Hoare triple {8747#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {8747#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:45:51,302 INFO L290 TraceCheckUtils]: 63: Hoare triple {8769#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {8747#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:45:51,303 INFO L290 TraceCheckUtils]: 62: Hoare triple {8769#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} assume !!(~a~0 != ~b~0); {8769#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} is VALID [2022-04-08 05:45:51,304 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {8692#(not (= |__VERIFIER_assert_#in~cond| 0))} {8776#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #78#return; {8769#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} is VALID [2022-04-08 05:45:51,304 INFO L290 TraceCheckUtils]: 60: Hoare triple {8692#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8692#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:45:51,304 INFO L290 TraceCheckUtils]: 59: Hoare triple {8786#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {8692#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:45:51,305 INFO L290 TraceCheckUtils]: 58: Hoare triple {8503#true} ~cond := #in~cond; {8786#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:45:51,305 INFO L272 TraceCheckUtils]: 57: Hoare triple {8776#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8503#true} is VALID [2022-04-08 05:45:51,305 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {8503#true} {8776#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #76#return; {8776#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 05:45:51,305 INFO L290 TraceCheckUtils]: 55: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 05:45:51,306 INFO L290 TraceCheckUtils]: 54: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 05:45:51,306 INFO L290 TraceCheckUtils]: 53: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 05:45:51,306 INFO L272 TraceCheckUtils]: 52: Hoare triple {8776#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8503#true} is VALID [2022-04-08 05:45:51,306 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8503#true} {8776#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #74#return; {8776#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 05:45:51,306 INFO L290 TraceCheckUtils]: 50: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 05:45:51,306 INFO L290 TraceCheckUtils]: 49: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 05:45:51,306 INFO L290 TraceCheckUtils]: 48: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 05:45:51,306 INFO L272 TraceCheckUtils]: 47: Hoare triple {8776#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {8503#true} is VALID [2022-04-08 05:45:51,307 INFO L290 TraceCheckUtils]: 46: Hoare triple {8776#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !false; {8776#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 05:45:53,308 WARN L290 TraceCheckUtils]: 45: Hoare triple {8826#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {8776#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is UNKNOWN [2022-04-08 05:45:53,309 INFO L290 TraceCheckUtils]: 44: Hoare triple {8830#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} assume !!(~a~0 != ~b~0); {8826#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} is VALID [2022-04-08 05:45:53,310 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {8503#true} {8830#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} #78#return; {8830#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} is VALID [2022-04-08 05:45:53,310 INFO L290 TraceCheckUtils]: 42: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 05:45:53,310 INFO L290 TraceCheckUtils]: 41: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 05:45:53,310 INFO L290 TraceCheckUtils]: 40: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 05:45:53,310 INFO L272 TraceCheckUtils]: 39: Hoare triple {8830#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8503#true} is VALID [2022-04-08 05:45:53,311 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8503#true} {8830#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} #76#return; {8830#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} is VALID [2022-04-08 05:45:53,311 INFO L290 TraceCheckUtils]: 37: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 05:45:53,311 INFO L290 TraceCheckUtils]: 36: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 05:45:53,311 INFO L290 TraceCheckUtils]: 35: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 05:45:53,311 INFO L272 TraceCheckUtils]: 34: Hoare triple {8830#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8503#true} is VALID [2022-04-08 05:45:53,312 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {8503#true} {8830#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} #74#return; {8830#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} is VALID [2022-04-08 05:45:53,312 INFO L290 TraceCheckUtils]: 32: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 05:45:53,312 INFO L290 TraceCheckUtils]: 31: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 05:45:53,312 INFO L290 TraceCheckUtils]: 30: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 05:45:53,312 INFO L272 TraceCheckUtils]: 29: Hoare triple {8830#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {8503#true} is VALID [2022-04-08 05:45:53,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {8830#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} assume !false; {8830#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} is VALID [2022-04-08 05:45:53,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {8503#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {8830#(or (not (< main_~b~0 (* main_~a~0 2))) (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0)) (+ (* main_~a~0 2) (* (- 1) main_~b~0))))} is VALID [2022-04-08 05:45:53,314 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8503#true} {8503#true} #72#return; {8503#true} is VALID [2022-04-08 05:45:53,315 INFO L290 TraceCheckUtils]: 25: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 05:45:53,315 INFO L290 TraceCheckUtils]: 24: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 05:45:53,315 INFO L290 TraceCheckUtils]: 23: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 05:45:53,315 INFO L272 TraceCheckUtils]: 22: Hoare triple {8503#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8503#true} is VALID [2022-04-08 05:45:53,315 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8503#true} {8503#true} #70#return; {8503#true} is VALID [2022-04-08 05:45:53,315 INFO L290 TraceCheckUtils]: 20: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 05:45:53,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 05:45:53,315 INFO L290 TraceCheckUtils]: 18: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 05:45:53,315 INFO L272 TraceCheckUtils]: 17: Hoare triple {8503#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8503#true} is VALID [2022-04-08 05:45:53,315 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8503#true} {8503#true} #68#return; {8503#true} is VALID [2022-04-08 05:45:53,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 05:45:53,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 05:45:53,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 05:45:53,315 INFO L272 TraceCheckUtils]: 12: Hoare triple {8503#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {8503#true} is VALID [2022-04-08 05:45:53,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {8503#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8503#true} is VALID [2022-04-08 05:45:53,315 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8503#true} {8503#true} #66#return; {8503#true} is VALID [2022-04-08 05:45:53,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 05:45:53,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {8503#true} assume !(0 == ~cond); {8503#true} is VALID [2022-04-08 05:45:53,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {8503#true} ~cond := #in~cond; {8503#true} is VALID [2022-04-08 05:45:53,316 INFO L272 TraceCheckUtils]: 6: Hoare triple {8503#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {8503#true} is VALID [2022-04-08 05:45:53,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {8503#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {8503#true} is VALID [2022-04-08 05:45:53,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {8503#true} call #t~ret6 := main(); {8503#true} is VALID [2022-04-08 05:45:53,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8503#true} {8503#true} #88#return; {8503#true} is VALID [2022-04-08 05:45:53,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {8503#true} assume true; {8503#true} is VALID [2022-04-08 05:45:53,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {8503#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(10, 2);call #Ultimate.allocInit(12, 3); {8503#true} is VALID [2022-04-08 05:45:53,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {8503#true} call ULTIMATE.init(); {8503#true} is VALID [2022-04-08 05:45:53,316 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-04-08 05:45:53,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:45:53,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541005355] [2022-04-08 05:45:53,316 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:45:53,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569371856] [2022-04-08 05:45:53,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569371856] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:45:53,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:45:53,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 19 [2022-04-08 05:45:53,317 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:45:53,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [301163882] [2022-04-08 05:45:53,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [301163882] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:45:53,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:45:53,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 05:45:53,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645567627] [2022-04-08 05:45:53,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:45:53,317 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 74 [2022-04-08 05:45:53,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:45:53,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-08 05:45:53,356 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:45:53,356 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 05:45:53,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:45:53,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 05:45:53,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-04-08 05:45:53,357 INFO L87 Difference]: Start difference. First operand 142 states and 177 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-08 05:45:55,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:45:55,431 INFO L93 Difference]: Finished difference Result 180 states and 222 transitions. [2022-04-08 05:45:55,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 05:45:55,431 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 74 [2022-04-08 05:45:55,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:45:55,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-08 05:45:55,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 85 transitions. [2022-04-08 05:45:55,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-08 05:45:55,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 85 transitions. [2022-04-08 05:45:55,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 85 transitions. [2022-04-08 05:45:55,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:45:55,515 INFO L225 Difference]: With dead ends: 180 [2022-04-08 05:45:55,515 INFO L226 Difference]: Without dead ends: 178 [2022-04-08 05:45:55,516 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 128 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2022-04-08 05:45:55,516 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 25 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-08 05:45:55,516 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 163 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-08 05:45:55,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-04-08 05:45:55,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 164. [2022-04-08 05:45:55,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:45:55,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand has 164 states, 97 states have (on average 1.1443298969072164) internal successors, (111), 100 states have internal predecessors, (111), 45 states have call successors, (45), 22 states have call predecessors, (45), 21 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-08 05:45:55,729 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand has 164 states, 97 states have (on average 1.1443298969072164) internal successors, (111), 100 states have internal predecessors, (111), 45 states have call successors, (45), 22 states have call predecessors, (45), 21 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-08 05:45:55,729 INFO L87 Difference]: Start difference. First operand 178 states. Second operand has 164 states, 97 states have (on average 1.1443298969072164) internal successors, (111), 100 states have internal predecessors, (111), 45 states have call successors, (45), 22 states have call predecessors, (45), 21 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-08 05:45:55,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:45:55,732 INFO L93 Difference]: Finished difference Result 178 states and 220 transitions. [2022-04-08 05:45:55,732 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 220 transitions. [2022-04-08 05:45:55,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:45:55,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:45:55,733 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 97 states have (on average 1.1443298969072164) internal successors, (111), 100 states have internal predecessors, (111), 45 states have call successors, (45), 22 states have call predecessors, (45), 21 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) Second operand 178 states. [2022-04-08 05:45:55,733 INFO L87 Difference]: Start difference. First operand has 164 states, 97 states have (on average 1.1443298969072164) internal successors, (111), 100 states have internal predecessors, (111), 45 states have call successors, (45), 22 states have call predecessors, (45), 21 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) Second operand 178 states. [2022-04-08 05:45:55,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:45:55,737 INFO L93 Difference]: Finished difference Result 178 states and 220 transitions. [2022-04-08 05:45:55,737 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 220 transitions. [2022-04-08 05:45:55,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:45:55,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:45:55,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:45:55,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:45:55,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 97 states have (on average 1.1443298969072164) internal successors, (111), 100 states have internal predecessors, (111), 45 states have call successors, (45), 22 states have call predecessors, (45), 21 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-08 05:45:55,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 199 transitions. [2022-04-08 05:45:55,741 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 199 transitions. Word has length 74 [2022-04-08 05:45:55,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:45:55,741 INFO L478 AbstractCegarLoop]: Abstraction has 164 states and 199 transitions. [2022-04-08 05:45:55,741 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-08 05:45:55,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 164 states and 199 transitions. [2022-04-08 05:45:56,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:45:56,025 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 199 transitions. [2022-04-08 05:45:56,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-08 05:45:56,026 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:45:56,026 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:45:56,042 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:45:56,239 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:45:56,239 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:45:56,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:45:56,240 INFO L85 PathProgramCache]: Analyzing trace with hash 15858924, now seen corresponding path program 5 times [2022-04-08 05:45:56,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:45:56,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [689827268] [2022-04-08 05:45:56,240 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:45:56,240 INFO L85 PathProgramCache]: Analyzing trace with hash 15858924, now seen corresponding path program 6 times [2022-04-08 05:45:56,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:45:56,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225726927] [2022-04-08 05:45:56,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:45:56,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:45:56,252 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:45:56,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1529163525] [2022-04-08 05:45:56,252 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 05:45:56,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:45:56,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:45:56,253 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:45:56,254 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:45:56,298 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 05:45:56,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:45:56,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 05:45:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:45:56,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:45:56,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {10015#true} call ULTIMATE.init(); {10015#true} is VALID [2022-04-08 05:45:56,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {10015#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(10, 2);call #Ultimate.allocInit(12, 3); {10015#true} is VALID [2022-04-08 05:45:56,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 05:45:56,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10015#true} {10015#true} #88#return; {10015#true} is VALID [2022-04-08 05:45:56,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {10015#true} call #t~ret6 := main(); {10015#true} is VALID [2022-04-08 05:45:56,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {10015#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {10015#true} is VALID [2022-04-08 05:45:56,572 INFO L272 TraceCheckUtils]: 6: Hoare triple {10015#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {10015#true} is VALID [2022-04-08 05:45:56,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 05:45:56,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 05:45:56,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 05:45:56,572 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10015#true} {10015#true} #66#return; {10015#true} is VALID [2022-04-08 05:45:56,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {10015#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10015#true} is VALID [2022-04-08 05:45:56,573 INFO L272 TraceCheckUtils]: 12: Hoare triple {10015#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {10015#true} is VALID [2022-04-08 05:45:56,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 05:45:56,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 05:45:56,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 05:45:56,573 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10015#true} {10015#true} #68#return; {10015#true} is VALID [2022-04-08 05:45:56,573 INFO L272 TraceCheckUtils]: 17: Hoare triple {10015#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10015#true} is VALID [2022-04-08 05:45:56,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 05:45:56,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 05:45:56,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 05:45:56,573 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10015#true} {10015#true} #70#return; {10015#true} is VALID [2022-04-08 05:45:56,573 INFO L272 TraceCheckUtils]: 22: Hoare triple {10015#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10015#true} is VALID [2022-04-08 05:45:56,573 INFO L290 TraceCheckUtils]: 23: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 05:45:56,573 INFO L290 TraceCheckUtils]: 24: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 05:45:56,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 05:45:56,573 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10015#true} {10015#true} #72#return; {10015#true} is VALID [2022-04-08 05:45:56,587 INFO L290 TraceCheckUtils]: 27: Hoare triple {10015#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:45:56,588 INFO L290 TraceCheckUtils]: 28: Hoare triple {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:45:56,588 INFO L272 TraceCheckUtils]: 29: Hoare triple {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {10015#true} is VALID [2022-04-08 05:45:56,588 INFO L290 TraceCheckUtils]: 30: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 05:45:56,588 INFO L290 TraceCheckUtils]: 31: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 05:45:56,588 INFO L290 TraceCheckUtils]: 32: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 05:45:56,588 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {10015#true} {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #74#return; {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:45:56,588 INFO L272 TraceCheckUtils]: 34: Hoare triple {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10015#true} is VALID [2022-04-08 05:45:56,589 INFO L290 TraceCheckUtils]: 35: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 05:45:56,589 INFO L290 TraceCheckUtils]: 36: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 05:45:56,589 INFO L290 TraceCheckUtils]: 37: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 05:45:56,589 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10015#true} {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #76#return; {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:45:56,589 INFO L272 TraceCheckUtils]: 39: Hoare triple {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10015#true} is VALID [2022-04-08 05:45:56,589 INFO L290 TraceCheckUtils]: 40: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 05:45:56,589 INFO L290 TraceCheckUtils]: 41: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 05:45:56,589 INFO L290 TraceCheckUtils]: 42: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 05:45:56,590 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {10015#true} {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #78#return; {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:45:56,591 INFO L290 TraceCheckUtils]: 44: Hoare triple {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(~a~0 != ~b~0); {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:45:56,591 INFO L290 TraceCheckUtils]: 45: Hoare triple {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:45:56,592 INFO L290 TraceCheckUtils]: 46: Hoare triple {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:45:56,592 INFO L272 TraceCheckUtils]: 47: Hoare triple {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {10015#true} is VALID [2022-04-08 05:45:56,594 INFO L290 TraceCheckUtils]: 48: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 05:45:56,594 INFO L290 TraceCheckUtils]: 49: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 05:45:56,594 INFO L290 TraceCheckUtils]: 50: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 05:45:56,595 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {10015#true} {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #74#return; {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:45:56,595 INFO L272 TraceCheckUtils]: 52: Hoare triple {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10015#true} is VALID [2022-04-08 05:45:56,595 INFO L290 TraceCheckUtils]: 53: Hoare triple {10015#true} ~cond := #in~cond; {10180#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:45:56,595 INFO L290 TraceCheckUtils]: 54: Hoare triple {10180#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10184#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:45:56,595 INFO L290 TraceCheckUtils]: 55: Hoare triple {10184#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10184#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:45:56,596 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {10184#(not (= |__VERIFIER_assert_#in~cond| 0))} {10101#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #76#return; {10191#(and (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:45:56,596 INFO L272 TraceCheckUtils]: 57: Hoare triple {10191#(and (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10015#true} is VALID [2022-04-08 05:45:56,596 INFO L290 TraceCheckUtils]: 58: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 05:45:56,596 INFO L290 TraceCheckUtils]: 59: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 05:45:56,596 INFO L290 TraceCheckUtils]: 60: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 05:45:56,597 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {10015#true} {10191#(and (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #78#return; {10191#(and (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:45:56,597 INFO L290 TraceCheckUtils]: 62: Hoare triple {10191#(and (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(~a~0 != ~b~0); {10191#(and (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:45:56,602 INFO L290 TraceCheckUtils]: 63: Hoare triple {10191#(and (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is VALID [2022-04-08 05:45:56,602 INFO L290 TraceCheckUtils]: 64: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} assume !false; {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is VALID [2022-04-08 05:45:56,602 INFO L272 TraceCheckUtils]: 65: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {10015#true} is VALID [2022-04-08 05:45:56,602 INFO L290 TraceCheckUtils]: 66: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 05:45:56,603 INFO L290 TraceCheckUtils]: 67: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 05:45:56,603 INFO L290 TraceCheckUtils]: 68: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 05:45:56,603 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {10015#true} {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} #74#return; {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is VALID [2022-04-08 05:45:56,603 INFO L272 TraceCheckUtils]: 70: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10015#true} is VALID [2022-04-08 05:45:56,603 INFO L290 TraceCheckUtils]: 71: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 05:45:56,603 INFO L290 TraceCheckUtils]: 72: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 05:45:56,603 INFO L290 TraceCheckUtils]: 73: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 05:45:56,604 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {10015#true} {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} #76#return; {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is VALID [2022-04-08 05:45:56,604 INFO L272 TraceCheckUtils]: 75: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10250#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:45:56,605 INFO L290 TraceCheckUtils]: 76: Hoare triple {10250#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10254#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:45:56,605 INFO L290 TraceCheckUtils]: 77: Hoare triple {10254#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10016#false} is VALID [2022-04-08 05:45:56,605 INFO L290 TraceCheckUtils]: 78: Hoare triple {10016#false} assume !false; {10016#false} is VALID [2022-04-08 05:45:56,605 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-04-08 05:45:56,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:46:19,385 INFO L290 TraceCheckUtils]: 78: Hoare triple {10016#false} assume !false; {10016#false} is VALID [2022-04-08 05:46:19,385 INFO L290 TraceCheckUtils]: 77: Hoare triple {10254#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10016#false} is VALID [2022-04-08 05:46:19,385 INFO L290 TraceCheckUtils]: 76: Hoare triple {10250#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10254#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:46:19,386 INFO L272 TraceCheckUtils]: 75: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10250#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:46:19,386 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {10015#true} {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} #76#return; {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is VALID [2022-04-08 05:46:19,387 INFO L290 TraceCheckUtils]: 73: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 05:46:19,387 INFO L290 TraceCheckUtils]: 72: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 05:46:19,387 INFO L290 TraceCheckUtils]: 71: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 05:46:19,387 INFO L272 TraceCheckUtils]: 70: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10015#true} is VALID [2022-04-08 05:46:19,387 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {10015#true} {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} #74#return; {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is VALID [2022-04-08 05:46:19,387 INFO L290 TraceCheckUtils]: 68: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 05:46:19,387 INFO L290 TraceCheckUtils]: 67: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 05:46:19,387 INFO L290 TraceCheckUtils]: 66: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 05:46:19,387 INFO L272 TraceCheckUtils]: 65: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {10015#true} is VALID [2022-04-08 05:46:19,388 INFO L290 TraceCheckUtils]: 64: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} assume !false; {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is VALID [2022-04-08 05:46:19,808 INFO L290 TraceCheckUtils]: 63: Hoare triple {10306#(= (+ main_~a~0 main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ main_~r~0 (* (- 1) main_~s~0) 1) main_~y~0)))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is VALID [2022-04-08 05:46:19,809 INFO L290 TraceCheckUtils]: 62: Hoare triple {10306#(= (+ main_~a~0 main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ main_~r~0 (* (- 1) main_~s~0) 1) main_~y~0)))} assume !!(~a~0 != ~b~0); {10306#(= (+ main_~a~0 main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ main_~r~0 (* (- 1) main_~s~0) 1) main_~y~0)))} is VALID [2022-04-08 05:46:19,810 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {10015#true} {10306#(= (+ main_~a~0 main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ main_~r~0 (* (- 1) main_~s~0) 1) main_~y~0)))} #78#return; {10306#(= (+ main_~a~0 main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ main_~r~0 (* (- 1) main_~s~0) 1) main_~y~0)))} is VALID [2022-04-08 05:46:19,810 INFO L290 TraceCheckUtils]: 60: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 05:46:19,810 INFO L290 TraceCheckUtils]: 59: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 05:46:19,810 INFO L290 TraceCheckUtils]: 58: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 05:46:19,810 INFO L272 TraceCheckUtils]: 57: Hoare triple {10306#(= (+ main_~a~0 main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ main_~r~0 (* (- 1) main_~s~0) 1) main_~y~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10015#true} is VALID [2022-04-08 05:46:19,811 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {10184#(not (= |__VERIFIER_assert_#in~cond| 0))} {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} #76#return; {10306#(= (+ main_~a~0 main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ main_~r~0 (* (- 1) main_~s~0) 1) main_~y~0)))} is VALID [2022-04-08 05:46:19,811 INFO L290 TraceCheckUtils]: 55: Hoare triple {10184#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10184#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:46:19,812 INFO L290 TraceCheckUtils]: 54: Hoare triple {10337#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {10184#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:46:19,812 INFO L290 TraceCheckUtils]: 53: Hoare triple {10015#true} ~cond := #in~cond; {10337#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:46:19,812 INFO L272 TraceCheckUtils]: 52: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10015#true} is VALID [2022-04-08 05:46:19,812 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {10015#true} {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} #74#return; {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is VALID [2022-04-08 05:46:19,812 INFO L290 TraceCheckUtils]: 50: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 05:46:19,812 INFO L290 TraceCheckUtils]: 49: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 05:46:19,813 INFO L290 TraceCheckUtils]: 48: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 05:46:19,813 INFO L272 TraceCheckUtils]: 47: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {10015#true} is VALID [2022-04-08 05:46:19,813 INFO L290 TraceCheckUtils]: 46: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} assume !false; {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is VALID [2022-04-08 05:46:19,813 INFO L290 TraceCheckUtils]: 45: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is VALID [2022-04-08 05:46:19,814 INFO L290 TraceCheckUtils]: 44: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} assume !!(~a~0 != ~b~0); {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is VALID [2022-04-08 05:46:19,814 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {10015#true} {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} #78#return; {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is VALID [2022-04-08 05:46:19,814 INFO L290 TraceCheckUtils]: 42: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 05:46:19,814 INFO L290 TraceCheckUtils]: 41: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 05:46:19,814 INFO L290 TraceCheckUtils]: 40: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 05:46:19,814 INFO L272 TraceCheckUtils]: 39: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10015#true} is VALID [2022-04-08 05:46:19,815 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10015#true} {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} #76#return; {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is VALID [2022-04-08 05:46:19,815 INFO L290 TraceCheckUtils]: 37: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 05:46:19,815 INFO L290 TraceCheckUtils]: 36: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 05:46:19,815 INFO L290 TraceCheckUtils]: 35: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 05:46:19,815 INFO L272 TraceCheckUtils]: 34: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10015#true} is VALID [2022-04-08 05:46:19,816 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {10015#true} {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} #74#return; {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is VALID [2022-04-08 05:46:19,816 INFO L290 TraceCheckUtils]: 32: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 05:46:19,816 INFO L290 TraceCheckUtils]: 31: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 05:46:19,816 INFO L290 TraceCheckUtils]: 30: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 05:46:19,816 INFO L272 TraceCheckUtils]: 29: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {10015#true} is VALID [2022-04-08 05:46:19,816 INFO L290 TraceCheckUtils]: 28: Hoare triple {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} assume !false; {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is VALID [2022-04-08 05:46:19,816 INFO L290 TraceCheckUtils]: 27: Hoare triple {10015#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {10213#(= (+ main_~y~0 (* (- 1) main_~b~0)) (+ (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1))))} is VALID [2022-04-08 05:46:19,817 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10015#true} {10015#true} #72#return; {10015#true} is VALID [2022-04-08 05:46:19,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 05:46:19,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 05:46:19,817 INFO L290 TraceCheckUtils]: 23: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 05:46:19,817 INFO L272 TraceCheckUtils]: 22: Hoare triple {10015#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10015#true} is VALID [2022-04-08 05:46:19,817 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10015#true} {10015#true} #70#return; {10015#true} is VALID [2022-04-08 05:46:19,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 05:46:19,817 INFO L290 TraceCheckUtils]: 19: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 05:46:19,817 INFO L290 TraceCheckUtils]: 18: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 05:46:19,817 INFO L272 TraceCheckUtils]: 17: Hoare triple {10015#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10015#true} is VALID [2022-04-08 05:46:19,817 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10015#true} {10015#true} #68#return; {10015#true} is VALID [2022-04-08 05:46:19,817 INFO L290 TraceCheckUtils]: 15: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 05:46:19,817 INFO L290 TraceCheckUtils]: 14: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 05:46:19,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 05:46:19,817 INFO L272 TraceCheckUtils]: 12: Hoare triple {10015#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {10015#true} is VALID [2022-04-08 05:46:19,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {10015#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10015#true} is VALID [2022-04-08 05:46:19,817 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10015#true} {10015#true} #66#return; {10015#true} is VALID [2022-04-08 05:46:19,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 05:46:19,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {10015#true} assume !(0 == ~cond); {10015#true} is VALID [2022-04-08 05:46:19,818 INFO L290 TraceCheckUtils]: 7: Hoare triple {10015#true} ~cond := #in~cond; {10015#true} is VALID [2022-04-08 05:46:19,818 INFO L272 TraceCheckUtils]: 6: Hoare triple {10015#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {10015#true} is VALID [2022-04-08 05:46:19,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {10015#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {10015#true} is VALID [2022-04-08 05:46:19,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {10015#true} call #t~ret6 := main(); {10015#true} is VALID [2022-04-08 05:46:19,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10015#true} {10015#true} #88#return; {10015#true} is VALID [2022-04-08 05:46:19,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {10015#true} assume true; {10015#true} is VALID [2022-04-08 05:46:19,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {10015#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(10, 2);call #Ultimate.allocInit(12, 3); {10015#true} is VALID [2022-04-08 05:46:19,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {10015#true} call ULTIMATE.init(); {10015#true} is VALID [2022-04-08 05:46:19,818 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 27 proven. 14 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-04-08 05:46:19,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:46:19,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225726927] [2022-04-08 05:46:19,818 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:46:19,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529163525] [2022-04-08 05:46:19,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529163525] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:46:19,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:46:19,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2022-04-08 05:46:19,819 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:46:19,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [689827268] [2022-04-08 05:46:19,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [689827268] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:46:19,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:46:19,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 05:46:19,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495275333] [2022-04-08 05:46:19,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:46:19,820 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 79 [2022-04-08 05:46:19,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:46:19,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 05:46:19,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:46:19,861 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 05:46:19,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:46:19,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 05:46:19,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-08 05:46:19,862 INFO L87 Difference]: Start difference. First operand 164 states and 199 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 05:46:20,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:46:20,819 INFO L93 Difference]: Finished difference Result 178 states and 218 transitions. [2022-04-08 05:46:20,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 05:46:20,820 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 79 [2022-04-08 05:46:20,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:46:20,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 05:46:20,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2022-04-08 05:46:20,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 05:46:20,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2022-04-08 05:46:20,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 64 transitions. [2022-04-08 05:46:20,917 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:46:20,920 INFO L225 Difference]: With dead ends: 178 [2022-04-08 05:46:20,920 INFO L226 Difference]: Without dead ends: 165 [2022-04-08 05:46:20,920 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 145 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-08 05:46:20,921 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 14 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 05:46:20,921 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 169 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 05:46:20,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-08 05:46:21,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 145. [2022-04-08 05:46:21,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:46:21,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 145 states, 88 states have (on average 1.0909090909090908) internal successors, (96), 92 states have internal predecessors, (96), 36 states have call successors, (36), 21 states have call predecessors, (36), 20 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-08 05:46:21,116 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 145 states, 88 states have (on average 1.0909090909090908) internal successors, (96), 92 states have internal predecessors, (96), 36 states have call successors, (36), 21 states have call predecessors, (36), 20 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-08 05:46:21,116 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 145 states, 88 states have (on average 1.0909090909090908) internal successors, (96), 92 states have internal predecessors, (96), 36 states have call successors, (36), 21 states have call predecessors, (36), 20 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-08 05:46:21,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:46:21,119 INFO L93 Difference]: Finished difference Result 165 states and 197 transitions. [2022-04-08 05:46:21,119 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 197 transitions. [2022-04-08 05:46:21,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:46:21,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:46:21,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 145 states, 88 states have (on average 1.0909090909090908) internal successors, (96), 92 states have internal predecessors, (96), 36 states have call successors, (36), 21 states have call predecessors, (36), 20 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) Second operand 165 states. [2022-04-08 05:46:21,119 INFO L87 Difference]: Start difference. First operand has 145 states, 88 states have (on average 1.0909090909090908) internal successors, (96), 92 states have internal predecessors, (96), 36 states have call successors, (36), 21 states have call predecessors, (36), 20 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) Second operand 165 states. [2022-04-08 05:46:21,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:46:21,122 INFO L93 Difference]: Finished difference Result 165 states and 197 transitions. [2022-04-08 05:46:21,122 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 197 transitions. [2022-04-08 05:46:21,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:46:21,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:46:21,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:46:21,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:46:21,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 88 states have (on average 1.0909090909090908) internal successors, (96), 92 states have internal predecessors, (96), 36 states have call successors, (36), 21 states have call predecessors, (36), 20 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-08 05:46:21,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 167 transitions. [2022-04-08 05:46:21,125 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 167 transitions. Word has length 79 [2022-04-08 05:46:21,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:46:21,125 INFO L478 AbstractCegarLoop]: Abstraction has 145 states and 167 transitions. [2022-04-08 05:46:21,127 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 05:46:21,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 145 states and 167 transitions. [2022-04-08 05:46:21,548 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 05:46:21,548 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 167 transitions. [2022-04-08 05:46:21,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-08 05:46:21,549 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:46:21,549 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 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] [2022-04-08 05:46:21,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-08 05:46:21,765 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:46:21,765 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:46:21,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:46:21,765 INFO L85 PathProgramCache]: Analyzing trace with hash 2066842922, now seen corresponding path program 3 times [2022-04-08 05:46:21,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:46:21,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [86583580] [2022-04-08 05:46:21,766 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:46:21,766 INFO L85 PathProgramCache]: Analyzing trace with hash 2066842922, now seen corresponding path program 4 times [2022-04-08 05:46:21,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:46:21,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562446031] [2022-04-08 05:46:21,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:46:21,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:46:21,778 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:46:21,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1332509689] [2022-04-08 05:46:21,778 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 05:46:21,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:46:21,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:46:21,779 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:46:21,780 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:46:21,818 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 05:46:21,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:46:21,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 05:46:21,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:46:21,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:46:22,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {11479#true} call ULTIMATE.init(); {11479#true} is VALID [2022-04-08 05:46:22,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {11479#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(10, 2);call #Ultimate.allocInit(12, 3); {11479#true} is VALID [2022-04-08 05:46:22,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 05:46:22,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11479#true} {11479#true} #88#return; {11479#true} is VALID [2022-04-08 05:46:22,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {11479#true} call #t~ret6 := main(); {11479#true} is VALID [2022-04-08 05:46:22,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {11479#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {11479#true} is VALID [2022-04-08 05:46:22,411 INFO L272 TraceCheckUtils]: 6: Hoare triple {11479#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {11479#true} is VALID [2022-04-08 05:46:22,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 05:46:22,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 05:46:22,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 05:46:22,411 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11479#true} {11479#true} #66#return; {11479#true} is VALID [2022-04-08 05:46:22,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {11479#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11479#true} is VALID [2022-04-08 05:46:22,411 INFO L272 TraceCheckUtils]: 12: Hoare triple {11479#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {11479#true} is VALID [2022-04-08 05:46:22,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 05:46:22,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 05:46:22,411 INFO L290 TraceCheckUtils]: 15: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 05:46:22,411 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11479#true} {11479#true} #68#return; {11479#true} is VALID [2022-04-08 05:46:22,411 INFO L272 TraceCheckUtils]: 17: Hoare triple {11479#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11479#true} is VALID [2022-04-08 05:46:22,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {11479#true} ~cond := #in~cond; {11538#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:46:22,412 INFO L290 TraceCheckUtils]: 19: Hoare triple {11538#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {11542#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:46:22,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {11542#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {11542#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:46:22,412 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11542#(not (= |assume_abort_if_not_#in~cond| 0))} {11479#true} #70#return; {11549#(<= 1 main_~x~0)} is VALID [2022-04-08 05:46:22,413 INFO L272 TraceCheckUtils]: 22: Hoare triple {11549#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11479#true} is VALID [2022-04-08 05:46:22,413 INFO L290 TraceCheckUtils]: 23: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 05:46:22,413 INFO L290 TraceCheckUtils]: 24: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 05:46:22,413 INFO L290 TraceCheckUtils]: 25: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 05:46:22,413 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11479#true} {11549#(<= 1 main_~x~0)} #72#return; {11549#(<= 1 main_~x~0)} is VALID [2022-04-08 05:46:22,413 INFO L290 TraceCheckUtils]: 27: Hoare triple {11549#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {11568#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:46:22,414 INFO L290 TraceCheckUtils]: 28: Hoare triple {11568#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {11568#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:46:22,414 INFO L272 TraceCheckUtils]: 29: Hoare triple {11568#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {11479#true} is VALID [2022-04-08 05:46:22,414 INFO L290 TraceCheckUtils]: 30: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 05:46:22,414 INFO L290 TraceCheckUtils]: 31: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 05:46:22,414 INFO L290 TraceCheckUtils]: 32: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 05:46:22,415 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {11479#true} {11568#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #74#return; {11568#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:46:22,415 INFO L272 TraceCheckUtils]: 34: Hoare triple {11568#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11479#true} is VALID [2022-04-08 05:46:22,415 INFO L290 TraceCheckUtils]: 35: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 05:46:22,415 INFO L290 TraceCheckUtils]: 36: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 05:46:22,415 INFO L290 TraceCheckUtils]: 37: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 05:46:22,415 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11479#true} {11568#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #76#return; {11568#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:46:22,415 INFO L272 TraceCheckUtils]: 39: Hoare triple {11568#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11479#true} is VALID [2022-04-08 05:46:22,416 INFO L290 TraceCheckUtils]: 40: Hoare triple {11479#true} ~cond := #in~cond; {11608#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:46:22,416 INFO L290 TraceCheckUtils]: 41: Hoare triple {11608#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11612#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:46:22,416 INFO L290 TraceCheckUtils]: 42: Hoare triple {11612#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11612#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:46:22,417 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {11612#(not (= |__VERIFIER_assert_#in~cond| 0))} {11568#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #78#return; {11619#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:46:22,417 INFO L290 TraceCheckUtils]: 44: Hoare triple {11619#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {11619#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:46:22,418 INFO L290 TraceCheckUtils]: 45: Hoare triple {11619#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {11626#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0))) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 05:46:22,419 INFO L290 TraceCheckUtils]: 46: Hoare triple {11626#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0))) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !false; {11626#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0))) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 05:46:22,419 INFO L272 TraceCheckUtils]: 47: Hoare triple {11626#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0))) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {11479#true} is VALID [2022-04-08 05:46:22,419 INFO L290 TraceCheckUtils]: 48: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 05:46:22,419 INFO L290 TraceCheckUtils]: 49: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 05:46:22,419 INFO L290 TraceCheckUtils]: 50: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 05:46:22,419 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {11479#true} {11626#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0))) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #74#return; {11626#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0))) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 05:46:22,419 INFO L272 TraceCheckUtils]: 52: Hoare triple {11626#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0))) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11479#true} is VALID [2022-04-08 05:46:22,419 INFO L290 TraceCheckUtils]: 53: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 05:46:22,420 INFO L290 TraceCheckUtils]: 54: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 05:46:22,420 INFO L290 TraceCheckUtils]: 55: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 05:46:22,420 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {11479#true} {11626#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0))) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #76#return; {11626#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0))) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 05:46:22,420 INFO L272 TraceCheckUtils]: 57: Hoare triple {11626#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0))) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11479#true} is VALID [2022-04-08 05:46:22,420 INFO L290 TraceCheckUtils]: 58: Hoare triple {11479#true} ~cond := #in~cond; {11608#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:46:22,421 INFO L290 TraceCheckUtils]: 59: Hoare triple {11608#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11612#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:46:22,421 INFO L290 TraceCheckUtils]: 60: Hoare triple {11612#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11612#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:46:22,421 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {11612#(not (= |__VERIFIER_assert_#in~cond| 0))} {11626#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0))) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #78#return; {11626#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0))) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 05:46:22,422 INFO L290 TraceCheckUtils]: 62: Hoare triple {11626#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0))) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {11626#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0))) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 05:46:22,423 INFO L290 TraceCheckUtils]: 63: Hoare triple {11626#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (- 1) main_~a~0) (* (+ main_~s~0 main_~r~0) main_~y~0) (* (+ main_~q~0 main_~p~0) main_~x~0))) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {11681#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (- 2) main_~q~0))} is VALID [2022-04-08 05:46:22,423 INFO L290 TraceCheckUtils]: 64: Hoare triple {11681#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (- 2) main_~q~0))} assume !false; {11681#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (- 2) main_~q~0))} is VALID [2022-04-08 05:46:22,423 INFO L272 TraceCheckUtils]: 65: Hoare triple {11681#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (- 2) main_~q~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {11479#true} is VALID [2022-04-08 05:46:22,423 INFO L290 TraceCheckUtils]: 66: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 05:46:22,423 INFO L290 TraceCheckUtils]: 67: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 05:46:22,423 INFO L290 TraceCheckUtils]: 68: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 05:46:22,424 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {11479#true} {11681#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (- 2) main_~q~0))} #74#return; {11681#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (- 2) main_~q~0))} is VALID [2022-04-08 05:46:22,424 INFO L272 TraceCheckUtils]: 70: Hoare triple {11681#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (- 2) main_~q~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11479#true} is VALID [2022-04-08 05:46:22,424 INFO L290 TraceCheckUtils]: 71: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 05:46:22,424 INFO L290 TraceCheckUtils]: 72: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 05:46:22,424 INFO L290 TraceCheckUtils]: 73: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 05:46:22,424 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11479#true} {11681#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (- 2) main_~q~0))} #76#return; {11681#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (- 2) main_~q~0))} is VALID [2022-04-08 05:46:22,425 INFO L272 TraceCheckUtils]: 75: Hoare triple {11681#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (- 2) main_~q~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11718#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:46:22,425 INFO L290 TraceCheckUtils]: 76: Hoare triple {11718#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11722#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:46:22,426 INFO L290 TraceCheckUtils]: 77: Hoare triple {11722#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11480#false} is VALID [2022-04-08 05:46:22,426 INFO L290 TraceCheckUtils]: 78: Hoare triple {11480#false} assume !false; {11480#false} is VALID [2022-04-08 05:46:22,426 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 38 proven. 37 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-08 05:46:22,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:46:42,896 INFO L290 TraceCheckUtils]: 78: Hoare triple {11480#false} assume !false; {11480#false} is VALID [2022-04-08 05:46:42,896 INFO L290 TraceCheckUtils]: 77: Hoare triple {11722#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11480#false} is VALID [2022-04-08 05:46:42,897 INFO L290 TraceCheckUtils]: 76: Hoare triple {11718#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11722#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:46:42,897 INFO L272 TraceCheckUtils]: 75: Hoare triple {11738#(= 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)); {11718#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:46:42,898 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11479#true} {11738#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #76#return; {11738#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:46:42,898 INFO L290 TraceCheckUtils]: 73: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 05:46:42,898 INFO L290 TraceCheckUtils]: 72: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 05:46:42,898 INFO L290 TraceCheckUtils]: 71: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 05:46:42,898 INFO L272 TraceCheckUtils]: 70: Hoare triple {11738#(= 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)); {11479#true} is VALID [2022-04-08 05:46:42,899 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {11479#true} {11738#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #74#return; {11738#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:46:42,899 INFO L290 TraceCheckUtils]: 68: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 05:46:42,899 INFO L290 TraceCheckUtils]: 67: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 05:46:42,899 INFO L290 TraceCheckUtils]: 66: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 05:46:42,899 INFO L272 TraceCheckUtils]: 65: Hoare triple {11738#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {11479#true} is VALID [2022-04-08 05:46:42,899 INFO L290 TraceCheckUtils]: 64: Hoare triple {11738#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {11738#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:46:43,020 INFO L290 TraceCheckUtils]: 63: Hoare triple {11775#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {11738#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:46:43,021 INFO L290 TraceCheckUtils]: 62: Hoare triple {11775#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} assume !!(~a~0 != ~b~0); {11775#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} is VALID [2022-04-08 05:46:43,022 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {11612#(not (= |__VERIFIER_assert_#in~cond| 0))} {11782#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} #78#return; {11775#(= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))} is VALID [2022-04-08 05:46:43,022 INFO L290 TraceCheckUtils]: 60: Hoare triple {11612#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11612#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:46:43,022 INFO L290 TraceCheckUtils]: 59: Hoare triple {11792#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11612#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:46:43,023 INFO L290 TraceCheckUtils]: 58: Hoare triple {11479#true} ~cond := #in~cond; {11792#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:46:43,023 INFO L272 TraceCheckUtils]: 57: Hoare triple {11782#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11479#true} is VALID [2022-04-08 05:46:43,023 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {11479#true} {11782#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} #76#return; {11782#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} is VALID [2022-04-08 05:46:43,023 INFO L290 TraceCheckUtils]: 55: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 05:46:43,023 INFO L290 TraceCheckUtils]: 54: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 05:46:43,023 INFO L290 TraceCheckUtils]: 53: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 05:46:43,024 INFO L272 TraceCheckUtils]: 52: Hoare triple {11782#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11479#true} is VALID [2022-04-08 05:46:43,024 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {11479#true} {11782#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} #74#return; {11782#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} is VALID [2022-04-08 05:46:43,024 INFO L290 TraceCheckUtils]: 50: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 05:46:43,024 INFO L290 TraceCheckUtils]: 49: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 05:46:43,024 INFO L290 TraceCheckUtils]: 48: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 05:46:43,024 INFO L272 TraceCheckUtils]: 47: Hoare triple {11782#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {11479#true} is VALID [2022-04-08 05:46:43,025 INFO L290 TraceCheckUtils]: 46: Hoare triple {11782#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} assume !false; {11782#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} is VALID [2022-04-08 05:46:45,026 WARN L290 TraceCheckUtils]: 45: Hoare triple {11832#(or (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* main_~y~0 (+ (* (- 2) main_~r~0) main_~s~0)) (* main_~x~0 (+ main_~q~0 (* (- 2) main_~p~0)))) (+ main_~b~0 (* (- 2) main_~a~0))))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {11782#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} is UNKNOWN [2022-04-08 05:46:45,027 INFO L290 TraceCheckUtils]: 44: Hoare triple {11832#(or (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* main_~y~0 (+ (* (- 2) main_~r~0) main_~s~0)) (* main_~x~0 (+ main_~q~0 (* (- 2) main_~p~0)))) (+ main_~b~0 (* (- 2) main_~a~0))))} assume !!(~a~0 != ~b~0); {11832#(or (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* main_~y~0 (+ (* (- 2) main_~r~0) main_~s~0)) (* main_~x~0 (+ main_~q~0 (* (- 2) main_~p~0)))) (+ main_~b~0 (* (- 2) main_~a~0))))} is VALID [2022-04-08 05:46:45,029 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {11612#(not (= |__VERIFIER_assert_#in~cond| 0))} {11479#true} #78#return; {11832#(or (not (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0))) (= (+ (* main_~y~0 (+ (* (- 2) main_~r~0) main_~s~0)) (* main_~x~0 (+ main_~q~0 (* (- 2) main_~p~0)))) (+ main_~b~0 (* (- 2) main_~a~0))))} is VALID [2022-04-08 05:46:45,029 INFO L290 TraceCheckUtils]: 42: Hoare triple {11612#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11612#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:46:45,029 INFO L290 TraceCheckUtils]: 41: Hoare triple {11792#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11612#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:46:45,029 INFO L290 TraceCheckUtils]: 40: Hoare triple {11479#true} ~cond := #in~cond; {11792#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:46:45,029 INFO L272 TraceCheckUtils]: 39: Hoare triple {11479#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11479#true} is VALID [2022-04-08 05:46:45,030 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11479#true} {11479#true} #76#return; {11479#true} is VALID [2022-04-08 05:46:45,030 INFO L290 TraceCheckUtils]: 37: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 05:46:45,030 INFO L290 TraceCheckUtils]: 36: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 05:46:45,030 INFO L290 TraceCheckUtils]: 35: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 05:46:45,030 INFO L272 TraceCheckUtils]: 34: Hoare triple {11479#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11479#true} is VALID [2022-04-08 05:46:45,030 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {11479#true} {11479#true} #74#return; {11479#true} is VALID [2022-04-08 05:46:45,030 INFO L290 TraceCheckUtils]: 32: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 05:46:45,030 INFO L290 TraceCheckUtils]: 31: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 05:46:45,030 INFO L290 TraceCheckUtils]: 30: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 05:46:45,030 INFO L272 TraceCheckUtils]: 29: Hoare triple {11479#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {11479#true} is VALID [2022-04-08 05:46:45,030 INFO L290 TraceCheckUtils]: 28: Hoare triple {11479#true} assume !false; {11479#true} is VALID [2022-04-08 05:46:45,030 INFO L290 TraceCheckUtils]: 27: Hoare triple {11479#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {11479#true} is VALID [2022-04-08 05:46:45,030 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11479#true} {11479#true} #72#return; {11479#true} is VALID [2022-04-08 05:46:45,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 05:46:45,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 05:46:45,030 INFO L290 TraceCheckUtils]: 23: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 05:46:45,030 INFO L272 TraceCheckUtils]: 22: Hoare triple {11479#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11479#true} is VALID [2022-04-08 05:46:45,030 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11479#true} {11479#true} #70#return; {11479#true} is VALID [2022-04-08 05:46:45,031 INFO L290 TraceCheckUtils]: 20: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 05:46:45,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 05:46:45,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 05:46:45,031 INFO L272 TraceCheckUtils]: 17: Hoare triple {11479#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11479#true} is VALID [2022-04-08 05:46:45,031 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11479#true} {11479#true} #68#return; {11479#true} is VALID [2022-04-08 05:46:45,031 INFO L290 TraceCheckUtils]: 15: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 05:46:45,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 05:46:45,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 05:46:45,031 INFO L272 TraceCheckUtils]: 12: Hoare triple {11479#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {11479#true} is VALID [2022-04-08 05:46:45,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {11479#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11479#true} is VALID [2022-04-08 05:46:45,031 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11479#true} {11479#true} #66#return; {11479#true} is VALID [2022-04-08 05:46:45,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 05:46:45,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {11479#true} assume !(0 == ~cond); {11479#true} is VALID [2022-04-08 05:46:45,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {11479#true} ~cond := #in~cond; {11479#true} is VALID [2022-04-08 05:46:45,031 INFO L272 TraceCheckUtils]: 6: Hoare triple {11479#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {11479#true} is VALID [2022-04-08 05:46:45,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {11479#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {11479#true} is VALID [2022-04-08 05:46:45,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {11479#true} call #t~ret6 := main(); {11479#true} is VALID [2022-04-08 05:46:45,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11479#true} {11479#true} #88#return; {11479#true} is VALID [2022-04-08 05:46:45,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {11479#true} assume true; {11479#true} is VALID [2022-04-08 05:46:45,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {11479#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(10, 2);call #Ultimate.allocInit(12, 3); {11479#true} is VALID [2022-04-08 05:46:45,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {11479#true} call ULTIMATE.init(); {11479#true} is VALID [2022-04-08 05:46:45,032 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 40 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-08 05:46:45,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:46:45,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562446031] [2022-04-08 05:46:45,032 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:46:45,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332509689] [2022-04-08 05:46:45,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332509689] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:46:45,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:46:45,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2022-04-08 05:46:45,032 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:46:45,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [86583580] [2022-04-08 05:46:45,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [86583580] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:46:45,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:46:45,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 05:46:45,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103175183] [2022-04-08 05:46:45,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:46:45,033 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 79 [2022-04-08 05:46:45,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:46:45,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-08 05:46:45,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:46:45,079 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 05:46:45,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:46:45,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 05:46:45,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-04-08 05:46:45,080 INFO L87 Difference]: Start difference. First operand 145 states and 167 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-08 05:46:46,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:46:46,392 INFO L93 Difference]: Finished difference Result 167 states and 195 transitions. [2022-04-08 05:46:46,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 05:46:46,392 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 79 [2022-04-08 05:46:46,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:46:46,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-08 05:46:46,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-08 05:46:46,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-08 05:46:46,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-08 05:46:46,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 69 transitions. [2022-04-08 05:46:46,502 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:46:46,505 INFO L225 Difference]: With dead ends: 167 [2022-04-08 05:46:46,505 INFO L226 Difference]: Without dead ends: 165 [2022-04-08 05:46:46,505 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-04-08 05:46:46,506 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 24 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 05:46:46,506 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 149 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 05:46:46,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-08 05:46:46,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 155. [2022-04-08 05:46:46,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:46:46,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 155 states, 94 states have (on average 1.0957446808510638) internal successors, (103), 98 states have internal predecessors, (103), 39 states have call successors, (39), 22 states have call predecessors, (39), 21 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 05:46:46,712 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 155 states, 94 states have (on average 1.0957446808510638) internal successors, (103), 98 states have internal predecessors, (103), 39 states have call successors, (39), 22 states have call predecessors, (39), 21 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 05:46:46,713 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 155 states, 94 states have (on average 1.0957446808510638) internal successors, (103), 98 states have internal predecessors, (103), 39 states have call successors, (39), 22 states have call predecessors, (39), 21 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 05:46:46,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:46:46,715 INFO L93 Difference]: Finished difference Result 165 states and 193 transitions. [2022-04-08 05:46:46,715 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 193 transitions. [2022-04-08 05:46:46,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:46:46,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:46:46,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 94 states have (on average 1.0957446808510638) internal successors, (103), 98 states have internal predecessors, (103), 39 states have call successors, (39), 22 states have call predecessors, (39), 21 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) Second operand 165 states. [2022-04-08 05:46:46,716 INFO L87 Difference]: Start difference. First operand has 155 states, 94 states have (on average 1.0957446808510638) internal successors, (103), 98 states have internal predecessors, (103), 39 states have call successors, (39), 22 states have call predecessors, (39), 21 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) Second operand 165 states. [2022-04-08 05:46:46,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:46:46,718 INFO L93 Difference]: Finished difference Result 165 states and 193 transitions. [2022-04-08 05:46:46,718 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 193 transitions. [2022-04-08 05:46:46,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:46:46,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:46:46,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:46:46,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:46:46,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 94 states have (on average 1.0957446808510638) internal successors, (103), 98 states have internal predecessors, (103), 39 states have call successors, (39), 22 states have call predecessors, (39), 21 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-08 05:46:46,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 180 transitions. [2022-04-08 05:46:46,721 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 180 transitions. Word has length 79 [2022-04-08 05:46:46,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:46:46,721 INFO L478 AbstractCegarLoop]: Abstraction has 155 states and 180 transitions. [2022-04-08 05:46:46,721 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-08 05:46:46,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 155 states and 180 transitions. [2022-04-08 05:46:49,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 179 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 05:46:49,034 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 180 transitions. [2022-04-08 05:46:49,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-08 05:46:49,035 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:46:49,035 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:46:49,051 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:46:49,251 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:46:49,251 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:46:49,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:46:49,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1804875380, now seen corresponding path program 7 times [2022-04-08 05:46:49,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:46:49,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1109958912] [2022-04-08 05:46:49,252 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:46:49,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1804875380, now seen corresponding path program 8 times [2022-04-08 05:46:49,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:46:49,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953970295] [2022-04-08 05:46:49,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:46:49,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:46:49,261 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:46:49,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1036683435] [2022-04-08 05:46:49,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:46:49,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:46:49,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:46:49,262 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:46:49,263 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:46:49,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:46:49,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:46:49,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-08 05:46:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:46:49,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:49:56,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {12950#true} call ULTIMATE.init(); {12950#true} is VALID [2022-04-08 05:49:56,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {12950#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(10, 2);call #Ultimate.allocInit(12, 3); {12950#true} is VALID [2022-04-08 05:49:56,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 05:49:56,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12950#true} {12950#true} #88#return; {12950#true} is VALID [2022-04-08 05:49:56,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {12950#true} call #t~ret6 := main(); {12950#true} is VALID [2022-04-08 05:49:56,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {12950#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {12950#true} is VALID [2022-04-08 05:49:56,446 INFO L272 TraceCheckUtils]: 6: Hoare triple {12950#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {12950#true} is VALID [2022-04-08 05:49:56,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {12950#true} ~cond := #in~cond; {12976#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:49:56,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {12976#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {12980#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:49:56,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {12980#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {12980#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:49:56,448 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12980#(not (= |assume_abort_if_not_#in~cond| 0))} {12950#true} #66#return; {12987#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 05:49:56,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {12987#(and (<= 0 main_~x~0) (<= main_~x~0 5))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {12987#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 05:49:56,448 INFO L272 TraceCheckUtils]: 12: Hoare triple {12987#(and (<= 0 main_~x~0) (<= main_~x~0 5))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {12950#true} is VALID [2022-04-08 05:49:56,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 05:49:56,448 INFO L290 TraceCheckUtils]: 14: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 05:49:56,448 INFO L290 TraceCheckUtils]: 15: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 05:49:56,449 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12950#true} {12987#(and (<= 0 main_~x~0) (<= main_~x~0 5))} #68#return; {12987#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 05:49:56,449 INFO L272 TraceCheckUtils]: 17: Hoare triple {12987#(and (<= 0 main_~x~0) (<= main_~x~0 5))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {12950#true} is VALID [2022-04-08 05:49:56,449 INFO L290 TraceCheckUtils]: 18: Hoare triple {12950#true} ~cond := #in~cond; {12976#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:49:56,449 INFO L290 TraceCheckUtils]: 19: Hoare triple {12976#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {12980#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:49:56,449 INFO L290 TraceCheckUtils]: 20: Hoare triple {12980#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {12980#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:49:56,450 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {12980#(not (= |assume_abort_if_not_#in~cond| 0))} {12987#(and (<= 0 main_~x~0) (<= main_~x~0 5))} #70#return; {13021#(and (<= 1 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 05:49:56,450 INFO L272 TraceCheckUtils]: 22: Hoare triple {13021#(and (<= 1 main_~x~0) (<= main_~x~0 5))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12950#true} is VALID [2022-04-08 05:49:56,450 INFO L290 TraceCheckUtils]: 23: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 05:49:56,450 INFO L290 TraceCheckUtils]: 24: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 05:49:56,450 INFO L290 TraceCheckUtils]: 25: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 05:49:56,451 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12950#true} {13021#(and (<= 1 main_~x~0) (<= main_~x~0 5))} #72#return; {13021#(and (<= 1 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 05:49:56,451 INFO L290 TraceCheckUtils]: 27: Hoare triple {13021#(and (<= 1 main_~x~0) (<= main_~x~0 5))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {13040#(and (<= 1 main_~s~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:49:56,451 INFO L290 TraceCheckUtils]: 28: Hoare triple {13040#(and (<= 1 main_~s~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !false; {13040#(and (<= 1 main_~s~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:49:56,452 INFO L272 TraceCheckUtils]: 29: Hoare triple {13040#(and (<= 1 main_~s~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 05:49:56,452 INFO L290 TraceCheckUtils]: 30: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 05:49:56,452 INFO L290 TraceCheckUtils]: 31: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 05:49:56,452 INFO L290 TraceCheckUtils]: 32: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 05:49:56,452 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {12950#true} {13040#(and (<= 1 main_~s~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #74#return; {13040#(and (<= 1 main_~s~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:49:56,452 INFO L272 TraceCheckUtils]: 34: Hoare triple {13040#(and (<= 1 main_~s~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 05:49:56,453 INFO L290 TraceCheckUtils]: 35: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 05:49:56,453 INFO L290 TraceCheckUtils]: 36: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 05:49:56,453 INFO L290 TraceCheckUtils]: 37: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 05:49:56,453 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {12950#true} {13040#(and (<= 1 main_~s~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #76#return; {13040#(and (<= 1 main_~s~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:49:56,453 INFO L272 TraceCheckUtils]: 39: Hoare triple {13040#(and (<= 1 main_~s~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 05:49:56,454 INFO L290 TraceCheckUtils]: 40: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 05:49:56,454 INFO L290 TraceCheckUtils]: 41: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 05:49:56,454 INFO L290 TraceCheckUtils]: 42: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 05:49:56,454 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {12950#true} {13040#(and (<= 1 main_~s~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #78#return; {13040#(and (<= 1 main_~s~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:49:56,455 INFO L290 TraceCheckUtils]: 44: Hoare triple {13040#(and (<= 1 main_~s~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(~a~0 != ~b~0); {13040#(and (<= 1 main_~s~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:49:56,456 INFO L290 TraceCheckUtils]: 45: Hoare triple {13040#(and (<= 1 main_~s~0) (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {13095#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (<= main_~x~0 (+ main_~b~0 main_~a~0)) (< main_~b~0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= (+ main_~q~0 main_~p~0) 1))} is VALID [2022-04-08 05:49:56,456 INFO L290 TraceCheckUtils]: 46: Hoare triple {13095#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (<= main_~x~0 (+ main_~b~0 main_~a~0)) (< main_~b~0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= (+ main_~q~0 main_~p~0) 1))} assume !false; {13095#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (<= main_~x~0 (+ main_~b~0 main_~a~0)) (< main_~b~0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= (+ main_~q~0 main_~p~0) 1))} is VALID [2022-04-08 05:49:56,456 INFO L272 TraceCheckUtils]: 47: Hoare triple {13095#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (<= main_~x~0 (+ main_~b~0 main_~a~0)) (< main_~b~0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= (+ main_~q~0 main_~p~0) 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 05:49:56,456 INFO L290 TraceCheckUtils]: 48: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 05:49:56,457 INFO L290 TraceCheckUtils]: 49: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 05:49:56,457 INFO L290 TraceCheckUtils]: 50: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 05:49:56,457 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {12950#true} {13095#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (<= main_~x~0 (+ main_~b~0 main_~a~0)) (< main_~b~0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= (+ main_~q~0 main_~p~0) 1))} #74#return; {13095#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (<= main_~x~0 (+ main_~b~0 main_~a~0)) (< main_~b~0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= (+ main_~q~0 main_~p~0) 1))} is VALID [2022-04-08 05:49:56,457 INFO L272 TraceCheckUtils]: 52: Hoare triple {13095#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (<= main_~x~0 (+ main_~b~0 main_~a~0)) (< main_~b~0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= (+ main_~q~0 main_~p~0) 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 05:49:56,457 INFO L290 TraceCheckUtils]: 53: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 05:49:56,457 INFO L290 TraceCheckUtils]: 54: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 05:49:56,458 INFO L290 TraceCheckUtils]: 55: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 05:49:56,458 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {12950#true} {13095#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (<= main_~x~0 (+ main_~b~0 main_~a~0)) (< main_~b~0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= (+ main_~q~0 main_~p~0) 1))} #76#return; {13095#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (<= main_~x~0 (+ main_~b~0 main_~a~0)) (< main_~b~0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= (+ main_~q~0 main_~p~0) 1))} is VALID [2022-04-08 05:49:56,458 INFO L272 TraceCheckUtils]: 57: Hoare triple {13095#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (<= main_~x~0 (+ main_~b~0 main_~a~0)) (< main_~b~0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= (+ main_~q~0 main_~p~0) 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 05:49:56,458 INFO L290 TraceCheckUtils]: 58: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 05:49:56,458 INFO L290 TraceCheckUtils]: 59: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 05:49:56,458 INFO L290 TraceCheckUtils]: 60: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 05:49:56,459 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {12950#true} {13095#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (<= main_~x~0 (+ main_~b~0 main_~a~0)) (< main_~b~0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= (+ main_~q~0 main_~p~0) 1))} #78#return; {13095#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (<= main_~x~0 (+ main_~b~0 main_~a~0)) (< main_~b~0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= (+ main_~q~0 main_~p~0) 1))} is VALID [2022-04-08 05:49:56,460 INFO L290 TraceCheckUtils]: 62: Hoare triple {13095#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (<= main_~x~0 (+ main_~b~0 main_~a~0)) (< main_~b~0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= (+ main_~q~0 main_~p~0) 1))} assume !!(~a~0 != ~b~0); {13147#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (<= main_~x~0 (+ main_~b~0 main_~a~0)) (< main_~b~0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (= main_~b~0 main_~a~0)) (<= (+ main_~q~0 main_~p~0) 1))} is VALID [2022-04-08 05:49:56,461 INFO L290 TraceCheckUtils]: 63: Hoare triple {13147#(and (<= 1 main_~s~0) (= (+ main_~s~0 main_~r~0) 0) (<= 1 main_~x~0) (<= main_~x~0 (+ main_~b~0 main_~a~0)) (< main_~b~0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (= main_~b~0 main_~a~0)) (<= (+ main_~q~0 main_~p~0) 1))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {13151#(and (<= (+ main_~r~0 1) 0) (<= main_~x~0 (+ (* main_~a~0 2) main_~b~0)) (< (+ main_~b~0 main_~a~0) main_~x~0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= main_~x~0 5) (not (= main_~b~0 0)) (<= main_~p~0 1) (<= 0 main_~b~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-08 05:49:56,462 INFO L290 TraceCheckUtils]: 64: Hoare triple {13151#(and (<= (+ main_~r~0 1) 0) (<= main_~x~0 (+ (* main_~a~0 2) main_~b~0)) (< (+ main_~b~0 main_~a~0) main_~x~0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= main_~x~0 5) (not (= main_~b~0 0)) (<= main_~p~0 1) (<= 0 main_~b~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} assume !false; {13151#(and (<= (+ main_~r~0 1) 0) (<= main_~x~0 (+ (* main_~a~0 2) main_~b~0)) (< (+ main_~b~0 main_~a~0) main_~x~0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= main_~x~0 5) (not (= main_~b~0 0)) (<= main_~p~0 1) (<= 0 main_~b~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-08 05:49:56,462 INFO L272 TraceCheckUtils]: 65: Hoare triple {13151#(and (<= (+ main_~r~0 1) 0) (<= main_~x~0 (+ (* main_~a~0 2) main_~b~0)) (< (+ main_~b~0 main_~a~0) main_~x~0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= main_~x~0 5) (not (= main_~b~0 0)) (<= main_~p~0 1) (<= 0 main_~b~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 05:49:56,462 INFO L290 TraceCheckUtils]: 66: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 05:49:56,462 INFO L290 TraceCheckUtils]: 67: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 05:49:56,462 INFO L290 TraceCheckUtils]: 68: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 05:49:56,463 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {12950#true} {13151#(and (<= (+ main_~r~0 1) 0) (<= main_~x~0 (+ (* main_~a~0 2) main_~b~0)) (< (+ main_~b~0 main_~a~0) main_~x~0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= main_~x~0 5) (not (= main_~b~0 0)) (<= main_~p~0 1) (<= 0 main_~b~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} #74#return; {13151#(and (<= (+ main_~r~0 1) 0) (<= main_~x~0 (+ (* main_~a~0 2) main_~b~0)) (< (+ main_~b~0 main_~a~0) main_~x~0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= main_~x~0 5) (not (= main_~b~0 0)) (<= main_~p~0 1) (<= 0 main_~b~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-08 05:49:56,463 INFO L272 TraceCheckUtils]: 70: Hoare triple {13151#(and (<= (+ main_~r~0 1) 0) (<= main_~x~0 (+ (* main_~a~0 2) main_~b~0)) (< (+ main_~b~0 main_~a~0) main_~x~0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= main_~x~0 5) (not (= main_~b~0 0)) (<= main_~p~0 1) (<= 0 main_~b~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 05:49:56,463 INFO L290 TraceCheckUtils]: 71: Hoare triple {12950#true} ~cond := #in~cond; {13176#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:49:56,463 INFO L290 TraceCheckUtils]: 72: Hoare triple {13176#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13180#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:49:56,464 INFO L290 TraceCheckUtils]: 73: Hoare triple {13180#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13180#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:49:56,465 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13180#(not (= |__VERIFIER_assert_#in~cond| 0))} {13151#(and (<= (+ main_~r~0 1) 0) (<= main_~x~0 (+ (* main_~a~0 2) main_~b~0)) (< (+ main_~b~0 main_~a~0) main_~x~0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (<= main_~x~0 5) (not (= main_~b~0 0)) (<= main_~p~0 1) (<= 0 main_~b~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} #76#return; {13187#(and (<= (+ main_~r~0 1) 0) (<= main_~x~0 (+ (* main_~a~0 2) main_~b~0)) (< (+ main_~b~0 main_~a~0) main_~x~0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~x~0 5) (not (= main_~b~0 0)) (<= main_~p~0 1) (<= 0 main_~b~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-08 05:49:56,465 INFO L272 TraceCheckUtils]: 75: Hoare triple {13187#(and (<= (+ main_~r~0 1) 0) (<= main_~x~0 (+ (* main_~a~0 2) main_~b~0)) (< (+ main_~b~0 main_~a~0) main_~x~0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~x~0 5) (not (= main_~b~0 0)) (<= main_~p~0 1) (<= 0 main_~b~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 05:49:56,465 INFO L290 TraceCheckUtils]: 76: Hoare triple {12950#true} ~cond := #in~cond; {13176#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:49:56,465 INFO L290 TraceCheckUtils]: 77: Hoare triple {13176#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13180#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:49:56,466 INFO L290 TraceCheckUtils]: 78: Hoare triple {13180#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13180#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:49:56,466 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {13180#(not (= |__VERIFIER_assert_#in~cond| 0))} {13187#(and (<= (+ main_~r~0 1) 0) (<= main_~x~0 (+ (* main_~a~0 2) main_~b~0)) (< (+ main_~b~0 main_~a~0) main_~x~0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~x~0 5) (not (= main_~b~0 0)) (<= main_~p~0 1) (<= 0 main_~b~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} #78#return; {13187#(and (<= (+ main_~r~0 1) 0) (<= main_~x~0 (+ (* main_~a~0 2) main_~b~0)) (< (+ main_~b~0 main_~a~0) main_~x~0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~x~0 5) (not (= main_~b~0 0)) (<= main_~p~0 1) (<= 0 main_~b~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-08 05:49:56,467 INFO L290 TraceCheckUtils]: 80: Hoare triple {13187#(and (<= (+ main_~r~0 1) 0) (<= main_~x~0 (+ (* main_~a~0 2) main_~b~0)) (< (+ main_~b~0 main_~a~0) main_~x~0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~x~0 5) (not (= main_~b~0 0)) (<= main_~p~0 1) (<= 0 main_~b~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} assume !!(~a~0 != ~b~0); {13187#(and (<= (+ main_~r~0 1) 0) (<= main_~x~0 (+ (* main_~a~0 2) main_~b~0)) (< (+ main_~b~0 main_~a~0) main_~x~0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~x~0 5) (not (= main_~b~0 0)) (<= main_~p~0 1) (<= 0 main_~b~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-08 05:49:56,471 INFO L290 TraceCheckUtils]: 81: Hoare triple {13187#(and (<= (+ main_~r~0 1) 0) (<= main_~x~0 (+ (* main_~a~0 2) main_~b~0)) (< (+ main_~b~0 main_~a~0) main_~x~0) (= main_~y~0 (+ main_~b~0 main_~a~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~x~0 5) (not (= main_~b~0 0)) (<= main_~p~0 1) (<= 0 main_~b~0) (= (+ main_~q~0 main_~p~0) 0) (= (+ main_~s~0 (* main_~r~0 2)) 0))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {13209#(and (= (mod main_~r~0 3) 0) (< (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) main_~a~0 main_~x~0)) (<= main_~x~0 5) (<= 0 (+ (div (* (- 1) main_~p~0) 2) 1)) (<= (+ main_~a~0 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (< 0 main_~a~0) (= (mod main_~p~0 2) 0) (= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) main_~a~0 main_~y~0)) (not (= (+ main_~a~0 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3))))) (<= (+ main_~r~0 (div (* (- 2) main_~r~0) 3) 1) 0))} is VALID [2022-04-08 05:49:56,472 INFO L290 TraceCheckUtils]: 82: Hoare triple {13209#(and (= (mod main_~r~0 3) 0) (< (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) main_~a~0 main_~x~0)) (<= main_~x~0 5) (<= 0 (+ (div (* (- 1) main_~p~0) 2) 1)) (<= (+ main_~a~0 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (< 0 main_~a~0) (= (mod main_~p~0 2) 0) (= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) main_~a~0 main_~y~0)) (not (= (+ main_~a~0 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3))))) (<= (+ main_~r~0 (div (* (- 2) main_~r~0) 3) 1) 0))} assume !false; {13209#(and (= (mod main_~r~0 3) 0) (< (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) main_~a~0 main_~x~0)) (<= main_~x~0 5) (<= 0 (+ (div (* (- 1) main_~p~0) 2) 1)) (<= (+ main_~a~0 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (< 0 main_~a~0) (= (mod main_~p~0 2) 0) (= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) main_~a~0 main_~y~0)) (not (= (+ main_~a~0 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3))))) (<= (+ main_~r~0 (div (* (- 2) main_~r~0) 3) 1) 0))} is VALID [2022-04-08 05:49:56,472 INFO L272 TraceCheckUtils]: 83: Hoare triple {13209#(and (= (mod main_~r~0 3) 0) (< (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) main_~a~0 main_~x~0)) (<= main_~x~0 5) (<= 0 (+ (div (* (- 1) main_~p~0) 2) 1)) (<= (+ main_~a~0 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (< 0 main_~a~0) (= (mod main_~p~0 2) 0) (= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) main_~a~0 main_~y~0)) (not (= (+ main_~a~0 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3))))) (<= (+ main_~r~0 (div (* (- 2) main_~r~0) 3) 1) 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 05:49:56,472 INFO L290 TraceCheckUtils]: 84: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 05:49:56,472 INFO L290 TraceCheckUtils]: 85: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 05:49:56,472 INFO L290 TraceCheckUtils]: 86: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 05:49:56,473 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {12950#true} {13209#(and (= (mod main_~r~0 3) 0) (< (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) main_~a~0 main_~x~0)) (<= main_~x~0 5) (<= 0 (+ (div (* (- 1) main_~p~0) 2) 1)) (<= (+ main_~a~0 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (< 0 main_~a~0) (= (mod main_~p~0 2) 0) (= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) main_~a~0 main_~y~0)) (not (= (+ main_~a~0 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3))))) (<= (+ main_~r~0 (div (* (- 2) main_~r~0) 3) 1) 0))} #74#return; {13209#(and (= (mod main_~r~0 3) 0) (< (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) main_~a~0 main_~x~0)) (<= main_~x~0 5) (<= 0 (+ (div (* (- 1) main_~p~0) 2) 1)) (<= (+ main_~a~0 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (< 0 main_~a~0) (= (mod main_~p~0 2) 0) (= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) main_~a~0 main_~y~0)) (not (= (+ main_~a~0 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3))))) (<= (+ main_~r~0 (div (* (- 2) main_~r~0) 3) 1) 0))} is VALID [2022-04-08 05:49:56,480 INFO L272 TraceCheckUtils]: 88: Hoare triple {13209#(and (= (mod main_~r~0 3) 0) (< (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) main_~a~0 main_~x~0)) (<= main_~x~0 5) (<= 0 (+ (div (* (- 1) main_~p~0) 2) 1)) (<= (+ main_~a~0 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (< 0 main_~a~0) (= (mod main_~p~0 2) 0) (= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~y~0 (div (* (- 2) main_~r~0) 3)))) (+ (* 2 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) main_~a~0 main_~y~0)) (not (= (+ main_~a~0 (* main_~x~0 (div (* (- 1) main_~p~0) 2))) (+ (* main_~y~0 main_~r~0) (* main_~y~0 (div (* (- 2) main_~r~0) 3))))) (<= (+ main_~r~0 (div (* (- 2) main_~r~0) 3) 1) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13231#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:49:56,480 INFO L290 TraceCheckUtils]: 89: Hoare triple {13231#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:49:56,480 INFO L290 TraceCheckUtils]: 90: Hoare triple {13235#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12951#false} is VALID [2022-04-08 05:49:56,480 INFO L290 TraceCheckUtils]: 91: Hoare triple {12951#false} assume !false; {12951#false} is VALID [2022-04-08 05:49:56,481 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 63 proven. 44 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-08 05:49:56,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:50:17,616 INFO L290 TraceCheckUtils]: 91: Hoare triple {12951#false} assume !false; {12951#false} is VALID [2022-04-08 05:50:17,617 INFO L290 TraceCheckUtils]: 90: Hoare triple {13235#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12951#false} is VALID [2022-04-08 05:50:17,617 INFO L290 TraceCheckUtils]: 89: Hoare triple {13231#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:50:17,618 INFO L272 TraceCheckUtils]: 88: Hoare triple {13251#(= 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)); {13231#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:50:17,618 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {12950#true} {13251#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #74#return; {13251#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:50:17,618 INFO L290 TraceCheckUtils]: 86: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 05:50:17,618 INFO L290 TraceCheckUtils]: 85: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 05:50:17,618 INFO L290 TraceCheckUtils]: 84: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 05:50:17,618 INFO L272 TraceCheckUtils]: 83: Hoare triple {13251#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 05:50:17,619 INFO L290 TraceCheckUtils]: 82: Hoare triple {13251#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {13251#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:50:17,979 INFO L290 TraceCheckUtils]: 81: Hoare triple {13273#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {13251#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:50:17,980 INFO L290 TraceCheckUtils]: 80: Hoare triple {13273#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} assume !!(~a~0 != ~b~0); {13273#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} is VALID [2022-04-08 05:50:17,981 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {13180#(not (= |__VERIFIER_assert_#in~cond| 0))} {13280#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #78#return; {13273#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} is VALID [2022-04-08 05:50:17,981 INFO L290 TraceCheckUtils]: 78: Hoare triple {13180#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13180#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:50:17,981 INFO L290 TraceCheckUtils]: 77: Hoare triple {13290#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13180#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:50:17,982 INFO L290 TraceCheckUtils]: 76: Hoare triple {12950#true} ~cond := #in~cond; {13290#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:50:17,982 INFO L272 TraceCheckUtils]: 75: Hoare triple {13280#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 05:50:17,983 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13180#(not (= |__VERIFIER_assert_#in~cond| 0))} {12950#true} #76#return; {13280#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 05:50:17,983 INFO L290 TraceCheckUtils]: 73: Hoare triple {13180#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13180#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:50:17,983 INFO L290 TraceCheckUtils]: 72: Hoare triple {13290#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13180#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:50:17,984 INFO L290 TraceCheckUtils]: 71: Hoare triple {12950#true} ~cond := #in~cond; {13290#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:50:17,984 INFO L272 TraceCheckUtils]: 70: Hoare triple {12950#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 05:50:17,984 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {12950#true} {12950#true} #74#return; {12950#true} is VALID [2022-04-08 05:50:17,984 INFO L290 TraceCheckUtils]: 68: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 05:50:17,984 INFO L290 TraceCheckUtils]: 67: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 05:50:17,984 INFO L290 TraceCheckUtils]: 66: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 05:50:17,984 INFO L272 TraceCheckUtils]: 65: Hoare triple {12950#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 05:50:17,984 INFO L290 TraceCheckUtils]: 64: Hoare triple {12950#true} assume !false; {12950#true} is VALID [2022-04-08 05:50:17,984 INFO L290 TraceCheckUtils]: 63: Hoare triple {12950#true} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {12950#true} is VALID [2022-04-08 05:50:17,984 INFO L290 TraceCheckUtils]: 62: Hoare triple {12950#true} assume !!(~a~0 != ~b~0); {12950#true} is VALID [2022-04-08 05:50:17,984 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {12950#true} {12950#true} #78#return; {12950#true} is VALID [2022-04-08 05:50:17,984 INFO L290 TraceCheckUtils]: 60: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 05:50:17,984 INFO L290 TraceCheckUtils]: 59: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 05:50:17,989 INFO L290 TraceCheckUtils]: 58: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 05:50:17,990 INFO L272 TraceCheckUtils]: 57: Hoare triple {12950#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 05:50:17,990 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {12950#true} {12950#true} #76#return; {12950#true} is VALID [2022-04-08 05:50:17,990 INFO L290 TraceCheckUtils]: 55: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 05:50:17,990 INFO L290 TraceCheckUtils]: 54: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 05:50:17,990 INFO L290 TraceCheckUtils]: 53: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 05:50:17,990 INFO L272 TraceCheckUtils]: 52: Hoare triple {12950#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 05:50:17,990 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {12950#true} {12950#true} #74#return; {12950#true} is VALID [2022-04-08 05:50:17,990 INFO L290 TraceCheckUtils]: 50: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 05:50:17,994 INFO L290 TraceCheckUtils]: 49: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 05:50:17,995 INFO L290 TraceCheckUtils]: 48: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 05:50:17,995 INFO L272 TraceCheckUtils]: 47: Hoare triple {12950#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 05:50:17,995 INFO L290 TraceCheckUtils]: 46: Hoare triple {12950#true} assume !false; {12950#true} is VALID [2022-04-08 05:50:17,995 INFO L290 TraceCheckUtils]: 45: Hoare triple {12950#true} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {12950#true} is VALID [2022-04-08 05:50:17,995 INFO L290 TraceCheckUtils]: 44: Hoare triple {12950#true} assume !!(~a~0 != ~b~0); {12950#true} is VALID [2022-04-08 05:50:17,995 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {12950#true} {12950#true} #78#return; {12950#true} is VALID [2022-04-08 05:50:17,995 INFO L290 TraceCheckUtils]: 42: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 05:50:17,995 INFO L290 TraceCheckUtils]: 41: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 05:50:17,995 INFO L290 TraceCheckUtils]: 40: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 05:50:17,996 INFO L272 TraceCheckUtils]: 39: Hoare triple {12950#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 05:50:17,996 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {12950#true} {12950#true} #76#return; {12950#true} is VALID [2022-04-08 05:50:17,996 INFO L290 TraceCheckUtils]: 37: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 05:50:17,996 INFO L290 TraceCheckUtils]: 36: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 05:50:17,996 INFO L290 TraceCheckUtils]: 35: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 05:50:17,996 INFO L272 TraceCheckUtils]: 34: Hoare triple {12950#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 05:50:17,996 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {12950#true} {12950#true} #74#return; {12950#true} is VALID [2022-04-08 05:50:17,996 INFO L290 TraceCheckUtils]: 32: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 05:50:17,996 INFO L290 TraceCheckUtils]: 31: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 05:50:17,996 INFO L290 TraceCheckUtils]: 30: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 05:50:17,996 INFO L272 TraceCheckUtils]: 29: Hoare triple {12950#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {12950#true} is VALID [2022-04-08 05:50:17,996 INFO L290 TraceCheckUtils]: 28: Hoare triple {12950#true} assume !false; {12950#true} is VALID [2022-04-08 05:50:17,996 INFO L290 TraceCheckUtils]: 27: Hoare triple {12950#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {12950#true} is VALID [2022-04-08 05:50:17,996 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12950#true} {12950#true} #72#return; {12950#true} is VALID [2022-04-08 05:50:17,996 INFO L290 TraceCheckUtils]: 25: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 05:50:17,996 INFO L290 TraceCheckUtils]: 24: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 05:50:17,996 INFO L290 TraceCheckUtils]: 23: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 05:50:17,996 INFO L272 TraceCheckUtils]: 22: Hoare triple {12950#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12950#true} is VALID [2022-04-08 05:50:17,996 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {12950#true} {12950#true} #70#return; {12950#true} is VALID [2022-04-08 05:50:17,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 05:50:17,997 INFO L290 TraceCheckUtils]: 19: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 05:50:17,997 INFO L290 TraceCheckUtils]: 18: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 05:50:17,997 INFO L272 TraceCheckUtils]: 17: Hoare triple {12950#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {12950#true} is VALID [2022-04-08 05:50:17,997 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12950#true} {12950#true} #68#return; {12950#true} is VALID [2022-04-08 05:50:17,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 05:50:17,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 05:50:17,997 INFO L290 TraceCheckUtils]: 13: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 05:50:17,997 INFO L272 TraceCheckUtils]: 12: Hoare triple {12950#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {12950#true} is VALID [2022-04-08 05:50:17,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {12950#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {12950#true} is VALID [2022-04-08 05:50:17,997 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12950#true} {12950#true} #66#return; {12950#true} is VALID [2022-04-08 05:50:17,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 05:50:17,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {12950#true} assume !(0 == ~cond); {12950#true} is VALID [2022-04-08 05:50:17,997 INFO L290 TraceCheckUtils]: 7: Hoare triple {12950#true} ~cond := #in~cond; {12950#true} is VALID [2022-04-08 05:50:17,997 INFO L272 TraceCheckUtils]: 6: Hoare triple {12950#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {12950#true} is VALID [2022-04-08 05:50:17,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {12950#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {12950#true} is VALID [2022-04-08 05:50:17,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {12950#true} call #t~ret6 := main(); {12950#true} is VALID [2022-04-08 05:50:17,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12950#true} {12950#true} #88#return; {12950#true} is VALID [2022-04-08 05:50:17,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-04-08 05:50:17,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {12950#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(10, 2);call #Ultimate.allocInit(12, 3); {12950#true} is VALID [2022-04-08 05:50:17,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {12950#true} call ULTIMATE.init(); {12950#true} is VALID [2022-04-08 05:50:17,998 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 75 proven. 8 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2022-04-08 05:50:17,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:50:17,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953970295] [2022-04-08 05:50:17,998 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:50:17,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036683435] [2022-04-08 05:50:17,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036683435] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:50:17,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:50:17,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 20 [2022-04-08 05:50:17,999 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:50:17,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1109958912] [2022-04-08 05:50:17,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1109958912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:50:17,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:50:17,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 05:50:17,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545900950] [2022-04-08 05:50:17,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:50:17,999 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 14 states have internal predecessors, (30), 8 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) Word has length 92 [2022-04-08 05:50:17,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:50:17,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.875) internal successors, (30), 14 states have internal predecessors, (30), 8 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2022-04-08 05:50:18,085 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:50:18,086 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 05:50:18,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:50:18,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 05:50:18,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-04-08 05:50:18,086 INFO L87 Difference]: Start difference. First operand 155 states and 180 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 14 states have internal predecessors, (30), 8 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2022-04-08 05:50:27,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:50:27,546 INFO L93 Difference]: Finished difference Result 185 states and 218 transitions. [2022-04-08 05:50:27,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 05:50:27,546 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 14 states have internal predecessors, (30), 8 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) Word has length 92 [2022-04-08 05:50:27,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:50:27,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 14 states have internal predecessors, (30), 8 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2022-04-08 05:50:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 79 transitions. [2022-04-08 05:50:27,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 14 states have internal predecessors, (30), 8 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2022-04-08 05:50:27,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 79 transitions. [2022-04-08 05:50:27,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 79 transitions. [2022-04-08 05:50:27,664 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 05:50:27,666 INFO L225 Difference]: With dead ends: 185 [2022-04-08 05:50:27,666 INFO L226 Difference]: Without dead ends: 183 [2022-04-08 05:50:27,667 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 163 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2022-04-08 05:50:27,667 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 24 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-08 05:50:27,667 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 189 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-04-08 05:50:27,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-04-08 05:50:27,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2022-04-08 05:50:27,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:50:27,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand has 183 states, 110 states have (on average 1.1) internal successors, (121), 115 states have internal predecessors, (121), 48 states have call successors, (48), 25 states have call predecessors, (48), 24 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) [2022-04-08 05:50:27,996 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand has 183 states, 110 states have (on average 1.1) internal successors, (121), 115 states have internal predecessors, (121), 48 states have call successors, (48), 25 states have call predecessors, (48), 24 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) [2022-04-08 05:50:27,997 INFO L87 Difference]: Start difference. First operand 183 states. Second operand has 183 states, 110 states have (on average 1.1) internal successors, (121), 115 states have internal predecessors, (121), 48 states have call successors, (48), 25 states have call predecessors, (48), 24 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) [2022-04-08 05:50:28,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:50:28,000 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2022-04-08 05:50:28,000 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 216 transitions. [2022-04-08 05:50:28,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:50:28,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:50:28,001 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 110 states have (on average 1.1) internal successors, (121), 115 states have internal predecessors, (121), 48 states have call successors, (48), 25 states have call predecessors, (48), 24 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) Second operand 183 states. [2022-04-08 05:50:28,002 INFO L87 Difference]: Start difference. First operand has 183 states, 110 states have (on average 1.1) internal successors, (121), 115 states have internal predecessors, (121), 48 states have call successors, (48), 25 states have call predecessors, (48), 24 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) Second operand 183 states. [2022-04-08 05:50:28,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:50:28,005 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2022-04-08 05:50:28,005 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 216 transitions. [2022-04-08 05:50:28,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:50:28,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:50:28,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:50:28,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:50:28,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 110 states have (on average 1.1) internal successors, (121), 115 states have internal predecessors, (121), 48 states have call successors, (48), 25 states have call predecessors, (48), 24 states have return successors, (47), 42 states have call predecessors, (47), 47 states have call successors, (47) [2022-04-08 05:50:28,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 216 transitions. [2022-04-08 05:50:28,010 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 216 transitions. Word has length 92 [2022-04-08 05:50:28,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:50:28,011 INFO L478 AbstractCegarLoop]: Abstraction has 183 states and 216 transitions. [2022-04-08 05:50:28,011 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 14 states have internal predecessors, (30), 8 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2022-04-08 05:50:28,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 183 states and 216 transitions. [2022-04-08 05:50:28,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:50:28,724 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 216 transitions. [2022-04-08 05:50:28,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-08 05:50:28,725 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:50:28,725 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:50:28,743 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 05:50:28,925 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 05:50:28,926 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:50:28,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:50:28,926 INFO L85 PathProgramCache]: Analyzing trace with hash 65583604, now seen corresponding path program 9 times [2022-04-08 05:50:28,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:50:28,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [740263105] [2022-04-08 05:50:28,926 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:50:28,926 INFO L85 PathProgramCache]: Analyzing trace with hash 65583604, now seen corresponding path program 10 times [2022-04-08 05:50:28,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:50:28,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085443883] [2022-04-08 05:50:28,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:50:28,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:50:28,939 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:50:28,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1492832132] [2022-04-08 05:50:28,940 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 05:50:28,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:50:28,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:50:28,940 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 05:50:28,941 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 05:50:28,988 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 05:50:28,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:50:28,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 05:50:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:50:29,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:50:33,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {14629#true} call ULTIMATE.init(); {14629#true} is VALID [2022-04-08 05:50:33,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {14629#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(10, 2);call #Ultimate.allocInit(12, 3); {14629#true} is VALID [2022-04-08 05:50:33,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 05:50:33,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14629#true} {14629#true} #88#return; {14629#true} is VALID [2022-04-08 05:50:33,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {14629#true} call #t~ret6 := main(); {14629#true} is VALID [2022-04-08 05:50:33,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {14629#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {14629#true} is VALID [2022-04-08 05:50:33,198 INFO L272 TraceCheckUtils]: 6: Hoare triple {14629#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {14629#true} is VALID [2022-04-08 05:50:33,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 05:50:33,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 05:50:33,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 05:50:33,198 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14629#true} {14629#true} #66#return; {14629#true} is VALID [2022-04-08 05:50:33,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {14629#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {14629#true} is VALID [2022-04-08 05:50:33,198 INFO L272 TraceCheckUtils]: 12: Hoare triple {14629#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {14629#true} is VALID [2022-04-08 05:50:33,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 05:50:33,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 05:50:33,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 05:50:33,199 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14629#true} {14629#true} #68#return; {14629#true} is VALID [2022-04-08 05:50:33,199 INFO L272 TraceCheckUtils]: 17: Hoare triple {14629#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {14629#true} is VALID [2022-04-08 05:50:33,199 INFO L290 TraceCheckUtils]: 18: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 05:50:33,199 INFO L290 TraceCheckUtils]: 19: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 05:50:33,199 INFO L290 TraceCheckUtils]: 20: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 05:50:33,199 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14629#true} {14629#true} #70#return; {14629#true} is VALID [2022-04-08 05:50:33,199 INFO L272 TraceCheckUtils]: 22: Hoare triple {14629#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14629#true} is VALID [2022-04-08 05:50:33,199 INFO L290 TraceCheckUtils]: 23: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 05:50:33,199 INFO L290 TraceCheckUtils]: 24: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 05:50:33,199 INFO L290 TraceCheckUtils]: 25: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 05:50:33,199 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14629#true} {14629#true} #72#return; {14629#true} is VALID [2022-04-08 05:50:33,207 INFO L290 TraceCheckUtils]: 27: Hoare triple {14629#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {14715#(and (<= 1 main_~s~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:50:33,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {14715#(and (<= 1 main_~s~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {14715#(and (<= 1 main_~s~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:50:33,208 INFO L272 TraceCheckUtils]: 29: Hoare triple {14715#(and (<= 1 main_~s~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 05:50:33,209 INFO L290 TraceCheckUtils]: 30: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 05:50:33,209 INFO L290 TraceCheckUtils]: 31: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 05:50:33,209 INFO L290 TraceCheckUtils]: 32: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 05:50:33,215 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {14629#true} {14715#(and (<= 1 main_~s~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #74#return; {14715#(and (<= 1 main_~s~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:50:33,215 INFO L272 TraceCheckUtils]: 34: Hoare triple {14715#(and (<= 1 main_~s~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 05:50:33,215 INFO L290 TraceCheckUtils]: 35: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 05:50:33,215 INFO L290 TraceCheckUtils]: 36: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 05:50:33,215 INFO L290 TraceCheckUtils]: 37: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 05:50:33,216 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {14629#true} {14715#(and (<= 1 main_~s~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #76#return; {14715#(and (<= 1 main_~s~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:50:33,216 INFO L272 TraceCheckUtils]: 39: Hoare triple {14715#(and (<= 1 main_~s~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 05:50:33,216 INFO L290 TraceCheckUtils]: 40: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 05:50:33,216 INFO L290 TraceCheckUtils]: 41: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 05:50:33,216 INFO L290 TraceCheckUtils]: 42: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 05:50:33,217 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {14629#true} {14715#(and (<= 1 main_~s~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #78#return; {14715#(and (<= 1 main_~s~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:50:33,217 INFO L290 TraceCheckUtils]: 44: Hoare triple {14715#(and (<= 1 main_~s~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {14767#(and (<= 1 main_~s~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (= main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:50:33,219 INFO L290 TraceCheckUtils]: 45: Hoare triple {14767#(and (<= 1 main_~s~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (= main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {14771#(and (= main_~r~0 0) (not (= main_~a~0 main_~y~0)) (<= 1 (+ main_~s~0 main_~r~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 05:50:33,219 INFO L290 TraceCheckUtils]: 46: Hoare triple {14771#(and (= main_~r~0 0) (not (= main_~a~0 main_~y~0)) (<= 1 (+ main_~s~0 main_~r~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !false; {14771#(and (= main_~r~0 0) (not (= main_~a~0 main_~y~0)) (<= 1 (+ main_~s~0 main_~r~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 05:50:33,219 INFO L272 TraceCheckUtils]: 47: Hoare triple {14771#(and (= main_~r~0 0) (not (= main_~a~0 main_~y~0)) (<= 1 (+ main_~s~0 main_~r~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 05:50:33,219 INFO L290 TraceCheckUtils]: 48: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 05:50:33,219 INFO L290 TraceCheckUtils]: 49: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 05:50:33,219 INFO L290 TraceCheckUtils]: 50: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 05:50:33,220 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {14629#true} {14771#(and (= main_~r~0 0) (not (= main_~a~0 main_~y~0)) (<= 1 (+ main_~s~0 main_~r~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #74#return; {14771#(and (= main_~r~0 0) (not (= main_~a~0 main_~y~0)) (<= 1 (+ main_~s~0 main_~r~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 05:50:33,220 INFO L272 TraceCheckUtils]: 52: Hoare triple {14771#(and (= main_~r~0 0) (not (= main_~a~0 main_~y~0)) (<= 1 (+ main_~s~0 main_~r~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 05:50:33,220 INFO L290 TraceCheckUtils]: 53: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 05:50:33,220 INFO L290 TraceCheckUtils]: 54: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 05:50:33,220 INFO L290 TraceCheckUtils]: 55: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 05:50:33,221 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {14629#true} {14771#(and (= main_~r~0 0) (not (= main_~a~0 main_~y~0)) (<= 1 (+ main_~s~0 main_~r~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #76#return; {14771#(and (= main_~r~0 0) (not (= main_~a~0 main_~y~0)) (<= 1 (+ main_~s~0 main_~r~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 05:50:33,221 INFO L272 TraceCheckUtils]: 57: Hoare triple {14771#(and (= main_~r~0 0) (not (= main_~a~0 main_~y~0)) (<= 1 (+ main_~s~0 main_~r~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 05:50:33,221 INFO L290 TraceCheckUtils]: 58: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 05:50:33,221 INFO L290 TraceCheckUtils]: 59: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 05:50:33,221 INFO L290 TraceCheckUtils]: 60: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 05:50:33,222 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {14629#true} {14771#(and (= main_~r~0 0) (not (= main_~a~0 main_~y~0)) (<= 1 (+ main_~s~0 main_~r~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #78#return; {14771#(and (= main_~r~0 0) (not (= main_~a~0 main_~y~0)) (<= 1 (+ main_~s~0 main_~r~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 05:50:33,222 INFO L290 TraceCheckUtils]: 62: Hoare triple {14771#(and (= main_~r~0 0) (not (= main_~a~0 main_~y~0)) (<= 1 (+ main_~s~0 main_~r~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {14771#(and (= main_~r~0 0) (not (= main_~a~0 main_~y~0)) (<= 1 (+ main_~s~0 main_~r~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 05:50:33,224 INFO L290 TraceCheckUtils]: 63: Hoare triple {14771#(and (= main_~r~0 0) (not (= main_~a~0 main_~y~0)) (<= 1 (+ main_~s~0 main_~r~0)) (not (< main_~y~0 main_~a~0)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {14826#(and (not (= main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 (* (- 2) main_~q~0)) (not (< main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (<= 1 (+ main_~r~0 (* main_~s~0 2))) (= (* (- 1) main_~q~0) 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 05:50:33,224 INFO L290 TraceCheckUtils]: 64: Hoare triple {14826#(and (not (= main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 (* (- 2) main_~q~0)) (not (< main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (<= 1 (+ main_~r~0 (* main_~s~0 2))) (= (* (- 1) main_~q~0) 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} assume !false; {14826#(and (not (= main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 (* (- 2) main_~q~0)) (not (< main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (<= 1 (+ main_~r~0 (* main_~s~0 2))) (= (* (- 1) main_~q~0) 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 05:50:33,225 INFO L272 TraceCheckUtils]: 65: Hoare triple {14826#(and (not (= main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 (* (- 2) main_~q~0)) (not (< main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (<= 1 (+ main_~r~0 (* main_~s~0 2))) (= (* (- 1) main_~q~0) 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 05:50:33,225 INFO L290 TraceCheckUtils]: 66: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 05:50:33,225 INFO L290 TraceCheckUtils]: 67: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 05:50:33,225 INFO L290 TraceCheckUtils]: 68: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 05:50:33,225 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {14629#true} {14826#(and (not (= main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 (* (- 2) main_~q~0)) (not (< main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (<= 1 (+ main_~r~0 (* main_~s~0 2))) (= (* (- 1) main_~q~0) 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} #74#return; {14826#(and (not (= main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 (* (- 2) main_~q~0)) (not (< main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (<= 1 (+ main_~r~0 (* main_~s~0 2))) (= (* (- 1) main_~q~0) 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 05:50:33,225 INFO L272 TraceCheckUtils]: 70: Hoare triple {14826#(and (not (= main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 (* (- 2) main_~q~0)) (not (< main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (<= 1 (+ main_~r~0 (* main_~s~0 2))) (= (* (- 1) main_~q~0) 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 05:50:33,226 INFO L290 TraceCheckUtils]: 71: Hoare triple {14629#true} ~cond := #in~cond; {14851#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:50:33,226 INFO L290 TraceCheckUtils]: 72: Hoare triple {14851#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {14855#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:50:33,226 INFO L290 TraceCheckUtils]: 73: Hoare triple {14855#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14855#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:50:33,227 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14855#(not (= |__VERIFIER_assert_#in~cond| 0))} {14826#(and (not (= main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 (* (- 2) main_~q~0)) (not (< main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (<= 1 (+ main_~r~0 (* main_~s~0 2))) (= (* (- 1) main_~q~0) 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} #76#return; {14862#(and (not (= main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 (* (- 2) main_~q~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (< main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (<= 1 (+ main_~r~0 (* main_~s~0 2))) (= (* (- 1) main_~q~0) 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 05:50:33,227 INFO L272 TraceCheckUtils]: 75: Hoare triple {14862#(and (not (= main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 (* (- 2) main_~q~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (< main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (<= 1 (+ main_~r~0 (* main_~s~0 2))) (= (* (- 1) main_~q~0) 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 05:50:33,227 INFO L290 TraceCheckUtils]: 76: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 05:50:33,227 INFO L290 TraceCheckUtils]: 77: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 05:50:33,227 INFO L290 TraceCheckUtils]: 78: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 05:50:33,228 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {14629#true} {14862#(and (not (= main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 (* (- 2) main_~q~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (< main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (<= 1 (+ main_~r~0 (* main_~s~0 2))) (= (* (- 1) main_~q~0) 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} #78#return; {14862#(and (not (= main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 (* (- 2) main_~q~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (< main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (<= 1 (+ main_~r~0 (* main_~s~0 2))) (= (* (- 1) main_~q~0) 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 05:50:33,229 INFO L290 TraceCheckUtils]: 80: Hoare triple {14862#(and (not (= main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 (* (- 2) main_~q~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (< main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (<= 1 (+ main_~r~0 (* main_~s~0 2))) (= (* (- 1) main_~q~0) 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} assume !!(~a~0 != ~b~0); {14862#(and (not (= main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 (* (- 2) main_~q~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (< main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (<= 1 (+ main_~r~0 (* main_~s~0 2))) (= (* (- 1) main_~q~0) 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-08 05:50:33,232 INFO L290 TraceCheckUtils]: 81: Hoare triple {14862#(and (not (= main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 (* (- 2) main_~q~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (< main_~y~0 (+ main_~b~0 main_~a~0))) (= (+ (* (- 1) main_~a~0) main_~y~0 (* (- 1) main_~b~0)) main_~b~0) (<= 1 (+ main_~r~0 (* main_~s~0 2))) (= (* (- 1) main_~q~0) 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {14884#(and (= main_~p~0 3) (<= main_~x~0 main_~y~0) (= (mod main_~r~0 2) 0) (< (* main_~y~0 2) (* main_~x~0 3)) (= (* main_~x~0 3) (+ main_~a~0 (* main_~y~0 2))) (= (+ main_~y~0 (* main_~p~0 main_~x~0)) (+ (* main_~x~0 3) (* main_~y~0 (div main_~r~0 (- 2))))) (not (= main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:50:33,232 INFO L290 TraceCheckUtils]: 82: Hoare triple {14884#(and (= main_~p~0 3) (<= main_~x~0 main_~y~0) (= (mod main_~r~0 2) 0) (< (* main_~y~0 2) (* main_~x~0 3)) (= (* main_~x~0 3) (+ main_~a~0 (* main_~y~0 2))) (= (+ main_~y~0 (* main_~p~0 main_~x~0)) (+ (* main_~x~0 3) (* main_~y~0 (div main_~r~0 (- 2))))) (not (= main_~y~0 main_~x~0)))} assume !false; {14884#(and (= main_~p~0 3) (<= main_~x~0 main_~y~0) (= (mod main_~r~0 2) 0) (< (* main_~y~0 2) (* main_~x~0 3)) (= (* main_~x~0 3) (+ main_~a~0 (* main_~y~0 2))) (= (+ main_~y~0 (* main_~p~0 main_~x~0)) (+ (* main_~x~0 3) (* main_~y~0 (div main_~r~0 (- 2))))) (not (= main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:50:33,232 INFO L272 TraceCheckUtils]: 83: Hoare triple {14884#(and (= main_~p~0 3) (<= main_~x~0 main_~y~0) (= (mod main_~r~0 2) 0) (< (* main_~y~0 2) (* main_~x~0 3)) (= (* main_~x~0 3) (+ main_~a~0 (* main_~y~0 2))) (= (+ main_~y~0 (* main_~p~0 main_~x~0)) (+ (* main_~x~0 3) (* main_~y~0 (div main_~r~0 (- 2))))) (not (= main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 05:50:33,232 INFO L290 TraceCheckUtils]: 84: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 05:50:33,232 INFO L290 TraceCheckUtils]: 85: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 05:50:33,232 INFO L290 TraceCheckUtils]: 86: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 05:50:33,233 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {14629#true} {14884#(and (= main_~p~0 3) (<= main_~x~0 main_~y~0) (= (mod main_~r~0 2) 0) (< (* main_~y~0 2) (* main_~x~0 3)) (= (* main_~x~0 3) (+ main_~a~0 (* main_~y~0 2))) (= (+ main_~y~0 (* main_~p~0 main_~x~0)) (+ (* main_~x~0 3) (* main_~y~0 (div main_~r~0 (- 2))))) (not (= main_~y~0 main_~x~0)))} #74#return; {14884#(and (= main_~p~0 3) (<= main_~x~0 main_~y~0) (= (mod main_~r~0 2) 0) (< (* main_~y~0 2) (* main_~x~0 3)) (= (* main_~x~0 3) (+ main_~a~0 (* main_~y~0 2))) (= (+ main_~y~0 (* main_~p~0 main_~x~0)) (+ (* main_~x~0 3) (* main_~y~0 (div main_~r~0 (- 2))))) (not (= main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:50:33,235 INFO L272 TraceCheckUtils]: 88: Hoare triple {14884#(and (= main_~p~0 3) (<= main_~x~0 main_~y~0) (= (mod main_~r~0 2) 0) (< (* main_~y~0 2) (* main_~x~0 3)) (= (* main_~x~0 3) (+ main_~a~0 (* main_~y~0 2))) (= (+ main_~y~0 (* main_~p~0 main_~x~0)) (+ (* main_~x~0 3) (* main_~y~0 (div main_~r~0 (- 2))))) (not (= main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14906#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:50:33,235 INFO L290 TraceCheckUtils]: 89: Hoare triple {14906#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14910#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:50:33,236 INFO L290 TraceCheckUtils]: 90: Hoare triple {14910#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14630#false} is VALID [2022-04-08 05:50:33,236 INFO L290 TraceCheckUtils]: 91: Hoare triple {14630#false} assume !false; {14630#false} is VALID [2022-04-08 05:50:33,236 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 40 proven. 34 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2022-04-08 05:50:33,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:50:53,473 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 05:50:53,591 INFO L290 TraceCheckUtils]: 91: Hoare triple {14630#false} assume !false; {14630#false} is VALID [2022-04-08 05:50:53,592 INFO L290 TraceCheckUtils]: 90: Hoare triple {14910#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14630#false} is VALID [2022-04-08 05:50:53,592 INFO L290 TraceCheckUtils]: 89: Hoare triple {14906#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14910#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:50:53,593 INFO L272 TraceCheckUtils]: 88: Hoare triple {14926#(= 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)); {14906#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:50:53,593 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {14629#true} {14926#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #74#return; {14926#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:50:53,593 INFO L290 TraceCheckUtils]: 86: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 05:50:53,593 INFO L290 TraceCheckUtils]: 85: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 05:50:53,593 INFO L290 TraceCheckUtils]: 84: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 05:50:53,593 INFO L272 TraceCheckUtils]: 83: Hoare triple {14926#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 05:50:53,594 INFO L290 TraceCheckUtils]: 82: Hoare triple {14926#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {14926#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:50:53,877 INFO L290 TraceCheckUtils]: 81: Hoare triple {14948#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {14926#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:50:53,877 INFO L290 TraceCheckUtils]: 80: Hoare triple {14948#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} assume !!(~a~0 != ~b~0); {14948#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} is VALID [2022-04-08 05:50:53,878 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {14629#true} {14948#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} #78#return; {14948#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} is VALID [2022-04-08 05:50:53,878 INFO L290 TraceCheckUtils]: 78: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 05:50:53,878 INFO L290 TraceCheckUtils]: 77: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 05:50:53,878 INFO L290 TraceCheckUtils]: 76: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 05:50:53,878 INFO L272 TraceCheckUtils]: 75: Hoare triple {14948#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 05:50:53,879 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14855#(not (= |__VERIFIER_assert_#in~cond| 0))} {14970#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} #76#return; {14948#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} is VALID [2022-04-08 05:50:53,879 INFO L290 TraceCheckUtils]: 73: Hoare triple {14855#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14855#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:50:53,879 INFO L290 TraceCheckUtils]: 72: Hoare triple {14980#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {14855#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:50:53,880 INFO L290 TraceCheckUtils]: 71: Hoare triple {14629#true} ~cond := #in~cond; {14980#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:50:53,880 INFO L272 TraceCheckUtils]: 70: Hoare triple {14970#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 05:50:53,880 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {14629#true} {14970#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} #74#return; {14970#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 05:50:53,880 INFO L290 TraceCheckUtils]: 68: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 05:50:53,880 INFO L290 TraceCheckUtils]: 67: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 05:50:53,880 INFO L290 TraceCheckUtils]: 66: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 05:50:53,880 INFO L272 TraceCheckUtils]: 65: Hoare triple {14970#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 05:50:53,881 INFO L290 TraceCheckUtils]: 64: Hoare triple {14970#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !false; {14970#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 05:50:53,992 INFO L290 TraceCheckUtils]: 63: Hoare triple {15005#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* (- 1) main_~b~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {14970#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 05:50:53,993 INFO L290 TraceCheckUtils]: 62: Hoare triple {15005#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* (- 1) main_~b~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} assume !!(~a~0 != ~b~0); {15005#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* (- 1) main_~b~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} is VALID [2022-04-08 05:50:53,994 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {14629#true} {15005#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* (- 1) main_~b~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} #78#return; {15005#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* (- 1) main_~b~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} is VALID [2022-04-08 05:50:53,994 INFO L290 TraceCheckUtils]: 60: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 05:50:53,994 INFO L290 TraceCheckUtils]: 59: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 05:50:53,994 INFO L290 TraceCheckUtils]: 58: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 05:50:53,994 INFO L272 TraceCheckUtils]: 57: Hoare triple {15005#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* (- 1) main_~b~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 05:50:53,995 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {14629#true} {15005#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* (- 1) main_~b~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} #76#return; {15005#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* (- 1) main_~b~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} is VALID [2022-04-08 05:50:53,995 INFO L290 TraceCheckUtils]: 55: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 05:50:53,995 INFO L290 TraceCheckUtils]: 54: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 05:50:53,995 INFO L290 TraceCheckUtils]: 53: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 05:50:53,995 INFO L272 TraceCheckUtils]: 52: Hoare triple {15005#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* (- 1) main_~b~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 05:50:53,995 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {14629#true} {15005#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* (- 1) main_~b~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} #74#return; {15005#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* (- 1) main_~b~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} is VALID [2022-04-08 05:50:53,995 INFO L290 TraceCheckUtils]: 50: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 05:50:53,996 INFO L290 TraceCheckUtils]: 49: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 05:50:53,996 INFO L290 TraceCheckUtils]: 48: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 05:50:53,996 INFO L272 TraceCheckUtils]: 47: Hoare triple {15005#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* (- 1) main_~b~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 05:50:53,996 INFO L290 TraceCheckUtils]: 46: Hoare triple {15005#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* (- 1) main_~b~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} assume !false; {15005#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* (- 1) main_~b~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} is VALID [2022-04-08 05:50:55,998 WARN L290 TraceCheckUtils]: 45: Hoare triple {15060#(or (< main_~b~0 main_~a~0) (not (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* (* main_~y~0 main_~r~0) 4) (* (* main_~p~0 main_~x~0) 4)))) (= (+ (* (- 1) main_~a~0) (* (- 1) (* (- 2) main_~y~0 main_~r~0)) (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* (- 2) main_~p~0 main_~x~0)) (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0))) (+ (* (+ (* (- 2) main_~q~0) (* main_~p~0 3)) main_~x~0) (* main_~y~0 (+ (* (- 2) main_~s~0) (* main_~r~0 3))))) (not (= (+ (* (- 1) main_~a~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* (- 2) main_~y~0 main_~r~0) main_~a~0 (* (- 2) main_~p~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {15005#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* (- 1) main_~b~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} is UNKNOWN [2022-04-08 05:50:55,999 INFO L290 TraceCheckUtils]: 44: Hoare triple {15064#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* (* main_~y~0 main_~r~0) 4) (* (* main_~p~0 main_~x~0) 4)))) (= (+ (* (- 1) main_~a~0) (* (- 1) (* (- 2) main_~y~0 main_~r~0)) (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* (- 2) main_~p~0 main_~x~0)) (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0))) (+ (* (+ (* (- 2) main_~q~0) (* main_~p~0 3)) main_~x~0) (* main_~y~0 (+ (* (- 2) main_~s~0) (* main_~r~0 3))))) (not (= (+ (* (- 1) main_~a~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* (- 2) main_~y~0 main_~r~0) main_~a~0 (* (- 2) main_~p~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !!(~a~0 != ~b~0); {15060#(or (< main_~b~0 main_~a~0) (not (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* (* main_~y~0 main_~r~0) 4) (* (* main_~p~0 main_~x~0) 4)))) (= (+ (* (- 1) main_~a~0) (* (- 1) (* (- 2) main_~y~0 main_~r~0)) (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* (- 2) main_~p~0 main_~x~0)) (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0))) (+ (* (+ (* (- 2) main_~q~0) (* main_~p~0 3)) main_~x~0) (* main_~y~0 (+ (* (- 2) main_~s~0) (* main_~r~0 3))))) (not (= (+ (* (- 1) main_~a~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* (- 2) main_~y~0 main_~r~0) main_~a~0 (* (- 2) main_~p~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 05:50:56,000 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {14629#true} {15064#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* (* main_~y~0 main_~r~0) 4) (* (* main_~p~0 main_~x~0) 4)))) (= (+ (* (- 1) main_~a~0) (* (- 1) (* (- 2) main_~y~0 main_~r~0)) (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* (- 2) main_~p~0 main_~x~0)) (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0))) (+ (* (+ (* (- 2) main_~q~0) (* main_~p~0 3)) main_~x~0) (* main_~y~0 (+ (* (- 2) main_~s~0) (* main_~r~0 3))))) (not (= (+ (* (- 1) main_~a~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* (- 2) main_~y~0 main_~r~0) main_~a~0 (* (- 2) main_~p~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #78#return; {15064#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* (* main_~y~0 main_~r~0) 4) (* (* main_~p~0 main_~x~0) 4)))) (= (+ (* (- 1) main_~a~0) (* (- 1) (* (- 2) main_~y~0 main_~r~0)) (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* (- 2) main_~p~0 main_~x~0)) (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0))) (+ (* (+ (* (- 2) main_~q~0) (* main_~p~0 3)) main_~x~0) (* main_~y~0 (+ (* (- 2) main_~s~0) (* main_~r~0 3))))) (not (= (+ (* (- 1) main_~a~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* (- 2) main_~y~0 main_~r~0) main_~a~0 (* (- 2) main_~p~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 05:50:56,000 INFO L290 TraceCheckUtils]: 42: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 05:50:56,000 INFO L290 TraceCheckUtils]: 41: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 05:50:56,000 INFO L290 TraceCheckUtils]: 40: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 05:50:56,000 INFO L272 TraceCheckUtils]: 39: Hoare triple {15064#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* (* main_~y~0 main_~r~0) 4) (* (* main_~p~0 main_~x~0) 4)))) (= (+ (* (- 1) main_~a~0) (* (- 1) (* (- 2) main_~y~0 main_~r~0)) (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* (- 2) main_~p~0 main_~x~0)) (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0))) (+ (* (+ (* (- 2) main_~q~0) (* main_~p~0 3)) main_~x~0) (* main_~y~0 (+ (* (- 2) main_~s~0) (* main_~r~0 3))))) (not (= (+ (* (- 1) main_~a~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* (- 2) main_~y~0 main_~r~0) main_~a~0 (* (- 2) main_~p~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)); {14629#true} is VALID [2022-04-08 05:50:56,001 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {14629#true} {15064#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* (* main_~y~0 main_~r~0) 4) (* (* main_~p~0 main_~x~0) 4)))) (= (+ (* (- 1) main_~a~0) (* (- 1) (* (- 2) main_~y~0 main_~r~0)) (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* (- 2) main_~p~0 main_~x~0)) (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0))) (+ (* (+ (* (- 2) main_~q~0) (* main_~p~0 3)) main_~x~0) (* main_~y~0 (+ (* (- 2) main_~s~0) (* main_~r~0 3))))) (not (= (+ (* (- 1) main_~a~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* (- 2) main_~y~0 main_~r~0) main_~a~0 (* (- 2) main_~p~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #76#return; {15064#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* (* main_~y~0 main_~r~0) 4) (* (* main_~p~0 main_~x~0) 4)))) (= (+ (* (- 1) main_~a~0) (* (- 1) (* (- 2) main_~y~0 main_~r~0)) (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* (- 2) main_~p~0 main_~x~0)) (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0))) (+ (* (+ (* (- 2) main_~q~0) (* main_~p~0 3)) main_~x~0) (* main_~y~0 (+ (* (- 2) main_~s~0) (* main_~r~0 3))))) (not (= (+ (* (- 1) main_~a~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* (- 2) main_~y~0 main_~r~0) main_~a~0 (* (- 2) main_~p~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 05:50:56,001 INFO L290 TraceCheckUtils]: 37: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 05:50:56,001 INFO L290 TraceCheckUtils]: 36: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 05:50:56,001 INFO L290 TraceCheckUtils]: 35: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 05:50:56,001 INFO L272 TraceCheckUtils]: 34: Hoare triple {15064#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* (* main_~y~0 main_~r~0) 4) (* (* main_~p~0 main_~x~0) 4)))) (= (+ (* (- 1) main_~a~0) (* (- 1) (* (- 2) main_~y~0 main_~r~0)) (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* (- 2) main_~p~0 main_~x~0)) (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0))) (+ (* (+ (* (- 2) main_~q~0) (* main_~p~0 3)) main_~x~0) (* main_~y~0 (+ (* (- 2) main_~s~0) (* main_~r~0 3))))) (not (= (+ (* (- 1) main_~a~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* (- 2) main_~y~0 main_~r~0) main_~a~0 (* (- 2) main_~p~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)); {14629#true} is VALID [2022-04-08 05:50:56,001 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {14629#true} {15064#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* (* main_~y~0 main_~r~0) 4) (* (* main_~p~0 main_~x~0) 4)))) (= (+ (* (- 1) main_~a~0) (* (- 1) (* (- 2) main_~y~0 main_~r~0)) (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* (- 2) main_~p~0 main_~x~0)) (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0))) (+ (* (+ (* (- 2) main_~q~0) (* main_~p~0 3)) main_~x~0) (* main_~y~0 (+ (* (- 2) main_~s~0) (* main_~r~0 3))))) (not (= (+ (* (- 1) main_~a~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* (- 2) main_~y~0 main_~r~0) main_~a~0 (* (- 2) main_~p~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #74#return; {15064#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* (* main_~y~0 main_~r~0) 4) (* (* main_~p~0 main_~x~0) 4)))) (= (+ (* (- 1) main_~a~0) (* (- 1) (* (- 2) main_~y~0 main_~r~0)) (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* (- 2) main_~p~0 main_~x~0)) (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0))) (+ (* (+ (* (- 2) main_~q~0) (* main_~p~0 3)) main_~x~0) (* main_~y~0 (+ (* (- 2) main_~s~0) (* main_~r~0 3))))) (not (= (+ (* (- 1) main_~a~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* (- 2) main_~y~0 main_~r~0) main_~a~0 (* (- 2) main_~p~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 05:50:56,002 INFO L290 TraceCheckUtils]: 32: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 05:50:56,002 INFO L290 TraceCheckUtils]: 31: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 05:50:56,002 INFO L290 TraceCheckUtils]: 30: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 05:50:56,002 INFO L272 TraceCheckUtils]: 29: Hoare triple {15064#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* (* main_~y~0 main_~r~0) 4) (* (* main_~p~0 main_~x~0) 4)))) (= (+ (* (- 1) main_~a~0) (* (- 1) (* (- 2) main_~y~0 main_~r~0)) (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* (- 2) main_~p~0 main_~x~0)) (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0))) (+ (* (+ (* (- 2) main_~q~0) (* main_~p~0 3)) main_~x~0) (* main_~y~0 (+ (* (- 2) main_~s~0) (* main_~r~0 3))))) (not (= (+ (* (- 1) main_~a~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* (- 2) main_~y~0 main_~r~0) main_~a~0 (* (- 2) main_~p~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {14629#true} is VALID [2022-04-08 05:50:56,002 INFO L290 TraceCheckUtils]: 28: Hoare triple {15064#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* (* main_~y~0 main_~r~0) 4) (* (* main_~p~0 main_~x~0) 4)))) (= (+ (* (- 1) main_~a~0) (* (- 1) (* (- 2) main_~y~0 main_~r~0)) (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* (- 2) main_~p~0 main_~x~0)) (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0))) (+ (* (+ (* (- 2) main_~q~0) (* main_~p~0 3)) main_~x~0) (* main_~y~0 (+ (* (- 2) main_~s~0) (* main_~r~0 3))))) (not (= (+ (* (- 1) main_~a~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* (- 2) main_~y~0 main_~r~0) main_~a~0 (* (- 2) main_~p~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !false; {15064#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* (* main_~y~0 main_~r~0) 4) (* (* main_~p~0 main_~x~0) 4)))) (= (+ (* (- 1) main_~a~0) (* (- 1) (* (- 2) main_~y~0 main_~r~0)) (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* (- 2) main_~p~0 main_~x~0)) (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0))) (+ (* (+ (* (- 2) main_~q~0) (* main_~p~0 3)) main_~x~0) (* main_~y~0 (+ (* (- 2) main_~s~0) (* main_~r~0 3))))) (not (= (+ (* (- 1) main_~a~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* (- 2) main_~y~0 main_~r~0) main_~a~0 (* (- 2) main_~p~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 05:50:56,003 INFO L290 TraceCheckUtils]: 27: Hoare triple {14629#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {15064#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0) (not (< (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~a~0) (+ (* (* main_~y~0 main_~r~0) 4) (* (* main_~p~0 main_~x~0) 4)))) (= (+ (* (- 1) main_~a~0) (* (- 1) (* (- 2) main_~y~0 main_~r~0)) (* (- 1) (* main_~y~0 main_~s~0)) (* (- 1) (* (- 2) main_~p~0 main_~x~0)) (* (+ (* main_~p~0 2) (* (- 1) main_~q~0)) main_~x~0) (* (+ (* (- 1) main_~s~0) (* main_~r~0 2)) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0))) (+ (* (+ (* (- 2) main_~q~0) (* main_~p~0 3)) main_~x~0) (* main_~y~0 (+ (* (- 2) main_~s~0) (* main_~r~0 3))))) (not (= (+ (* (- 1) main_~a~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* (- 2) main_~y~0 main_~r~0) main_~a~0 (* (- 2) main_~p~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 05:50:56,003 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14629#true} {14629#true} #72#return; {14629#true} is VALID [2022-04-08 05:50:56,003 INFO L290 TraceCheckUtils]: 25: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 05:50:56,003 INFO L290 TraceCheckUtils]: 24: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 05:50:56,003 INFO L290 TraceCheckUtils]: 23: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 05:50:56,003 INFO L272 TraceCheckUtils]: 22: Hoare triple {14629#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14629#true} is VALID [2022-04-08 05:50:56,003 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14629#true} {14629#true} #70#return; {14629#true} is VALID [2022-04-08 05:50:56,004 INFO L290 TraceCheckUtils]: 20: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 05:50:56,004 INFO L290 TraceCheckUtils]: 19: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 05:50:56,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 05:50:56,004 INFO L272 TraceCheckUtils]: 17: Hoare triple {14629#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {14629#true} is VALID [2022-04-08 05:50:56,004 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14629#true} {14629#true} #68#return; {14629#true} is VALID [2022-04-08 05:50:56,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 05:50:56,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 05:50:56,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 05:50:56,004 INFO L272 TraceCheckUtils]: 12: Hoare triple {14629#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {14629#true} is VALID [2022-04-08 05:50:56,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {14629#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {14629#true} is VALID [2022-04-08 05:50:56,004 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14629#true} {14629#true} #66#return; {14629#true} is VALID [2022-04-08 05:50:56,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 05:50:56,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {14629#true} assume !(0 == ~cond); {14629#true} is VALID [2022-04-08 05:50:56,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {14629#true} ~cond := #in~cond; {14629#true} is VALID [2022-04-08 05:50:56,004 INFO L272 TraceCheckUtils]: 6: Hoare triple {14629#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {14629#true} is VALID [2022-04-08 05:50:56,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {14629#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {14629#true} is VALID [2022-04-08 05:50:56,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {14629#true} call #t~ret6 := main(); {14629#true} is VALID [2022-04-08 05:50:56,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14629#true} {14629#true} #88#return; {14629#true} is VALID [2022-04-08 05:50:56,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {14629#true} assume true; {14629#true} is VALID [2022-04-08 05:50:56,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {14629#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(10, 2);call #Ultimate.allocInit(12, 3); {14629#true} is VALID [2022-04-08 05:50:56,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {14629#true} call ULTIMATE.init(); {14629#true} is VALID [2022-04-08 05:50:56,005 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 46 proven. 28 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2022-04-08 05:50:56,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:50:56,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085443883] [2022-04-08 05:50:56,005 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:50:56,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492832132] [2022-04-08 05:50:56,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492832132] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:50:56,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:50:56,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-04-08 05:50:56,006 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:50:56,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [740263105] [2022-04-08 05:50:56,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [740263105] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:50:56,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:50:56,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 05:50:56,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974352006] [2022-04-08 05:50:56,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:50:56,006 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 92 [2022-04-08 05:50:56,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:50:56,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-08 05:50:56,066 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:50:56,066 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 05:50:56,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:50:56,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 05:50:56,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-08 05:50:56,066 INFO L87 Difference]: Start difference. First operand 183 states and 216 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-08 05:50:58,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:50:58,867 INFO L93 Difference]: Finished difference Result 212 states and 252 transitions. [2022-04-08 05:50:58,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 05:50:58,867 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 92 [2022-04-08 05:50:58,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:50:58,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-08 05:50:58,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 79 transitions. [2022-04-08 05:50:58,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-08 05:50:58,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 79 transitions. [2022-04-08 05:50:58,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 79 transitions. [2022-04-08 05:50:58,966 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 05:50:58,969 INFO L225 Difference]: With dead ends: 212 [2022-04-08 05:50:58,969 INFO L226 Difference]: Without dead ends: 210 [2022-04-08 05:50:58,969 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2022-04-08 05:50:58,969 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 14 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-08 05:50:58,970 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 210 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-08 05:50:58,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-04-08 05:50:59,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2022-04-08 05:50:59,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:50:59,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand has 200 states, 121 states have (on average 1.1074380165289257) internal successors, (134), 125 states have internal predecessors, (134), 52 states have call successors, (52), 27 states have call predecessors, (52), 26 states have return successors, (51), 47 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-08 05:50:59,374 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand has 200 states, 121 states have (on average 1.1074380165289257) internal successors, (134), 125 states have internal predecessors, (134), 52 states have call successors, (52), 27 states have call predecessors, (52), 26 states have return successors, (51), 47 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-08 05:50:59,374 INFO L87 Difference]: Start difference. First operand 210 states. Second operand has 200 states, 121 states have (on average 1.1074380165289257) internal successors, (134), 125 states have internal predecessors, (134), 52 states have call successors, (52), 27 states have call predecessors, (52), 26 states have return successors, (51), 47 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-08 05:50:59,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:50:59,377 INFO L93 Difference]: Finished difference Result 210 states and 250 transitions. [2022-04-08 05:50:59,377 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 250 transitions. [2022-04-08 05:50:59,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:50:59,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:50:59,378 INFO L74 IsIncluded]: Start isIncluded. First operand has 200 states, 121 states have (on average 1.1074380165289257) internal successors, (134), 125 states have internal predecessors, (134), 52 states have call successors, (52), 27 states have call predecessors, (52), 26 states have return successors, (51), 47 states have call predecessors, (51), 51 states have call successors, (51) Second operand 210 states. [2022-04-08 05:50:59,378 INFO L87 Difference]: Start difference. First operand has 200 states, 121 states have (on average 1.1074380165289257) internal successors, (134), 125 states have internal predecessors, (134), 52 states have call successors, (52), 27 states have call predecessors, (52), 26 states have return successors, (51), 47 states have call predecessors, (51), 51 states have call successors, (51) Second operand 210 states. [2022-04-08 05:50:59,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:50:59,382 INFO L93 Difference]: Finished difference Result 210 states and 250 transitions. [2022-04-08 05:50:59,382 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 250 transitions. [2022-04-08 05:50:59,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:50:59,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:50:59,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:50:59,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:50:59,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 121 states have (on average 1.1074380165289257) internal successors, (134), 125 states have internal predecessors, (134), 52 states have call successors, (52), 27 states have call predecessors, (52), 26 states have return successors, (51), 47 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-08 05:50:59,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 237 transitions. [2022-04-08 05:50:59,386 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 237 transitions. Word has length 92 [2022-04-08 05:50:59,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:50:59,386 INFO L478 AbstractCegarLoop]: Abstraction has 200 states and 237 transitions. [2022-04-08 05:50:59,386 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-08 05:50:59,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 200 states and 237 transitions. [2022-04-08 05:51:02,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 237 edges. 236 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 05:51:02,758 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 237 transitions. [2022-04-08 05:51:02,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-08 05:51:02,759 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:51:02,759 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:51:02,775 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 05:51:02,959 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 05:51:02,959 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:51:02,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:51:02,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1451786998, now seen corresponding path program 11 times [2022-04-08 05:51:02,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:51:02,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1218783885] [2022-04-08 05:51:02,960 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:51:02,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1451786998, now seen corresponding path program 12 times [2022-04-08 05:51:02,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:51:02,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398283931] [2022-04-08 05:51:02,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:51:02,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:51:02,986 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:51:02,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1041729313] [2022-04-08 05:51:02,986 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 05:51:02,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:51:02,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:51:02,987 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 05:51:02,988 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 05:51:03,036 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 05:51:03,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:51:03,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-08 05:51:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:51:03,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:51:18,694 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 05:51:21,083 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 05:51:31,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {16447#true} call ULTIMATE.init(); {16447#true} is VALID [2022-04-08 05:51:31,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {16447#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(10, 2);call #Ultimate.allocInit(12, 3); {16447#true} is VALID [2022-04-08 05:51:31,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {16447#true} assume true; {16447#true} is VALID [2022-04-08 05:51:31,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16447#true} {16447#true} #88#return; {16447#true} is VALID [2022-04-08 05:51:31,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {16447#true} call #t~ret6 := main(); {16447#true} is VALID [2022-04-08 05:51:31,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {16447#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {16447#true} is VALID [2022-04-08 05:51:31,508 INFO L272 TraceCheckUtils]: 6: Hoare triple {16447#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {16447#true} is VALID [2022-04-08 05:51:31,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {16447#true} ~cond := #in~cond; {16447#true} is VALID [2022-04-08 05:51:31,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {16447#true} assume !(0 == ~cond); {16447#true} is VALID [2022-04-08 05:51:31,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {16447#true} assume true; {16447#true} is VALID [2022-04-08 05:51:31,508 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16447#true} {16447#true} #66#return; {16447#true} is VALID [2022-04-08 05:51:31,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {16447#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {16447#true} is VALID [2022-04-08 05:51:31,508 INFO L272 TraceCheckUtils]: 12: Hoare triple {16447#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {16447#true} is VALID [2022-04-08 05:51:31,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {16447#true} ~cond := #in~cond; {16447#true} is VALID [2022-04-08 05:51:31,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {16447#true} assume !(0 == ~cond); {16447#true} is VALID [2022-04-08 05:51:31,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {16447#true} assume true; {16447#true} is VALID [2022-04-08 05:51:31,508 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {16447#true} {16447#true} #68#return; {16447#true} is VALID [2022-04-08 05:51:31,508 INFO L272 TraceCheckUtils]: 17: Hoare triple {16447#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16447#true} is VALID [2022-04-08 05:51:31,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {16447#true} ~cond := #in~cond; {16447#true} is VALID [2022-04-08 05:51:31,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {16447#true} assume !(0 == ~cond); {16447#true} is VALID [2022-04-08 05:51:31,509 INFO L290 TraceCheckUtils]: 20: Hoare triple {16447#true} assume true; {16447#true} is VALID [2022-04-08 05:51:31,509 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {16447#true} {16447#true} #70#return; {16447#true} is VALID [2022-04-08 05:51:31,509 INFO L272 TraceCheckUtils]: 22: Hoare triple {16447#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16447#true} is VALID [2022-04-08 05:51:31,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {16447#true} ~cond := #in~cond; {16447#true} is VALID [2022-04-08 05:51:31,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {16447#true} assume !(0 == ~cond); {16447#true} is VALID [2022-04-08 05:51:31,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {16447#true} assume true; {16447#true} is VALID [2022-04-08 05:51:31,509 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16447#true} {16447#true} #72#return; {16447#true} is VALID [2022-04-08 05:51:31,509 INFO L290 TraceCheckUtils]: 27: Hoare triple {16447#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:51:31,510 INFO L290 TraceCheckUtils]: 28: Hoare triple {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} assume !false; {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:51:31,510 INFO L272 TraceCheckUtils]: 29: Hoare triple {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {16447#true} is VALID [2022-04-08 05:51:31,510 INFO L290 TraceCheckUtils]: 30: Hoare triple {16447#true} ~cond := #in~cond; {16447#true} is VALID [2022-04-08 05:51:31,510 INFO L290 TraceCheckUtils]: 31: Hoare triple {16447#true} assume !(0 == ~cond); {16447#true} is VALID [2022-04-08 05:51:31,510 INFO L290 TraceCheckUtils]: 32: Hoare triple {16447#true} assume true; {16447#true} is VALID [2022-04-08 05:51:31,510 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {16447#true} {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} #74#return; {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:51:31,510 INFO L272 TraceCheckUtils]: 34: Hoare triple {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16447#true} is VALID [2022-04-08 05:51:31,510 INFO L290 TraceCheckUtils]: 35: Hoare triple {16447#true} ~cond := #in~cond; {16447#true} is VALID [2022-04-08 05:51:31,511 INFO L290 TraceCheckUtils]: 36: Hoare triple {16447#true} assume !(0 == ~cond); {16447#true} is VALID [2022-04-08 05:51:31,511 INFO L290 TraceCheckUtils]: 37: Hoare triple {16447#true} assume true; {16447#true} is VALID [2022-04-08 05:51:31,511 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {16447#true} {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} #76#return; {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:51:31,511 INFO L272 TraceCheckUtils]: 39: Hoare triple {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16447#true} is VALID [2022-04-08 05:51:31,511 INFO L290 TraceCheckUtils]: 40: Hoare triple {16447#true} ~cond := #in~cond; {16447#true} is VALID [2022-04-08 05:51:31,511 INFO L290 TraceCheckUtils]: 41: Hoare triple {16447#true} assume !(0 == ~cond); {16447#true} is VALID [2022-04-08 05:51:31,511 INFO L290 TraceCheckUtils]: 42: Hoare triple {16447#true} assume true; {16447#true} is VALID [2022-04-08 05:51:31,512 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {16447#true} {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} #78#return; {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:51:31,512 INFO L290 TraceCheckUtils]: 44: Hoare triple {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} assume !!(~a~0 != ~b~0); {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:51:31,513 INFO L290 TraceCheckUtils]: 45: Hoare triple {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:51:31,513 INFO L290 TraceCheckUtils]: 46: Hoare triple {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} assume !false; {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:51:31,513 INFO L272 TraceCheckUtils]: 47: Hoare triple {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {16447#true} is VALID [2022-04-08 05:51:31,513 INFO L290 TraceCheckUtils]: 48: Hoare triple {16447#true} ~cond := #in~cond; {16447#true} is VALID [2022-04-08 05:51:31,513 INFO L290 TraceCheckUtils]: 49: Hoare triple {16447#true} assume !(0 == ~cond); {16447#true} is VALID [2022-04-08 05:51:31,513 INFO L290 TraceCheckUtils]: 50: Hoare triple {16447#true} assume true; {16447#true} is VALID [2022-04-08 05:51:31,514 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {16447#true} {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} #74#return; {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:51:31,514 INFO L272 TraceCheckUtils]: 52: Hoare triple {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16447#true} is VALID [2022-04-08 05:51:31,514 INFO L290 TraceCheckUtils]: 53: Hoare triple {16447#true} ~cond := #in~cond; {16447#true} is VALID [2022-04-08 05:51:31,514 INFO L290 TraceCheckUtils]: 54: Hoare triple {16447#true} assume !(0 == ~cond); {16447#true} is VALID [2022-04-08 05:51:31,514 INFO L290 TraceCheckUtils]: 55: Hoare triple {16447#true} assume true; {16447#true} is VALID [2022-04-08 05:51:31,514 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {16447#true} {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} #76#return; {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:51:31,514 INFO L272 TraceCheckUtils]: 57: Hoare triple {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16447#true} is VALID [2022-04-08 05:51:31,514 INFO L290 TraceCheckUtils]: 58: Hoare triple {16447#true} ~cond := #in~cond; {16447#true} is VALID [2022-04-08 05:51:31,515 INFO L290 TraceCheckUtils]: 59: Hoare triple {16447#true} assume !(0 == ~cond); {16447#true} is VALID [2022-04-08 05:51:31,515 INFO L290 TraceCheckUtils]: 60: Hoare triple {16447#true} assume true; {16447#true} is VALID [2022-04-08 05:51:31,515 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {16447#true} {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} #78#return; {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:51:31,515 INFO L290 TraceCheckUtils]: 62: Hoare triple {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} assume !!(~a~0 != ~b~0); {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:51:31,516 INFO L290 TraceCheckUtils]: 63: Hoare triple {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:51:31,516 INFO L290 TraceCheckUtils]: 64: Hoare triple {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} assume !false; {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:51:31,516 INFO L272 TraceCheckUtils]: 65: Hoare triple {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {16447#true} is VALID [2022-04-08 05:51:31,516 INFO L290 TraceCheckUtils]: 66: Hoare triple {16447#true} ~cond := #in~cond; {16447#true} is VALID [2022-04-08 05:51:31,516 INFO L290 TraceCheckUtils]: 67: Hoare triple {16447#true} assume !(0 == ~cond); {16447#true} is VALID [2022-04-08 05:51:31,516 INFO L290 TraceCheckUtils]: 68: Hoare triple {16447#true} assume true; {16447#true} is VALID [2022-04-08 05:51:31,517 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {16447#true} {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} #74#return; {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:51:31,517 INFO L272 TraceCheckUtils]: 70: Hoare triple {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16447#true} is VALID [2022-04-08 05:51:31,517 INFO L290 TraceCheckUtils]: 71: Hoare triple {16447#true} ~cond := #in~cond; {16447#true} is VALID [2022-04-08 05:51:31,517 INFO L290 TraceCheckUtils]: 72: Hoare triple {16447#true} assume !(0 == ~cond); {16447#true} is VALID [2022-04-08 05:51:31,517 INFO L290 TraceCheckUtils]: 73: Hoare triple {16447#true} assume true; {16447#true} is VALID [2022-04-08 05:51:31,518 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16447#true} {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} #76#return; {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:51:31,518 INFO L272 TraceCheckUtils]: 75: Hoare triple {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16447#true} is VALID [2022-04-08 05:51:31,518 INFO L290 TraceCheckUtils]: 76: Hoare triple {16447#true} ~cond := #in~cond; {16681#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:51:31,518 INFO L290 TraceCheckUtils]: 77: Hoare triple {16681#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {16685#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:51:31,518 INFO L290 TraceCheckUtils]: 78: Hoare triple {16685#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16685#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:51:31,527 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {16685#(not (= |__VERIFIER_assert_#in~cond| 0))} {16533#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} #78#return; {16692#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:51:31,527 INFO L290 TraceCheckUtils]: 80: Hoare triple {16692#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} assume !!(~a~0 != ~b~0); {16692#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:51:31,529 INFO L290 TraceCheckUtils]: 81: Hoare triple {16692#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~p~0) (= main_~a~0 main_~x~0))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {16699#(and (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) main_~x~0) (= main_~r~0 (* (- 1) main_~s~0)) (<= 1 (+ main_~q~0 main_~p~0)))} is VALID [2022-04-08 05:51:31,529 INFO L290 TraceCheckUtils]: 82: Hoare triple {16699#(and (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) main_~x~0) (= main_~r~0 (* (- 1) main_~s~0)) (<= 1 (+ main_~q~0 main_~p~0)))} assume !false; {16699#(and (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) main_~x~0) (= main_~r~0 (* (- 1) main_~s~0)) (<= 1 (+ main_~q~0 main_~p~0)))} is VALID [2022-04-08 05:51:31,529 INFO L272 TraceCheckUtils]: 83: Hoare triple {16699#(and (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) main_~x~0) (= main_~r~0 (* (- 1) main_~s~0)) (<= 1 (+ main_~q~0 main_~p~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {16447#true} is VALID [2022-04-08 05:51:31,529 INFO L290 TraceCheckUtils]: 84: Hoare triple {16447#true} ~cond := #in~cond; {16681#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:51:31,530 INFO L290 TraceCheckUtils]: 85: Hoare triple {16681#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {16685#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:51:31,530 INFO L290 TraceCheckUtils]: 86: Hoare triple {16685#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16685#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:51:33,534 WARN L284 TraceCheckUtils]: 87: Hoare quadruple {16685#(not (= |__VERIFIER_assert_#in~cond| 0))} {16699#(and (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) main_~x~0) (= main_~r~0 (* (- 1) main_~s~0)) (<= 1 (+ main_~q~0 main_~p~0)))} #74#return; {16718#(or (and (<= 1 (+ (div (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0) main_~x~0) main_~x~0) main_~p~0)) (= (mod (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0) main_~x~0) main_~x~0) 0) (= (* main_~p~0 (* (- 1) main_~r~0)) (+ (* (div (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0) main_~x~0) main_~x~0) main_~r~0) 1)) (not (= main_~x~0 0))) (and (= main_~x~0 0) (not (= main_~r~0 0)) (= (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0) main_~x~0) 0) (<= 1 (+ main_~p~0 (div (+ (- 1) (* (- 1) main_~p~0 main_~r~0)) main_~r~0))) (= (mod (+ (- 1) (* (- 1) main_~p~0 main_~r~0)) main_~r~0) 0)))} is UNKNOWN [2022-04-08 05:51:33,541 INFO L272 TraceCheckUtils]: 88: Hoare triple {16718#(or (and (<= 1 (+ (div (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0) main_~x~0) main_~x~0) main_~p~0)) (= (mod (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0) main_~x~0) main_~x~0) 0) (= (* main_~p~0 (* (- 1) main_~r~0)) (+ (* (div (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0) main_~x~0) main_~x~0) main_~r~0) 1)) (not (= main_~x~0 0))) (and (= main_~x~0 0) (not (= main_~r~0 0)) (= (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0) main_~x~0) 0) (<= 1 (+ main_~p~0 (div (+ (- 1) (* (- 1) main_~p~0 main_~r~0)) main_~r~0))) (= (mod (+ (- 1) (* (- 1) main_~p~0 main_~r~0)) main_~r~0) 0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16722#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:51:33,541 INFO L290 TraceCheckUtils]: 89: Hoare triple {16722#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16726#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:51:33,542 INFO L290 TraceCheckUtils]: 90: Hoare triple {16726#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16448#false} is VALID [2022-04-08 05:51:33,542 INFO L290 TraceCheckUtils]: 91: Hoare triple {16448#false} assume !false; {16448#false} is VALID [2022-04-08 05:51:33,542 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 70 proven. 11 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2022-04-08 05:51:33,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:53:02,433 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 05:55:00,938 WARN L855 $PredicateComparison]: unable to prove that (forall ((v_main_~r~0_BEFORE_CALL_133 Int) (v_main_~q~0_BEFORE_CALL_132 Int) (v_main_~p~0_BEFORE_CALL_136 Int) (v_main_~s~0_BEFORE_CALL_132 Int)) (or (not (= (+ (* (+ (* (- 1) v_main_~s~0_BEFORE_CALL_132) v_main_~r~0_BEFORE_CALL_133) v_main_~q~0_BEFORE_CALL_132) 1) (* (+ v_main_~p~0_BEFORE_CALL_136 (* (- 1) v_main_~q~0_BEFORE_CALL_132)) v_main_~s~0_BEFORE_CALL_132))) (and (not (= |c___VERIFIER_assert_#in~cond| 0)) (let ((.cse0 (+ (* v_main_~r~0_BEFORE_CALL_133 v_main_~q~0_BEFORE_CALL_132) 1))) (or (= .cse0 0) (not (= |c___VERIFIER_assert_#in~cond| 1)) (= (mod .cse0 v_main_~p~0_BEFORE_CALL_136) 0)))))) is different from true [2022-04-08 05:56:47,682 WARN L855 $PredicateComparison]: unable to prove that (or (forall ((v_main_~r~0_BEFORE_CALL_133 Int) (v_main_~q~0_BEFORE_CALL_132 Int) (v_main_~p~0_BEFORE_CALL_136 Int) (v_main_~s~0_BEFORE_CALL_132 Int)) (or (not (= (+ (* (+ (* (- 1) v_main_~s~0_BEFORE_CALL_132) v_main_~r~0_BEFORE_CALL_133) v_main_~q~0_BEFORE_CALL_132) 1) (* (+ v_main_~p~0_BEFORE_CALL_136 (* (- 1) v_main_~q~0_BEFORE_CALL_132)) v_main_~s~0_BEFORE_CALL_132))) (and (not (= |c___VERIFIER_assert_#in~cond| 0)) (let ((.cse0 (+ (* v_main_~r~0_BEFORE_CALL_133 v_main_~q~0_BEFORE_CALL_132) 1))) (or (= .cse0 0) (not (= |c___VERIFIER_assert_#in~cond| 1)) (= (mod .cse0 v_main_~p~0_BEFORE_CALL_136) 0)))))) (= c___VERIFIER_assert_~cond 0)) is different from true