/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 12:30:31,488 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 12:30:31,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 12:30:31,533 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 12:30:31,534 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 12:30:31,536 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 12:30:31,540 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 12:30:31,547 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 12:30:31,549 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 12:30:31,553 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 12:30:31,553 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 12:30:31,555 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 12:30:31,555 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 12:30:31,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 12:30:31,557 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 12:30:31,558 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 12:30:31,559 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 12:30:31,560 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 12:30:31,563 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 12:30:31,568 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 12:30:31,569 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 12:30:31,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 12:30:31,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 12:30:31,572 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 12:30:31,574 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 12:30:31,580 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 12:30:31,580 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 12:30:31,580 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 12:30:31,581 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 12:30:31,581 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 12:30:31,582 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 12:30:31,582 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 12:30:31,584 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 12:30:31,584 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 12:30:31,585 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 12:30:31,586 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 12:30:31,586 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 12:30:31,586 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 12:30:31,587 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 12:30:31,587 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 12:30:31,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 12:30:31,589 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 12:30:31,589 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 12:30:31,602 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 12:30:31,603 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 12:30:31,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 12:30:31,604 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 12:30:31,604 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 12:30:31,604 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 12:30:31,604 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 12:30:31,605 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 12:30:31,605 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 12:30:31,605 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 12:30:31,606 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 12:30:31,606 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 12:30:31,606 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 12:30:31,606 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 12:30:31,606 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 12:30:31,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 12:30:31,606 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 12:30:31,606 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 12:30:31,607 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 12:30:31,607 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 12:30:31,607 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 12:30:31,607 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 12:30:31,607 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-28 12:30:31,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 12:30:31,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 12:30:31,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 12:30:31,868 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 12:30:31,869 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 12:30:31,870 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound100.c [2022-04-28 12:30:31,923 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16f25451a/80e567b2d3b4416e86fe7f2fd14ddc89/FLAG18e7405cb [2022-04-28 12:30:32,344 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 12:30:32,344 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound100.c [2022-04-28 12:30:32,351 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16f25451a/80e567b2d3b4416e86fe7f2fd14ddc89/FLAG18e7405cb [2022-04-28 12:30:32,739 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16f25451a/80e567b2d3b4416e86fe7f2fd14ddc89 [2022-04-28 12:30:32,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 12:30:32,743 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 12:30:32,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 12:30:32,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 12:30:32,749 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 12:30:32,750 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:30:32" (1/1) ... [2022-04-28 12:30:32,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@111efe6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:30:32, skipping insertion in model container [2022-04-28 12:30:32,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:30:32" (1/1) ... [2022-04-28 12:30:32,756 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 12:30:32,768 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 12:30:32,893 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound100.c[490,503] [2022-04-28 12:30:32,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 12:30:32,940 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 12:30:32,949 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound100.c[490,503] [2022-04-28 12:30:32,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 12:30:32,970 INFO L208 MainTranslator]: Completed translation [2022-04-28 12:30:32,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:30:32 WrapperNode [2022-04-28 12:30:32,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 12:30:32,972 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 12:30:32,972 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 12:30:32,972 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 12:30:32,980 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:30:32" (1/1) ... [2022-04-28 12:30:32,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:30:32" (1/1) ... [2022-04-28 12:30:32,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:30:32" (1/1) ... [2022-04-28 12:30:32,986 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:30:32" (1/1) ... [2022-04-28 12:30:32,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:30:32" (1/1) ... [2022-04-28 12:30:32,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:30:32" (1/1) ... [2022-04-28 12:30:32,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:30:32" (1/1) ... [2022-04-28 12:30:33,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 12:30:33,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 12:30:33,002 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 12:30:33,002 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 12:30:33,003 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:30:32" (1/1) ... [2022-04-28 12:30:33,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 12:30:33,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:30:33,030 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-28 12:30:33,042 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-28 12:30:33,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 12:30:33,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 12:30:33,073 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 12:30:33,073 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 12:30:33,073 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 12:30:33,073 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 12:30:33,073 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 12:30:33,073 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 12:30:33,073 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 12:30:33,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 12:30:33,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 12:30:33,074 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 12:30:33,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 12:30:33,074 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 12:30:33,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 12:30:33,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 12:30:33,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 12:30:33,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 12:30:33,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 12:30:33,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 12:30:33,125 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 12:30:33,127 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 12:30:33,396 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 12:30:33,402 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 12:30:33,402 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-28 12:30:33,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:30:33 BoogieIcfgContainer [2022-04-28 12:30:33,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 12:30:33,405 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 12:30:33,405 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 12:30:33,408 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 12:30:33,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 12:30:32" (1/3) ... [2022-04-28 12:30:33,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4320db5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:30:33, skipping insertion in model container [2022-04-28 12:30:33,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:30:32" (2/3) ... [2022-04-28 12:30:33,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4320db5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:30:33, skipping insertion in model container [2022-04-28 12:30:33,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:30:33" (3/3) ... [2022-04-28 12:30:33,410 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_valuebound100.c [2022-04-28 12:30:33,422 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 12:30:33,422 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 12:30:33,483 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 12:30:33,497 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@db676c6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@16b4ab7e [2022-04-28 12:30:33,497 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 12:30:33,507 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:30:33,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 12:30:33,514 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:30:33,514 INFO L195 NwaCegarLoop]: 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-28 12:30:33,515 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:30:33,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:30:33,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1237885594, now seen corresponding path program 1 times [2022-04-28 12:30:33,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:30:33,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1754385309] [2022-04-28 12:30:33,541 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:30:33,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1237885594, now seen corresponding path program 2 times [2022-04-28 12:30:33,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:30:33,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762422735] [2022-04-28 12:30:33,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:30:33,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:30:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:30:33,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 12:30:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:30:33,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {64#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {43#true} is VALID [2022-04-28 12:30:33,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-28 12:30:33,764 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #112#return; {43#true} is VALID [2022-04-28 12:30:33,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 12:30:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:30:33,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:30:33,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:30:33,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:30:33,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} #94#return; {44#false} is VALID [2022-04-28 12:30:33,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 12:30:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:30:33,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:30:33,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:30:33,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:30:33,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #96#return; {44#false} is VALID [2022-04-28 12:30:33,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-28 12:30:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:30:33,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:30:33,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:30:33,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:30:33,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #98#return; {44#false} is VALID [2022-04-28 12:30:33,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-28 12:30:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:30:33,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:30:33,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:30:33,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:30:33,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #100#return; {44#false} is VALID [2022-04-28 12:30:33,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {64#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 12:30:33,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {64#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {43#true} is VALID [2022-04-28 12:30:33,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-28 12:30:33,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #112#return; {43#true} is VALID [2022-04-28 12:30:33,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret6 := main(); {43#true} is VALID [2022-04-28 12:30:33,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {43#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {43#true} is VALID [2022-04-28 12:30:33,818 INFO L272 TraceCheckUtils]: 6: Hoare triple {43#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {43#true} is VALID [2022-04-28 12:30:33,818 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:30:33,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:30:33,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:30:33,820 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} #94#return; {44#false} is VALID [2022-04-28 12:30:33,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {44#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {44#false} is VALID [2022-04-28 12:30:33,820 INFO L272 TraceCheckUtils]: 12: Hoare triple {44#false} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {43#true} is VALID [2022-04-28 12:30:33,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:30:33,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:30:33,821 INFO L290 TraceCheckUtils]: 15: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:30:33,821 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {44#false} {44#false} #96#return; {44#false} is VALID [2022-04-28 12:30:33,822 INFO L272 TraceCheckUtils]: 17: Hoare triple {44#false} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-28 12:30:33,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:30:33,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:30:33,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:30:33,823 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {44#false} {44#false} #98#return; {44#false} is VALID [2022-04-28 12:30:33,824 INFO L272 TraceCheckUtils]: 22: Hoare triple {44#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-28 12:30:33,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:30:33,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:30:33,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:30:33,826 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {44#false} {44#false} #100#return; {44#false} is VALID [2022-04-28 12:30:33,826 INFO L290 TraceCheckUtils]: 27: Hoare triple {44#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {44#false} is VALID [2022-04-28 12:30:33,828 INFO L290 TraceCheckUtils]: 28: Hoare triple {44#false} assume false; {44#false} is VALID [2022-04-28 12:30:33,830 INFO L272 TraceCheckUtils]: 29: Hoare triple {44#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {44#false} is VALID [2022-04-28 12:30:33,831 INFO L290 TraceCheckUtils]: 30: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2022-04-28 12:30:33,831 INFO L290 TraceCheckUtils]: 31: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2022-04-28 12:30:33,831 INFO L290 TraceCheckUtils]: 32: Hoare triple {44#false} assume !false; {44#false} is VALID [2022-04-28 12:30:33,832 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-28 12:30:33,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:30:33,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762422735] [2022-04-28 12:30:33,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762422735] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:30:33,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:30:33,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 12:30:33,837 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:30:33,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1754385309] [2022-04-28 12:30:33,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1754385309] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:30:33,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:30:33,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 12:30:33,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440288392] [2022-04-28 12:30:33,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:30:33,844 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-28 12:30:33,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:30:33,849 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-28 12:30:33,890 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-28 12:30:33,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 12:30:33,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:30:33,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 12:30:33,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 12:30:33,920 INFO L87 Difference]: Start difference. First operand has 40 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:30:34,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:34,141 INFO L93 Difference]: Finished difference Result 73 states and 115 transitions. [2022-04-28 12:30:34,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 12:30:34,147 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-28 12:30:34,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:30:34,148 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-28 12:30:34,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2022-04-28 12:30:34,169 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-28 12:30:34,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2022-04-28 12:30:34,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 115 transitions. [2022-04-28 12:30:34,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:30:34,323 INFO L225 Difference]: With dead ends: 73 [2022-04-28 12:30:34,323 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 12:30:34,326 INFO L412 NwaCegarLoop]: 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-28 12:30:34,329 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 24 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:30:34,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 43 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:30:34,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 12:30:34,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 12:30:34,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:30:34,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 12:30:34,367 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 12:30:34,369 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 12:30:34,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:34,375 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 12:30:34,375 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 12:30:34,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:30:34,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:30:34,378 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 35 states. [2022-04-28 12:30:34,379 INFO L87 Difference]: Start difference. First operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 35 states. [2022-04-28 12:30:34,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:34,383 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 12:30:34,383 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 12:30:34,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:30:34,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:30:34,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:30:34,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:30:34,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 12:30:34,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-28 12:30:34,388 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 33 [2022-04-28 12:30:34,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:30:34,388 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-28 12:30:34,389 INFO L496 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-28 12:30:34,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 44 transitions. [2022-04-28 12:30:34,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:30:34,487 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 12:30:34,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 12:30:34,489 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:30:34,489 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:30:34,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 12:30:34,490 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:30:34,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:30:34,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1569470122, now seen corresponding path program 1 times [2022-04-28 12:30:34,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:30:34,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1995287069] [2022-04-28 12:30:34,492 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:30:34,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1569470122, now seen corresponding path program 2 times [2022-04-28 12:30:34,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:30:34,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52739879] [2022-04-28 12:30:34,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:30:34,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:30:34,544 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:30:34,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1674903369] [2022-04-28 12:30:34,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:30:34,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:30:34,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:30:34,547 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-28 12:30:34,548 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-28 12:30:34,595 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 12:30:34,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:30:34,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 12:30:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:30:34,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:30:34,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {353#true} call ULTIMATE.init(); {353#true} is VALID [2022-04-28 12:30:34,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {353#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {353#true} is VALID [2022-04-28 12:30:34,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {353#true} assume true; {353#true} is VALID [2022-04-28 12:30:34,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {353#true} {353#true} #112#return; {353#true} is VALID [2022-04-28 12:30:34,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {353#true} call #t~ret6 := main(); {353#true} is VALID [2022-04-28 12:30:34,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {353#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {353#true} is VALID [2022-04-28 12:30:34,893 INFO L272 TraceCheckUtils]: 6: Hoare triple {353#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {353#true} is VALID [2022-04-28 12:30:34,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {353#true} ~cond := #in~cond; {353#true} is VALID [2022-04-28 12:30:34,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {353#true} assume !(0 == ~cond); {353#true} is VALID [2022-04-28 12:30:34,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {353#true} assume true; {353#true} is VALID [2022-04-28 12:30:34,894 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {353#true} {353#true} #94#return; {353#true} is VALID [2022-04-28 12:30:34,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {353#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {353#true} is VALID [2022-04-28 12:30:34,894 INFO L272 TraceCheckUtils]: 12: Hoare triple {353#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {353#true} is VALID [2022-04-28 12:30:34,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {353#true} ~cond := #in~cond; {353#true} is VALID [2022-04-28 12:30:34,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {353#true} assume !(0 == ~cond); {353#true} is VALID [2022-04-28 12:30:34,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {353#true} assume true; {353#true} is VALID [2022-04-28 12:30:34,895 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {353#true} {353#true} #96#return; {353#true} is VALID [2022-04-28 12:30:34,895 INFO L272 TraceCheckUtils]: 17: Hoare triple {353#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {353#true} is VALID [2022-04-28 12:30:34,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {353#true} ~cond := #in~cond; {353#true} is VALID [2022-04-28 12:30:34,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {353#true} assume !(0 == ~cond); {353#true} is VALID [2022-04-28 12:30:34,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {353#true} assume true; {353#true} is VALID [2022-04-28 12:30:34,896 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {353#true} {353#true} #98#return; {353#true} is VALID [2022-04-28 12:30:34,896 INFO L272 TraceCheckUtils]: 22: Hoare triple {353#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {353#true} is VALID [2022-04-28 12:30:34,896 INFO L290 TraceCheckUtils]: 23: Hoare triple {353#true} ~cond := #in~cond; {353#true} is VALID [2022-04-28 12:30:34,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {353#true} assume !(0 == ~cond); {353#true} is VALID [2022-04-28 12:30:34,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {353#true} assume true; {353#true} is VALID [2022-04-28 12:30:34,896 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {353#true} {353#true} #100#return; {353#true} is VALID [2022-04-28 12:30:34,897 INFO L290 TraceCheckUtils]: 27: Hoare triple {353#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {439#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:34,898 INFO L290 TraceCheckUtils]: 28: Hoare triple {439#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {439#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:34,899 INFO L290 TraceCheckUtils]: 29: Hoare triple {439#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 != ~b~0); {446#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:34,900 INFO L272 TraceCheckUtils]: 30: Hoare triple {446#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {450#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:30:34,900 INFO L290 TraceCheckUtils]: 31: Hoare triple {450#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {454#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:30:34,901 INFO L290 TraceCheckUtils]: 32: Hoare triple {454#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {354#false} is VALID [2022-04-28 12:30:34,901 INFO L290 TraceCheckUtils]: 33: Hoare triple {354#false} assume !false; {354#false} is VALID [2022-04-28 12:30:34,901 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-28 12:30:34,902 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:30:34,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:30:34,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52739879] [2022-04-28 12:30:34,902 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:30:34,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674903369] [2022-04-28 12:30:34,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674903369] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:30:34,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:30:34,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:30:34,903 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:30:34,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1995287069] [2022-04-28 12:30:34,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1995287069] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:30:34,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:30:34,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:30:34,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470447835] [2022-04-28 12:30:34,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:30:34,905 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2022-04-28 12:30:34,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:30:34,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 12:30:34,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:30:34,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 12:30:34,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:30:34,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 12:30:34,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 12:30:34,929 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 12:30:35,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:35,283 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2022-04-28 12:30:35,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 12:30:35,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2022-04-28 12:30:35,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:30:35,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 12:30:35,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-28 12:30:35,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 12:30:35,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-28 12:30:35,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2022-04-28 12:30:35,353 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-28 12:30:35,356 INFO L225 Difference]: With dead ends: 54 [2022-04-28 12:30:35,357 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 12:30:35,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 12:30:35,359 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 14 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:30:35,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 158 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:30:35,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 12:30:35,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-28 12:30:35,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:30:35,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 12:30:35,380 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 12:30:35,380 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 12:30:35,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:35,383 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2022-04-28 12:30:35,383 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2022-04-28 12:30:35,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:30:35,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:30:35,385 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 51 states. [2022-04-28 12:30:35,385 INFO L87 Difference]: Start difference. First operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 51 states. [2022-04-28 12:30:35,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:35,388 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2022-04-28 12:30:35,388 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2022-04-28 12:30:35,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:30:35,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:30:35,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:30:35,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:30:35,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 12:30:35,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-28 12:30:35,392 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 34 [2022-04-28 12:30:35,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:30:35,393 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-04-28 12:30:35,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 12:30:35,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 64 transitions. [2022-04-28 12:30:35,459 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-28 12:30:35,460 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-28 12:30:35,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 12:30:35,460 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:30:35,461 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:30:35,484 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-28 12:30:35,684 WARN L477 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-28 12:30:35,684 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:30:35,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:30:35,685 INFO L85 PathProgramCache]: Analyzing trace with hash 584996456, now seen corresponding path program 1 times [2022-04-28 12:30:35,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:30:35,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [943867856] [2022-04-28 12:30:35,685 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:30:35,685 INFO L85 PathProgramCache]: Analyzing trace with hash 584996456, now seen corresponding path program 2 times [2022-04-28 12:30:35,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:30:35,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317948311] [2022-04-28 12:30:35,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:30:35,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:30:35,708 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:30:35,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [655220978] [2022-04-28 12:30:35,708 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:30:35,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:30:35,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:30:35,710 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-28 12:30:35,720 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-28 12:30:35,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:30:35,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:30:35,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 12:30:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:30:35,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:30:35,979 INFO L272 TraceCheckUtils]: 0: Hoare triple {774#true} call ULTIMATE.init(); {774#true} is VALID [2022-04-28 12:30:35,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {774#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {774#true} is VALID [2022-04-28 12:30:35,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-28 12:30:35,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {774#true} {774#true} #112#return; {774#true} is VALID [2022-04-28 12:30:35,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {774#true} call #t~ret6 := main(); {774#true} is VALID [2022-04-28 12:30:35,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {774#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {774#true} is VALID [2022-04-28 12:30:35,980 INFO L272 TraceCheckUtils]: 6: Hoare triple {774#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {774#true} is VALID [2022-04-28 12:30:35,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-28 12:30:35,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-28 12:30:35,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-28 12:30:35,981 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {774#true} {774#true} #94#return; {774#true} is VALID [2022-04-28 12:30:35,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {774#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {774#true} is VALID [2022-04-28 12:30:35,981 INFO L272 TraceCheckUtils]: 12: Hoare triple {774#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {774#true} is VALID [2022-04-28 12:30:35,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-28 12:30:35,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-28 12:30:35,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-28 12:30:35,982 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {774#true} {774#true} #96#return; {774#true} is VALID [2022-04-28 12:30:35,982 INFO L272 TraceCheckUtils]: 17: Hoare triple {774#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {774#true} is VALID [2022-04-28 12:30:35,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {774#true} ~cond := #in~cond; {833#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:30:35,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {833#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {837#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:30:35,986 INFO L290 TraceCheckUtils]: 20: Hoare triple {837#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {837#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:30:35,989 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {837#(not (= |assume_abort_if_not_#in~cond| 0))} {774#true} #98#return; {844#(<= 1 main_~x~0)} is VALID [2022-04-28 12:30:35,990 INFO L272 TraceCheckUtils]: 22: Hoare triple {844#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {774#true} is VALID [2022-04-28 12:30:35,990 INFO L290 TraceCheckUtils]: 23: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-28 12:30:35,990 INFO L290 TraceCheckUtils]: 24: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-28 12:30:35,990 INFO L290 TraceCheckUtils]: 25: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-28 12:30:35,991 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {774#true} {844#(<= 1 main_~x~0)} #100#return; {844#(<= 1 main_~x~0)} is VALID [2022-04-28 12:30:35,992 INFO L290 TraceCheckUtils]: 27: Hoare triple {844#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {863#(<= 1 main_~a~0)} is VALID [2022-04-28 12:30:35,992 INFO L290 TraceCheckUtils]: 28: Hoare triple {863#(<= 1 main_~a~0)} assume !false; {863#(<= 1 main_~a~0)} is VALID [2022-04-28 12:30:35,993 INFO L290 TraceCheckUtils]: 29: Hoare triple {863#(<= 1 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {870#(<= 1 main_~c~0)} is VALID [2022-04-28 12:30:35,993 INFO L290 TraceCheckUtils]: 30: Hoare triple {870#(<= 1 main_~c~0)} assume !false; {870#(<= 1 main_~c~0)} is VALID [2022-04-28 12:30:35,994 INFO L290 TraceCheckUtils]: 31: Hoare triple {870#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {870#(<= 1 main_~c~0)} is VALID [2022-04-28 12:30:35,995 INFO L290 TraceCheckUtils]: 32: Hoare triple {870#(<= 1 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {880#(<= 1 main_~b~0)} is VALID [2022-04-28 12:30:35,996 INFO L290 TraceCheckUtils]: 33: Hoare triple {880#(<= 1 main_~b~0)} assume !false; {880#(<= 1 main_~b~0)} is VALID [2022-04-28 12:30:35,996 INFO L290 TraceCheckUtils]: 34: Hoare triple {880#(<= 1 main_~b~0)} assume !(0 != ~b~0); {775#false} is VALID [2022-04-28 12:30:35,996 INFO L272 TraceCheckUtils]: 35: Hoare triple {775#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {775#false} is VALID [2022-04-28 12:30:35,997 INFO L290 TraceCheckUtils]: 36: Hoare triple {775#false} ~cond := #in~cond; {775#false} is VALID [2022-04-28 12:30:35,997 INFO L290 TraceCheckUtils]: 37: Hoare triple {775#false} assume 0 == ~cond; {775#false} is VALID [2022-04-28 12:30:35,997 INFO L290 TraceCheckUtils]: 38: Hoare triple {775#false} assume !false; {775#false} is VALID [2022-04-28 12:30:35,997 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 12:30:35,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:30:36,317 INFO L290 TraceCheckUtils]: 38: Hoare triple {775#false} assume !false; {775#false} is VALID [2022-04-28 12:30:36,317 INFO L290 TraceCheckUtils]: 37: Hoare triple {775#false} assume 0 == ~cond; {775#false} is VALID [2022-04-28 12:30:36,317 INFO L290 TraceCheckUtils]: 36: Hoare triple {775#false} ~cond := #in~cond; {775#false} is VALID [2022-04-28 12:30:36,318 INFO L272 TraceCheckUtils]: 35: Hoare triple {775#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {775#false} is VALID [2022-04-28 12:30:36,318 INFO L290 TraceCheckUtils]: 34: Hoare triple {880#(<= 1 main_~b~0)} assume !(0 != ~b~0); {775#false} is VALID [2022-04-28 12:30:36,319 INFO L290 TraceCheckUtils]: 33: Hoare triple {880#(<= 1 main_~b~0)} assume !false; {880#(<= 1 main_~b~0)} is VALID [2022-04-28 12:30:36,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {870#(<= 1 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {880#(<= 1 main_~b~0)} is VALID [2022-04-28 12:30:36,320 INFO L290 TraceCheckUtils]: 31: Hoare triple {870#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {870#(<= 1 main_~c~0)} is VALID [2022-04-28 12:30:36,320 INFO L290 TraceCheckUtils]: 30: Hoare triple {870#(<= 1 main_~c~0)} assume !false; {870#(<= 1 main_~c~0)} is VALID [2022-04-28 12:30:36,321 INFO L290 TraceCheckUtils]: 29: Hoare triple {863#(<= 1 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {870#(<= 1 main_~c~0)} is VALID [2022-04-28 12:30:36,321 INFO L290 TraceCheckUtils]: 28: Hoare triple {863#(<= 1 main_~a~0)} assume !false; {863#(<= 1 main_~a~0)} is VALID [2022-04-28 12:30:36,324 INFO L290 TraceCheckUtils]: 27: Hoare triple {844#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {863#(<= 1 main_~a~0)} is VALID [2022-04-28 12:30:36,325 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {774#true} {844#(<= 1 main_~x~0)} #100#return; {844#(<= 1 main_~x~0)} is VALID [2022-04-28 12:30:36,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-28 12:30:36,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-28 12:30:36,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-28 12:30:36,326 INFO L272 TraceCheckUtils]: 22: Hoare triple {844#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {774#true} is VALID [2022-04-28 12:30:36,327 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {837#(not (= |assume_abort_if_not_#in~cond| 0))} {774#true} #98#return; {844#(<= 1 main_~x~0)} is VALID [2022-04-28 12:30:36,327 INFO L290 TraceCheckUtils]: 20: Hoare triple {837#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {837#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:30:36,328 INFO L290 TraceCheckUtils]: 19: Hoare triple {959#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {837#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:30:36,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {774#true} ~cond := #in~cond; {959#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 12:30:36,329 INFO L272 TraceCheckUtils]: 17: Hoare triple {774#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {774#true} is VALID [2022-04-28 12:30:36,329 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {774#true} {774#true} #96#return; {774#true} is VALID [2022-04-28 12:30:36,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-28 12:30:36,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-28 12:30:36,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-28 12:30:36,329 INFO L272 TraceCheckUtils]: 12: Hoare triple {774#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {774#true} is VALID [2022-04-28 12:30:36,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {774#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {774#true} is VALID [2022-04-28 12:30:36,330 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {774#true} {774#true} #94#return; {774#true} is VALID [2022-04-28 12:30:36,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-28 12:30:36,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-28 12:30:36,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-28 12:30:36,330 INFO L272 TraceCheckUtils]: 6: Hoare triple {774#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {774#true} is VALID [2022-04-28 12:30:36,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {774#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {774#true} is VALID [2022-04-28 12:30:36,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {774#true} call #t~ret6 := main(); {774#true} is VALID [2022-04-28 12:30:36,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {774#true} {774#true} #112#return; {774#true} is VALID [2022-04-28 12:30:36,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-28 12:30:36,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {774#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {774#true} is VALID [2022-04-28 12:30:36,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {774#true} call ULTIMATE.init(); {774#true} is VALID [2022-04-28 12:30:36,333 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 12:30:36,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:30:36,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317948311] [2022-04-28 12:30:36,333 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:30:36,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655220978] [2022-04-28 12:30:36,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655220978] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:30:36,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:30:36,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-28 12:30:36,334 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:30:36,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [943867856] [2022-04-28 12:30:36,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [943867856] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:30:36,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:30:36,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:30:36,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992358418] [2022-04-28 12:30:36,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:30:36,336 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-28 12:30:36,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:30:36,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:30:36,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:30:36,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:30:36,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:30:36,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:30:36,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:30:36,365 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:30:37,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:37,116 INFO L93 Difference]: Finished difference Result 103 states and 143 transitions. [2022-04-28 12:30:37,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 12:30:37,116 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-28 12:30:37,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:30:37,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:30:37,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-28 12:30:37,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:30:37,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-28 12:30:37,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 108 transitions. [2022-04-28 12:30:37,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:30:37,226 INFO L225 Difference]: With dead ends: 103 [2022-04-28 12:30:37,226 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 12:30:37,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:30:37,234 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 68 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:30:37,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 232 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 12:30:37,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 12:30:37,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2022-04-28 12:30:37,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:30:37,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 12:30:37,329 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 12:30:37,329 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 12:30:37,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:37,336 INFO L93 Difference]: Finished difference Result 96 states and 136 transitions. [2022-04-28 12:30:37,336 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 136 transitions. [2022-04-28 12:30:37,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:30:37,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:30:37,339 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 96 states. [2022-04-28 12:30:37,339 INFO L87 Difference]: Start difference. First operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 96 states. [2022-04-28 12:30:37,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:37,344 INFO L93 Difference]: Finished difference Result 96 states and 136 transitions. [2022-04-28 12:30:37,345 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 136 transitions. [2022-04-28 12:30:37,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:30:37,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:30:37,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:30:37,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:30:37,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 12:30:37,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 95 transitions. [2022-04-28 12:30:37,350 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 95 transitions. Word has length 39 [2022-04-28 12:30:37,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:30:37,350 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 95 transitions. [2022-04-28 12:30:37,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:30:37,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 95 transitions. [2022-04-28 12:30:37,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:30:37,463 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 95 transitions. [2022-04-28 12:30:37,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 12:30:37,465 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:30:37,465 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:30:37,490 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-28 12:30:37,674 WARN L477 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-28 12:30:37,675 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:30:37,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:30:37,675 INFO L85 PathProgramCache]: Analyzing trace with hash -974923140, now seen corresponding path program 1 times [2022-04-28 12:30:37,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:30:37,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [992306482] [2022-04-28 12:30:37,676 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:30:37,676 INFO L85 PathProgramCache]: Analyzing trace with hash -974923140, now seen corresponding path program 2 times [2022-04-28 12:30:37,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:30:37,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514320771] [2022-04-28 12:30:37,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:30:37,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:30:37,697 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:30:37,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [322244757] [2022-04-28 12:30:37,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:30:37,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:30:37,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:30:37,698 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-28 12:30:37,705 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-28 12:30:37,755 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:30:37,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:30:37,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-28 12:30:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:30:37,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:30:38,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1566#true} is VALID [2022-04-28 12:30:38,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {1566#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1566#true} is VALID [2022-04-28 12:30:38,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-28 12:30:38,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #112#return; {1566#true} is VALID [2022-04-28 12:30:38,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret6 := main(); {1566#true} is VALID [2022-04-28 12:30:38,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {1566#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1566#true} is VALID [2022-04-28 12:30:38,464 INFO L272 TraceCheckUtils]: 6: Hoare triple {1566#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {1566#true} is VALID [2022-04-28 12:30:38,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-28 12:30:38,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-28 12:30:38,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-28 12:30:38,465 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1566#true} {1566#true} #94#return; {1566#true} is VALID [2022-04-28 12:30:38,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {1566#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1566#true} is VALID [2022-04-28 12:30:38,466 INFO L272 TraceCheckUtils]: 12: Hoare triple {1566#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {1566#true} is VALID [2022-04-28 12:30:38,466 INFO L290 TraceCheckUtils]: 13: Hoare triple {1566#true} ~cond := #in~cond; {1610#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:30:38,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {1610#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1614#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:30:38,467 INFO L290 TraceCheckUtils]: 15: Hoare triple {1614#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1614#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:30:38,468 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1614#(not (= |assume_abort_if_not_#in~cond| 0))} {1566#true} #96#return; {1621#(and (<= 0 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 12:30:38,468 INFO L272 TraceCheckUtils]: 17: Hoare triple {1621#(and (<= 0 main_~y~0) (<= main_~y~0 100))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1566#true} is VALID [2022-04-28 12:30:38,469 INFO L290 TraceCheckUtils]: 18: Hoare triple {1566#true} ~cond := #in~cond; {1610#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:30:38,469 INFO L290 TraceCheckUtils]: 19: Hoare triple {1610#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1614#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:30:38,469 INFO L290 TraceCheckUtils]: 20: Hoare triple {1614#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1614#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:30:38,470 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1614#(not (= |assume_abort_if_not_#in~cond| 0))} {1621#(and (<= 0 main_~y~0) (<= main_~y~0 100))} #98#return; {1637#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 100))} is VALID [2022-04-28 12:30:38,470 INFO L272 TraceCheckUtils]: 22: Hoare triple {1637#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 100))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1566#true} is VALID [2022-04-28 12:30:38,473 INFO L290 TraceCheckUtils]: 23: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-28 12:30:38,473 INFO L290 TraceCheckUtils]: 24: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-28 12:30:38,473 INFO L290 TraceCheckUtils]: 25: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-28 12:30:38,474 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1566#true} {1637#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 100))} #100#return; {1637#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 100))} is VALID [2022-04-28 12:30:38,474 INFO L290 TraceCheckUtils]: 27: Hoare triple {1637#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 100))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1656#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~y~0 100) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 12:30:38,475 INFO L290 TraceCheckUtils]: 28: Hoare triple {1656#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~y~0 100) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !false; {1656#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~y~0 100) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 12:30:38,476 INFO L290 TraceCheckUtils]: 29: Hoare triple {1656#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~y~0 100) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1663#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~y~0 100) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 12:30:38,476 INFO L290 TraceCheckUtils]: 30: Hoare triple {1663#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~y~0 100) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !false; {1663#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~y~0 100) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 12:30:38,477 INFO L290 TraceCheckUtils]: 31: Hoare triple {1663#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~y~0 100) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !(~c~0 >= ~b~0); {1663#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~y~0 100) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 12:30:38,477 INFO L290 TraceCheckUtils]: 32: Hoare triple {1663#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~y~0 100) (= main_~q~0 0) (= main_~c~0 main_~x~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {1673#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 100))} is VALID [2022-04-28 12:30:38,478 INFO L290 TraceCheckUtils]: 33: Hoare triple {1673#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 100))} assume !false; {1673#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 100))} is VALID [2022-04-28 12:30:38,481 INFO L290 TraceCheckUtils]: 34: Hoare triple {1673#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 100))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1680#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 100))} is VALID [2022-04-28 12:30:38,483 INFO L290 TraceCheckUtils]: 35: Hoare triple {1680#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 100))} assume !false; {1680#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 100))} is VALID [2022-04-28 12:30:38,484 INFO L290 TraceCheckUtils]: 36: Hoare triple {1680#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 100))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {1687#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (<= main_~y~0 100) (<= main_~x~0 main_~a~0))} is VALID [2022-04-28 12:30:38,485 INFO L290 TraceCheckUtils]: 37: Hoare triple {1687#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (<= main_~y~0 100) (<= main_~x~0 main_~a~0))} assume !false; {1687#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (<= main_~y~0 100) (<= main_~x~0 main_~a~0))} is VALID [2022-04-28 12:30:38,486 INFO L272 TraceCheckUtils]: 38: Hoare triple {1687#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (<= main_~y~0 100) (<= main_~x~0 main_~a~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1694#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:30:38,486 INFO L290 TraceCheckUtils]: 39: Hoare triple {1694#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1698#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:30:38,487 INFO L290 TraceCheckUtils]: 40: Hoare triple {1698#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1567#false} is VALID [2022-04-28 12:30:38,487 INFO L290 TraceCheckUtils]: 41: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2022-04-28 12:30:38,487 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 12:30:38,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:30:38,922 INFO L290 TraceCheckUtils]: 41: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2022-04-28 12:30:38,922 INFO L290 TraceCheckUtils]: 40: Hoare triple {1698#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1567#false} is VALID [2022-04-28 12:30:38,922 INFO L290 TraceCheckUtils]: 39: Hoare triple {1694#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1698#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:30:38,923 INFO L272 TraceCheckUtils]: 38: Hoare triple {1714#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1694#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:30:38,924 INFO L290 TraceCheckUtils]: 37: Hoare triple {1714#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {1714#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:30:38,924 INFO L290 TraceCheckUtils]: 36: Hoare triple {1721#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (<= main_~b~0 main_~c~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {1714#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:30:38,925 INFO L290 TraceCheckUtils]: 35: Hoare triple {1721#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (<= main_~b~0 main_~c~0)))} assume !false; {1721#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-28 12:30:38,925 INFO L290 TraceCheckUtils]: 34: Hoare triple {1728#(or (not (<= main_~b~0 main_~a~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1721#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-28 12:30:38,926 INFO L290 TraceCheckUtils]: 33: Hoare triple {1728#(or (not (<= main_~b~0 main_~a~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !false; {1728#(or (not (<= main_~b~0 main_~a~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:30:38,926 INFO L290 TraceCheckUtils]: 32: Hoare triple {1735#(or (not (<= main_~c~0 main_~b~0)) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {1728#(or (not (<= main_~b~0 main_~a~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:30:38,927 INFO L290 TraceCheckUtils]: 31: Hoare triple {1735#(or (not (<= main_~c~0 main_~b~0)) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {1735#(or (not (<= main_~c~0 main_~b~0)) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:30:38,927 INFO L290 TraceCheckUtils]: 30: Hoare triple {1735#(or (not (<= main_~c~0 main_~b~0)) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {1735#(or (not (<= main_~c~0 main_~b~0)) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:30:38,928 INFO L290 TraceCheckUtils]: 29: Hoare triple {1745#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (<= main_~a~0 main_~b~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1735#(or (not (<= main_~c~0 main_~b~0)) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:30:38,928 INFO L290 TraceCheckUtils]: 28: Hoare triple {1745#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (<= main_~a~0 main_~b~0)))} assume !false; {1745#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (<= main_~a~0 main_~b~0)))} is VALID [2022-04-28 12:30:38,929 INFO L290 TraceCheckUtils]: 27: Hoare triple {1566#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1745#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (<= main_~a~0 main_~b~0)))} is VALID [2022-04-28 12:30:38,929 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1566#true} {1566#true} #100#return; {1566#true} is VALID [2022-04-28 12:30:38,929 INFO L290 TraceCheckUtils]: 25: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-28 12:30:38,929 INFO L290 TraceCheckUtils]: 24: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-28 12:30:38,930 INFO L290 TraceCheckUtils]: 23: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-28 12:30:38,930 INFO L272 TraceCheckUtils]: 22: Hoare triple {1566#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1566#true} is VALID [2022-04-28 12:30:38,930 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1566#true} {1566#true} #98#return; {1566#true} is VALID [2022-04-28 12:30:38,930 INFO L290 TraceCheckUtils]: 20: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-28 12:30:38,930 INFO L290 TraceCheckUtils]: 19: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-28 12:30:38,930 INFO L290 TraceCheckUtils]: 18: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-28 12:30:38,930 INFO L272 TraceCheckUtils]: 17: Hoare triple {1566#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1566#true} is VALID [2022-04-28 12:30:38,931 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1566#true} {1566#true} #96#return; {1566#true} is VALID [2022-04-28 12:30:38,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-28 12:30:38,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-28 12:30:38,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-28 12:30:38,931 INFO L272 TraceCheckUtils]: 12: Hoare triple {1566#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {1566#true} is VALID [2022-04-28 12:30:38,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {1566#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1566#true} is VALID [2022-04-28 12:30:38,932 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1566#true} {1566#true} #94#return; {1566#true} is VALID [2022-04-28 12:30:38,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-28 12:30:38,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-28 12:30:38,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-28 12:30:38,932 INFO L272 TraceCheckUtils]: 6: Hoare triple {1566#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {1566#true} is VALID [2022-04-28 12:30:38,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {1566#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1566#true} is VALID [2022-04-28 12:30:38,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret6 := main(); {1566#true} is VALID [2022-04-28 12:30:38,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #112#return; {1566#true} is VALID [2022-04-28 12:30:38,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-28 12:30:38,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {1566#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1566#true} is VALID [2022-04-28 12:30:38,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1566#true} is VALID [2022-04-28 12:30:38,933 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 12:30:38,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:30:38,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514320771] [2022-04-28 12:30:38,934 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:30:38,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322244757] [2022-04-28 12:30:38,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322244757] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:30:38,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:30:38,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 18 [2022-04-28 12:30:38,935 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:30:38,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [992306482] [2022-04-28 12:30:38,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [992306482] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:30:38,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:30:38,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 12:30:38,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386676518] [2022-04-28 12:30:38,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:30:38,936 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2022-04-28 12:30:38,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:30:38,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 12:30:38,971 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-28 12:30:38,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 12:30:38,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:30:38,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 12:30:38,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-04-28 12:30:38,973 INFO L87 Difference]: Start difference. First operand 71 states and 95 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 12:30:40,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:40,424 INFO L93 Difference]: Finished difference Result 112 states and 151 transitions. [2022-04-28 12:30:40,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 12:30:40,424 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2022-04-28 12:30:40,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:30:40,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 12:30:40,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 117 transitions. [2022-04-28 12:30:40,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 12:30:40,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 117 transitions. [2022-04-28 12:30:40,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 117 transitions. [2022-04-28 12:30:40,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:30:40,562 INFO L225 Difference]: With dead ends: 112 [2022-04-28 12:30:40,562 INFO L226 Difference]: Without dead ends: 110 [2022-04-28 12:30:40,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2022-04-28 12:30:40,563 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 89 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 12:30:40,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 245 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 12:30:40,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-28 12:30:40,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 93. [2022-04-28 12:30:40,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:30:40,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 93 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 12:30:40,750 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 93 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 12:30:40,750 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 93 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 12:30:40,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:40,756 INFO L93 Difference]: Finished difference Result 110 states and 149 transitions. [2022-04-28 12:30:40,756 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 149 transitions. [2022-04-28 12:30:40,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:30:40,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:30:40,757 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 110 states. [2022-04-28 12:30:40,758 INFO L87 Difference]: Start difference. First operand has 93 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 110 states. [2022-04-28 12:30:40,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:40,763 INFO L93 Difference]: Finished difference Result 110 states and 149 transitions. [2022-04-28 12:30:40,763 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 149 transitions. [2022-04-28 12:30:40,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:30:40,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:30:40,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:30:40,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:30:40,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 12:30:40,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 122 transitions. [2022-04-28 12:30:40,768 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 122 transitions. Word has length 42 [2022-04-28 12:30:40,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:30:40,769 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 122 transitions. [2022-04-28 12:30:40,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 12:30:40,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 122 transitions. [2022-04-28 12:30:40,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:30:40,929 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 122 transitions. [2022-04-28 12:30:40,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 12:30:40,930 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:30:40,930 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:30:40,953 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-28 12:30:41,131 WARN L477 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-28 12:30:41,131 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:30:41,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:30:41,132 INFO L85 PathProgramCache]: Analyzing trace with hash 81990170, now seen corresponding path program 1 times [2022-04-28 12:30:41,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:30:41,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [314172547] [2022-04-28 12:30:41,132 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:30:41,132 INFO L85 PathProgramCache]: Analyzing trace with hash 81990170, now seen corresponding path program 2 times [2022-04-28 12:30:41,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:30:41,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209216008] [2022-04-28 12:30:41,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:30:41,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:30:41,150 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:30:41,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [301574008] [2022-04-28 12:30:41,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:30:41,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:30:41,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:30:41,151 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-28 12:30:41,154 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-28 12:30:41,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:30:41,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:30:41,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 12:30:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:30:41,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:30:41,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {2475#true} call ULTIMATE.init(); {2475#true} is VALID [2022-04-28 12:30:41,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {2475#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2475#true} is VALID [2022-04-28 12:30:41,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 12:30:41,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2475#true} {2475#true} #112#return; {2475#true} is VALID [2022-04-28 12:30:41,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {2475#true} call #t~ret6 := main(); {2475#true} is VALID [2022-04-28 12:30:41,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {2475#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2475#true} is VALID [2022-04-28 12:30:41,540 INFO L272 TraceCheckUtils]: 6: Hoare triple {2475#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {2475#true} is VALID [2022-04-28 12:30:41,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-28 12:30:41,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-28 12:30:41,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 12:30:41,541 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2475#true} {2475#true} #94#return; {2475#true} is VALID [2022-04-28 12:30:41,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {2475#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2475#true} is VALID [2022-04-28 12:30:41,541 INFO L272 TraceCheckUtils]: 12: Hoare triple {2475#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {2475#true} is VALID [2022-04-28 12:30:41,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {2475#true} ~cond := #in~cond; {2519#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:30:41,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {2519#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2523#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:30:41,555 INFO L290 TraceCheckUtils]: 15: Hoare triple {2523#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2523#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:30:41,556 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2523#(not (= |assume_abort_if_not_#in~cond| 0))} {2475#true} #96#return; {2530#(and (<= 0 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 12:30:41,556 INFO L272 TraceCheckUtils]: 17: Hoare triple {2530#(and (<= 0 main_~y~0) (<= main_~y~0 100))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2475#true} is VALID [2022-04-28 12:30:41,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-28 12:30:41,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-28 12:30:41,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 12:30:41,556 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2475#true} {2530#(and (<= 0 main_~y~0) (<= main_~y~0 100))} #98#return; {2530#(and (<= 0 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 12:30:41,557 INFO L272 TraceCheckUtils]: 22: Hoare triple {2530#(and (<= 0 main_~y~0) (<= main_~y~0 100))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2475#true} is VALID [2022-04-28 12:30:41,557 INFO L290 TraceCheckUtils]: 23: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-28 12:30:41,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-28 12:30:41,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 12:30:41,557 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2475#true} {2530#(and (<= 0 main_~y~0) (<= main_~y~0 100))} #100#return; {2530#(and (<= 0 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 12:30:41,558 INFO L290 TraceCheckUtils]: 27: Hoare triple {2530#(and (<= 0 main_~y~0) (<= main_~y~0 100))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2564#(<= 0 main_~b~0)} is VALID [2022-04-28 12:30:41,558 INFO L290 TraceCheckUtils]: 28: Hoare triple {2564#(<= 0 main_~b~0)} assume !false; {2564#(<= 0 main_~b~0)} is VALID [2022-04-28 12:30:41,558 INFO L290 TraceCheckUtils]: 29: Hoare triple {2564#(<= 0 main_~b~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 12:30:41,559 INFO L290 TraceCheckUtils]: 30: Hoare triple {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !false; {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 12:30:41,559 INFO L290 TraceCheckUtils]: 31: Hoare triple {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 12:30:41,559 INFO L290 TraceCheckUtils]: 32: Hoare triple {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !false; {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 12:30:41,560 INFO L272 TraceCheckUtils]: 33: Hoare triple {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2475#true} is VALID [2022-04-28 12:30:41,560 INFO L290 TraceCheckUtils]: 34: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-28 12:30:41,560 INFO L290 TraceCheckUtils]: 35: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-28 12:30:41,560 INFO L290 TraceCheckUtils]: 36: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 12:30:41,561 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2475#true} {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #102#return; {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 12:30:41,561 INFO L272 TraceCheckUtils]: 38: Hoare triple {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2475#true} is VALID [2022-04-28 12:30:41,561 INFO L290 TraceCheckUtils]: 39: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-28 12:30:41,561 INFO L290 TraceCheckUtils]: 40: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-28 12:30:41,561 INFO L290 TraceCheckUtils]: 41: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 12:30:41,562 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2475#true} {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #104#return; {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 12:30:41,562 INFO L272 TraceCheckUtils]: 43: Hoare triple {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2614#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:30:41,563 INFO L290 TraceCheckUtils]: 44: Hoare triple {2614#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2618#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:30:41,563 INFO L290 TraceCheckUtils]: 45: Hoare triple {2618#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2476#false} is VALID [2022-04-28 12:30:41,563 INFO L290 TraceCheckUtils]: 46: Hoare triple {2476#false} assume !false; {2476#false} is VALID [2022-04-28 12:30:41,563 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-28 12:30:41,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:30:41,808 INFO L290 TraceCheckUtils]: 46: Hoare triple {2476#false} assume !false; {2476#false} is VALID [2022-04-28 12:30:41,808 INFO L290 TraceCheckUtils]: 45: Hoare triple {2618#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2476#false} is VALID [2022-04-28 12:30:41,809 INFO L290 TraceCheckUtils]: 44: Hoare triple {2614#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2618#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:30:41,810 INFO L272 TraceCheckUtils]: 43: Hoare triple {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2614#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:30:41,811 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2475#true} {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #104#return; {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 12:30:41,811 INFO L290 TraceCheckUtils]: 41: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 12:30:41,811 INFO L290 TraceCheckUtils]: 40: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-28 12:30:41,811 INFO L290 TraceCheckUtils]: 39: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-28 12:30:41,812 INFO L272 TraceCheckUtils]: 38: Hoare triple {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2475#true} is VALID [2022-04-28 12:30:41,813 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2475#true} {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #102#return; {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 12:30:41,813 INFO L290 TraceCheckUtils]: 36: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 12:30:41,813 INFO L290 TraceCheckUtils]: 35: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-28 12:30:41,814 INFO L290 TraceCheckUtils]: 34: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-28 12:30:41,814 INFO L272 TraceCheckUtils]: 33: Hoare triple {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2475#true} is VALID [2022-04-28 12:30:41,814 INFO L290 TraceCheckUtils]: 32: Hoare triple {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !false; {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 12:30:41,815 INFO L290 TraceCheckUtils]: 31: Hoare triple {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 12:30:41,815 INFO L290 TraceCheckUtils]: 30: Hoare triple {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !false; {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 12:30:41,816 INFO L290 TraceCheckUtils]: 29: Hoare triple {2475#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 12:30:41,816 INFO L290 TraceCheckUtils]: 28: Hoare triple {2475#true} assume !false; {2475#true} is VALID [2022-04-28 12:30:41,816 INFO L290 TraceCheckUtils]: 27: Hoare triple {2475#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2475#true} is VALID [2022-04-28 12:30:41,816 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2475#true} {2475#true} #100#return; {2475#true} is VALID [2022-04-28 12:30:41,816 INFO L290 TraceCheckUtils]: 25: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 12:30:41,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-28 12:30:41,817 INFO L290 TraceCheckUtils]: 23: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-28 12:30:41,817 INFO L272 TraceCheckUtils]: 22: Hoare triple {2475#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2475#true} is VALID [2022-04-28 12:30:41,817 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2475#true} {2475#true} #98#return; {2475#true} is VALID [2022-04-28 12:30:41,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 12:30:41,817 INFO L290 TraceCheckUtils]: 19: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-28 12:30:41,817 INFO L290 TraceCheckUtils]: 18: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-28 12:30:41,817 INFO L272 TraceCheckUtils]: 17: Hoare triple {2475#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2475#true} is VALID [2022-04-28 12:30:41,817 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2475#true} {2475#true} #96#return; {2475#true} is VALID [2022-04-28 12:30:41,818 INFO L290 TraceCheckUtils]: 15: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 12:30:41,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-28 12:30:41,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-28 12:30:41,818 INFO L272 TraceCheckUtils]: 12: Hoare triple {2475#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {2475#true} is VALID [2022-04-28 12:30:41,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {2475#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2475#true} is VALID [2022-04-28 12:30:41,823 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2475#true} {2475#true} #94#return; {2475#true} is VALID [2022-04-28 12:30:41,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 12:30:41,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-28 12:30:41,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-28 12:30:41,824 INFO L272 TraceCheckUtils]: 6: Hoare triple {2475#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {2475#true} is VALID [2022-04-28 12:30:41,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {2475#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2475#true} is VALID [2022-04-28 12:30:41,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {2475#true} call #t~ret6 := main(); {2475#true} is VALID [2022-04-28 12:30:41,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2475#true} {2475#true} #112#return; {2475#true} is VALID [2022-04-28 12:30:41,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 12:30:41,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {2475#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2475#true} is VALID [2022-04-28 12:30:41,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {2475#true} call ULTIMATE.init(); {2475#true} is VALID [2022-04-28 12:30:41,825 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-28 12:30:41,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:30:41,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209216008] [2022-04-28 12:30:41,825 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:30:41,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301574008] [2022-04-28 12:30:41,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301574008] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 12:30:41,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 12:30:41,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-28 12:30:41,826 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:30:41,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [314172547] [2022-04-28 12:30:41,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [314172547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:30:41,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:30:41,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:30:41,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959369187] [2022-04-28 12:30:41,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:30:41,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2022-04-28 12:30:41,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:30:41,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:30:41,858 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-28 12:30:41,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:30:41,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:30:41,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:30:41,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-28 12:30:41,859 INFO L87 Difference]: Start difference. First operand 93 states and 122 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:30:42,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:42,302 INFO L93 Difference]: Finished difference Result 130 states and 179 transitions. [2022-04-28 12:30:42,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:30:42,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2022-04-28 12:30:42,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:30:42,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:30:42,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 12:30:42,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:30:42,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 12:30:42,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-28 12:30:42,365 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-28 12:30:42,368 INFO L225 Difference]: With dead ends: 130 [2022-04-28 12:30:42,368 INFO L226 Difference]: Without dead ends: 128 [2022-04-28 12:30:42,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-28 12:30:42,369 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 8 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:30:42,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 141 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:30:42,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-28 12:30:42,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2022-04-28 12:30:42,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:30:42,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 123 states, 76 states have (on average 1.263157894736842) internal successors, (96), 77 states have internal predecessors, (96), 39 states have call successors, (39), 8 states have call predecessors, (39), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 12:30:42,630 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 123 states, 76 states have (on average 1.263157894736842) internal successors, (96), 77 states have internal predecessors, (96), 39 states have call successors, (39), 8 states have call predecessors, (39), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 12:30:42,630 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 123 states, 76 states have (on average 1.263157894736842) internal successors, (96), 77 states have internal predecessors, (96), 39 states have call successors, (39), 8 states have call predecessors, (39), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 12:30:42,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:42,637 INFO L93 Difference]: Finished difference Result 128 states and 177 transitions. [2022-04-28 12:30:42,637 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 177 transitions. [2022-04-28 12:30:42,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:30:42,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:30:42,639 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 76 states have (on average 1.263157894736842) internal successors, (96), 77 states have internal predecessors, (96), 39 states have call successors, (39), 8 states have call predecessors, (39), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 128 states. [2022-04-28 12:30:42,640 INFO L87 Difference]: Start difference. First operand has 123 states, 76 states have (on average 1.263157894736842) internal successors, (96), 77 states have internal predecessors, (96), 39 states have call successors, (39), 8 states have call predecessors, (39), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 128 states. [2022-04-28 12:30:42,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:42,647 INFO L93 Difference]: Finished difference Result 128 states and 177 transitions. [2022-04-28 12:30:42,647 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 177 transitions. [2022-04-28 12:30:42,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:30:42,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:30:42,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:30:42,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:30:42,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 76 states have (on average 1.263157894736842) internal successors, (96), 77 states have internal predecessors, (96), 39 states have call successors, (39), 8 states have call predecessors, (39), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 12:30:42,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 172 transitions. [2022-04-28 12:30:42,657 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 172 transitions. Word has length 47 [2022-04-28 12:30:42,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:30:42,657 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 172 transitions. [2022-04-28 12:30:42,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:30:42,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 172 transitions. [2022-04-28 12:30:42,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:30:42,882 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 172 transitions. [2022-04-28 12:30:42,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 12:30:42,883 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:30:42,883 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:30:42,901 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-28 12:30:43,091 WARN L477 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-28 12:30:43,091 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:30:43,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:30:43,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1524769911, now seen corresponding path program 1 times [2022-04-28 12:30:43,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:30:43,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1516163699] [2022-04-28 12:30:43,092 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:30:43,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1524769911, now seen corresponding path program 2 times [2022-04-28 12:30:43,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:30:43,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019681290] [2022-04-28 12:30:43,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:30:43,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:30:43,120 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:30:43,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [973463335] [2022-04-28 12:30:43,120 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:30:43,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:30:43,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:30:43,121 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-28 12:30:43,138 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-28 12:30:43,169 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:30:43,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:30:43,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 12:30:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:30:43,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:30:46,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {3530#true} call ULTIMATE.init(); {3530#true} is VALID [2022-04-28 12:30:46,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {3530#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {3530#true} is VALID [2022-04-28 12:30:46,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-28 12:30:46,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3530#true} {3530#true} #112#return; {3530#true} is VALID [2022-04-28 12:30:46,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {3530#true} call #t~ret6 := main(); {3530#true} is VALID [2022-04-28 12:30:46,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {3530#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3530#true} is VALID [2022-04-28 12:30:46,781 INFO L272 TraceCheckUtils]: 6: Hoare triple {3530#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {3530#true} is VALID [2022-04-28 12:30:46,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-28 12:30:46,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-28 12:30:46,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-28 12:30:46,782 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3530#true} {3530#true} #94#return; {3530#true} is VALID [2022-04-28 12:30:46,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {3530#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3530#true} is VALID [2022-04-28 12:30:46,782 INFO L272 TraceCheckUtils]: 12: Hoare triple {3530#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {3530#true} is VALID [2022-04-28 12:30:46,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {3530#true} ~cond := #in~cond; {3574#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:30:46,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {3574#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3578#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:30:46,784 INFO L290 TraceCheckUtils]: 15: Hoare triple {3578#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3578#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:30:46,784 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3578#(not (= |assume_abort_if_not_#in~cond| 0))} {3530#true} #96#return; {3585#(and (<= 0 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 12:30:46,784 INFO L272 TraceCheckUtils]: 17: Hoare triple {3585#(and (<= 0 main_~y~0) (<= main_~y~0 100))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3530#true} is VALID [2022-04-28 12:30:46,784 INFO L290 TraceCheckUtils]: 18: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-28 12:30:46,785 INFO L290 TraceCheckUtils]: 19: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-28 12:30:46,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-28 12:30:46,785 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3530#true} {3585#(and (<= 0 main_~y~0) (<= main_~y~0 100))} #98#return; {3585#(and (<= 0 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-28 12:30:46,785 INFO L272 TraceCheckUtils]: 22: Hoare triple {3585#(and (<= 0 main_~y~0) (<= main_~y~0 100))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3530#true} is VALID [2022-04-28 12:30:46,786 INFO L290 TraceCheckUtils]: 23: Hoare triple {3530#true} ~cond := #in~cond; {3574#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:30:46,786 INFO L290 TraceCheckUtils]: 24: Hoare triple {3574#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3578#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:30:46,787 INFO L290 TraceCheckUtils]: 25: Hoare triple {3578#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3578#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:30:46,787 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3578#(not (= |assume_abort_if_not_#in~cond| 0))} {3585#(and (<= 0 main_~y~0) (<= main_~y~0 100))} #100#return; {3616#(and (<= main_~y~0 100) (<= 1 main_~y~0))} is VALID [2022-04-28 12:30:46,788 INFO L290 TraceCheckUtils]: 27: Hoare triple {3616#(and (<= main_~y~0 100) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3620#(and (= main_~r~0 0) (<= main_~y~0 100) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:46,789 INFO L290 TraceCheckUtils]: 28: Hoare triple {3620#(and (= main_~r~0 0) (<= main_~y~0 100) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {3620#(and (= main_~r~0 0) (<= main_~y~0 100) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:46,789 INFO L290 TraceCheckUtils]: 29: Hoare triple {3620#(and (= main_~r~0 0) (<= main_~y~0 100) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3627#(and (= main_~r~0 0) (= main_~k~0 0) (<= main_~y~0 100) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:46,790 INFO L290 TraceCheckUtils]: 30: Hoare triple {3627#(and (= main_~r~0 0) (= main_~k~0 0) (<= main_~y~0 100) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {3627#(and (= main_~r~0 0) (= main_~k~0 0) (<= main_~y~0 100) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:46,790 INFO L290 TraceCheckUtils]: 31: Hoare triple {3627#(and (= main_~r~0 0) (= main_~k~0 0) (<= main_~y~0 100) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {3627#(and (= main_~r~0 0) (= main_~k~0 0) (<= main_~y~0 100) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:46,791 INFO L290 TraceCheckUtils]: 32: Hoare triple {3627#(and (= main_~r~0 0) (= main_~k~0 0) (<= main_~y~0 100) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {3637#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (<= main_~y~0 100) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 12:30:46,791 INFO L290 TraceCheckUtils]: 33: Hoare triple {3637#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (<= main_~y~0 100) (= main_~q~0 1) (<= 1 main_~y~0))} assume !false; {3637#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (<= main_~y~0 100) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 12:30:46,792 INFO L290 TraceCheckUtils]: 34: Hoare triple {3637#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (<= main_~y~0 100) (= main_~q~0 1) (<= 1 main_~y~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3637#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (<= main_~y~0 100) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 12:30:46,793 INFO L290 TraceCheckUtils]: 35: Hoare triple {3637#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (<= main_~y~0 100) (= main_~q~0 1) (<= 1 main_~y~0))} assume !false; {3637#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (<= main_~y~0 100) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 12:30:46,793 INFO L290 TraceCheckUtils]: 36: Hoare triple {3637#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (<= main_~y~0 100) (= main_~q~0 1) (<= 1 main_~y~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {3637#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (<= main_~y~0 100) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 12:30:46,794 INFO L290 TraceCheckUtils]: 37: Hoare triple {3637#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (<= main_~y~0 100) (= main_~q~0 1) (<= 1 main_~y~0))} assume !false; {3637#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (<= main_~y~0 100) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 12:30:46,794 INFO L272 TraceCheckUtils]: 38: Hoare triple {3637#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (<= main_~y~0 100) (= main_~q~0 1) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3530#true} is VALID [2022-04-28 12:30:46,794 INFO L290 TraceCheckUtils]: 39: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-28 12:30:46,794 INFO L290 TraceCheckUtils]: 40: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-28 12:30:46,794 INFO L290 TraceCheckUtils]: 41: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-28 12:30:46,795 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3530#true} {3637#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (<= main_~y~0 100) (= main_~q~0 1) (<= 1 main_~y~0))} #102#return; {3637#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (<= main_~y~0 100) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 12:30:46,796 INFO L272 TraceCheckUtils]: 43: Hoare triple {3637#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (<= main_~y~0 100) (= main_~q~0 1) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3671#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:30:46,796 INFO L290 TraceCheckUtils]: 44: Hoare triple {3671#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3675#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:30:46,797 INFO L290 TraceCheckUtils]: 45: Hoare triple {3675#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3531#false} is VALID [2022-04-28 12:30:46,797 INFO L290 TraceCheckUtils]: 46: Hoare triple {3531#false} assume !false; {3531#false} is VALID [2022-04-28 12:30:46,797 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 12:30:46,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:32:12,659 INFO L290 TraceCheckUtils]: 46: Hoare triple {3531#false} assume !false; {3531#false} is VALID [2022-04-28 12:32:12,660 INFO L290 TraceCheckUtils]: 45: Hoare triple {3675#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3531#false} is VALID [2022-04-28 12:32:12,660 INFO L290 TraceCheckUtils]: 44: Hoare triple {3671#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3675#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:32:12,661 INFO L272 TraceCheckUtils]: 43: Hoare triple {3691#(= 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)); {3671#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:32:12,661 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3530#true} {3691#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #102#return; {3691#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:32:12,661 INFO L290 TraceCheckUtils]: 41: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-28 12:32:12,662 INFO L290 TraceCheckUtils]: 40: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-28 12:32:12,662 INFO L290 TraceCheckUtils]: 39: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-28 12:32:12,662 INFO L272 TraceCheckUtils]: 38: Hoare triple {3691#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3530#true} is VALID [2022-04-28 12:32:12,673 INFO L290 TraceCheckUtils]: 37: Hoare triple {3691#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {3691#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:32:12,673 INFO L290 TraceCheckUtils]: 36: Hoare triple {3691#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {3691#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:32:12,673 INFO L290 TraceCheckUtils]: 35: Hoare triple {3691#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {3691#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:32:12,674 INFO L290 TraceCheckUtils]: 34: Hoare triple {3691#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3691#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:32:12,674 INFO L290 TraceCheckUtils]: 33: Hoare triple {3691#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {3691#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:32:12,979 INFO L290 TraceCheckUtils]: 32: Hoare triple {3725#(forall ((main_~s~0 Int)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {3691#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:32:12,980 INFO L290 TraceCheckUtils]: 31: Hoare triple {3725#(forall ((main_~s~0 Int)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0))} assume !(~c~0 >= ~b~0); {3725#(forall ((main_~s~0 Int)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0))} is VALID [2022-04-28 12:32:12,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {3725#(forall ((main_~s~0 Int)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0))} assume !false; {3725#(forall ((main_~s~0 Int)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0))} is VALID [2022-04-28 12:32:12,981 INFO L290 TraceCheckUtils]: 29: Hoare triple {3735#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3725#(forall ((main_~s~0 Int)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0))} is VALID [2022-04-28 12:32:12,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {3735#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {3735#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:32:12,982 INFO L290 TraceCheckUtils]: 27: Hoare triple {3530#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3735#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:32:12,982 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3530#true} {3530#true} #100#return; {3530#true} is VALID [2022-04-28 12:32:12,982 INFO L290 TraceCheckUtils]: 25: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-28 12:32:12,982 INFO L290 TraceCheckUtils]: 24: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-28 12:32:12,983 INFO L290 TraceCheckUtils]: 23: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-28 12:32:12,983 INFO L272 TraceCheckUtils]: 22: Hoare triple {3530#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3530#true} is VALID [2022-04-28 12:32:12,983 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3530#true} {3530#true} #98#return; {3530#true} is VALID [2022-04-28 12:32:12,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-28 12:32:12,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-28 12:32:12,983 INFO L290 TraceCheckUtils]: 18: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-28 12:32:12,983 INFO L272 TraceCheckUtils]: 17: Hoare triple {3530#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3530#true} is VALID [2022-04-28 12:32:12,984 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3530#true} {3530#true} #96#return; {3530#true} is VALID [2022-04-28 12:32:12,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-28 12:32:12,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-28 12:32:12,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-28 12:32:12,984 INFO L272 TraceCheckUtils]: 12: Hoare triple {3530#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {3530#true} is VALID [2022-04-28 12:32:12,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {3530#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3530#true} is VALID [2022-04-28 12:32:12,984 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3530#true} {3530#true} #94#return; {3530#true} is VALID [2022-04-28 12:32:12,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-28 12:32:12,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-28 12:32:12,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-28 12:32:12,985 INFO L272 TraceCheckUtils]: 6: Hoare triple {3530#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {3530#true} is VALID [2022-04-28 12:32:12,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {3530#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3530#true} is VALID [2022-04-28 12:32:12,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {3530#true} call #t~ret6 := main(); {3530#true} is VALID [2022-04-28 12:32:12,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3530#true} {3530#true} #112#return; {3530#true} is VALID [2022-04-28 12:32:12,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-28 12:32:12,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {3530#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {3530#true} is VALID [2022-04-28 12:32:12,986 INFO L272 TraceCheckUtils]: 0: Hoare triple {3530#true} call ULTIMATE.init(); {3530#true} is VALID [2022-04-28 12:32:12,986 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 12:32:12,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:32:12,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019681290] [2022-04-28 12:32:12,986 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:32:12,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973463335] [2022-04-28 12:32:12,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973463335] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:32:12,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:32:12,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 14 [2022-04-28 12:32:12,987 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:32:12,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1516163699] [2022-04-28 12:32:12,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1516163699] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:32:12,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:32:12,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 12:32:12,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018178230] [2022-04-28 12:32:12,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:32:12,988 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-04-28 12:32:12,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:32:12,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 12:32:13,024 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-28 12:32:13,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 12:32:13,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:32:13,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 12:32:13,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:32:13,025 INFO L87 Difference]: Start difference. First operand 123 states and 172 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 12:32:14,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:32:14,194 INFO L93 Difference]: Finished difference Result 137 states and 184 transitions. [2022-04-28 12:32:14,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 12:32:14,194 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-04-28 12:32:14,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:32:14,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 12:32:14,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 101 transitions. [2022-04-28 12:32:14,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 12:32:14,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 101 transitions. [2022-04-28 12:32:14,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 101 transitions. [2022-04-28 12:32:14,303 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-28 12:32:14,305 INFO L225 Difference]: With dead ends: 137 [2022-04-28 12:32:14,306 INFO L226 Difference]: Without dead ends: 135 [2022-04-28 12:32:14,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-04-28 12:32:14,306 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 58 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 12:32:14,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 231 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 12:32:14,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-28 12:32:14,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2022-04-28 12:32:14,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:32:14,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 131 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 83 states have internal predecessors, (102), 39 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 12:32:14,570 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 131 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 83 states have internal predecessors, (102), 39 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 12:32:14,570 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 131 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 83 states have internal predecessors, (102), 39 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 12:32:14,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:32:14,578 INFO L93 Difference]: Finished difference Result 135 states and 182 transitions. [2022-04-28 12:32:14,578 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 182 transitions. [2022-04-28 12:32:14,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:32:14,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:32:14,579 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 83 states have internal predecessors, (102), 39 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 135 states. [2022-04-28 12:32:14,579 INFO L87 Difference]: Start difference. First operand has 131 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 83 states have internal predecessors, (102), 39 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 135 states. [2022-04-28 12:32:14,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:32:14,585 INFO L93 Difference]: Finished difference Result 135 states and 182 transitions. [2022-04-28 12:32:14,585 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 182 transitions. [2022-04-28 12:32:14,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:32:14,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:32:14,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:32:14,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:32:14,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 83 states have internal predecessors, (102), 39 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 12:32:14,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 178 transitions. [2022-04-28 12:32:14,591 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 178 transitions. Word has length 47 [2022-04-28 12:32:14,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:32:14,591 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 178 transitions. [2022-04-28 12:32:14,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 12:32:14,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 178 transitions. [2022-04-28 12:32:14,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:32:14,816 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 178 transitions. [2022-04-28 12:32:14,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 12:32:14,817 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:32:14,817 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:32:14,834 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-28 12:32:15,019 WARN L477 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-28 12:32:15,020 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:32:15,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:32:15,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1836145722, now seen corresponding path program 3 times [2022-04-28 12:32:15,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:32:15,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1340729010] [2022-04-28 12:32:15,020 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:32:15,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1836145722, now seen corresponding path program 4 times [2022-04-28 12:32:15,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:32:15,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562799223] [2022-04-28 12:32:15,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:32:15,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:32:15,066 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:32:15,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1998838923] [2022-04-28 12:32:15,067 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:32:15,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:32:15,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:32:15,068 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-28 12:32:15,078 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-28 12:32:15,112 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:32:15,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:32:15,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 12:32:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:32:15,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:32:15,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {4637#true} call ULTIMATE.init(); {4637#true} is VALID [2022-04-28 12:32:15,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {4637#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {4637#true} is VALID [2022-04-28 12:32:15,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {4637#true} assume true; {4637#true} is VALID [2022-04-28 12:32:15,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4637#true} {4637#true} #112#return; {4637#true} is VALID [2022-04-28 12:32:15,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {4637#true} call #t~ret6 := main(); {4637#true} is VALID [2022-04-28 12:32:15,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {4637#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4637#true} is VALID [2022-04-28 12:32:15,256 INFO L272 TraceCheckUtils]: 6: Hoare triple {4637#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {4637#true} is VALID [2022-04-28 12:32:15,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {4637#true} ~cond := #in~cond; {4637#true} is VALID [2022-04-28 12:32:15,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {4637#true} assume !(0 == ~cond); {4637#true} is VALID [2022-04-28 12:32:15,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {4637#true} assume true; {4637#true} is VALID [2022-04-28 12:32:15,256 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4637#true} {4637#true} #94#return; {4637#true} is VALID [2022-04-28 12:32:15,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {4637#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4637#true} is VALID [2022-04-28 12:32:15,256 INFO L272 TraceCheckUtils]: 12: Hoare triple {4637#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {4637#true} is VALID [2022-04-28 12:32:15,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {4637#true} ~cond := #in~cond; {4637#true} is VALID [2022-04-28 12:32:15,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {4637#true} assume !(0 == ~cond); {4637#true} is VALID [2022-04-28 12:32:15,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {4637#true} assume true; {4637#true} is VALID [2022-04-28 12:32:15,257 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4637#true} {4637#true} #96#return; {4637#true} is VALID [2022-04-28 12:32:15,257 INFO L272 TraceCheckUtils]: 17: Hoare triple {4637#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4637#true} is VALID [2022-04-28 12:32:15,257 INFO L290 TraceCheckUtils]: 18: Hoare triple {4637#true} ~cond := #in~cond; {4637#true} is VALID [2022-04-28 12:32:15,257 INFO L290 TraceCheckUtils]: 19: Hoare triple {4637#true} assume !(0 == ~cond); {4637#true} is VALID [2022-04-28 12:32:15,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {4637#true} assume true; {4637#true} is VALID [2022-04-28 12:32:15,257 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4637#true} {4637#true} #98#return; {4637#true} is VALID [2022-04-28 12:32:15,257 INFO L272 TraceCheckUtils]: 22: Hoare triple {4637#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4637#true} is VALID [2022-04-28 12:32:15,257 INFO L290 TraceCheckUtils]: 23: Hoare triple {4637#true} ~cond := #in~cond; {4637#true} is VALID [2022-04-28 12:32:15,257 INFO L290 TraceCheckUtils]: 24: Hoare triple {4637#true} assume !(0 == ~cond); {4637#true} is VALID [2022-04-28 12:32:15,258 INFO L290 TraceCheckUtils]: 25: Hoare triple {4637#true} assume true; {4637#true} is VALID [2022-04-28 12:32:15,258 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4637#true} {4637#true} #100#return; {4637#true} is VALID [2022-04-28 12:32:15,258 INFO L290 TraceCheckUtils]: 27: Hoare triple {4637#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4637#true} is VALID [2022-04-28 12:32:15,258 INFO L290 TraceCheckUtils]: 28: Hoare triple {4637#true} assume !false; {4637#true} is VALID [2022-04-28 12:32:15,258 INFO L290 TraceCheckUtils]: 29: Hoare triple {4637#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4637#true} is VALID [2022-04-28 12:32:15,258 INFO L290 TraceCheckUtils]: 30: Hoare triple {4637#true} assume !false; {4637#true} is VALID [2022-04-28 12:32:15,258 INFO L290 TraceCheckUtils]: 31: Hoare triple {4637#true} assume !(~c~0 >= ~b~0); {4735#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:32:15,259 INFO L290 TraceCheckUtils]: 32: Hoare triple {4735#(not (<= main_~b~0 main_~c~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {4739#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 12:32:15,259 INFO L290 TraceCheckUtils]: 33: Hoare triple {4739#(< main_~b~0 main_~a~0)} assume !false; {4739#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 12:32:15,259 INFO L290 TraceCheckUtils]: 34: Hoare triple {4739#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4746#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:32:15,261 INFO L290 TraceCheckUtils]: 35: Hoare triple {4746#(< main_~b~0 main_~c~0)} assume !false; {4746#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:32:15,261 INFO L290 TraceCheckUtils]: 36: Hoare triple {4746#(< main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {4638#false} is VALID [2022-04-28 12:32:15,262 INFO L290 TraceCheckUtils]: 37: Hoare triple {4638#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {4638#false} is VALID [2022-04-28 12:32:15,262 INFO L290 TraceCheckUtils]: 38: Hoare triple {4638#false} assume !false; {4638#false} is VALID [2022-04-28 12:32:15,262 INFO L290 TraceCheckUtils]: 39: Hoare triple {4638#false} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4638#false} is VALID [2022-04-28 12:32:15,262 INFO L290 TraceCheckUtils]: 40: Hoare triple {4638#false} assume !false; {4638#false} is VALID [2022-04-28 12:32:15,262 INFO L290 TraceCheckUtils]: 41: Hoare triple {4638#false} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {4638#false} is VALID [2022-04-28 12:32:15,262 INFO L290 TraceCheckUtils]: 42: Hoare triple {4638#false} assume !false; {4638#false} is VALID [2022-04-28 12:32:15,262 INFO L272 TraceCheckUtils]: 43: Hoare triple {4638#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4638#false} is VALID [2022-04-28 12:32:15,262 INFO L290 TraceCheckUtils]: 44: Hoare triple {4638#false} ~cond := #in~cond; {4638#false} is VALID [2022-04-28 12:32:15,262 INFO L290 TraceCheckUtils]: 45: Hoare triple {4638#false} assume 0 == ~cond; {4638#false} is VALID [2022-04-28 12:32:15,262 INFO L290 TraceCheckUtils]: 46: Hoare triple {4638#false} assume !false; {4638#false} is VALID [2022-04-28 12:32:15,263 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 12:32:15,263 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:32:15,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:32:15,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562799223] [2022-04-28 12:32:15,263 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:32:15,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998838923] [2022-04-28 12:32:15,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998838923] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:32:15,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:32:15,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:32:15,264 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:32:15,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1340729010] [2022-04-28 12:32:15,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1340729010] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:32:15,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:32:15,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:32:15,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070238833] [2022-04-28 12:32:15,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:32:15,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2022-04-28 12:32:15,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:32:15,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 12:32:15,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:32:15,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:32:15,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:32:15,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:32:15,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:32:15,299 INFO L87 Difference]: Start difference. First operand 131 states and 178 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 12:32:15,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:32:15,869 INFO L93 Difference]: Finished difference Result 170 states and 230 transitions. [2022-04-28 12:32:15,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 12:32:15,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2022-04-28 12:32:15,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:32:15,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 12:32:15,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2022-04-28 12:32:15,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 12:32:15,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2022-04-28 12:32:15,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 102 transitions. [2022-04-28 12:32:15,951 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-28 12:32:15,953 INFO L225 Difference]: With dead ends: 170 [2022-04-28 12:32:15,953 INFO L226 Difference]: Without dead ends: 114 [2022-04-28 12:32:15,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-28 12:32:15,955 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 18 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:32:15,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 155 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:32:15,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-28 12:32:16,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2022-04-28 12:32:16,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:32:16,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 106 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 12:32:16,175 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 106 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 12:32:16,176 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 106 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 12:32:16,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:32:16,179 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2022-04-28 12:32:16,179 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 146 transitions. [2022-04-28 12:32:16,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:32:16,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:32:16,180 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 114 states. [2022-04-28 12:32:16,181 INFO L87 Difference]: Start difference. First operand has 106 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 114 states. [2022-04-28 12:32:16,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:32:16,184 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2022-04-28 12:32:16,185 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 146 transitions. [2022-04-28 12:32:16,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:32:16,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:32:16,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:32:16,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:32:16,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 12:32:16,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 137 transitions. [2022-04-28 12:32:16,189 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 137 transitions. Word has length 47 [2022-04-28 12:32:16,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:32:16,190 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 137 transitions. [2022-04-28 12:32:16,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 12:32:16,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 137 transitions. [2022-04-28 12:32:16,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:32:16,366 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 137 transitions. [2022-04-28 12:32:16,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-28 12:32:16,366 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:32:16,366 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:32:16,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 12:32:16,566 WARN L477 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-28 12:32:16,567 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:32:16,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:32:16,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1952108775, now seen corresponding path program 1 times [2022-04-28 12:32:16,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:32:16,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1428440069] [2022-04-28 12:32:16,569 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:32:16,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1952108775, now seen corresponding path program 2 times [2022-04-28 12:32:16,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:32:16,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891631276] [2022-04-28 12:32:16,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:32:16,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:32:16,582 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:32:16,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [196200164] [2022-04-28 12:32:16,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:32:16,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:32:16,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:32:16,583 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-28 12:32:16,607 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-28 12:32:16,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:32:16,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:32:16,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 12:32:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:32:16,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:32:16,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {5567#true} call ULTIMATE.init(); {5567#true} is VALID [2022-04-28 12:32:16,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {5567#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {5567#true} is VALID [2022-04-28 12:32:16,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {5567#true} assume true; {5567#true} is VALID [2022-04-28 12:32:16,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5567#true} {5567#true} #112#return; {5567#true} is VALID [2022-04-28 12:32:16,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {5567#true} call #t~ret6 := main(); {5567#true} is VALID [2022-04-28 12:32:16,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {5567#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {5567#true} is VALID [2022-04-28 12:32:16,833 INFO L272 TraceCheckUtils]: 6: Hoare triple {5567#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {5567#true} is VALID [2022-04-28 12:32:16,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {5567#true} ~cond := #in~cond; {5567#true} is VALID [2022-04-28 12:32:16,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {5567#true} assume !(0 == ~cond); {5567#true} is VALID [2022-04-28 12:32:16,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {5567#true} assume true; {5567#true} is VALID [2022-04-28 12:32:16,834 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5567#true} {5567#true} #94#return; {5567#true} is VALID [2022-04-28 12:32:16,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {5567#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5567#true} is VALID [2022-04-28 12:32:16,834 INFO L272 TraceCheckUtils]: 12: Hoare triple {5567#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {5567#true} is VALID [2022-04-28 12:32:16,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {5567#true} ~cond := #in~cond; {5567#true} is VALID [2022-04-28 12:32:16,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {5567#true} assume !(0 == ~cond); {5567#true} is VALID [2022-04-28 12:32:16,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {5567#true} assume true; {5567#true} is VALID [2022-04-28 12:32:16,834 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5567#true} {5567#true} #96#return; {5567#true} is VALID [2022-04-28 12:32:16,835 INFO L272 TraceCheckUtils]: 17: Hoare triple {5567#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5567#true} is VALID [2022-04-28 12:32:16,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {5567#true} ~cond := #in~cond; {5567#true} is VALID [2022-04-28 12:32:16,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {5567#true} assume !(0 == ~cond); {5567#true} is VALID [2022-04-28 12:32:16,835 INFO L290 TraceCheckUtils]: 20: Hoare triple {5567#true} assume true; {5567#true} is VALID [2022-04-28 12:32:16,835 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5567#true} {5567#true} #98#return; {5567#true} is VALID [2022-04-28 12:32:16,835 INFO L272 TraceCheckUtils]: 22: Hoare triple {5567#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5567#true} is VALID [2022-04-28 12:32:16,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {5567#true} ~cond := #in~cond; {5567#true} is VALID [2022-04-28 12:32:16,841 INFO L290 TraceCheckUtils]: 24: Hoare triple {5567#true} assume !(0 == ~cond); {5567#true} is VALID [2022-04-28 12:32:16,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {5567#true} assume true; {5567#true} is VALID [2022-04-28 12:32:16,844 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5567#true} {5567#true} #100#return; {5567#true} is VALID [2022-04-28 12:32:16,844 INFO L290 TraceCheckUtils]: 27: Hoare triple {5567#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {5567#true} is VALID [2022-04-28 12:32:16,845 INFO L290 TraceCheckUtils]: 28: Hoare triple {5567#true} assume !false; {5567#true} is VALID [2022-04-28 12:32:16,845 INFO L290 TraceCheckUtils]: 29: Hoare triple {5567#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {5567#true} is VALID [2022-04-28 12:32:16,845 INFO L290 TraceCheckUtils]: 30: Hoare triple {5567#true} assume !false; {5567#true} is VALID [2022-04-28 12:32:16,848 INFO L290 TraceCheckUtils]: 31: Hoare triple {5567#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {5665#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 12:32:16,849 INFO L290 TraceCheckUtils]: 32: Hoare triple {5665#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} assume !false; {5665#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 12:32:16,849 INFO L272 TraceCheckUtils]: 33: Hoare triple {5665#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {5567#true} is VALID [2022-04-28 12:32:16,849 INFO L290 TraceCheckUtils]: 34: Hoare triple {5567#true} ~cond := #in~cond; {5567#true} is VALID [2022-04-28 12:32:16,849 INFO L290 TraceCheckUtils]: 35: Hoare triple {5567#true} assume !(0 == ~cond); {5567#true} is VALID [2022-04-28 12:32:16,849 INFO L290 TraceCheckUtils]: 36: Hoare triple {5567#true} assume true; {5567#true} is VALID [2022-04-28 12:32:16,850 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5567#true} {5665#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #102#return; {5665#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 12:32:16,850 INFO L272 TraceCheckUtils]: 38: Hoare triple {5665#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {5567#true} is VALID [2022-04-28 12:32:16,850 INFO L290 TraceCheckUtils]: 39: Hoare triple {5567#true} ~cond := #in~cond; {5567#true} is VALID [2022-04-28 12:32:16,850 INFO L290 TraceCheckUtils]: 40: Hoare triple {5567#true} assume !(0 == ~cond); {5567#true} is VALID [2022-04-28 12:32:16,850 INFO L290 TraceCheckUtils]: 41: Hoare triple {5567#true} assume true; {5567#true} is VALID [2022-04-28 12:32:16,851 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5567#true} {5665#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #104#return; {5665#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 12:32:16,851 INFO L272 TraceCheckUtils]: 43: Hoare triple {5665#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {5567#true} is VALID [2022-04-28 12:32:16,851 INFO L290 TraceCheckUtils]: 44: Hoare triple {5567#true} ~cond := #in~cond; {5567#true} is VALID [2022-04-28 12:32:16,851 INFO L290 TraceCheckUtils]: 45: Hoare triple {5567#true} assume !(0 == ~cond); {5567#true} is VALID [2022-04-28 12:32:16,851 INFO L290 TraceCheckUtils]: 46: Hoare triple {5567#true} assume true; {5567#true} is VALID [2022-04-28 12:32:16,852 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5567#true} {5665#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #106#return; {5665#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 12:32:16,853 INFO L272 TraceCheckUtils]: 48: Hoare triple {5665#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {5717#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:32:16,853 INFO L290 TraceCheckUtils]: 49: Hoare triple {5717#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5721#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:32:16,853 INFO L290 TraceCheckUtils]: 50: Hoare triple {5721#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5568#false} is VALID [2022-04-28 12:32:16,853 INFO L290 TraceCheckUtils]: 51: Hoare triple {5568#false} assume !false; {5568#false} is VALID [2022-04-28 12:32:16,854 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-28 12:32:16,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:32:16,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:32:16,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891631276] [2022-04-28 12:32:16,854 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:32:16,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196200164] [2022-04-28 12:32:16,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196200164] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:32:16,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:32:16,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:32:16,855 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:32:16,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1428440069] [2022-04-28 12:32:16,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1428440069] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:32:16,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:32:16,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:32:16,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332246988] [2022-04-28 12:32:16,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:32:16,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 52 [2022-04-28 12:32:16,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:32:16,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 12:32:16,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:32:16,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:32:16,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:32:16,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:32:16,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:32:16,889 INFO L87 Difference]: Start difference. First operand 106 states and 137 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 12:32:17,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:32:17,478 INFO L93 Difference]: Finished difference Result 158 states and 221 transitions. [2022-04-28 12:32:17,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:32:17,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 52 [2022-04-28 12:32:17,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:32:17,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 12:32:17,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 12:32:17,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 12:32:17,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 12:32:17,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-28 12:32:17,540 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-28 12:32:17,544 INFO L225 Difference]: With dead ends: 158 [2022-04-28 12:32:17,544 INFO L226 Difference]: Without dead ends: 156 [2022-04-28 12:32:17,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 12:32:17,545 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 9 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:32:17,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 156 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:32:17,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-04-28 12:32:17,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 140. [2022-04-28 12:32:17,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:32:17,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand has 140 states, 74 states have (on average 1.162162162162162) internal successors, (86), 81 states have internal predecessors, (86), 55 states have call successors, (55), 11 states have call predecessors, (55), 10 states have return successors, (53), 47 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-28 12:32:17,884 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand has 140 states, 74 states have (on average 1.162162162162162) internal successors, (86), 81 states have internal predecessors, (86), 55 states have call successors, (55), 11 states have call predecessors, (55), 10 states have return successors, (53), 47 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-28 12:32:17,885 INFO L87 Difference]: Start difference. First operand 156 states. Second operand has 140 states, 74 states have (on average 1.162162162162162) internal successors, (86), 81 states have internal predecessors, (86), 55 states have call successors, (55), 11 states have call predecessors, (55), 10 states have return successors, (53), 47 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-28 12:32:17,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:32:17,891 INFO L93 Difference]: Finished difference Result 156 states and 219 transitions. [2022-04-28 12:32:17,891 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 219 transitions. [2022-04-28 12:32:17,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:32:17,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:32:17,892 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 74 states have (on average 1.162162162162162) internal successors, (86), 81 states have internal predecessors, (86), 55 states have call successors, (55), 11 states have call predecessors, (55), 10 states have return successors, (53), 47 states have call predecessors, (53), 53 states have call successors, (53) Second operand 156 states. [2022-04-28 12:32:17,893 INFO L87 Difference]: Start difference. First operand has 140 states, 74 states have (on average 1.162162162162162) internal successors, (86), 81 states have internal predecessors, (86), 55 states have call successors, (55), 11 states have call predecessors, (55), 10 states have return successors, (53), 47 states have call predecessors, (53), 53 states have call successors, (53) Second operand 156 states. [2022-04-28 12:32:17,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:32:17,898 INFO L93 Difference]: Finished difference Result 156 states and 219 transitions. [2022-04-28 12:32:17,898 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 219 transitions. [2022-04-28 12:32:17,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:32:17,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:32:17,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:32:17,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:32:17,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 74 states have (on average 1.162162162162162) internal successors, (86), 81 states have internal predecessors, (86), 55 states have call successors, (55), 11 states have call predecessors, (55), 10 states have return successors, (53), 47 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-28 12:32:17,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2022-04-28 12:32:17,905 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 52 [2022-04-28 12:32:17,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:32:17,906 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2022-04-28 12:32:17,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 12:32:17,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 194 transitions. [2022-04-28 12:32:18,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:32:18,264 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2022-04-28 12:32:18,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 12:32:18,265 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:32:18,265 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:32:18,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-28 12:32:18,466 WARN L477 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-28 12:32:18,466 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:32:18,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:32:18,466 INFO L85 PathProgramCache]: Analyzing trace with hash 188363668, now seen corresponding path program 1 times [2022-04-28 12:32:18,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:32:18,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1691712382] [2022-04-28 12:32:18,467 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:32:18,467 INFO L85 PathProgramCache]: Analyzing trace with hash 188363668, now seen corresponding path program 2 times [2022-04-28 12:32:18,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:32:18,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493878011] [2022-04-28 12:32:18,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:32:18,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:32:18,485 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:32:18,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [646809636] [2022-04-28 12:32:18,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:32:18,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:32:18,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:32:18,486 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-28 12:32:18,499 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-28 12:32:18,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:32:18,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:32:18,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-28 12:32:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:32:18,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:32:19,335 INFO L272 TraceCheckUtils]: 0: Hoare triple {6637#true} call ULTIMATE.init(); {6637#true} is VALID [2022-04-28 12:32:19,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {6637#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {6637#true} is VALID [2022-04-28 12:32:19,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {6637#true} assume true; {6637#true} is VALID [2022-04-28 12:32:19,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6637#true} {6637#true} #112#return; {6637#true} is VALID [2022-04-28 12:32:19,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {6637#true} call #t~ret6 := main(); {6637#true} is VALID [2022-04-28 12:32:19,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {6637#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {6637#true} is VALID [2022-04-28 12:32:19,336 INFO L272 TraceCheckUtils]: 6: Hoare triple {6637#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {6637#true} is VALID [2022-04-28 12:32:19,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {6637#true} ~cond := #in~cond; {6637#true} is VALID [2022-04-28 12:32:19,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {6637#true} assume !(0 == ~cond); {6637#true} is VALID [2022-04-28 12:32:19,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {6637#true} assume true; {6637#true} is VALID [2022-04-28 12:32:19,337 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6637#true} {6637#true} #94#return; {6637#true} is VALID [2022-04-28 12:32:19,337 INFO L290 TraceCheckUtils]: 11: Hoare triple {6637#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6637#true} is VALID [2022-04-28 12:32:19,337 INFO L272 TraceCheckUtils]: 12: Hoare triple {6637#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {6637#true} is VALID [2022-04-28 12:32:19,337 INFO L290 TraceCheckUtils]: 13: Hoare triple {6637#true} ~cond := #in~cond; {6637#true} is VALID [2022-04-28 12:32:19,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {6637#true} assume !(0 == ~cond); {6637#true} is VALID [2022-04-28 12:32:19,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {6637#true} assume true; {6637#true} is VALID [2022-04-28 12:32:19,337 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6637#true} {6637#true} #96#return; {6637#true} is VALID [2022-04-28 12:32:19,337 INFO L272 TraceCheckUtils]: 17: Hoare triple {6637#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6637#true} is VALID [2022-04-28 12:32:19,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {6637#true} ~cond := #in~cond; {6637#true} is VALID [2022-04-28 12:32:19,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {6637#true} assume !(0 == ~cond); {6637#true} is VALID [2022-04-28 12:32:19,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {6637#true} assume true; {6637#true} is VALID [2022-04-28 12:32:19,338 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6637#true} {6637#true} #98#return; {6637#true} is VALID [2022-04-28 12:32:19,338 INFO L272 TraceCheckUtils]: 22: Hoare triple {6637#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6637#true} is VALID [2022-04-28 12:32:19,338 INFO L290 TraceCheckUtils]: 23: Hoare triple {6637#true} ~cond := #in~cond; {6637#true} is VALID [2022-04-28 12:32:19,338 INFO L290 TraceCheckUtils]: 24: Hoare triple {6637#true} assume !(0 == ~cond); {6637#true} is VALID [2022-04-28 12:32:19,338 INFO L290 TraceCheckUtils]: 25: Hoare triple {6637#true} assume true; {6637#true} is VALID [2022-04-28 12:32:19,338 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6637#true} {6637#true} #100#return; {6637#true} is VALID [2022-04-28 12:32:19,339 INFO L290 TraceCheckUtils]: 27: Hoare triple {6637#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {6723#(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-28 12:32:19,339 INFO L290 TraceCheckUtils]: 28: Hoare triple {6723#(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; {6723#(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-28 12:32:19,340 INFO L290 TraceCheckUtils]: 29: Hoare triple {6723#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {6730#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:32:19,341 INFO L290 TraceCheckUtils]: 30: Hoare triple {6730#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {6730#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:32:19,341 INFO L290 TraceCheckUtils]: 31: Hoare triple {6730#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {6737#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:32:19,342 INFO L290 TraceCheckUtils]: 32: Hoare triple {6737#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {6737#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:32:19,342 INFO L272 TraceCheckUtils]: 33: Hoare triple {6737#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6637#true} is VALID [2022-04-28 12:32:19,342 INFO L290 TraceCheckUtils]: 34: Hoare triple {6637#true} ~cond := #in~cond; {6747#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:32:19,343 INFO L290 TraceCheckUtils]: 35: Hoare triple {6747#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6751#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:32:19,343 INFO L290 TraceCheckUtils]: 36: Hoare triple {6751#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6751#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:32:19,344 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6751#(not (= |__VERIFIER_assert_#in~cond| 0))} {6737#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #102#return; {6758#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:32:19,344 INFO L272 TraceCheckUtils]: 38: Hoare triple {6758#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6637#true} is VALID [2022-04-28 12:32:19,345 INFO L290 TraceCheckUtils]: 39: Hoare triple {6637#true} ~cond := #in~cond; {6747#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:32:19,345 INFO L290 TraceCheckUtils]: 40: Hoare triple {6747#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6751#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:32:19,345 INFO L290 TraceCheckUtils]: 41: Hoare triple {6751#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6751#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:32:19,346 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6751#(not (= |__VERIFIER_assert_#in~cond| 0))} {6758#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #104#return; {6758#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:32:19,347 INFO L272 TraceCheckUtils]: 43: Hoare triple {6758#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {6637#true} is VALID [2022-04-28 12:32:19,347 INFO L290 TraceCheckUtils]: 44: Hoare triple {6637#true} ~cond := #in~cond; {6637#true} is VALID [2022-04-28 12:32:19,347 INFO L290 TraceCheckUtils]: 45: Hoare triple {6637#true} assume !(0 == ~cond); {6637#true} is VALID [2022-04-28 12:32:19,347 INFO L290 TraceCheckUtils]: 46: Hoare triple {6637#true} assume true; {6637#true} is VALID [2022-04-28 12:32:19,348 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6637#true} {6758#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #106#return; {6758#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:32:19,348 INFO L272 TraceCheckUtils]: 48: Hoare triple {6758#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {6637#true} is VALID [2022-04-28 12:32:19,348 INFO L290 TraceCheckUtils]: 49: Hoare triple {6637#true} ~cond := #in~cond; {6637#true} is VALID [2022-04-28 12:32:19,348 INFO L290 TraceCheckUtils]: 50: Hoare triple {6637#true} assume !(0 == ~cond); {6637#true} is VALID [2022-04-28 12:32:19,348 INFO L290 TraceCheckUtils]: 51: Hoare triple {6637#true} assume true; {6637#true} is VALID [2022-04-28 12:32:19,349 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6637#true} {6758#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #108#return; {6758#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:32:19,350 INFO L290 TraceCheckUtils]: 53: Hoare triple {6758#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {6758#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:32:19,351 INFO L290 TraceCheckUtils]: 54: Hoare triple {6758#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {6810#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 12:32:19,351 INFO L290 TraceCheckUtils]: 55: Hoare triple {6810#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {6810#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 12:32:19,352 INFO L290 TraceCheckUtils]: 56: Hoare triple {6810#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {6810#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 12:32:19,353 INFO L290 TraceCheckUtils]: 57: Hoare triple {6810#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {6820#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 12:32:19,353 INFO L290 TraceCheckUtils]: 58: Hoare triple {6820#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (+ main_~s~0 1) 0))} assume !false; {6820#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 12:32:19,354 INFO L290 TraceCheckUtils]: 59: Hoare triple {6820#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (+ main_~s~0 1) 0))} assume !(0 != ~b~0); {6827#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~s~0 1) 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0))} is VALID [2022-04-28 12:32:19,355 INFO L272 TraceCheckUtils]: 60: Hoare triple {6827#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~s~0 1) 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {6831#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:32:19,355 INFO L290 TraceCheckUtils]: 61: Hoare triple {6831#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6835#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:32:19,356 INFO L290 TraceCheckUtils]: 62: Hoare triple {6835#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6638#false} is VALID [2022-04-28 12:32:19,356 INFO L290 TraceCheckUtils]: 63: Hoare triple {6638#false} assume !false; {6638#false} is VALID [2022-04-28 12:32:19,356 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 12:32:19,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:32:58,617 INFO L290 TraceCheckUtils]: 63: Hoare triple {6638#false} assume !false; {6638#false} is VALID [2022-04-28 12:32:58,618 INFO L290 TraceCheckUtils]: 62: Hoare triple {6835#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6638#false} is VALID [2022-04-28 12:32:58,618 INFO L290 TraceCheckUtils]: 61: Hoare triple {6831#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6835#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:32:58,619 INFO L272 TraceCheckUtils]: 60: Hoare triple {6851#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {6831#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:32:58,620 INFO L290 TraceCheckUtils]: 59: Hoare triple {6855#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !(0 != ~b~0); {6851#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:32:58,620 INFO L290 TraceCheckUtils]: 58: Hoare triple {6855#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !false; {6855#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-28 12:32:59,310 INFO L290 TraceCheckUtils]: 57: Hoare triple {6862#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {6855#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-28 12:32:59,311 INFO L290 TraceCheckUtils]: 56: Hoare triple {6862#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {6862#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:32:59,311 INFO L290 TraceCheckUtils]: 55: Hoare triple {6862#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {6862#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:32:59,329 INFO L290 TraceCheckUtils]: 54: Hoare triple {6872#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {6862#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:32:59,330 INFO L290 TraceCheckUtils]: 53: Hoare triple {6872#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= 2 * ~v~0); {6872#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:32:59,330 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6637#true} {6872#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #108#return; {6872#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:32:59,330 INFO L290 TraceCheckUtils]: 51: Hoare triple {6637#true} assume true; {6637#true} is VALID [2022-04-28 12:32:59,331 INFO L290 TraceCheckUtils]: 50: Hoare triple {6637#true} assume !(0 == ~cond); {6637#true} is VALID [2022-04-28 12:32:59,331 INFO L290 TraceCheckUtils]: 49: Hoare triple {6637#true} ~cond := #in~cond; {6637#true} is VALID [2022-04-28 12:32:59,331 INFO L272 TraceCheckUtils]: 48: Hoare triple {6872#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {6637#true} is VALID [2022-04-28 12:32:59,331 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6637#true} {6872#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #106#return; {6872#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:32:59,332 INFO L290 TraceCheckUtils]: 46: Hoare triple {6637#true} assume true; {6637#true} is VALID [2022-04-28 12:32:59,332 INFO L290 TraceCheckUtils]: 45: Hoare triple {6637#true} assume !(0 == ~cond); {6637#true} is VALID [2022-04-28 12:32:59,332 INFO L290 TraceCheckUtils]: 44: Hoare triple {6637#true} ~cond := #in~cond; {6637#true} is VALID [2022-04-28 12:32:59,332 INFO L272 TraceCheckUtils]: 43: Hoare triple {6872#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {6637#true} is VALID [2022-04-28 12:32:59,333 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6751#(not (= |__VERIFIER_assert_#in~cond| 0))} {6909#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {6872#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:32:59,333 INFO L290 TraceCheckUtils]: 41: Hoare triple {6751#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6751#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:32:59,334 INFO L290 TraceCheckUtils]: 40: Hoare triple {6919#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6751#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:32:59,334 INFO L290 TraceCheckUtils]: 39: Hoare triple {6637#true} ~cond := #in~cond; {6919#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:32:59,334 INFO L272 TraceCheckUtils]: 38: Hoare triple {6909#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6637#true} is VALID [2022-04-28 12:32:59,335 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6751#(not (= |__VERIFIER_assert_#in~cond| 0))} {6926#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #102#return; {6909#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:32:59,335 INFO L290 TraceCheckUtils]: 36: Hoare triple {6751#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6751#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:32:59,336 INFO L290 TraceCheckUtils]: 35: Hoare triple {6919#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6751#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:32:59,336 INFO L290 TraceCheckUtils]: 34: Hoare triple {6637#true} ~cond := #in~cond; {6919#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:32:59,336 INFO L272 TraceCheckUtils]: 33: Hoare triple {6926#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6637#true} is VALID [2022-04-28 12:32:59,337 INFO L290 TraceCheckUtils]: 32: Hoare triple {6926#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {6926#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:32:59,338 INFO L290 TraceCheckUtils]: 31: Hoare triple {6945#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {6926#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:32:59,338 INFO L290 TraceCheckUtils]: 30: Hoare triple {6945#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} assume !false; {6945#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-28 12:32:59,339 INFO L290 TraceCheckUtils]: 29: Hoare triple {6637#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {6945#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-28 12:32:59,339 INFO L290 TraceCheckUtils]: 28: Hoare triple {6637#true} assume !false; {6637#true} is VALID [2022-04-28 12:32:59,339 INFO L290 TraceCheckUtils]: 27: Hoare triple {6637#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {6637#true} is VALID [2022-04-28 12:32:59,339 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6637#true} {6637#true} #100#return; {6637#true} is VALID [2022-04-28 12:32:59,339 INFO L290 TraceCheckUtils]: 25: Hoare triple {6637#true} assume true; {6637#true} is VALID [2022-04-28 12:32:59,339 INFO L290 TraceCheckUtils]: 24: Hoare triple {6637#true} assume !(0 == ~cond); {6637#true} is VALID [2022-04-28 12:32:59,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {6637#true} ~cond := #in~cond; {6637#true} is VALID [2022-04-28 12:32:59,340 INFO L272 TraceCheckUtils]: 22: Hoare triple {6637#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6637#true} is VALID [2022-04-28 12:32:59,340 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6637#true} {6637#true} #98#return; {6637#true} is VALID [2022-04-28 12:32:59,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {6637#true} assume true; {6637#true} is VALID [2022-04-28 12:32:59,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {6637#true} assume !(0 == ~cond); {6637#true} is VALID [2022-04-28 12:32:59,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {6637#true} ~cond := #in~cond; {6637#true} is VALID [2022-04-28 12:32:59,340 INFO L272 TraceCheckUtils]: 17: Hoare triple {6637#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6637#true} is VALID [2022-04-28 12:32:59,340 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6637#true} {6637#true} #96#return; {6637#true} is VALID [2022-04-28 12:32:59,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {6637#true} assume true; {6637#true} is VALID [2022-04-28 12:32:59,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {6637#true} assume !(0 == ~cond); {6637#true} is VALID [2022-04-28 12:32:59,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {6637#true} ~cond := #in~cond; {6637#true} is VALID [2022-04-28 12:32:59,341 INFO L272 TraceCheckUtils]: 12: Hoare triple {6637#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {6637#true} is VALID [2022-04-28 12:32:59,341 INFO L290 TraceCheckUtils]: 11: Hoare triple {6637#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6637#true} is VALID [2022-04-28 12:32:59,341 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6637#true} {6637#true} #94#return; {6637#true} is VALID [2022-04-28 12:32:59,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {6637#true} assume true; {6637#true} is VALID [2022-04-28 12:32:59,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {6637#true} assume !(0 == ~cond); {6637#true} is VALID [2022-04-28 12:32:59,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {6637#true} ~cond := #in~cond; {6637#true} is VALID [2022-04-28 12:32:59,341 INFO L272 TraceCheckUtils]: 6: Hoare triple {6637#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {6637#true} is VALID [2022-04-28 12:32:59,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {6637#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {6637#true} is VALID [2022-04-28 12:32:59,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {6637#true} call #t~ret6 := main(); {6637#true} is VALID [2022-04-28 12:32:59,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6637#true} {6637#true} #112#return; {6637#true} is VALID [2022-04-28 12:32:59,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {6637#true} assume true; {6637#true} is VALID [2022-04-28 12:32:59,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {6637#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {6637#true} is VALID [2022-04-28 12:32:59,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {6637#true} call ULTIMATE.init(); {6637#true} is VALID [2022-04-28 12:32:59,342 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 12:32:59,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:32:59,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493878011] [2022-04-28 12:32:59,343 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:32:59,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646809636] [2022-04-28 12:32:59,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646809636] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:32:59,343 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:32:59,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2022-04-28 12:32:59,343 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:32:59,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1691712382] [2022-04-28 12:32:59,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1691712382] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:32:59,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:32:59,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 12:32:59,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865630516] [2022-04-28 12:32:59,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:32:59,344 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 64 [2022-04-28 12:32:59,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:32:59,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 12:32:59,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:32:59,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 12:32:59,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:32:59,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 12:32:59,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-04-28 12:32:59,386 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 12:33:01,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:33:01,667 INFO L93 Difference]: Finished difference Result 200 states and 283 transitions. [2022-04-28 12:33:01,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 12:33:01,667 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 64 [2022-04-28 12:33:01,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:33:01,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 12:33:01,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 131 transitions. [2022-04-28 12:33:01,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 12:33:01,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 131 transitions. [2022-04-28 12:33:01,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 131 transitions. [2022-04-28 12:33:01,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:33:01,809 INFO L225 Difference]: With dead ends: 200 [2022-04-28 12:33:01,809 INFO L226 Difference]: Without dead ends: 197 [2022-04-28 12:33:01,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-04-28 12:33:01,810 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 53 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 12:33:01,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 310 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 12:33:01,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-28 12:33:02,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 193. [2022-04-28 12:33:02,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:33:02,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 193 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 110 states have internal predecessors, (119), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 69 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:33:02,317 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 193 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 110 states have internal predecessors, (119), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 69 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:33:02,318 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 193 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 110 states have internal predecessors, (119), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 69 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:33:02,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:33:02,326 INFO L93 Difference]: Finished difference Result 197 states and 279 transitions. [2022-04-28 12:33:02,326 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 279 transitions. [2022-04-28 12:33:02,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:33:02,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:33:02,328 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 110 states have internal predecessors, (119), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 69 states have call predecessors, (77), 77 states have call successors, (77) Second operand 197 states. [2022-04-28 12:33:02,328 INFO L87 Difference]: Start difference. First operand has 193 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 110 states have internal predecessors, (119), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 69 states have call predecessors, (77), 77 states have call successors, (77) Second operand 197 states. [2022-04-28 12:33:02,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:33:02,337 INFO L93 Difference]: Finished difference Result 197 states and 279 transitions. [2022-04-28 12:33:02,337 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 279 transitions. [2022-04-28 12:33:02,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:33:02,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:33:02,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:33:02,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:33:02,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 110 states have internal predecessors, (119), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 69 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:33:02,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 275 transitions. [2022-04-28 12:33:02,347 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 275 transitions. Word has length 64 [2022-04-28 12:33:02,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:33:02,348 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 275 transitions. [2022-04-28 12:33:02,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 12:33:02,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 193 states and 275 transitions. [2022-04-28 12:33:02,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 275 edges. 275 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:33:02,743 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 275 transitions. [2022-04-28 12:33:02,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 12:33:02,744 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:33:02,744 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:33:02,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-28 12:33:02,944 WARN L477 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-28 12:33:02,944 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:33:02,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:33:02,945 INFO L85 PathProgramCache]: Analyzing trace with hash -368004398, now seen corresponding path program 3 times [2022-04-28 12:33:02,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:33:02,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [664859274] [2022-04-28 12:33:02,945 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:33:02,945 INFO L85 PathProgramCache]: Analyzing trace with hash -368004398, now seen corresponding path program 4 times [2022-04-28 12:33:02,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:33:02,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707679628] [2022-04-28 12:33:02,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:33:02,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:33:02,969 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:33:02,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [569889339] [2022-04-28 12:33:02,970 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:33:02,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:33:02,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:33:02,981 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-28 12:33:02,983 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-28 12:33:03,033 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:33:03,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:33:03,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 12:33:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:33:03,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:33:03,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {8229#true} call ULTIMATE.init(); {8229#true} is VALID [2022-04-28 12:33:03,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {8229#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {8229#true} is VALID [2022-04-28 12:33:03,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {8229#true} assume true; {8229#true} is VALID [2022-04-28 12:33:03,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8229#true} {8229#true} #112#return; {8229#true} is VALID [2022-04-28 12:33:03,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {8229#true} call #t~ret6 := main(); {8229#true} is VALID [2022-04-28 12:33:03,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {8229#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {8229#true} is VALID [2022-04-28 12:33:03,305 INFO L272 TraceCheckUtils]: 6: Hoare triple {8229#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {8229#true} is VALID [2022-04-28 12:33:03,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {8229#true} ~cond := #in~cond; {8229#true} is VALID [2022-04-28 12:33:03,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {8229#true} assume !(0 == ~cond); {8229#true} is VALID [2022-04-28 12:33:03,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {8229#true} assume true; {8229#true} is VALID [2022-04-28 12:33:03,306 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8229#true} {8229#true} #94#return; {8229#true} is VALID [2022-04-28 12:33:03,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {8229#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8229#true} is VALID [2022-04-28 12:33:03,306 INFO L272 TraceCheckUtils]: 12: Hoare triple {8229#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {8229#true} is VALID [2022-04-28 12:33:03,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {8229#true} ~cond := #in~cond; {8229#true} is VALID [2022-04-28 12:33:03,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {8229#true} assume !(0 == ~cond); {8229#true} is VALID [2022-04-28 12:33:03,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {8229#true} assume true; {8229#true} is VALID [2022-04-28 12:33:03,306 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8229#true} {8229#true} #96#return; {8229#true} is VALID [2022-04-28 12:33:03,307 INFO L272 TraceCheckUtils]: 17: Hoare triple {8229#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8229#true} is VALID [2022-04-28 12:33:03,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {8229#true} ~cond := #in~cond; {8229#true} is VALID [2022-04-28 12:33:03,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {8229#true} assume !(0 == ~cond); {8229#true} is VALID [2022-04-28 12:33:03,307 INFO L290 TraceCheckUtils]: 20: Hoare triple {8229#true} assume true; {8229#true} is VALID [2022-04-28 12:33:03,307 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8229#true} {8229#true} #98#return; {8229#true} is VALID [2022-04-28 12:33:03,307 INFO L272 TraceCheckUtils]: 22: Hoare triple {8229#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8229#true} is VALID [2022-04-28 12:33:03,307 INFO L290 TraceCheckUtils]: 23: Hoare triple {8229#true} ~cond := #in~cond; {8229#true} is VALID [2022-04-28 12:33:03,307 INFO L290 TraceCheckUtils]: 24: Hoare triple {8229#true} assume !(0 == ~cond); {8229#true} is VALID [2022-04-28 12:33:03,307 INFO L290 TraceCheckUtils]: 25: Hoare triple {8229#true} assume true; {8229#true} is VALID [2022-04-28 12:33:03,307 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8229#true} {8229#true} #100#return; {8229#true} is VALID [2022-04-28 12:33:03,308 INFO L290 TraceCheckUtils]: 27: Hoare triple {8229#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {8229#true} is VALID [2022-04-28 12:33:03,308 INFO L290 TraceCheckUtils]: 28: Hoare triple {8229#true} assume !false; {8229#true} is VALID [2022-04-28 12:33:03,308 INFO L290 TraceCheckUtils]: 29: Hoare triple {8229#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {8229#true} is VALID [2022-04-28 12:33:03,308 INFO L290 TraceCheckUtils]: 30: Hoare triple {8229#true} assume !false; {8229#true} is VALID [2022-04-28 12:33:03,308 INFO L290 TraceCheckUtils]: 31: Hoare triple {8229#true} assume !(~c~0 >= ~b~0); {8327#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:33:03,309 INFO L290 TraceCheckUtils]: 32: Hoare triple {8327#(not (<= main_~b~0 main_~c~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {8331#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 12:33:03,309 INFO L290 TraceCheckUtils]: 33: Hoare triple {8331#(< main_~b~0 main_~a~0)} assume !false; {8331#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 12:33:03,309 INFO L290 TraceCheckUtils]: 34: Hoare triple {8331#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {8338#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:33:03,310 INFO L290 TraceCheckUtils]: 35: Hoare triple {8338#(< main_~b~0 main_~c~0)} assume !false; {8338#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:33:03,310 INFO L290 TraceCheckUtils]: 36: Hoare triple {8338#(< main_~b~0 main_~c~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {8345#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:33:03,311 INFO L290 TraceCheckUtils]: 37: Hoare triple {8345#(< main_~v~0 main_~c~0)} assume !false; {8345#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:33:03,311 INFO L272 TraceCheckUtils]: 38: Hoare triple {8345#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8229#true} is VALID [2022-04-28 12:33:03,311 INFO L290 TraceCheckUtils]: 39: Hoare triple {8229#true} ~cond := #in~cond; {8229#true} is VALID [2022-04-28 12:33:03,311 INFO L290 TraceCheckUtils]: 40: Hoare triple {8229#true} assume !(0 == ~cond); {8229#true} is VALID [2022-04-28 12:33:03,311 INFO L290 TraceCheckUtils]: 41: Hoare triple {8229#true} assume true; {8229#true} is VALID [2022-04-28 12:33:03,312 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8229#true} {8345#(< main_~v~0 main_~c~0)} #102#return; {8345#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:33:03,312 INFO L272 TraceCheckUtils]: 43: Hoare triple {8345#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8229#true} is VALID [2022-04-28 12:33:03,312 INFO L290 TraceCheckUtils]: 44: Hoare triple {8229#true} ~cond := #in~cond; {8229#true} is VALID [2022-04-28 12:33:03,312 INFO L290 TraceCheckUtils]: 45: Hoare triple {8229#true} assume !(0 == ~cond); {8229#true} is VALID [2022-04-28 12:33:03,312 INFO L290 TraceCheckUtils]: 46: Hoare triple {8229#true} assume true; {8229#true} is VALID [2022-04-28 12:33:03,313 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8229#true} {8345#(< main_~v~0 main_~c~0)} #104#return; {8345#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:33:03,313 INFO L272 TraceCheckUtils]: 48: Hoare triple {8345#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8229#true} is VALID [2022-04-28 12:33:03,313 INFO L290 TraceCheckUtils]: 49: Hoare triple {8229#true} ~cond := #in~cond; {8229#true} is VALID [2022-04-28 12:33:03,313 INFO L290 TraceCheckUtils]: 50: Hoare triple {8229#true} assume !(0 == ~cond); {8229#true} is VALID [2022-04-28 12:33:03,313 INFO L290 TraceCheckUtils]: 51: Hoare triple {8229#true} assume true; {8229#true} is VALID [2022-04-28 12:33:03,314 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8229#true} {8345#(< main_~v~0 main_~c~0)} #106#return; {8345#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:33:03,314 INFO L272 TraceCheckUtils]: 53: Hoare triple {8345#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {8229#true} is VALID [2022-04-28 12:33:03,314 INFO L290 TraceCheckUtils]: 54: Hoare triple {8229#true} ~cond := #in~cond; {8229#true} is VALID [2022-04-28 12:33:03,314 INFO L290 TraceCheckUtils]: 55: Hoare triple {8229#true} assume !(0 == ~cond); {8229#true} is VALID [2022-04-28 12:33:03,315 INFO L290 TraceCheckUtils]: 56: Hoare triple {8229#true} assume true; {8229#true} is VALID [2022-04-28 12:33:03,315 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {8229#true} {8345#(< main_~v~0 main_~c~0)} #108#return; {8345#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:33:03,316 INFO L290 TraceCheckUtils]: 58: Hoare triple {8345#(< main_~v~0 main_~c~0)} assume !(~c~0 >= 2 * ~v~0); {8345#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:33:03,316 INFO L290 TraceCheckUtils]: 59: Hoare triple {8345#(< main_~v~0 main_~c~0)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {8415#(< 0 main_~c~0)} is VALID [2022-04-28 12:33:03,317 INFO L290 TraceCheckUtils]: 60: Hoare triple {8415#(< 0 main_~c~0)} assume !false; {8415#(< 0 main_~c~0)} is VALID [2022-04-28 12:33:03,317 INFO L290 TraceCheckUtils]: 61: Hoare triple {8415#(< 0 main_~c~0)} assume !(~c~0 >= ~b~0); {8415#(< 0 main_~c~0)} is VALID [2022-04-28 12:33:03,318 INFO L290 TraceCheckUtils]: 62: Hoare triple {8415#(< 0 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {8425#(< 0 main_~b~0)} is VALID [2022-04-28 12:33:03,318 INFO L290 TraceCheckUtils]: 63: Hoare triple {8425#(< 0 main_~b~0)} assume !false; {8425#(< 0 main_~b~0)} is VALID [2022-04-28 12:33:03,318 INFO L290 TraceCheckUtils]: 64: Hoare triple {8425#(< 0 main_~b~0)} assume !(0 != ~b~0); {8230#false} is VALID [2022-04-28 12:33:03,318 INFO L272 TraceCheckUtils]: 65: Hoare triple {8230#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {8230#false} is VALID [2022-04-28 12:33:03,318 INFO L290 TraceCheckUtils]: 66: Hoare triple {8230#false} ~cond := #in~cond; {8230#false} is VALID [2022-04-28 12:33:03,319 INFO L290 TraceCheckUtils]: 67: Hoare triple {8230#false} assume 0 == ~cond; {8230#false} is VALID [2022-04-28 12:33:03,319 INFO L290 TraceCheckUtils]: 68: Hoare triple {8230#false} assume !false; {8230#false} is VALID [2022-04-28 12:33:03,319 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 12:33:03,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:33:03,570 INFO L290 TraceCheckUtils]: 68: Hoare triple {8230#false} assume !false; {8230#false} is VALID [2022-04-28 12:33:03,570 INFO L290 TraceCheckUtils]: 67: Hoare triple {8230#false} assume 0 == ~cond; {8230#false} is VALID [2022-04-28 12:33:03,570 INFO L290 TraceCheckUtils]: 66: Hoare triple {8230#false} ~cond := #in~cond; {8230#false} is VALID [2022-04-28 12:33:03,570 INFO L272 TraceCheckUtils]: 65: Hoare triple {8230#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {8230#false} is VALID [2022-04-28 12:33:03,571 INFO L290 TraceCheckUtils]: 64: Hoare triple {8425#(< 0 main_~b~0)} assume !(0 != ~b~0); {8230#false} is VALID [2022-04-28 12:33:03,571 INFO L290 TraceCheckUtils]: 63: Hoare triple {8425#(< 0 main_~b~0)} assume !false; {8425#(< 0 main_~b~0)} is VALID [2022-04-28 12:33:03,571 INFO L290 TraceCheckUtils]: 62: Hoare triple {8415#(< 0 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {8425#(< 0 main_~b~0)} is VALID [2022-04-28 12:33:03,572 INFO L290 TraceCheckUtils]: 61: Hoare triple {8415#(< 0 main_~c~0)} assume !(~c~0 >= ~b~0); {8415#(< 0 main_~c~0)} is VALID [2022-04-28 12:33:03,572 INFO L290 TraceCheckUtils]: 60: Hoare triple {8415#(< 0 main_~c~0)} assume !false; {8415#(< 0 main_~c~0)} is VALID [2022-04-28 12:33:03,572 INFO L290 TraceCheckUtils]: 59: Hoare triple {8345#(< main_~v~0 main_~c~0)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {8415#(< 0 main_~c~0)} is VALID [2022-04-28 12:33:03,573 INFO L290 TraceCheckUtils]: 58: Hoare triple {8345#(< main_~v~0 main_~c~0)} assume !(~c~0 >= 2 * ~v~0); {8345#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:33:03,573 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {8229#true} {8345#(< main_~v~0 main_~c~0)} #108#return; {8345#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:33:03,573 INFO L290 TraceCheckUtils]: 56: Hoare triple {8229#true} assume true; {8229#true} is VALID [2022-04-28 12:33:03,573 INFO L290 TraceCheckUtils]: 55: Hoare triple {8229#true} assume !(0 == ~cond); {8229#true} is VALID [2022-04-28 12:33:03,573 INFO L290 TraceCheckUtils]: 54: Hoare triple {8229#true} ~cond := #in~cond; {8229#true} is VALID [2022-04-28 12:33:03,574 INFO L272 TraceCheckUtils]: 53: Hoare triple {8345#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {8229#true} is VALID [2022-04-28 12:33:03,574 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8229#true} {8345#(< main_~v~0 main_~c~0)} #106#return; {8345#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:33:03,574 INFO L290 TraceCheckUtils]: 51: Hoare triple {8229#true} assume true; {8229#true} is VALID [2022-04-28 12:33:03,574 INFO L290 TraceCheckUtils]: 50: Hoare triple {8229#true} assume !(0 == ~cond); {8229#true} is VALID [2022-04-28 12:33:03,574 INFO L290 TraceCheckUtils]: 49: Hoare triple {8229#true} ~cond := #in~cond; {8229#true} is VALID [2022-04-28 12:33:03,574 INFO L272 TraceCheckUtils]: 48: Hoare triple {8345#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8229#true} is VALID [2022-04-28 12:33:03,575 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8229#true} {8345#(< main_~v~0 main_~c~0)} #104#return; {8345#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:33:03,575 INFO L290 TraceCheckUtils]: 46: Hoare triple {8229#true} assume true; {8229#true} is VALID [2022-04-28 12:33:03,575 INFO L290 TraceCheckUtils]: 45: Hoare triple {8229#true} assume !(0 == ~cond); {8229#true} is VALID [2022-04-28 12:33:03,575 INFO L290 TraceCheckUtils]: 44: Hoare triple {8229#true} ~cond := #in~cond; {8229#true} is VALID [2022-04-28 12:33:03,575 INFO L272 TraceCheckUtils]: 43: Hoare triple {8345#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8229#true} is VALID [2022-04-28 12:33:03,576 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8229#true} {8345#(< main_~v~0 main_~c~0)} #102#return; {8345#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:33:03,576 INFO L290 TraceCheckUtils]: 41: Hoare triple {8229#true} assume true; {8229#true} is VALID [2022-04-28 12:33:03,576 INFO L290 TraceCheckUtils]: 40: Hoare triple {8229#true} assume !(0 == ~cond); {8229#true} is VALID [2022-04-28 12:33:03,576 INFO L290 TraceCheckUtils]: 39: Hoare triple {8229#true} ~cond := #in~cond; {8229#true} is VALID [2022-04-28 12:33:03,576 INFO L272 TraceCheckUtils]: 38: Hoare triple {8345#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8229#true} is VALID [2022-04-28 12:33:03,576 INFO L290 TraceCheckUtils]: 37: Hoare triple {8345#(< main_~v~0 main_~c~0)} assume !false; {8345#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:33:03,577 INFO L290 TraceCheckUtils]: 36: Hoare triple {8338#(< main_~b~0 main_~c~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {8345#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:33:03,577 INFO L290 TraceCheckUtils]: 35: Hoare triple {8338#(< main_~b~0 main_~c~0)} assume !false; {8338#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:33:03,577 INFO L290 TraceCheckUtils]: 34: Hoare triple {8331#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {8338#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:33:03,578 INFO L290 TraceCheckUtils]: 33: Hoare triple {8331#(< main_~b~0 main_~a~0)} assume !false; {8331#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 12:33:03,578 INFO L290 TraceCheckUtils]: 32: Hoare triple {8327#(not (<= main_~b~0 main_~c~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {8331#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 12:33:03,578 INFO L290 TraceCheckUtils]: 31: Hoare triple {8229#true} assume !(~c~0 >= ~b~0); {8327#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:33:03,578 INFO L290 TraceCheckUtils]: 30: Hoare triple {8229#true} assume !false; {8229#true} is VALID [2022-04-28 12:33:03,579 INFO L290 TraceCheckUtils]: 29: Hoare triple {8229#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {8229#true} is VALID [2022-04-28 12:33:03,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {8229#true} assume !false; {8229#true} is VALID [2022-04-28 12:33:03,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {8229#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {8229#true} is VALID [2022-04-28 12:33:03,579 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8229#true} {8229#true} #100#return; {8229#true} is VALID [2022-04-28 12:33:03,579 INFO L290 TraceCheckUtils]: 25: Hoare triple {8229#true} assume true; {8229#true} is VALID [2022-04-28 12:33:03,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {8229#true} assume !(0 == ~cond); {8229#true} is VALID [2022-04-28 12:33:03,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {8229#true} ~cond := #in~cond; {8229#true} is VALID [2022-04-28 12:33:03,579 INFO L272 TraceCheckUtils]: 22: Hoare triple {8229#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8229#true} is VALID [2022-04-28 12:33:03,579 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8229#true} {8229#true} #98#return; {8229#true} is VALID [2022-04-28 12:33:03,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {8229#true} assume true; {8229#true} is VALID [2022-04-28 12:33:03,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {8229#true} assume !(0 == ~cond); {8229#true} is VALID [2022-04-28 12:33:03,579 INFO L290 TraceCheckUtils]: 18: Hoare triple {8229#true} ~cond := #in~cond; {8229#true} is VALID [2022-04-28 12:33:03,579 INFO L272 TraceCheckUtils]: 17: Hoare triple {8229#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8229#true} is VALID [2022-04-28 12:33:03,580 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8229#true} {8229#true} #96#return; {8229#true} is VALID [2022-04-28 12:33:03,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {8229#true} assume true; {8229#true} is VALID [2022-04-28 12:33:03,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {8229#true} assume !(0 == ~cond); {8229#true} is VALID [2022-04-28 12:33:03,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {8229#true} ~cond := #in~cond; {8229#true} is VALID [2022-04-28 12:33:03,580 INFO L272 TraceCheckUtils]: 12: Hoare triple {8229#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {8229#true} is VALID [2022-04-28 12:33:03,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {8229#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8229#true} is VALID [2022-04-28 12:33:03,580 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8229#true} {8229#true} #94#return; {8229#true} is VALID [2022-04-28 12:33:03,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {8229#true} assume true; {8229#true} is VALID [2022-04-28 12:33:03,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {8229#true} assume !(0 == ~cond); {8229#true} is VALID [2022-04-28 12:33:03,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {8229#true} ~cond := #in~cond; {8229#true} is VALID [2022-04-28 12:33:03,580 INFO L272 TraceCheckUtils]: 6: Hoare triple {8229#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {8229#true} is VALID [2022-04-28 12:33:03,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {8229#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {8229#true} is VALID [2022-04-28 12:33:03,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {8229#true} call #t~ret6 := main(); {8229#true} is VALID [2022-04-28 12:33:03,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8229#true} {8229#true} #112#return; {8229#true} is VALID [2022-04-28 12:33:03,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {8229#true} assume true; {8229#true} is VALID [2022-04-28 12:33:03,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {8229#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {8229#true} is VALID [2022-04-28 12:33:03,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {8229#true} call ULTIMATE.init(); {8229#true} is VALID [2022-04-28 12:33:03,581 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 12:33:03,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:33:03,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707679628] [2022-04-28 12:33:03,581 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:33:03,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569889339] [2022-04-28 12:33:03,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569889339] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:33:03,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:33:03,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-28 12:33:03,582 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:33:03,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [664859274] [2022-04-28 12:33:03,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [664859274] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:33:03,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:33:03,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:33:03,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383861183] [2022-04-28 12:33:03,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:33:03,583 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 69 [2022-04-28 12:33:03,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:33:03,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 12:33:03,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:33:03,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:33:03,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:33:03,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:33:03,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-28 12:33:03,619 INFO L87 Difference]: Start difference. First operand 193 states and 275 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 12:33:05,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:33:05,656 INFO L93 Difference]: Finished difference Result 288 states and 424 transitions. [2022-04-28 12:33:05,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 12:33:05,657 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 69 [2022-04-28 12:33:05,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:33:05,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 12:33:05,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 158 transitions. [2022-04-28 12:33:05,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 12:33:05,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 158 transitions. [2022-04-28 12:33:05,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 158 transitions. [2022-04-28 12:33:05,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:33:05,809 INFO L225 Difference]: With dead ends: 288 [2022-04-28 12:33:05,809 INFO L226 Difference]: Without dead ends: 281 [2022-04-28 12:33:05,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2022-04-28 12:33:05,810 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 46 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 12:33:05,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 318 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 12:33:05,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-04-28 12:33:06,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 208. [2022-04-28 12:33:06,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:33:06,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 281 states. Second operand has 208 states, 116 states have (on average 1.206896551724138) internal successors, (140), 122 states have internal predecessors, (140), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:33:06,369 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand has 208 states, 116 states have (on average 1.206896551724138) internal successors, (140), 122 states have internal predecessors, (140), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:33:06,369 INFO L87 Difference]: Start difference. First operand 281 states. Second operand has 208 states, 116 states have (on average 1.206896551724138) internal successors, (140), 122 states have internal predecessors, (140), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:33:06,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:33:06,383 INFO L93 Difference]: Finished difference Result 281 states and 417 transitions. [2022-04-28 12:33:06,383 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 417 transitions. [2022-04-28 12:33:06,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:33:06,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:33:06,385 INFO L74 IsIncluded]: Start isIncluded. First operand has 208 states, 116 states have (on average 1.206896551724138) internal successors, (140), 122 states have internal predecessors, (140), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) Second operand 281 states. [2022-04-28 12:33:06,385 INFO L87 Difference]: Start difference. First operand has 208 states, 116 states have (on average 1.206896551724138) internal successors, (140), 122 states have internal predecessors, (140), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) Second operand 281 states. [2022-04-28 12:33:06,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:33:06,398 INFO L93 Difference]: Finished difference Result 281 states and 417 transitions. [2022-04-28 12:33:06,399 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 417 transitions. [2022-04-28 12:33:06,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:33:06,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:33:06,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:33:06,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:33:06,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 116 states have (on average 1.206896551724138) internal successors, (140), 122 states have internal predecessors, (140), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:33:06,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 296 transitions. [2022-04-28 12:33:06,410 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 296 transitions. Word has length 69 [2022-04-28 12:33:06,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:33:06,410 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 296 transitions. [2022-04-28 12:33:06,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 12:33:06,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 208 states and 296 transitions. [2022-04-28 12:33:06,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:33:06,876 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 296 transitions. [2022-04-28 12:33:06,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-28 12:33:06,877 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:33:06,877 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:33:06,893 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-28 12:33:07,078 WARN L477 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-28 12:33:07,078 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:33:07,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:33:07,079 INFO L85 PathProgramCache]: Analyzing trace with hash -298771846, now seen corresponding path program 1 times [2022-04-28 12:33:07,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:33:07,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1386260061] [2022-04-28 12:33:07,079 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:33:07,079 INFO L85 PathProgramCache]: Analyzing trace with hash -298771846, now seen corresponding path program 2 times [2022-04-28 12:33:07,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:33:07,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764021851] [2022-04-28 12:33:07,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:33:07,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:33:07,097 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:33:07,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1073867103] [2022-04-28 12:33:07,099 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:33:07,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:33:07,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:33:07,100 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-28 12:33:07,104 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-28 12:33:07,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:33:07,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:33:07,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 12:33:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:33:07,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:33:07,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {10231#true} call ULTIMATE.init(); {10231#true} is VALID [2022-04-28 12:33:07,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {10231#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {10231#true} is VALID [2022-04-28 12:33:07,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {10231#true} assume true; {10231#true} is VALID [2022-04-28 12:33:07,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10231#true} {10231#true} #112#return; {10231#true} is VALID [2022-04-28 12:33:07,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {10231#true} call #t~ret6 := main(); {10231#true} is VALID [2022-04-28 12:33:07,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {10231#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {10231#true} is VALID [2022-04-28 12:33:07,371 INFO L272 TraceCheckUtils]: 6: Hoare triple {10231#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {10231#true} is VALID [2022-04-28 12:33:07,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {10231#true} ~cond := #in~cond; {10231#true} is VALID [2022-04-28 12:33:07,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {10231#true} assume !(0 == ~cond); {10231#true} is VALID [2022-04-28 12:33:07,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {10231#true} assume true; {10231#true} is VALID [2022-04-28 12:33:07,372 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10231#true} {10231#true} #94#return; {10231#true} is VALID [2022-04-28 12:33:07,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {10231#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10231#true} is VALID [2022-04-28 12:33:07,372 INFO L272 TraceCheckUtils]: 12: Hoare triple {10231#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {10231#true} is VALID [2022-04-28 12:33:07,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {10231#true} ~cond := #in~cond; {10231#true} is VALID [2022-04-28 12:33:07,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {10231#true} assume !(0 == ~cond); {10231#true} is VALID [2022-04-28 12:33:07,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {10231#true} assume true; {10231#true} is VALID [2022-04-28 12:33:07,372 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10231#true} {10231#true} #96#return; {10231#true} is VALID [2022-04-28 12:33:07,372 INFO L272 TraceCheckUtils]: 17: Hoare triple {10231#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10231#true} is VALID [2022-04-28 12:33:07,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {10231#true} ~cond := #in~cond; {10231#true} is VALID [2022-04-28 12:33:07,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {10231#true} assume !(0 == ~cond); {10231#true} is VALID [2022-04-28 12:33:07,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {10231#true} assume true; {10231#true} is VALID [2022-04-28 12:33:07,372 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10231#true} {10231#true} #98#return; {10231#true} is VALID [2022-04-28 12:33:07,372 INFO L272 TraceCheckUtils]: 22: Hoare triple {10231#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10231#true} is VALID [2022-04-28 12:33:07,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {10231#true} ~cond := #in~cond; {10231#true} is VALID [2022-04-28 12:33:07,373 INFO L290 TraceCheckUtils]: 24: Hoare triple {10231#true} assume !(0 == ~cond); {10231#true} is VALID [2022-04-28 12:33:07,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {10231#true} assume true; {10231#true} is VALID [2022-04-28 12:33:07,373 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10231#true} {10231#true} #100#return; {10231#true} is VALID [2022-04-28 12:33:07,373 INFO L290 TraceCheckUtils]: 27: Hoare triple {10231#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {10231#true} is VALID [2022-04-28 12:33:07,373 INFO L290 TraceCheckUtils]: 28: Hoare triple {10231#true} assume !false; {10231#true} is VALID [2022-04-28 12:33:07,373 INFO L290 TraceCheckUtils]: 29: Hoare triple {10231#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {10231#true} is VALID [2022-04-28 12:33:07,373 INFO L290 TraceCheckUtils]: 30: Hoare triple {10231#true} assume !false; {10231#true} is VALID [2022-04-28 12:33:07,373 INFO L290 TraceCheckUtils]: 31: Hoare triple {10231#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {10329#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 12:33:07,374 INFO L290 TraceCheckUtils]: 32: Hoare triple {10329#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} assume !false; {10329#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 12:33:07,374 INFO L272 TraceCheckUtils]: 33: Hoare triple {10329#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10231#true} is VALID [2022-04-28 12:33:07,374 INFO L290 TraceCheckUtils]: 34: Hoare triple {10231#true} ~cond := #in~cond; {10231#true} is VALID [2022-04-28 12:33:07,374 INFO L290 TraceCheckUtils]: 35: Hoare triple {10231#true} assume !(0 == ~cond); {10231#true} is VALID [2022-04-28 12:33:07,374 INFO L290 TraceCheckUtils]: 36: Hoare triple {10231#true} assume true; {10231#true} is VALID [2022-04-28 12:33:07,375 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {10231#true} {10329#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #102#return; {10329#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 12:33:07,375 INFO L272 TraceCheckUtils]: 38: Hoare triple {10329#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10231#true} is VALID [2022-04-28 12:33:07,375 INFO L290 TraceCheckUtils]: 39: Hoare triple {10231#true} ~cond := #in~cond; {10231#true} is VALID [2022-04-28 12:33:07,375 INFO L290 TraceCheckUtils]: 40: Hoare triple {10231#true} assume !(0 == ~cond); {10231#true} is VALID [2022-04-28 12:33:07,375 INFO L290 TraceCheckUtils]: 41: Hoare triple {10231#true} assume true; {10231#true} is VALID [2022-04-28 12:33:07,376 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10231#true} {10329#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #104#return; {10329#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 12:33:07,376 INFO L272 TraceCheckUtils]: 43: Hoare triple {10329#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10231#true} is VALID [2022-04-28 12:33:07,376 INFO L290 TraceCheckUtils]: 44: Hoare triple {10231#true} ~cond := #in~cond; {10231#true} is VALID [2022-04-28 12:33:07,376 INFO L290 TraceCheckUtils]: 45: Hoare triple {10231#true} assume !(0 == ~cond); {10231#true} is VALID [2022-04-28 12:33:07,376 INFO L290 TraceCheckUtils]: 46: Hoare triple {10231#true} assume true; {10231#true} is VALID [2022-04-28 12:33:07,376 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10231#true} {10329#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #106#return; {10329#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 12:33:07,377 INFO L272 TraceCheckUtils]: 48: Hoare triple {10329#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {10231#true} is VALID [2022-04-28 12:33:07,377 INFO L290 TraceCheckUtils]: 49: Hoare triple {10231#true} ~cond := #in~cond; {10231#true} is VALID [2022-04-28 12:33:07,377 INFO L290 TraceCheckUtils]: 50: Hoare triple {10231#true} assume !(0 == ~cond); {10231#true} is VALID [2022-04-28 12:33:07,377 INFO L290 TraceCheckUtils]: 51: Hoare triple {10231#true} assume true; {10231#true} is VALID [2022-04-28 12:33:07,377 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10231#true} {10329#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #108#return; {10329#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 12:33:07,378 INFO L290 TraceCheckUtils]: 53: Hoare triple {10329#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {10396#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} is VALID [2022-04-28 12:33:07,378 INFO L290 TraceCheckUtils]: 54: Hoare triple {10396#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} assume !false; {10396#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} is VALID [2022-04-28 12:33:07,378 INFO L272 TraceCheckUtils]: 55: Hoare triple {10396#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10231#true} is VALID [2022-04-28 12:33:07,378 INFO L290 TraceCheckUtils]: 56: Hoare triple {10231#true} ~cond := #in~cond; {10231#true} is VALID [2022-04-28 12:33:07,378 INFO L290 TraceCheckUtils]: 57: Hoare triple {10231#true} assume !(0 == ~cond); {10231#true} is VALID [2022-04-28 12:33:07,378 INFO L290 TraceCheckUtils]: 58: Hoare triple {10231#true} assume true; {10231#true} is VALID [2022-04-28 12:33:07,379 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10231#true} {10396#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} #102#return; {10396#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} is VALID [2022-04-28 12:33:07,379 INFO L272 TraceCheckUtils]: 60: Hoare triple {10396#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10231#true} is VALID [2022-04-28 12:33:07,379 INFO L290 TraceCheckUtils]: 61: Hoare triple {10231#true} ~cond := #in~cond; {10231#true} is VALID [2022-04-28 12:33:07,379 INFO L290 TraceCheckUtils]: 62: Hoare triple {10231#true} assume !(0 == ~cond); {10231#true} is VALID [2022-04-28 12:33:07,379 INFO L290 TraceCheckUtils]: 63: Hoare triple {10231#true} assume true; {10231#true} is VALID [2022-04-28 12:33:07,380 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {10231#true} {10396#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} #104#return; {10396#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} is VALID [2022-04-28 12:33:07,380 INFO L272 TraceCheckUtils]: 65: Hoare triple {10396#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10231#true} is VALID [2022-04-28 12:33:07,380 INFO L290 TraceCheckUtils]: 66: Hoare triple {10231#true} ~cond := #in~cond; {10231#true} is VALID [2022-04-28 12:33:07,380 INFO L290 TraceCheckUtils]: 67: Hoare triple {10231#true} assume !(0 == ~cond); {10231#true} is VALID [2022-04-28 12:33:07,380 INFO L290 TraceCheckUtils]: 68: Hoare triple {10231#true} assume true; {10231#true} is VALID [2022-04-28 12:33:07,381 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {10231#true} {10396#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} #106#return; {10396#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} is VALID [2022-04-28 12:33:07,381 INFO L272 TraceCheckUtils]: 70: Hoare triple {10396#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {10448#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:33:07,381 INFO L290 TraceCheckUtils]: 71: Hoare triple {10448#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10452#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:33:07,382 INFO L290 TraceCheckUtils]: 72: Hoare triple {10452#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10232#false} is VALID [2022-04-28 12:33:07,382 INFO L290 TraceCheckUtils]: 73: Hoare triple {10232#false} assume !false; {10232#false} is VALID [2022-04-28 12:33:07,382 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-04-28 12:33:07,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:33:07,593 INFO L290 TraceCheckUtils]: 73: Hoare triple {10232#false} assume !false; {10232#false} is VALID [2022-04-28 12:33:07,594 INFO L290 TraceCheckUtils]: 72: Hoare triple {10452#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10232#false} is VALID [2022-04-28 12:33:07,594 INFO L290 TraceCheckUtils]: 71: Hoare triple {10448#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10452#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:33:07,594 INFO L272 TraceCheckUtils]: 70: Hoare triple {10468#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {10448#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:33:07,595 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {10231#true} {10468#(= main_~v~0 (* main_~d~0 main_~b~0))} #106#return; {10468#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 12:33:07,595 INFO L290 TraceCheckUtils]: 68: Hoare triple {10231#true} assume true; {10231#true} is VALID [2022-04-28 12:33:07,595 INFO L290 TraceCheckUtils]: 67: Hoare triple {10231#true} assume !(0 == ~cond); {10231#true} is VALID [2022-04-28 12:33:07,596 INFO L290 TraceCheckUtils]: 66: Hoare triple {10231#true} ~cond := #in~cond; {10231#true} is VALID [2022-04-28 12:33:07,596 INFO L272 TraceCheckUtils]: 65: Hoare triple {10468#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10231#true} is VALID [2022-04-28 12:33:07,600 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {10231#true} {10468#(= main_~v~0 (* main_~d~0 main_~b~0))} #104#return; {10468#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 12:33:07,601 INFO L290 TraceCheckUtils]: 63: Hoare triple {10231#true} assume true; {10231#true} is VALID [2022-04-28 12:33:07,601 INFO L290 TraceCheckUtils]: 62: Hoare triple {10231#true} assume !(0 == ~cond); {10231#true} is VALID [2022-04-28 12:33:07,601 INFO L290 TraceCheckUtils]: 61: Hoare triple {10231#true} ~cond := #in~cond; {10231#true} is VALID [2022-04-28 12:33:07,601 INFO L272 TraceCheckUtils]: 60: Hoare triple {10468#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10231#true} is VALID [2022-04-28 12:33:07,602 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10231#true} {10468#(= main_~v~0 (* main_~d~0 main_~b~0))} #102#return; {10468#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 12:33:07,602 INFO L290 TraceCheckUtils]: 58: Hoare triple {10231#true} assume true; {10231#true} is VALID [2022-04-28 12:33:07,602 INFO L290 TraceCheckUtils]: 57: Hoare triple {10231#true} assume !(0 == ~cond); {10231#true} is VALID [2022-04-28 12:33:07,602 INFO L290 TraceCheckUtils]: 56: Hoare triple {10231#true} ~cond := #in~cond; {10231#true} is VALID [2022-04-28 12:33:07,602 INFO L272 TraceCheckUtils]: 55: Hoare triple {10468#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10231#true} is VALID [2022-04-28 12:33:07,602 INFO L290 TraceCheckUtils]: 54: Hoare triple {10468#(= main_~v~0 (* main_~d~0 main_~b~0))} assume !false; {10468#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 12:33:07,604 INFO L290 TraceCheckUtils]: 53: Hoare triple {10468#(= main_~v~0 (* main_~d~0 main_~b~0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {10468#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 12:33:07,605 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10231#true} {10468#(= main_~v~0 (* main_~d~0 main_~b~0))} #108#return; {10468#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 12:33:07,605 INFO L290 TraceCheckUtils]: 51: Hoare triple {10231#true} assume true; {10231#true} is VALID [2022-04-28 12:33:07,605 INFO L290 TraceCheckUtils]: 50: Hoare triple {10231#true} assume !(0 == ~cond); {10231#true} is VALID [2022-04-28 12:33:07,605 INFO L290 TraceCheckUtils]: 49: Hoare triple {10231#true} ~cond := #in~cond; {10231#true} is VALID [2022-04-28 12:33:07,605 INFO L272 TraceCheckUtils]: 48: Hoare triple {10468#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {10231#true} is VALID [2022-04-28 12:33:07,605 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10231#true} {10468#(= main_~v~0 (* main_~d~0 main_~b~0))} #106#return; {10468#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 12:33:07,605 INFO L290 TraceCheckUtils]: 46: Hoare triple {10231#true} assume true; {10231#true} is VALID [2022-04-28 12:33:07,606 INFO L290 TraceCheckUtils]: 45: Hoare triple {10231#true} assume !(0 == ~cond); {10231#true} is VALID [2022-04-28 12:33:07,606 INFO L290 TraceCheckUtils]: 44: Hoare triple {10231#true} ~cond := #in~cond; {10231#true} is VALID [2022-04-28 12:33:07,606 INFO L272 TraceCheckUtils]: 43: Hoare triple {10468#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10231#true} is VALID [2022-04-28 12:33:07,606 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10231#true} {10468#(= main_~v~0 (* main_~d~0 main_~b~0))} #104#return; {10468#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 12:33:07,606 INFO L290 TraceCheckUtils]: 41: Hoare triple {10231#true} assume true; {10231#true} is VALID [2022-04-28 12:33:07,606 INFO L290 TraceCheckUtils]: 40: Hoare triple {10231#true} assume !(0 == ~cond); {10231#true} is VALID [2022-04-28 12:33:07,607 INFO L290 TraceCheckUtils]: 39: Hoare triple {10231#true} ~cond := #in~cond; {10231#true} is VALID [2022-04-28 12:33:07,607 INFO L272 TraceCheckUtils]: 38: Hoare triple {10468#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10231#true} is VALID [2022-04-28 12:33:07,624 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {10231#true} {10468#(= main_~v~0 (* main_~d~0 main_~b~0))} #102#return; {10468#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 12:33:07,624 INFO L290 TraceCheckUtils]: 36: Hoare triple {10231#true} assume true; {10231#true} is VALID [2022-04-28 12:33:07,624 INFO L290 TraceCheckUtils]: 35: Hoare triple {10231#true} assume !(0 == ~cond); {10231#true} is VALID [2022-04-28 12:33:07,624 INFO L290 TraceCheckUtils]: 34: Hoare triple {10231#true} ~cond := #in~cond; {10231#true} is VALID [2022-04-28 12:33:07,624 INFO L272 TraceCheckUtils]: 33: Hoare triple {10468#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10231#true} is VALID [2022-04-28 12:33:07,625 INFO L290 TraceCheckUtils]: 32: Hoare triple {10468#(= main_~v~0 (* main_~d~0 main_~b~0))} assume !false; {10468#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 12:33:07,625 INFO L290 TraceCheckUtils]: 31: Hoare triple {10231#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {10468#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 12:33:07,625 INFO L290 TraceCheckUtils]: 30: Hoare triple {10231#true} assume !false; {10231#true} is VALID [2022-04-28 12:33:07,625 INFO L290 TraceCheckUtils]: 29: Hoare triple {10231#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {10231#true} is VALID [2022-04-28 12:33:07,625 INFO L290 TraceCheckUtils]: 28: Hoare triple {10231#true} assume !false; {10231#true} is VALID [2022-04-28 12:33:07,625 INFO L290 TraceCheckUtils]: 27: Hoare triple {10231#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {10231#true} is VALID [2022-04-28 12:33:07,625 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10231#true} {10231#true} #100#return; {10231#true} is VALID [2022-04-28 12:33:07,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {10231#true} assume true; {10231#true} is VALID [2022-04-28 12:33:07,626 INFO L290 TraceCheckUtils]: 24: Hoare triple {10231#true} assume !(0 == ~cond); {10231#true} is VALID [2022-04-28 12:33:07,626 INFO L290 TraceCheckUtils]: 23: Hoare triple {10231#true} ~cond := #in~cond; {10231#true} is VALID [2022-04-28 12:33:07,626 INFO L272 TraceCheckUtils]: 22: Hoare triple {10231#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10231#true} is VALID [2022-04-28 12:33:07,626 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10231#true} {10231#true} #98#return; {10231#true} is VALID [2022-04-28 12:33:07,626 INFO L290 TraceCheckUtils]: 20: Hoare triple {10231#true} assume true; {10231#true} is VALID [2022-04-28 12:33:07,626 INFO L290 TraceCheckUtils]: 19: Hoare triple {10231#true} assume !(0 == ~cond); {10231#true} is VALID [2022-04-28 12:33:07,626 INFO L290 TraceCheckUtils]: 18: Hoare triple {10231#true} ~cond := #in~cond; {10231#true} is VALID [2022-04-28 12:33:07,626 INFO L272 TraceCheckUtils]: 17: Hoare triple {10231#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10231#true} is VALID [2022-04-28 12:33:07,626 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10231#true} {10231#true} #96#return; {10231#true} is VALID [2022-04-28 12:33:07,626 INFO L290 TraceCheckUtils]: 15: Hoare triple {10231#true} assume true; {10231#true} is VALID [2022-04-28 12:33:07,626 INFO L290 TraceCheckUtils]: 14: Hoare triple {10231#true} assume !(0 == ~cond); {10231#true} is VALID [2022-04-28 12:33:07,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {10231#true} ~cond := #in~cond; {10231#true} is VALID [2022-04-28 12:33:07,626 INFO L272 TraceCheckUtils]: 12: Hoare triple {10231#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {10231#true} is VALID [2022-04-28 12:33:07,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {10231#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10231#true} is VALID [2022-04-28 12:33:07,627 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10231#true} {10231#true} #94#return; {10231#true} is VALID [2022-04-28 12:33:07,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {10231#true} assume true; {10231#true} is VALID [2022-04-28 12:33:07,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {10231#true} assume !(0 == ~cond); {10231#true} is VALID [2022-04-28 12:33:07,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {10231#true} ~cond := #in~cond; {10231#true} is VALID [2022-04-28 12:33:07,627 INFO L272 TraceCheckUtils]: 6: Hoare triple {10231#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {10231#true} is VALID [2022-04-28 12:33:07,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {10231#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {10231#true} is VALID [2022-04-28 12:33:07,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {10231#true} call #t~ret6 := main(); {10231#true} is VALID [2022-04-28 12:33:07,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10231#true} {10231#true} #112#return; {10231#true} is VALID [2022-04-28 12:33:07,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {10231#true} assume true; {10231#true} is VALID [2022-04-28 12:33:07,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {10231#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {10231#true} is VALID [2022-04-28 12:33:07,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {10231#true} call ULTIMATE.init(); {10231#true} is VALID [2022-04-28 12:33:07,628 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-04-28 12:33:07,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:33:07,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764021851] [2022-04-28 12:33:07,628 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:33:07,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073867103] [2022-04-28 12:33:07,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073867103] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 12:33:07,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 12:33:07,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 12:33:07,629 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:33:07,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1386260061] [2022-04-28 12:33:07,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1386260061] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:33:07,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:33:07,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:33:07,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915449700] [2022-04-28 12:33:07,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:33:07,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 74 [2022-04-28 12:33:07,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:33:07,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 12:33:07,660 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-28 12:33:07,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:33:07,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:33:07,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:33:07,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 12:33:07,661 INFO L87 Difference]: Start difference. First operand 208 states and 296 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 12:33:08,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:33:08,346 INFO L93 Difference]: Finished difference Result 214 states and 301 transitions. [2022-04-28 12:33:08,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:33:08,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 74 [2022-04-28 12:33:08,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:33:08,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 12:33:08,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-28 12:33:08,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 12:33:08,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-28 12:33:08,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-28 12:33:08,397 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-28 12:33:08,402 INFO L225 Difference]: With dead ends: 214 [2022-04-28 12:33:08,402 INFO L226 Difference]: Without dead ends: 212 [2022-04-28 12:33:08,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 140 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 12:33:08,403 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 9 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:33:08,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 139 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:33:08,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-04-28 12:33:08,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2022-04-28 12:33:08,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:33:08,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand has 212 states, 119 states have (on average 1.2016806722689075) internal successors, (143), 125 states have internal predecessors, (143), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:33:08,963 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand has 212 states, 119 states have (on average 1.2016806722689075) internal successors, (143), 125 states have internal predecessors, (143), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:33:08,964 INFO L87 Difference]: Start difference. First operand 212 states. Second operand has 212 states, 119 states have (on average 1.2016806722689075) internal successors, (143), 125 states have internal predecessors, (143), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:33:08,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:33:08,970 INFO L93 Difference]: Finished difference Result 212 states and 299 transitions. [2022-04-28 12:33:08,970 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 299 transitions. [2022-04-28 12:33:08,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:33:08,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:33:08,972 INFO L74 IsIncluded]: Start isIncluded. First operand has 212 states, 119 states have (on average 1.2016806722689075) internal successors, (143), 125 states have internal predecessors, (143), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) Second operand 212 states. [2022-04-28 12:33:08,972 INFO L87 Difference]: Start difference. First operand has 212 states, 119 states have (on average 1.2016806722689075) internal successors, (143), 125 states have internal predecessors, (143), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) Second operand 212 states. [2022-04-28 12:33:08,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:33:08,978 INFO L93 Difference]: Finished difference Result 212 states and 299 transitions. [2022-04-28 12:33:08,978 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 299 transitions. [2022-04-28 12:33:08,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:33:08,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:33:08,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:33:08,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:33:08,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 119 states have (on average 1.2016806722689075) internal successors, (143), 125 states have internal predecessors, (143), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:33:08,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 299 transitions. [2022-04-28 12:33:08,987 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 299 transitions. Word has length 74 [2022-04-28 12:33:08,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:33:08,990 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 299 transitions. [2022-04-28 12:33:08,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 12:33:08,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 212 states and 299 transitions. [2022-04-28 12:33:09,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 299 edges. 299 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:33:09,542 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 299 transitions. [2022-04-28 12:33:09,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-28 12:33:09,543 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:33:09,543 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:33:09,560 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-28 12:33:09,747 WARN L477 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-28 12:33:09,748 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:33:09,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:33:09,748 INFO L85 PathProgramCache]: Analyzing trace with hash -2089538094, now seen corresponding path program 1 times [2022-04-28 12:33:09,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:33:09,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1835960705] [2022-04-28 12:33:09,753 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:33:09,754 INFO L85 PathProgramCache]: Analyzing trace with hash -2089538094, now seen corresponding path program 2 times [2022-04-28 12:33:09,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:33:09,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420486558] [2022-04-28 12:33:09,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:33:09,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:33:09,767 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:33:09,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1690396289] [2022-04-28 12:33:09,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:33:09,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:33:09,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:33:09,768 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-28 12:33:09,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 12:33:09,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:33:09,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:33:09,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 12:33:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:33:09,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:33:10,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {11959#true} call ULTIMATE.init(); {11959#true} is VALID [2022-04-28 12:33:10,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {11959#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {11959#true} is VALID [2022-04-28 12:33:10,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {11959#true} assume true; {11959#true} is VALID [2022-04-28 12:33:10,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11959#true} {11959#true} #112#return; {11959#true} is VALID [2022-04-28 12:33:10,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {11959#true} call #t~ret6 := main(); {11959#true} is VALID [2022-04-28 12:33:10,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {11959#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {11959#true} is VALID [2022-04-28 12:33:10,036 INFO L272 TraceCheckUtils]: 6: Hoare triple {11959#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {11959#true} is VALID [2022-04-28 12:33:10,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {11959#true} ~cond := #in~cond; {11959#true} is VALID [2022-04-28 12:33:10,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {11959#true} assume !(0 == ~cond); {11959#true} is VALID [2022-04-28 12:33:10,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {11959#true} assume true; {11959#true} is VALID [2022-04-28 12:33:10,036 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11959#true} {11959#true} #94#return; {11959#true} is VALID [2022-04-28 12:33:10,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {11959#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11959#true} is VALID [2022-04-28 12:33:10,036 INFO L272 TraceCheckUtils]: 12: Hoare triple {11959#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {11959#true} is VALID [2022-04-28 12:33:10,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {11959#true} ~cond := #in~cond; {11959#true} is VALID [2022-04-28 12:33:10,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {11959#true} assume !(0 == ~cond); {11959#true} is VALID [2022-04-28 12:33:10,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {11959#true} assume true; {11959#true} is VALID [2022-04-28 12:33:10,037 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11959#true} {11959#true} #96#return; {11959#true} is VALID [2022-04-28 12:33:10,037 INFO L272 TraceCheckUtils]: 17: Hoare triple {11959#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11959#true} is VALID [2022-04-28 12:33:10,037 INFO L290 TraceCheckUtils]: 18: Hoare triple {11959#true} ~cond := #in~cond; {11959#true} is VALID [2022-04-28 12:33:10,037 INFO L290 TraceCheckUtils]: 19: Hoare triple {11959#true} assume !(0 == ~cond); {11959#true} is VALID [2022-04-28 12:33:10,037 INFO L290 TraceCheckUtils]: 20: Hoare triple {11959#true} assume true; {11959#true} is VALID [2022-04-28 12:33:10,037 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11959#true} {11959#true} #98#return; {11959#true} is VALID [2022-04-28 12:33:10,037 INFO L272 TraceCheckUtils]: 22: Hoare triple {11959#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11959#true} is VALID [2022-04-28 12:33:10,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {11959#true} ~cond := #in~cond; {11959#true} is VALID [2022-04-28 12:33:10,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {11959#true} assume !(0 == ~cond); {11959#true} is VALID [2022-04-28 12:33:10,037 INFO L290 TraceCheckUtils]: 25: Hoare triple {11959#true} assume true; {11959#true} is VALID [2022-04-28 12:33:10,037 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11959#true} {11959#true} #100#return; {11959#true} is VALID [2022-04-28 12:33:10,037 INFO L290 TraceCheckUtils]: 27: Hoare triple {11959#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {11959#true} is VALID [2022-04-28 12:33:10,037 INFO L290 TraceCheckUtils]: 28: Hoare triple {11959#true} assume !false; {11959#true} is VALID [2022-04-28 12:33:10,037 INFO L290 TraceCheckUtils]: 29: Hoare triple {11959#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11959#true} is VALID [2022-04-28 12:33:10,038 INFO L290 TraceCheckUtils]: 30: Hoare triple {11959#true} assume !false; {11959#true} is VALID [2022-04-28 12:33:10,038 INFO L290 TraceCheckUtils]: 31: Hoare triple {11959#true} assume !(~c~0 >= ~b~0); {11959#true} is VALID [2022-04-28 12:33:10,038 INFO L290 TraceCheckUtils]: 32: Hoare triple {11959#true} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {11959#true} is VALID [2022-04-28 12:33:10,038 INFO L290 TraceCheckUtils]: 33: Hoare triple {11959#true} assume !false; {11959#true} is VALID [2022-04-28 12:33:10,038 INFO L290 TraceCheckUtils]: 34: Hoare triple {11959#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11959#true} is VALID [2022-04-28 12:33:10,038 INFO L290 TraceCheckUtils]: 35: Hoare triple {11959#true} assume !false; {11959#true} is VALID [2022-04-28 12:33:10,038 INFO L290 TraceCheckUtils]: 36: Hoare triple {11959#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {11959#true} is VALID [2022-04-28 12:33:10,038 INFO L290 TraceCheckUtils]: 37: Hoare triple {11959#true} assume !false; {11959#true} is VALID [2022-04-28 12:33:10,038 INFO L272 TraceCheckUtils]: 38: Hoare triple {11959#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11959#true} is VALID [2022-04-28 12:33:10,038 INFO L290 TraceCheckUtils]: 39: Hoare triple {11959#true} ~cond := #in~cond; {11959#true} is VALID [2022-04-28 12:33:10,038 INFO L290 TraceCheckUtils]: 40: Hoare triple {11959#true} assume !(0 == ~cond); {11959#true} is VALID [2022-04-28 12:33:10,039 INFO L290 TraceCheckUtils]: 41: Hoare triple {11959#true} assume true; {11959#true} is VALID [2022-04-28 12:33:10,039 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11959#true} {11959#true} #102#return; {11959#true} is VALID [2022-04-28 12:33:10,039 INFO L272 TraceCheckUtils]: 43: Hoare triple {11959#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11959#true} is VALID [2022-04-28 12:33:10,051 INFO L290 TraceCheckUtils]: 44: Hoare triple {11959#true} ~cond := #in~cond; {12096#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:33:10,052 INFO L290 TraceCheckUtils]: 45: Hoare triple {12096#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {12100#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:33:10,052 INFO L290 TraceCheckUtils]: 46: Hoare triple {12100#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12100#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:33:10,053 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {12100#(not (= |__VERIFIER_assert_#in~cond| 0))} {11959#true} #104#return; {12107#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:33:10,053 INFO L272 TraceCheckUtils]: 48: Hoare triple {12107#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11959#true} is VALID [2022-04-28 12:33:10,053 INFO L290 TraceCheckUtils]: 49: Hoare triple {11959#true} ~cond := #in~cond; {11959#true} is VALID [2022-04-28 12:33:10,053 INFO L290 TraceCheckUtils]: 50: Hoare triple {11959#true} assume !(0 == ~cond); {11959#true} is VALID [2022-04-28 12:33:10,053 INFO L290 TraceCheckUtils]: 51: Hoare triple {11959#true} assume true; {11959#true} is VALID [2022-04-28 12:33:10,054 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11959#true} {12107#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #106#return; {12107#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:33:10,054 INFO L272 TraceCheckUtils]: 53: Hoare triple {12107#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {11959#true} is VALID [2022-04-28 12:33:10,054 INFO L290 TraceCheckUtils]: 54: Hoare triple {11959#true} ~cond := #in~cond; {11959#true} is VALID [2022-04-28 12:33:10,054 INFO L290 TraceCheckUtils]: 55: Hoare triple {11959#true} assume !(0 == ~cond); {11959#true} is VALID [2022-04-28 12:33:10,054 INFO L290 TraceCheckUtils]: 56: Hoare triple {11959#true} assume true; {11959#true} is VALID [2022-04-28 12:33:10,055 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {11959#true} {12107#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #108#return; {12107#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:33:10,056 INFO L290 TraceCheckUtils]: 58: Hoare triple {12107#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= 2 * ~v~0); {12107#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:33:10,056 INFO L290 TraceCheckUtils]: 59: Hoare triple {12107#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {12107#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:33:10,057 INFO L290 TraceCheckUtils]: 60: Hoare triple {12107#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {12107#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:33:10,057 INFO L290 TraceCheckUtils]: 61: Hoare triple {12107#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {12107#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:33:10,058 INFO L290 TraceCheckUtils]: 62: Hoare triple {12107#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {12153#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:33:10,058 INFO L290 TraceCheckUtils]: 63: Hoare triple {12153#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {12153#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:33:10,058 INFO L290 TraceCheckUtils]: 64: Hoare triple {12153#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12153#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:33:10,059 INFO L290 TraceCheckUtils]: 65: Hoare triple {12153#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {12153#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:33:10,060 INFO L290 TraceCheckUtils]: 66: Hoare triple {12153#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {12153#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:33:10,060 INFO L290 TraceCheckUtils]: 67: Hoare triple {12153#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {12153#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:33:10,061 INFO L272 TraceCheckUtils]: 68: Hoare triple {12153#(= 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)); {12172#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:33:10,061 INFO L290 TraceCheckUtils]: 69: Hoare triple {12172#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12176#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:33:10,062 INFO L290 TraceCheckUtils]: 70: Hoare triple {12176#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11960#false} is VALID [2022-04-28 12:33:10,062 INFO L290 TraceCheckUtils]: 71: Hoare triple {11960#false} assume !false; {11960#false} is VALID [2022-04-28 12:33:10,062 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-04-28 12:33:10,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:33:20,981 INFO L290 TraceCheckUtils]: 71: Hoare triple {11960#false} assume !false; {11960#false} is VALID [2022-04-28 12:33:20,982 INFO L290 TraceCheckUtils]: 70: Hoare triple {12176#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11960#false} is VALID [2022-04-28 12:33:20,982 INFO L290 TraceCheckUtils]: 69: Hoare triple {12172#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12176#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:33:20,983 INFO L272 TraceCheckUtils]: 68: Hoare triple {12153#(= 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)); {12172#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:33:20,983 INFO L290 TraceCheckUtils]: 67: Hoare triple {12153#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {12153#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:33:20,983 INFO L290 TraceCheckUtils]: 66: Hoare triple {12153#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {12153#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:33:20,984 INFO L290 TraceCheckUtils]: 65: Hoare triple {12153#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {12153#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:33:20,984 INFO L290 TraceCheckUtils]: 64: Hoare triple {12153#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12153#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:33:20,984 INFO L290 TraceCheckUtils]: 63: Hoare triple {12153#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {12153#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:33:20,985 INFO L290 TraceCheckUtils]: 62: Hoare triple {12107#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {12153#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:33:20,985 INFO L290 TraceCheckUtils]: 61: Hoare triple {12107#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {12107#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:33:20,986 INFO L290 TraceCheckUtils]: 60: Hoare triple {12107#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {12107#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:33:20,986 INFO L290 TraceCheckUtils]: 59: Hoare triple {12107#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {12107#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:33:20,986 INFO L290 TraceCheckUtils]: 58: Hoare triple {12107#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= 2 * ~v~0); {12107#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:33:20,987 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {11959#true} {12107#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #108#return; {12107#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:33:20,987 INFO L290 TraceCheckUtils]: 56: Hoare triple {11959#true} assume true; {11959#true} is VALID [2022-04-28 12:33:20,987 INFO L290 TraceCheckUtils]: 55: Hoare triple {11959#true} assume !(0 == ~cond); {11959#true} is VALID [2022-04-28 12:33:20,987 INFO L290 TraceCheckUtils]: 54: Hoare triple {11959#true} ~cond := #in~cond; {11959#true} is VALID [2022-04-28 12:33:20,987 INFO L272 TraceCheckUtils]: 53: Hoare triple {12107#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {11959#true} is VALID [2022-04-28 12:33:20,988 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11959#true} {12107#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #106#return; {12107#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:33:20,988 INFO L290 TraceCheckUtils]: 51: Hoare triple {11959#true} assume true; {11959#true} is VALID [2022-04-28 12:33:20,988 INFO L290 TraceCheckUtils]: 50: Hoare triple {11959#true} assume !(0 == ~cond); {11959#true} is VALID [2022-04-28 12:33:20,988 INFO L290 TraceCheckUtils]: 49: Hoare triple {11959#true} ~cond := #in~cond; {11959#true} is VALID [2022-04-28 12:33:20,988 INFO L272 TraceCheckUtils]: 48: Hoare triple {12107#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11959#true} is VALID [2022-04-28 12:33:20,989 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {12100#(not (= |__VERIFIER_assert_#in~cond| 0))} {11959#true} #104#return; {12107#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:33:20,990 INFO L290 TraceCheckUtils]: 46: Hoare triple {12100#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12100#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:33:20,990 INFO L290 TraceCheckUtils]: 45: Hoare triple {12264#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {12100#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:33:20,990 INFO L290 TraceCheckUtils]: 44: Hoare triple {11959#true} ~cond := #in~cond; {12264#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:33:20,990 INFO L272 TraceCheckUtils]: 43: Hoare triple {11959#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11959#true} is VALID [2022-04-28 12:33:20,990 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11959#true} {11959#true} #102#return; {11959#true} is VALID [2022-04-28 12:33:20,991 INFO L290 TraceCheckUtils]: 41: Hoare triple {11959#true} assume true; {11959#true} is VALID [2022-04-28 12:33:20,991 INFO L290 TraceCheckUtils]: 40: Hoare triple {11959#true} assume !(0 == ~cond); {11959#true} is VALID [2022-04-28 12:33:20,991 INFO L290 TraceCheckUtils]: 39: Hoare triple {11959#true} ~cond := #in~cond; {11959#true} is VALID [2022-04-28 12:33:20,991 INFO L272 TraceCheckUtils]: 38: Hoare triple {11959#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11959#true} is VALID [2022-04-28 12:33:20,991 INFO L290 TraceCheckUtils]: 37: Hoare triple {11959#true} assume !false; {11959#true} is VALID [2022-04-28 12:33:20,991 INFO L290 TraceCheckUtils]: 36: Hoare triple {11959#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {11959#true} is VALID [2022-04-28 12:33:20,991 INFO L290 TraceCheckUtils]: 35: Hoare triple {11959#true} assume !false; {11959#true} is VALID [2022-04-28 12:33:20,991 INFO L290 TraceCheckUtils]: 34: Hoare triple {11959#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11959#true} is VALID [2022-04-28 12:33:20,991 INFO L290 TraceCheckUtils]: 33: Hoare triple {11959#true} assume !false; {11959#true} is VALID [2022-04-28 12:33:20,991 INFO L290 TraceCheckUtils]: 32: Hoare triple {11959#true} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {11959#true} is VALID [2022-04-28 12:33:20,991 INFO L290 TraceCheckUtils]: 31: Hoare triple {11959#true} assume !(~c~0 >= ~b~0); {11959#true} is VALID [2022-04-28 12:33:20,991 INFO L290 TraceCheckUtils]: 30: Hoare triple {11959#true} assume !false; {11959#true} is VALID [2022-04-28 12:33:20,991 INFO L290 TraceCheckUtils]: 29: Hoare triple {11959#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11959#true} is VALID [2022-04-28 12:33:20,991 INFO L290 TraceCheckUtils]: 28: Hoare triple {11959#true} assume !false; {11959#true} is VALID [2022-04-28 12:33:20,992 INFO L290 TraceCheckUtils]: 27: Hoare triple {11959#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {11959#true} is VALID [2022-04-28 12:33:20,992 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11959#true} {11959#true} #100#return; {11959#true} is VALID [2022-04-28 12:33:20,992 INFO L290 TraceCheckUtils]: 25: Hoare triple {11959#true} assume true; {11959#true} is VALID [2022-04-28 12:33:20,992 INFO L290 TraceCheckUtils]: 24: Hoare triple {11959#true} assume !(0 == ~cond); {11959#true} is VALID [2022-04-28 12:33:20,992 INFO L290 TraceCheckUtils]: 23: Hoare triple {11959#true} ~cond := #in~cond; {11959#true} is VALID [2022-04-28 12:33:20,992 INFO L272 TraceCheckUtils]: 22: Hoare triple {11959#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11959#true} is VALID [2022-04-28 12:33:20,992 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11959#true} {11959#true} #98#return; {11959#true} is VALID [2022-04-28 12:33:20,992 INFO L290 TraceCheckUtils]: 20: Hoare triple {11959#true} assume true; {11959#true} is VALID [2022-04-28 12:33:20,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {11959#true} assume !(0 == ~cond); {11959#true} is VALID [2022-04-28 12:33:20,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {11959#true} ~cond := #in~cond; {11959#true} is VALID [2022-04-28 12:33:20,992 INFO L272 TraceCheckUtils]: 17: Hoare triple {11959#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11959#true} is VALID [2022-04-28 12:33:20,992 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11959#true} {11959#true} #96#return; {11959#true} is VALID [2022-04-28 12:33:20,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {11959#true} assume true; {11959#true} is VALID [2022-04-28 12:33:20,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {11959#true} assume !(0 == ~cond); {11959#true} is VALID [2022-04-28 12:33:20,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {11959#true} ~cond := #in~cond; {11959#true} is VALID [2022-04-28 12:33:20,993 INFO L272 TraceCheckUtils]: 12: Hoare triple {11959#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {11959#true} is VALID [2022-04-28 12:33:20,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {11959#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11959#true} is VALID [2022-04-28 12:33:20,993 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11959#true} {11959#true} #94#return; {11959#true} is VALID [2022-04-28 12:33:20,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {11959#true} assume true; {11959#true} is VALID [2022-04-28 12:33:20,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {11959#true} assume !(0 == ~cond); {11959#true} is VALID [2022-04-28 12:33:20,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {11959#true} ~cond := #in~cond; {11959#true} is VALID [2022-04-28 12:33:20,993 INFO L272 TraceCheckUtils]: 6: Hoare triple {11959#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {11959#true} is VALID [2022-04-28 12:33:20,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {11959#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {11959#true} is VALID [2022-04-28 12:33:20,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {11959#true} call #t~ret6 := main(); {11959#true} is VALID [2022-04-28 12:33:20,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11959#true} {11959#true} #112#return; {11959#true} is VALID [2022-04-28 12:33:20,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {11959#true} assume true; {11959#true} is VALID [2022-04-28 12:33:20,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {11959#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {11959#true} is VALID [2022-04-28 12:33:20,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {11959#true} call ULTIMATE.init(); {11959#true} is VALID [2022-04-28 12:33:20,994 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-04-28 12:33:20,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:33:20,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420486558] [2022-04-28 12:33:20,994 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:33:20,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690396289] [2022-04-28 12:33:20,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690396289] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:33:20,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:33:20,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-28 12:33:20,995 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:33:20,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1835960705] [2022-04-28 12:33:20,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1835960705] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:33:20,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:33:20,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:33:20,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455768214] [2022-04-28 12:33:20,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:33:20,996 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 72 [2022-04-28 12:33:20,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:33:20,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 12:33:21,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:33:21,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:33:21,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:33:21,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:33:21,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:33:21,047 INFO L87 Difference]: Start difference. First operand 212 states and 299 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 12:33:22,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:33:22,164 INFO L93 Difference]: Finished difference Result 226 states and 310 transitions. [2022-04-28 12:33:22,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 12:33:22,164 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 72 [2022-04-28 12:33:22,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:33:22,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 12:33:22,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-04-28 12:33:22,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 12:33:22,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-04-28 12:33:22,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 58 transitions. [2022-04-28 12:33:22,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:33:22,234 INFO L225 Difference]: With dead ends: 226 [2022-04-28 12:33:22,234 INFO L226 Difference]: Without dead ends: 224 [2022-04-28 12:33:22,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-28 12:33:22,235 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 21 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:33:22,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 173 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 12:33:22,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-04-28 12:33:22,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2022-04-28 12:33:22,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:33:22,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 224 states. Second operand has 224 states, 128 states have (on average 1.1875) internal successors, (152), 134 states have internal predecessors, (152), 79 states have call successors, (79), 17 states have call predecessors, (79), 16 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:33:22,800 INFO L74 IsIncluded]: Start isIncluded. First operand 224 states. Second operand has 224 states, 128 states have (on average 1.1875) internal successors, (152), 134 states have internal predecessors, (152), 79 states have call successors, (79), 17 states have call predecessors, (79), 16 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:33:22,800 INFO L87 Difference]: Start difference. First operand 224 states. Second operand has 224 states, 128 states have (on average 1.1875) internal successors, (152), 134 states have internal predecessors, (152), 79 states have call successors, (79), 17 states have call predecessors, (79), 16 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:33:22,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:33:22,806 INFO L93 Difference]: Finished difference Result 224 states and 308 transitions. [2022-04-28 12:33:22,806 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 308 transitions. [2022-04-28 12:33:22,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:33:22,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:33:22,808 INFO L74 IsIncluded]: Start isIncluded. First operand has 224 states, 128 states have (on average 1.1875) internal successors, (152), 134 states have internal predecessors, (152), 79 states have call successors, (79), 17 states have call predecessors, (79), 16 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) Second operand 224 states. [2022-04-28 12:33:22,808 INFO L87 Difference]: Start difference. First operand has 224 states, 128 states have (on average 1.1875) internal successors, (152), 134 states have internal predecessors, (152), 79 states have call successors, (79), 17 states have call predecessors, (79), 16 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) Second operand 224 states. [2022-04-28 12:33:22,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:33:22,814 INFO L93 Difference]: Finished difference Result 224 states and 308 transitions. [2022-04-28 12:33:22,814 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 308 transitions. [2022-04-28 12:33:22,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:33:22,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:33:22,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:33:22,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:33:22,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 128 states have (on average 1.1875) internal successors, (152), 134 states have internal predecessors, (152), 79 states have call successors, (79), 17 states have call predecessors, (79), 16 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:33:22,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 308 transitions. [2022-04-28 12:33:22,823 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 308 transitions. Word has length 72 [2022-04-28 12:33:22,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:33:22,823 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 308 transitions. [2022-04-28 12:33:22,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 12:33:22,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 224 states and 308 transitions. [2022-04-28 12:33:23,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 308 edges. 308 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:33:23,396 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 308 transitions. [2022-04-28 12:33:23,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 12:33:23,397 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:33:23,397 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:33:23,421 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-28 12:33:23,597 WARN L477 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-28 12:33:23,598 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:33:23,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:33:23,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1984914564, now seen corresponding path program 3 times [2022-04-28 12:33:23,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:33:23,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [173197248] [2022-04-28 12:33:23,598 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:33:23,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1984914564, now seen corresponding path program 4 times [2022-04-28 12:33:23,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:33:23,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415295228] [2022-04-28 12:33:23,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:33:23,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:33:23,616 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:33:23,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1284130494] [2022-04-28 12:33:23,616 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:33:23,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:33:23,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:33:23,618 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-28 12:33:23,618 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-28 12:33:23,660 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:33:23,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:33:23,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 12:33:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:33:23,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:33:23,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {13754#true} call ULTIMATE.init(); {13754#true} is VALID [2022-04-28 12:33:23,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {13754#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {13754#true} is VALID [2022-04-28 12:33:23,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {13754#true} assume true; {13754#true} is VALID [2022-04-28 12:33:23,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13754#true} {13754#true} #112#return; {13754#true} is VALID [2022-04-28 12:33:23,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {13754#true} call #t~ret6 := main(); {13754#true} is VALID [2022-04-28 12:33:23,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {13754#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {13754#true} is VALID [2022-04-28 12:33:23,893 INFO L272 TraceCheckUtils]: 6: Hoare triple {13754#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {13754#true} is VALID [2022-04-28 12:33:23,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {13754#true} ~cond := #in~cond; {13754#true} is VALID [2022-04-28 12:33:23,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {13754#true} assume !(0 == ~cond); {13754#true} is VALID [2022-04-28 12:33:23,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {13754#true} assume true; {13754#true} is VALID [2022-04-28 12:33:23,893 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13754#true} {13754#true} #94#return; {13754#true} is VALID [2022-04-28 12:33:23,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {13754#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {13754#true} is VALID [2022-04-28 12:33:23,894 INFO L272 TraceCheckUtils]: 12: Hoare triple {13754#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {13754#true} is VALID [2022-04-28 12:33:23,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {13754#true} ~cond := #in~cond; {13754#true} is VALID [2022-04-28 12:33:23,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {13754#true} assume !(0 == ~cond); {13754#true} is VALID [2022-04-28 12:33:23,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {13754#true} assume true; {13754#true} is VALID [2022-04-28 12:33:23,894 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13754#true} {13754#true} #96#return; {13754#true} is VALID [2022-04-28 12:33:23,894 INFO L272 TraceCheckUtils]: 17: Hoare triple {13754#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {13754#true} is VALID [2022-04-28 12:33:23,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {13754#true} ~cond := #in~cond; {13754#true} is VALID [2022-04-28 12:33:23,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {13754#true} assume !(0 == ~cond); {13754#true} is VALID [2022-04-28 12:33:23,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {13754#true} assume true; {13754#true} is VALID [2022-04-28 12:33:23,894 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {13754#true} {13754#true} #98#return; {13754#true} is VALID [2022-04-28 12:33:23,894 INFO L272 TraceCheckUtils]: 22: Hoare triple {13754#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {13754#true} is VALID [2022-04-28 12:33:23,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {13754#true} ~cond := #in~cond; {13754#true} is VALID [2022-04-28 12:33:23,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {13754#true} assume !(0 == ~cond); {13754#true} is VALID [2022-04-28 12:33:23,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {13754#true} assume true; {13754#true} is VALID [2022-04-28 12:33:23,895 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {13754#true} {13754#true} #100#return; {13754#true} is VALID [2022-04-28 12:33:23,895 INFO L290 TraceCheckUtils]: 27: Hoare triple {13754#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {13754#true} is VALID [2022-04-28 12:33:23,895 INFO L290 TraceCheckUtils]: 28: Hoare triple {13754#true} assume !false; {13754#true} is VALID [2022-04-28 12:33:23,895 INFO L290 TraceCheckUtils]: 29: Hoare triple {13754#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {13754#true} is VALID [2022-04-28 12:33:23,895 INFO L290 TraceCheckUtils]: 30: Hoare triple {13754#true} assume !false; {13754#true} is VALID [2022-04-28 12:33:23,895 INFO L290 TraceCheckUtils]: 31: Hoare triple {13754#true} assume !(~c~0 >= ~b~0); {13754#true} is VALID [2022-04-28 12:33:23,895 INFO L290 TraceCheckUtils]: 32: Hoare triple {13754#true} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {13754#true} is VALID [2022-04-28 12:33:23,895 INFO L290 TraceCheckUtils]: 33: Hoare triple {13754#true} assume !false; {13754#true} is VALID [2022-04-28 12:33:23,895 INFO L290 TraceCheckUtils]: 34: Hoare triple {13754#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {13754#true} is VALID [2022-04-28 12:33:23,895 INFO L290 TraceCheckUtils]: 35: Hoare triple {13754#true} assume !false; {13754#true} is VALID [2022-04-28 12:33:23,904 INFO L290 TraceCheckUtils]: 36: Hoare triple {13754#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {13867#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 12:33:23,904 INFO L290 TraceCheckUtils]: 37: Hoare triple {13867#(<= main_~v~0 main_~b~0)} assume !false; {13867#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 12:33:23,904 INFO L272 TraceCheckUtils]: 38: Hoare triple {13867#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13754#true} is VALID [2022-04-28 12:33:23,904 INFO L290 TraceCheckUtils]: 39: Hoare triple {13754#true} ~cond := #in~cond; {13754#true} is VALID [2022-04-28 12:33:23,904 INFO L290 TraceCheckUtils]: 40: Hoare triple {13754#true} assume !(0 == ~cond); {13754#true} is VALID [2022-04-28 12:33:23,904 INFO L290 TraceCheckUtils]: 41: Hoare triple {13754#true} assume true; {13754#true} is VALID [2022-04-28 12:33:23,905 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {13754#true} {13867#(<= main_~v~0 main_~b~0)} #102#return; {13867#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 12:33:23,905 INFO L272 TraceCheckUtils]: 43: Hoare triple {13867#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13754#true} is VALID [2022-04-28 12:33:23,905 INFO L290 TraceCheckUtils]: 44: Hoare triple {13754#true} ~cond := #in~cond; {13754#true} is VALID [2022-04-28 12:33:23,905 INFO L290 TraceCheckUtils]: 45: Hoare triple {13754#true} assume !(0 == ~cond); {13754#true} is VALID [2022-04-28 12:33:23,905 INFO L290 TraceCheckUtils]: 46: Hoare triple {13754#true} assume true; {13754#true} is VALID [2022-04-28 12:33:23,906 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13754#true} {13867#(<= main_~v~0 main_~b~0)} #104#return; {13867#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 12:33:23,906 INFO L272 TraceCheckUtils]: 48: Hoare triple {13867#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13754#true} is VALID [2022-04-28 12:33:23,906 INFO L290 TraceCheckUtils]: 49: Hoare triple {13754#true} ~cond := #in~cond; {13754#true} is VALID [2022-04-28 12:33:23,906 INFO L290 TraceCheckUtils]: 50: Hoare triple {13754#true} assume !(0 == ~cond); {13754#true} is VALID [2022-04-28 12:33:23,906 INFO L290 TraceCheckUtils]: 51: Hoare triple {13754#true} assume true; {13754#true} is VALID [2022-04-28 12:33:23,907 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13754#true} {13867#(<= main_~v~0 main_~b~0)} #106#return; {13867#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 12:33:23,907 INFO L272 TraceCheckUtils]: 53: Hoare triple {13867#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {13754#true} is VALID [2022-04-28 12:33:23,907 INFO L290 TraceCheckUtils]: 54: Hoare triple {13754#true} ~cond := #in~cond; {13754#true} is VALID [2022-04-28 12:33:23,907 INFO L290 TraceCheckUtils]: 55: Hoare triple {13754#true} assume !(0 == ~cond); {13754#true} is VALID [2022-04-28 12:33:23,907 INFO L290 TraceCheckUtils]: 56: Hoare triple {13754#true} assume true; {13754#true} is VALID [2022-04-28 12:33:23,907 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {13754#true} {13867#(<= main_~v~0 main_~b~0)} #108#return; {13867#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 12:33:23,908 INFO L290 TraceCheckUtils]: 58: Hoare triple {13867#(<= main_~v~0 main_~b~0)} assume !(~c~0 >= 2 * ~v~0); {13934#(and (<= main_~v~0 main_~b~0) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-28 12:33:23,908 INFO L290 TraceCheckUtils]: 59: Hoare triple {13934#(and (<= main_~v~0 main_~b~0) (not (<= (* main_~v~0 2) main_~c~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {13938#(< main_~c~0 main_~b~0)} is VALID [2022-04-28 12:33:23,909 INFO L290 TraceCheckUtils]: 60: Hoare triple {13938#(< main_~c~0 main_~b~0)} assume !false; {13938#(< main_~c~0 main_~b~0)} is VALID [2022-04-28 12:33:23,909 INFO L290 TraceCheckUtils]: 61: Hoare triple {13938#(< main_~c~0 main_~b~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {13755#false} is VALID [2022-04-28 12:33:23,909 INFO L290 TraceCheckUtils]: 62: Hoare triple {13755#false} assume !false; {13755#false} is VALID [2022-04-28 12:33:23,909 INFO L272 TraceCheckUtils]: 63: Hoare triple {13755#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13755#false} is VALID [2022-04-28 12:33:23,909 INFO L290 TraceCheckUtils]: 64: Hoare triple {13755#false} ~cond := #in~cond; {13755#false} is VALID [2022-04-28 12:33:23,909 INFO L290 TraceCheckUtils]: 65: Hoare triple {13755#false} assume !(0 == ~cond); {13755#false} is VALID [2022-04-28 12:33:23,909 INFO L290 TraceCheckUtils]: 66: Hoare triple {13755#false} assume true; {13755#false} is VALID [2022-04-28 12:33:23,909 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {13755#false} {13755#false} #102#return; {13755#false} is VALID [2022-04-28 12:33:23,910 INFO L272 TraceCheckUtils]: 68: Hoare triple {13755#false} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13755#false} is VALID [2022-04-28 12:33:23,910 INFO L290 TraceCheckUtils]: 69: Hoare triple {13755#false} ~cond := #in~cond; {13755#false} is VALID [2022-04-28 12:33:23,910 INFO L290 TraceCheckUtils]: 70: Hoare triple {13755#false} assume !(0 == ~cond); {13755#false} is VALID [2022-04-28 12:33:23,910 INFO L290 TraceCheckUtils]: 71: Hoare triple {13755#false} assume true; {13755#false} is VALID [2022-04-28 12:33:23,910 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {13755#false} {13755#false} #104#return; {13755#false} is VALID [2022-04-28 12:33:23,910 INFO L272 TraceCheckUtils]: 73: Hoare triple {13755#false} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13755#false} is VALID [2022-04-28 12:33:23,910 INFO L290 TraceCheckUtils]: 74: Hoare triple {13755#false} ~cond := #in~cond; {13755#false} is VALID [2022-04-28 12:33:23,910 INFO L290 TraceCheckUtils]: 75: Hoare triple {13755#false} assume 0 == ~cond; {13755#false} is VALID [2022-04-28 12:33:23,910 INFO L290 TraceCheckUtils]: 76: Hoare triple {13755#false} assume !false; {13755#false} is VALID [2022-04-28 12:33:23,910 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 12:33:23,910 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:33:23,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:33:23,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415295228] [2022-04-28 12:33:23,911 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:33:23,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284130494] [2022-04-28 12:33:23,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284130494] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:33:23,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:33:23,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:33:23,911 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:33:23,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [173197248] [2022-04-28 12:33:23,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [173197248] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:33:23,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:33:23,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:33:23,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666528529] [2022-04-28 12:33:23,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:33:23,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 77 [2022-04-28 12:33:23,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:33:23,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 12:33:23,963 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-28 12:33:23,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:33:23,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:33:23,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:33:23,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:33:23,964 INFO L87 Difference]: Start difference. First operand 224 states and 308 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 12:33:24,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:33:24,890 INFO L93 Difference]: Finished difference Result 367 states and 500 transitions. [2022-04-28 12:33:24,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 12:33:24,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 77 [2022-04-28 12:33:24,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:33:24,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 12:33:24,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2022-04-28 12:33:24,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 12:33:24,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2022-04-28 12:33:24,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 85 transitions. [2022-04-28 12:33:24,971 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-28 12:33:24,976 INFO L225 Difference]: With dead ends: 367 [2022-04-28 12:33:24,976 INFO L226 Difference]: Without dead ends: 230 [2022-04-28 12:33:24,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 12:33:24,980 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 3 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:33:24,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 109 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:33:24,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-04-28 12:33:25,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 214. [2022-04-28 12:33:25,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:33:25,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 230 states. Second operand has 214 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 127 states have internal predecessors, (149), 71 states have call successors, (71), 17 states have call predecessors, (71), 16 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-28 12:33:25,631 INFO L74 IsIncluded]: Start isIncluded. First operand 230 states. Second operand has 214 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 127 states have internal predecessors, (149), 71 states have call successors, (71), 17 states have call predecessors, (71), 16 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-28 12:33:25,631 INFO L87 Difference]: Start difference. First operand 230 states. Second operand has 214 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 127 states have internal predecessors, (149), 71 states have call successors, (71), 17 states have call predecessors, (71), 16 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-28 12:33:25,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:33:25,637 INFO L93 Difference]: Finished difference Result 230 states and 305 transitions. [2022-04-28 12:33:25,637 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 305 transitions. [2022-04-28 12:33:25,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:33:25,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:33:25,639 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 127 states have internal predecessors, (149), 71 states have call successors, (71), 17 states have call predecessors, (71), 16 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) Second operand 230 states. [2022-04-28 12:33:25,639 INFO L87 Difference]: Start difference. First operand has 214 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 127 states have internal predecessors, (149), 71 states have call successors, (71), 17 states have call predecessors, (71), 16 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) Second operand 230 states. [2022-04-28 12:33:25,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:33:25,645 INFO L93 Difference]: Finished difference Result 230 states and 305 transitions. [2022-04-28 12:33:25,645 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 305 transitions. [2022-04-28 12:33:25,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:33:25,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:33:25,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:33:25,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:33:25,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 127 states have internal predecessors, (149), 71 states have call successors, (71), 17 states have call predecessors, (71), 16 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-28 12:33:25,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 289 transitions. [2022-04-28 12:33:25,652 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 289 transitions. Word has length 77 [2022-04-28 12:33:25,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:33:25,653 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 289 transitions. [2022-04-28 12:33:25,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 12:33:25,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 214 states and 289 transitions. [2022-04-28 12:33:26,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 289 edges. 289 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:33:26,192 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 289 transitions. [2022-04-28 12:33:26,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 12:33:26,193 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:33:26,193 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:33:26,209 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-28 12:33:26,393 WARN L477 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-28 12:33:26,394 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:33:26,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:33:26,394 INFO L85 PathProgramCache]: Analyzing trace with hash -867272991, now seen corresponding path program 5 times [2022-04-28 12:33:26,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:33:26,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1003658730] [2022-04-28 12:33:26,394 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:33:26,394 INFO L85 PathProgramCache]: Analyzing trace with hash -867272991, now seen corresponding path program 6 times [2022-04-28 12:33:26,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:33:26,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91061829] [2022-04-28 12:33:26,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:33:26,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:33:26,410 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:33:26,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1706290032] [2022-04-28 12:33:26,410 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:33:26,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:33:26,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:33:26,412 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-28 12:33:26,417 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-28 12:33:26,470 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 12:33:26,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:33:26,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 65 conjunts are in the unsatisfiable core [2022-04-28 12:33:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:33:26,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:33:27,709 INFO L272 TraceCheckUtils]: 0: Hoare triple {15614#true} call ULTIMATE.init(); {15614#true} is VALID [2022-04-28 12:33:27,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {15614#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {15614#true} is VALID [2022-04-28 12:33:27,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {15614#true} assume true; {15614#true} is VALID [2022-04-28 12:33:27,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15614#true} {15614#true} #112#return; {15614#true} is VALID [2022-04-28 12:33:27,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {15614#true} call #t~ret6 := main(); {15614#true} is VALID [2022-04-28 12:33:27,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {15614#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {15614#true} is VALID [2022-04-28 12:33:27,710 INFO L272 TraceCheckUtils]: 6: Hoare triple {15614#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {15614#true} is VALID [2022-04-28 12:33:27,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {15614#true} ~cond := #in~cond; {15614#true} is VALID [2022-04-28 12:33:27,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {15614#true} assume !(0 == ~cond); {15614#true} is VALID [2022-04-28 12:33:27,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {15614#true} assume true; {15614#true} is VALID [2022-04-28 12:33:27,710 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15614#true} {15614#true} #94#return; {15614#true} is VALID [2022-04-28 12:33:27,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {15614#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {15614#true} is VALID [2022-04-28 12:33:27,710 INFO L272 TraceCheckUtils]: 12: Hoare triple {15614#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {15614#true} is VALID [2022-04-28 12:33:27,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {15614#true} ~cond := #in~cond; {15614#true} is VALID [2022-04-28 12:33:27,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {15614#true} assume !(0 == ~cond); {15614#true} is VALID [2022-04-28 12:33:27,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {15614#true} assume true; {15614#true} is VALID [2022-04-28 12:33:27,711 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15614#true} {15614#true} #96#return; {15614#true} is VALID [2022-04-28 12:33:27,711 INFO L272 TraceCheckUtils]: 17: Hoare triple {15614#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {15614#true} is VALID [2022-04-28 12:33:27,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {15614#true} ~cond := #in~cond; {15614#true} is VALID [2022-04-28 12:33:27,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {15614#true} assume !(0 == ~cond); {15614#true} is VALID [2022-04-28 12:33:27,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {15614#true} assume true; {15614#true} is VALID [2022-04-28 12:33:27,711 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {15614#true} {15614#true} #98#return; {15614#true} is VALID [2022-04-28 12:33:27,711 INFO L272 TraceCheckUtils]: 22: Hoare triple {15614#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {15614#true} is VALID [2022-04-28 12:33:27,711 INFO L290 TraceCheckUtils]: 23: Hoare triple {15614#true} ~cond := #in~cond; {15614#true} is VALID [2022-04-28 12:33:27,711 INFO L290 TraceCheckUtils]: 24: Hoare triple {15614#true} assume !(0 == ~cond); {15614#true} is VALID [2022-04-28 12:33:27,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {15614#true} assume true; {15614#true} is VALID [2022-04-28 12:33:27,711 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {15614#true} {15614#true} #100#return; {15614#true} is VALID [2022-04-28 12:33:27,712 INFO L290 TraceCheckUtils]: 27: Hoare triple {15614#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {15700#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 12:33:27,712 INFO L290 TraceCheckUtils]: 28: Hoare triple {15700#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !false; {15700#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 12:33:27,712 INFO L290 TraceCheckUtils]: 29: Hoare triple {15700#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {15707#(and (= main_~r~0 0) (= main_~k~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 12:33:27,713 INFO L290 TraceCheckUtils]: 30: Hoare triple {15707#(and (= main_~r~0 0) (= main_~k~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !false; {15707#(and (= main_~r~0 0) (= main_~k~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 12:33:27,713 INFO L290 TraceCheckUtils]: 31: Hoare triple {15707#(and (= main_~r~0 0) (= main_~k~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !(~c~0 >= ~b~0); {15707#(and (= main_~r~0 0) (= main_~k~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 12:33:27,714 INFO L290 TraceCheckUtils]: 32: Hoare triple {15707#(and (= main_~r~0 0) (= main_~k~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {15717#(and (= main_~s~0 0) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 12:33:27,715 INFO L290 TraceCheckUtils]: 33: Hoare triple {15717#(and (= main_~s~0 0) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !false; {15717#(and (= main_~s~0 0) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 12:33:27,715 INFO L290 TraceCheckUtils]: 34: Hoare triple {15717#(and (= main_~s~0 0) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {15724#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 12:33:27,715 INFO L290 TraceCheckUtils]: 35: Hoare triple {15724#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0))} assume !false; {15724#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 12:33:27,716 INFO L290 TraceCheckUtils]: 36: Hoare triple {15724#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {15731#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-28 12:33:27,716 INFO L290 TraceCheckUtils]: 37: Hoare triple {15731#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} assume !false; {15731#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-28 12:33:27,716 INFO L272 TraceCheckUtils]: 38: Hoare triple {15731#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {15614#true} is VALID [2022-04-28 12:33:27,716 INFO L290 TraceCheckUtils]: 39: Hoare triple {15614#true} ~cond := #in~cond; {15614#true} is VALID [2022-04-28 12:33:27,716 INFO L290 TraceCheckUtils]: 40: Hoare triple {15614#true} assume !(0 == ~cond); {15614#true} is VALID [2022-04-28 12:33:27,717 INFO L290 TraceCheckUtils]: 41: Hoare triple {15614#true} assume true; {15614#true} is VALID [2022-04-28 12:33:27,717 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15614#true} {15731#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} #102#return; {15731#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-28 12:33:27,717 INFO L272 TraceCheckUtils]: 43: Hoare triple {15731#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {15614#true} is VALID [2022-04-28 12:33:27,718 INFO L290 TraceCheckUtils]: 44: Hoare triple {15614#true} ~cond := #in~cond; {15756#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:33:27,718 INFO L290 TraceCheckUtils]: 45: Hoare triple {15756#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15760#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:33:27,718 INFO L290 TraceCheckUtils]: 46: Hoare triple {15760#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15760#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:33:27,720 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {15760#(not (= |__VERIFIER_assert_#in~cond| 0))} {15731#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} #104#return; {15767#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-28 12:33:27,720 INFO L272 TraceCheckUtils]: 48: Hoare triple {15767#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {15614#true} is VALID [2022-04-28 12:33:27,720 INFO L290 TraceCheckUtils]: 49: Hoare triple {15614#true} ~cond := #in~cond; {15614#true} is VALID [2022-04-28 12:33:27,720 INFO L290 TraceCheckUtils]: 50: Hoare triple {15614#true} assume !(0 == ~cond); {15614#true} is VALID [2022-04-28 12:33:27,720 INFO L290 TraceCheckUtils]: 51: Hoare triple {15614#true} assume true; {15614#true} is VALID [2022-04-28 12:33:27,721 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {15614#true} {15767#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} #106#return; {15767#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-28 12:33:27,721 INFO L272 TraceCheckUtils]: 53: Hoare triple {15767#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {15614#true} is VALID [2022-04-28 12:33:27,721 INFO L290 TraceCheckUtils]: 54: Hoare triple {15614#true} ~cond := #in~cond; {15614#true} is VALID [2022-04-28 12:33:27,721 INFO L290 TraceCheckUtils]: 55: Hoare triple {15614#true} assume !(0 == ~cond); {15614#true} is VALID [2022-04-28 12:33:27,721 INFO L290 TraceCheckUtils]: 56: Hoare triple {15614#true} assume true; {15614#true} is VALID [2022-04-28 12:33:27,722 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {15614#true} {15767#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} #108#return; {15767#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-28 12:33:27,722 INFO L290 TraceCheckUtils]: 58: Hoare triple {15767#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} assume !(~c~0 >= 2 * ~v~0); {15767#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-28 12:33:27,723 INFO L290 TraceCheckUtils]: 59: Hoare triple {15767#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {15804#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~y~0 (+ main_~c~0 main_~b~0)))} is VALID [2022-04-28 12:33:27,723 INFO L290 TraceCheckUtils]: 60: Hoare triple {15804#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~y~0 (+ main_~c~0 main_~b~0)))} assume !false; {15804#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~y~0 (+ main_~c~0 main_~b~0)))} is VALID [2022-04-28 12:33:27,724 INFO L290 TraceCheckUtils]: 61: Hoare triple {15804#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~y~0 (+ main_~c~0 main_~b~0)))} assume !(~c~0 >= ~b~0); {15804#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~y~0 (+ main_~c~0 main_~b~0)))} is VALID [2022-04-28 12:33:27,725 INFO L290 TraceCheckUtils]: 62: Hoare triple {15804#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~y~0 (+ main_~c~0 main_~b~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {15814#(and (= main_~s~0 1) (= main_~x~0 (* main_~x~0 (* (- 1) main_~q~0))) (<= (+ main_~q~0 1) 0) (= main_~a~0 (* main_~x~0 (* (- 1) main_~q~0))) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-28 12:33:27,726 INFO L290 TraceCheckUtils]: 63: Hoare triple {15814#(and (= main_~s~0 1) (= main_~x~0 (* main_~x~0 (* (- 1) main_~q~0))) (<= (+ main_~q~0 1) 0) (= main_~a~0 (* main_~x~0 (* (- 1) main_~q~0))) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0 (* (- 1) main_~q~0)))))} assume !false; {15814#(and (= main_~s~0 1) (= main_~x~0 (* main_~x~0 (* (- 1) main_~q~0))) (<= (+ main_~q~0 1) 0) (= main_~a~0 (* main_~x~0 (* (- 1) main_~q~0))) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-28 12:33:27,726 INFO L290 TraceCheckUtils]: 64: Hoare triple {15814#(and (= main_~s~0 1) (= main_~x~0 (* main_~x~0 (* (- 1) main_~q~0))) (<= (+ main_~q~0 1) 0) (= main_~a~0 (* main_~x~0 (* (- 1) main_~q~0))) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0 (* (- 1) main_~q~0)))))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {15821#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (<= (+ main_~q~0 1) 0) (= (+ (* main_~q~0 main_~x~0) main_~x~0) 0))} is VALID [2022-04-28 12:33:27,727 INFO L290 TraceCheckUtils]: 65: Hoare triple {15821#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (<= (+ main_~q~0 1) 0) (= (+ (* main_~q~0 main_~x~0) main_~x~0) 0))} assume !false; {15821#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (<= (+ main_~q~0 1) 0) (= (+ (* main_~q~0 main_~x~0) main_~x~0) 0))} is VALID [2022-04-28 12:33:27,727 INFO L290 TraceCheckUtils]: 66: Hoare triple {15821#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (<= (+ main_~q~0 1) 0) (= (+ (* main_~q~0 main_~x~0) main_~x~0) 0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {15821#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (<= (+ main_~q~0 1) 0) (= (+ (* main_~q~0 main_~x~0) main_~x~0) 0))} is VALID [2022-04-28 12:33:27,728 INFO L290 TraceCheckUtils]: 67: Hoare triple {15821#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (<= (+ main_~q~0 1) 0) (= (+ (* main_~q~0 main_~x~0) main_~x~0) 0))} assume !false; {15821#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (<= (+ main_~q~0 1) 0) (= (+ (* main_~q~0 main_~x~0) main_~x~0) 0))} is VALID [2022-04-28 12:33:27,728 INFO L272 TraceCheckUtils]: 68: Hoare triple {15821#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (<= (+ main_~q~0 1) 0) (= (+ (* main_~q~0 main_~x~0) main_~x~0) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {15614#true} is VALID [2022-04-28 12:33:27,728 INFO L290 TraceCheckUtils]: 69: Hoare triple {15614#true} ~cond := #in~cond; {15614#true} is VALID [2022-04-28 12:33:27,728 INFO L290 TraceCheckUtils]: 70: Hoare triple {15614#true} assume !(0 == ~cond); {15614#true} is VALID [2022-04-28 12:33:27,728 INFO L290 TraceCheckUtils]: 71: Hoare triple {15614#true} assume true; {15614#true} is VALID [2022-04-28 12:33:27,730 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {15614#true} {15821#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (<= (+ main_~q~0 1) 0) (= (+ (* main_~q~0 main_~x~0) main_~x~0) 0))} #102#return; {15821#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (<= (+ main_~q~0 1) 0) (= (+ (* main_~q~0 main_~x~0) main_~x~0) 0))} is VALID [2022-04-28 12:33:27,730 INFO L272 TraceCheckUtils]: 73: Hoare triple {15821#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (<= (+ main_~q~0 1) 0) (= (+ (* main_~q~0 main_~x~0) main_~x~0) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {15849#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:33:27,731 INFO L290 TraceCheckUtils]: 74: Hoare triple {15849#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15853#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:33:27,731 INFO L290 TraceCheckUtils]: 75: Hoare triple {15853#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15615#false} is VALID [2022-04-28 12:33:27,731 INFO L290 TraceCheckUtils]: 76: Hoare triple {15615#false} assume !false; {15615#false} is VALID [2022-04-28 12:33:27,731 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 32 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-28 12:33:27,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:34:00,130 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:34:00,234 INFO L290 TraceCheckUtils]: 76: Hoare triple {15615#false} assume !false; {15615#false} is VALID [2022-04-28 12:34:00,234 INFO L290 TraceCheckUtils]: 75: Hoare triple {15853#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15615#false} is VALID [2022-04-28 12:34:00,235 INFO L290 TraceCheckUtils]: 74: Hoare triple {15849#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15853#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:34:00,236 INFO L272 TraceCheckUtils]: 73: Hoare triple {15869#(= 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)); {15849#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:34:00,237 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {15614#true} {15869#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #102#return; {15869#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:34:00,237 INFO L290 TraceCheckUtils]: 71: Hoare triple {15614#true} assume true; {15614#true} is VALID [2022-04-28 12:34:00,237 INFO L290 TraceCheckUtils]: 70: Hoare triple {15614#true} assume !(0 == ~cond); {15614#true} is VALID [2022-04-28 12:34:00,237 INFO L290 TraceCheckUtils]: 69: Hoare triple {15614#true} ~cond := #in~cond; {15614#true} is VALID [2022-04-28 12:34:00,237 INFO L272 TraceCheckUtils]: 68: Hoare triple {15869#(= 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)); {15614#true} is VALID [2022-04-28 12:34:00,237 INFO L290 TraceCheckUtils]: 67: Hoare triple {15869#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {15869#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:34:00,238 INFO L290 TraceCheckUtils]: 66: Hoare triple {15869#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {15869#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:34:00,238 INFO L290 TraceCheckUtils]: 65: Hoare triple {15869#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {15869#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:34:00,238 INFO L290 TraceCheckUtils]: 64: Hoare triple {15869#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {15869#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:34:00,239 INFO L290 TraceCheckUtils]: 63: Hoare triple {15869#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {15869#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:34:02,240 WARN L290 TraceCheckUtils]: 62: Hoare triple {15903#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {15869#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is UNKNOWN [2022-04-28 12:34:02,241 INFO L290 TraceCheckUtils]: 61: Hoare triple {15903#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} assume !(~c~0 >= ~b~0); {15903#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-28 12:34:02,241 INFO L290 TraceCheckUtils]: 60: Hoare triple {15903#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} assume !false; {15903#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-28 12:34:02,897 INFO L290 TraceCheckUtils]: 59: Hoare triple {15913#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {15903#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-28 12:34:02,898 INFO L290 TraceCheckUtils]: 58: Hoare triple {15913#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !(~c~0 >= 2 * ~v~0); {15913#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:34:02,899 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {15614#true} {15913#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #108#return; {15913#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:34:02,899 INFO L290 TraceCheckUtils]: 56: Hoare triple {15614#true} assume true; {15614#true} is VALID [2022-04-28 12:34:02,899 INFO L290 TraceCheckUtils]: 55: Hoare triple {15614#true} assume !(0 == ~cond); {15614#true} is VALID [2022-04-28 12:34:02,899 INFO L290 TraceCheckUtils]: 54: Hoare triple {15614#true} ~cond := #in~cond; {15614#true} is VALID [2022-04-28 12:34:02,899 INFO L272 TraceCheckUtils]: 53: Hoare triple {15913#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {15614#true} is VALID [2022-04-28 12:34:02,900 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {15614#true} {15913#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #106#return; {15913#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:34:02,900 INFO L290 TraceCheckUtils]: 51: Hoare triple {15614#true} assume true; {15614#true} is VALID [2022-04-28 12:34:02,900 INFO L290 TraceCheckUtils]: 50: Hoare triple {15614#true} assume !(0 == ~cond); {15614#true} is VALID [2022-04-28 12:34:02,900 INFO L290 TraceCheckUtils]: 49: Hoare triple {15614#true} ~cond := #in~cond; {15614#true} is VALID [2022-04-28 12:34:02,900 INFO L272 TraceCheckUtils]: 48: Hoare triple {15913#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {15614#true} is VALID [2022-04-28 12:34:02,901 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {15760#(not (= |__VERIFIER_assert_#in~cond| 0))} {15950#(or (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #104#return; {15913#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:34:02,902 INFO L290 TraceCheckUtils]: 46: Hoare triple {15760#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15760#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:34:02,902 INFO L290 TraceCheckUtils]: 45: Hoare triple {15960#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15760#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:34:02,902 INFO L290 TraceCheckUtils]: 44: Hoare triple {15614#true} ~cond := #in~cond; {15960#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:34:02,902 INFO L272 TraceCheckUtils]: 43: Hoare triple {15950#(or (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {15614#true} is VALID [2022-04-28 12:34:02,903 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15614#true} {15950#(or (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #102#return; {15950#(or (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 12:34:02,903 INFO L290 TraceCheckUtils]: 41: Hoare triple {15614#true} assume true; {15614#true} is VALID [2022-04-28 12:34:02,903 INFO L290 TraceCheckUtils]: 40: Hoare triple {15614#true} assume !(0 == ~cond); {15614#true} is VALID [2022-04-28 12:34:02,903 INFO L290 TraceCheckUtils]: 39: Hoare triple {15614#true} ~cond := #in~cond; {15614#true} is VALID [2022-04-28 12:34:02,903 INFO L272 TraceCheckUtils]: 38: Hoare triple {15950#(or (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {15614#true} is VALID [2022-04-28 12:34:02,904 INFO L290 TraceCheckUtils]: 37: Hoare triple {15950#(or (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !false; {15950#(or (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 12:34:02,904 INFO L290 TraceCheckUtils]: 36: Hoare triple {15985#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) main_~c~0 (* (- 1) main_~b~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {15950#(or (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 12:34:02,905 INFO L290 TraceCheckUtils]: 35: Hoare triple {15985#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) main_~c~0 (* (- 1) main_~b~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !false; {15985#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) main_~c~0 (* (- 1) main_~b~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:34:02,905 INFO L290 TraceCheckUtils]: 34: Hoare triple {15992#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~a~0 (* (- 1) main_~b~0) (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {15985#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) main_~c~0 (* (- 1) main_~b~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:34:02,919 INFO L290 TraceCheckUtils]: 33: Hoare triple {15992#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~a~0 (* (- 1) main_~b~0) (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !false; {15992#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~a~0 (* (- 1) main_~b~0) (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:34:03,022 INFO L290 TraceCheckUtils]: 32: Hoare triple {15999#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)) (= (+ (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0 1) (* (- 1) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0 1) main_~b~0 (* (- 1) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {15992#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~a~0 (* (- 1) main_~b~0) (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:34:03,023 INFO L290 TraceCheckUtils]: 31: Hoare triple {15999#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)) (= (+ (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0 1) (* (- 1) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0 1) main_~b~0 (* (- 1) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {15999#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)) (= (+ (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0 1) (* (- 1) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0 1) main_~b~0 (* (- 1) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:34:03,023 INFO L290 TraceCheckUtils]: 30: Hoare triple {15999#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)) (= (+ (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0 1) (* (- 1) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0 1) main_~b~0 (* (- 1) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {15999#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)) (= (+ (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0 1) (* (- 1) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0 1) main_~b~0 (* (- 1) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:34:03,024 INFO L290 TraceCheckUtils]: 29: Hoare triple {16009#(or (= (+ (* main_~y~0 main_~r~0 1) (* main_~p~0 main_~x~0 1) main_~b~0 (* (- 1) (* main_~p~0 main_~x~0)) (* (- 1) (* main_~y~0 main_~r~0))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {15999#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)) (= (+ (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0 1) (* (- 1) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0 1) main_~b~0 (* (- 1) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:34:03,024 INFO L290 TraceCheckUtils]: 28: Hoare triple {16009#(or (= (+ (* main_~y~0 main_~r~0 1) (* main_~p~0 main_~x~0 1) main_~b~0 (* (- 1) (* main_~p~0 main_~x~0)) (* (- 1) (* main_~y~0 main_~r~0))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !false; {16009#(or (= (+ (* main_~y~0 main_~r~0 1) (* main_~p~0 main_~x~0 1) main_~b~0 (* (- 1) (* main_~p~0 main_~x~0)) (* (- 1) (* main_~y~0 main_~r~0))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-28 12:34:03,025 INFO L290 TraceCheckUtils]: 27: Hoare triple {15614#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {16009#(or (= (+ (* main_~y~0 main_~r~0 1) (* main_~p~0 main_~x~0 1) main_~b~0 (* (- 1) (* main_~p~0 main_~x~0)) (* (- 1) (* main_~y~0 main_~r~0))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-28 12:34:03,025 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {15614#true} {15614#true} #100#return; {15614#true} is VALID [2022-04-28 12:34:03,025 INFO L290 TraceCheckUtils]: 25: Hoare triple {15614#true} assume true; {15614#true} is VALID [2022-04-28 12:34:03,025 INFO L290 TraceCheckUtils]: 24: Hoare triple {15614#true} assume !(0 == ~cond); {15614#true} is VALID [2022-04-28 12:34:03,025 INFO L290 TraceCheckUtils]: 23: Hoare triple {15614#true} ~cond := #in~cond; {15614#true} is VALID [2022-04-28 12:34:03,025 INFO L272 TraceCheckUtils]: 22: Hoare triple {15614#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {15614#true} is VALID [2022-04-28 12:34:03,025 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {15614#true} {15614#true} #98#return; {15614#true} is VALID [2022-04-28 12:34:03,025 INFO L290 TraceCheckUtils]: 20: Hoare triple {15614#true} assume true; {15614#true} is VALID [2022-04-28 12:34:03,025 INFO L290 TraceCheckUtils]: 19: Hoare triple {15614#true} assume !(0 == ~cond); {15614#true} is VALID [2022-04-28 12:34:03,025 INFO L290 TraceCheckUtils]: 18: Hoare triple {15614#true} ~cond := #in~cond; {15614#true} is VALID [2022-04-28 12:34:03,025 INFO L272 TraceCheckUtils]: 17: Hoare triple {15614#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {15614#true} is VALID [2022-04-28 12:34:03,026 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15614#true} {15614#true} #96#return; {15614#true} is VALID [2022-04-28 12:34:03,026 INFO L290 TraceCheckUtils]: 15: Hoare triple {15614#true} assume true; {15614#true} is VALID [2022-04-28 12:34:03,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {15614#true} assume !(0 == ~cond); {15614#true} is VALID [2022-04-28 12:34:03,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {15614#true} ~cond := #in~cond; {15614#true} is VALID [2022-04-28 12:34:03,026 INFO L272 TraceCheckUtils]: 12: Hoare triple {15614#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {15614#true} is VALID [2022-04-28 12:34:03,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {15614#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {15614#true} is VALID [2022-04-28 12:34:03,026 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15614#true} {15614#true} #94#return; {15614#true} is VALID [2022-04-28 12:34:03,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {15614#true} assume true; {15614#true} is VALID [2022-04-28 12:34:03,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {15614#true} assume !(0 == ~cond); {15614#true} is VALID [2022-04-28 12:34:03,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {15614#true} ~cond := #in~cond; {15614#true} is VALID [2022-04-28 12:34:03,026 INFO L272 TraceCheckUtils]: 6: Hoare triple {15614#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {15614#true} is VALID [2022-04-28 12:34:03,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {15614#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {15614#true} is VALID [2022-04-28 12:34:03,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {15614#true} call #t~ret6 := main(); {15614#true} is VALID [2022-04-28 12:34:03,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15614#true} {15614#true} #112#return; {15614#true} is VALID [2022-04-28 12:34:03,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {15614#true} assume true; {15614#true} is VALID [2022-04-28 12:34:03,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {15614#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {15614#true} is VALID [2022-04-28 12:34:03,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {15614#true} call ULTIMATE.init(); {15614#true} is VALID [2022-04-28 12:34:03,027 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 18 proven. 26 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-28 12:34:03,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:34:03,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91061829] [2022-04-28 12:34:03,027 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:34:03,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706290032] [2022-04-28 12:34:03,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706290032] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:34:03,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:34:03,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 24 [2022-04-28 12:34:03,028 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:34:03,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1003658730] [2022-04-28 12:34:03,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1003658730] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:34:03,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:34:03,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 12:34:03,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793679277] [2022-04-28 12:34:03,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:34:03,028 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 77 [2022-04-28 12:34:03,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:34:03,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-28 12:34:03,081 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-28 12:34:03,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 12:34:03,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:34:03,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 12:34:03,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2022-04-28 12:34:03,082 INFO L87 Difference]: Start difference. First operand 214 states and 289 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-28 12:34:05,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:34:05,991 INFO L93 Difference]: Finished difference Result 285 states and 377 transitions. [2022-04-28 12:34:05,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 12:34:05,992 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 77 [2022-04-28 12:34:05,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:34:05,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-28 12:34:05,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 148 transitions. [2022-04-28 12:34:05,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-28 12:34:05,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 148 transitions. [2022-04-28 12:34:05,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 148 transitions. [2022-04-28 12:34:06,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:34:06,189 INFO L225 Difference]: With dead ends: 285 [2022-04-28 12:34:06,189 INFO L226 Difference]: Without dead ends: 283 [2022-04-28 12:34:06,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=780, Unknown=0, NotChecked=0, Total=930 [2022-04-28 12:34:06,190 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 64 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 12:34:06,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 341 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 12:34:06,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-04-28 12:34:07,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 265. [2022-04-28 12:34:07,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:34:07,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 283 states. Second operand has 265 states, 157 states have (on average 1.178343949044586) internal successors, (185), 158 states have internal predecessors, (185), 87 states have call successors, (87), 21 states have call predecessors, (87), 20 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-04-28 12:34:07,077 INFO L74 IsIncluded]: Start isIncluded. First operand 283 states. Second operand has 265 states, 157 states have (on average 1.178343949044586) internal successors, (185), 158 states have internal predecessors, (185), 87 states have call successors, (87), 21 states have call predecessors, (87), 20 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-04-28 12:34:07,078 INFO L87 Difference]: Start difference. First operand 283 states. Second operand has 265 states, 157 states have (on average 1.178343949044586) internal successors, (185), 158 states have internal predecessors, (185), 87 states have call successors, (87), 21 states have call predecessors, (87), 20 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-04-28 12:34:07,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:34:07,085 INFO L93 Difference]: Finished difference Result 283 states and 375 transitions. [2022-04-28 12:34:07,085 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 375 transitions. [2022-04-28 12:34:07,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:34:07,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:34:07,087 INFO L74 IsIncluded]: Start isIncluded. First operand has 265 states, 157 states have (on average 1.178343949044586) internal successors, (185), 158 states have internal predecessors, (185), 87 states have call successors, (87), 21 states have call predecessors, (87), 20 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) Second operand 283 states. [2022-04-28 12:34:07,088 INFO L87 Difference]: Start difference. First operand has 265 states, 157 states have (on average 1.178343949044586) internal successors, (185), 158 states have internal predecessors, (185), 87 states have call successors, (87), 21 states have call predecessors, (87), 20 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) Second operand 283 states. [2022-04-28 12:34:07,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:34:07,096 INFO L93 Difference]: Finished difference Result 283 states and 375 transitions. [2022-04-28 12:34:07,096 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 375 transitions. [2022-04-28 12:34:07,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:34:07,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:34:07,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:34:07,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:34:07,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 157 states have (on average 1.178343949044586) internal successors, (185), 158 states have internal predecessors, (185), 87 states have call successors, (87), 21 states have call predecessors, (87), 20 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-04-28 12:34:07,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 357 transitions. [2022-04-28 12:34:07,106 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 357 transitions. Word has length 77 [2022-04-28 12:34:07,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:34:07,106 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 357 transitions. [2022-04-28 12:34:07,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-28 12:34:07,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 265 states and 357 transitions. [2022-04-28 12:34:07,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 357 edges. 357 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:34:07,829 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 357 transitions. [2022-04-28 12:34:07,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 12:34:07,831 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:34:07,831 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:34:07,850 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-28 12:34:08,043 WARN L477 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-28 12:34:08,044 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:34:08,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:34:08,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1679616651, now seen corresponding path program 1 times [2022-04-28 12:34:08,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:34:08,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [283579109] [2022-04-28 12:34:08,044 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:34:08,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1679616651, now seen corresponding path program 2 times [2022-04-28 12:34:08,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:34:08,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948986869] [2022-04-28 12:34:08,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:34:08,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:34:08,061 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:34:08,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [867136629] [2022-04-28 12:34:08,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:34:08,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:34:08,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:34:08,062 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-28 12:34:08,066 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-28 12:34:08,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:34:08,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:34:08,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-28 12:34:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:34:08,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:34:09,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {17779#true} call ULTIMATE.init(); {17779#true} is VALID [2022-04-28 12:34:09,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {17779#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {17779#true} is VALID [2022-04-28 12:34:09,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {17779#true} assume true; {17779#true} is VALID [2022-04-28 12:34:09,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17779#true} {17779#true} #112#return; {17779#true} is VALID [2022-04-28 12:34:09,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {17779#true} call #t~ret6 := main(); {17779#true} is VALID [2022-04-28 12:34:09,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {17779#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {17779#true} is VALID [2022-04-28 12:34:09,094 INFO L272 TraceCheckUtils]: 6: Hoare triple {17779#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {17779#true} is VALID [2022-04-28 12:34:09,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {17779#true} ~cond := #in~cond; {17779#true} is VALID [2022-04-28 12:34:09,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {17779#true} assume !(0 == ~cond); {17779#true} is VALID [2022-04-28 12:34:09,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {17779#true} assume true; {17779#true} is VALID [2022-04-28 12:34:09,094 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17779#true} {17779#true} #94#return; {17779#true} is VALID [2022-04-28 12:34:09,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {17779#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {17779#true} is VALID [2022-04-28 12:34:09,094 INFO L272 TraceCheckUtils]: 12: Hoare triple {17779#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {17779#true} is VALID [2022-04-28 12:34:09,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {17779#true} ~cond := #in~cond; {17779#true} is VALID [2022-04-28 12:34:09,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {17779#true} assume !(0 == ~cond); {17779#true} is VALID [2022-04-28 12:34:09,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {17779#true} assume true; {17779#true} is VALID [2022-04-28 12:34:09,095 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17779#true} {17779#true} #96#return; {17779#true} is VALID [2022-04-28 12:34:09,095 INFO L272 TraceCheckUtils]: 17: Hoare triple {17779#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {17779#true} is VALID [2022-04-28 12:34:09,095 INFO L290 TraceCheckUtils]: 18: Hoare triple {17779#true} ~cond := #in~cond; {17779#true} is VALID [2022-04-28 12:34:09,095 INFO L290 TraceCheckUtils]: 19: Hoare triple {17779#true} assume !(0 == ~cond); {17779#true} is VALID [2022-04-28 12:34:09,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {17779#true} assume true; {17779#true} is VALID [2022-04-28 12:34:09,095 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {17779#true} {17779#true} #98#return; {17779#true} is VALID [2022-04-28 12:34:09,095 INFO L272 TraceCheckUtils]: 22: Hoare triple {17779#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {17779#true} is VALID [2022-04-28 12:34:09,096 INFO L290 TraceCheckUtils]: 23: Hoare triple {17779#true} ~cond := #in~cond; {17779#true} is VALID [2022-04-28 12:34:09,096 INFO L290 TraceCheckUtils]: 24: Hoare triple {17779#true} assume !(0 == ~cond); {17779#true} is VALID [2022-04-28 12:34:09,096 INFO L290 TraceCheckUtils]: 25: Hoare triple {17779#true} assume true; {17779#true} is VALID [2022-04-28 12:34:09,096 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {17779#true} {17779#true} #100#return; {17779#true} is VALID [2022-04-28 12:34:09,103 INFO L290 TraceCheckUtils]: 27: Hoare triple {17779#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {17865#(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-28 12:34:09,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {17865#(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; {17865#(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-28 12:34:09,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {17865#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {17872#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:34:09,105 INFO L290 TraceCheckUtils]: 30: Hoare triple {17872#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {17872#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:34:09,105 INFO L290 TraceCheckUtils]: 31: Hoare triple {17872#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {17879#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:34:09,106 INFO L290 TraceCheckUtils]: 32: Hoare triple {17879#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {17879#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:34:09,106 INFO L272 TraceCheckUtils]: 33: Hoare triple {17879#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {17779#true} is VALID [2022-04-28 12:34:09,106 INFO L290 TraceCheckUtils]: 34: Hoare triple {17779#true} ~cond := #in~cond; {17779#true} is VALID [2022-04-28 12:34:09,106 INFO L290 TraceCheckUtils]: 35: Hoare triple {17779#true} assume !(0 == ~cond); {17779#true} is VALID [2022-04-28 12:34:09,106 INFO L290 TraceCheckUtils]: 36: Hoare triple {17779#true} assume true; {17779#true} is VALID [2022-04-28 12:34:09,107 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {17779#true} {17879#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #102#return; {17879#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:34:09,107 INFO L272 TraceCheckUtils]: 38: Hoare triple {17879#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {17779#true} is VALID [2022-04-28 12:34:09,108 INFO L290 TraceCheckUtils]: 39: Hoare triple {17779#true} ~cond := #in~cond; {17779#true} is VALID [2022-04-28 12:34:09,108 INFO L290 TraceCheckUtils]: 40: Hoare triple {17779#true} assume !(0 == ~cond); {17779#true} is VALID [2022-04-28 12:34:09,108 INFO L290 TraceCheckUtils]: 41: Hoare triple {17779#true} assume true; {17779#true} is VALID [2022-04-28 12:34:09,109 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {17779#true} {17879#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #104#return; {17879#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:34:09,109 INFO L272 TraceCheckUtils]: 43: Hoare triple {17879#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {17779#true} is VALID [2022-04-28 12:34:09,109 INFO L290 TraceCheckUtils]: 44: Hoare triple {17779#true} ~cond := #in~cond; {17779#true} is VALID [2022-04-28 12:34:09,109 INFO L290 TraceCheckUtils]: 45: Hoare triple {17779#true} assume !(0 == ~cond); {17779#true} is VALID [2022-04-28 12:34:09,109 INFO L290 TraceCheckUtils]: 46: Hoare triple {17779#true} assume true; {17779#true} is VALID [2022-04-28 12:34:09,110 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17779#true} {17879#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #106#return; {17879#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:34:09,110 INFO L272 TraceCheckUtils]: 48: Hoare triple {17879#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {17779#true} is VALID [2022-04-28 12:34:09,110 INFO L290 TraceCheckUtils]: 49: Hoare triple {17779#true} ~cond := #in~cond; {17779#true} is VALID [2022-04-28 12:34:09,110 INFO L290 TraceCheckUtils]: 50: Hoare triple {17779#true} assume !(0 == ~cond); {17779#true} is VALID [2022-04-28 12:34:09,110 INFO L290 TraceCheckUtils]: 51: Hoare triple {17779#true} assume true; {17779#true} is VALID [2022-04-28 12:34:09,111 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {17779#true} {17879#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #108#return; {17879#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:34:09,112 INFO L290 TraceCheckUtils]: 53: Hoare triple {17879#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {17946#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:34:09,113 INFO L290 TraceCheckUtils]: 54: Hoare triple {17946#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {17946#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:34:09,113 INFO L272 TraceCheckUtils]: 55: Hoare triple {17946#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= 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)); {17779#true} is VALID [2022-04-28 12:34:09,113 INFO L290 TraceCheckUtils]: 56: Hoare triple {17779#true} ~cond := #in~cond; {17956#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:34:09,114 INFO L290 TraceCheckUtils]: 57: Hoare triple {17956#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17960#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:34:09,114 INFO L290 TraceCheckUtils]: 58: Hoare triple {17960#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17960#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:34:09,115 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {17960#(not (= |__VERIFIER_assert_#in~cond| 0))} {17946#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #102#return; {17967#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:34:09,115 INFO L272 TraceCheckUtils]: 60: Hoare triple {17967#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {17779#true} is VALID [2022-04-28 12:34:09,116 INFO L290 TraceCheckUtils]: 61: Hoare triple {17779#true} ~cond := #in~cond; {17956#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:34:09,116 INFO L290 TraceCheckUtils]: 62: Hoare triple {17956#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17960#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:34:09,116 INFO L290 TraceCheckUtils]: 63: Hoare triple {17960#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17960#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:34:09,117 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {17960#(not (= |__VERIFIER_assert_#in~cond| 0))} {17967#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #104#return; {17967#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:34:09,117 INFO L272 TraceCheckUtils]: 65: Hoare triple {17967#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {17779#true} is VALID [2022-04-28 12:34:09,117 INFO L290 TraceCheckUtils]: 66: Hoare triple {17779#true} ~cond := #in~cond; {17779#true} is VALID [2022-04-28 12:34:09,117 INFO L290 TraceCheckUtils]: 67: Hoare triple {17779#true} assume !(0 == ~cond); {17779#true} is VALID [2022-04-28 12:34:09,117 INFO L290 TraceCheckUtils]: 68: Hoare triple {17779#true} assume true; {17779#true} is VALID [2022-04-28 12:34:09,118 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {17779#true} {17967#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #106#return; {17967#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:34:09,118 INFO L272 TraceCheckUtils]: 70: Hoare triple {17967#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {17779#true} is VALID [2022-04-28 12:34:09,118 INFO L290 TraceCheckUtils]: 71: Hoare triple {17779#true} ~cond := #in~cond; {17779#true} is VALID [2022-04-28 12:34:09,118 INFO L290 TraceCheckUtils]: 72: Hoare triple {17779#true} assume !(0 == ~cond); {17779#true} is VALID [2022-04-28 12:34:09,118 INFO L290 TraceCheckUtils]: 73: Hoare triple {17779#true} assume true; {17779#true} is VALID [2022-04-28 12:34:09,119 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {17779#true} {17967#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #108#return; {17967#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:34:09,120 INFO L290 TraceCheckUtils]: 75: Hoare triple {17967#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {17967#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:34:09,120 INFO L290 TraceCheckUtils]: 76: Hoare triple {17967#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {18019#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~c~0 (+ (* (- 2) main_~b~0) main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-28 12:34:09,121 INFO L290 TraceCheckUtils]: 77: Hoare triple {18019#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~c~0 (+ (* (- 2) main_~b~0) main_~x~0)) (= main_~p~0 1))} assume !false; {18019#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~c~0 (+ (* (- 2) main_~b~0) main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-28 12:34:09,121 INFO L290 TraceCheckUtils]: 78: Hoare triple {18019#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~c~0 (+ (* (- 2) main_~b~0) main_~x~0)) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {18019#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~c~0 (+ (* (- 2) main_~b~0) main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-28 12:34:09,122 INFO L290 TraceCheckUtils]: 79: Hoare triple {18019#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~c~0 (+ (* (- 2) main_~b~0) main_~x~0)) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {18029#(and (= main_~p~0 0) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (* main_~p~0 2) main_~q~0) 1) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-28 12:34:09,122 INFO L290 TraceCheckUtils]: 80: Hoare triple {18029#(and (= main_~p~0 0) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (* main_~p~0 2) main_~q~0) 1) (= (+ main_~s~0 (* main_~r~0 2)) 0))} assume !false; {18029#(and (= main_~p~0 0) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (* main_~p~0 2) main_~q~0) 1) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-28 12:34:09,123 INFO L290 TraceCheckUtils]: 81: Hoare triple {18029#(and (= main_~p~0 0) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (* main_~p~0 2) main_~q~0) 1) (= (+ main_~s~0 (* main_~r~0 2)) 0))} assume !(0 != ~b~0); {18036#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~x~0 (* (- 2) main_~a~0)) 0) (= (+ (* main_~p~0 2) main_~q~0) 1) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-28 12:34:09,124 INFO L272 TraceCheckUtils]: 82: Hoare triple {18036#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~x~0 (* (- 2) main_~a~0)) 0) (= (+ (* main_~p~0 2) main_~q~0) 1) (= (+ main_~s~0 (* main_~r~0 2)) 0))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {18040#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:34:09,124 INFO L290 TraceCheckUtils]: 83: Hoare triple {18040#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18044#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:34:09,124 INFO L290 TraceCheckUtils]: 84: Hoare triple {18044#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17780#false} is VALID [2022-04-28 12:34:09,124 INFO L290 TraceCheckUtils]: 85: Hoare triple {17780#false} assume !false; {17780#false} is VALID [2022-04-28 12:34:09,125 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 38 proven. 24 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-28 12:34:09,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:34:48,665 INFO L290 TraceCheckUtils]: 85: Hoare triple {17780#false} assume !false; {17780#false} is VALID [2022-04-28 12:34:48,665 INFO L290 TraceCheckUtils]: 84: Hoare triple {18044#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17780#false} is VALID [2022-04-28 12:34:48,665 INFO L290 TraceCheckUtils]: 83: Hoare triple {18040#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18044#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:34:48,666 INFO L272 TraceCheckUtils]: 82: Hoare triple {18060#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {18040#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:34:48,667 INFO L290 TraceCheckUtils]: 81: Hoare triple {18064#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !(0 != ~b~0); {18060#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:34:48,667 INFO L290 TraceCheckUtils]: 80: Hoare triple {18064#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !false; {18064#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-28 12:34:48,773 INFO L290 TraceCheckUtils]: 79: Hoare triple {18071#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {18064#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-28 12:34:48,774 INFO L290 TraceCheckUtils]: 78: Hoare triple {18071#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {18071#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:34:48,774 INFO L290 TraceCheckUtils]: 77: Hoare triple {18071#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {18071#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:34:48,816 INFO L290 TraceCheckUtils]: 76: Hoare triple {18081#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {18071#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:34:48,830 INFO L290 TraceCheckUtils]: 75: Hoare triple {18081#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= 2 * ~v~0); {18081#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:34:48,831 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {17779#true} {18081#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #108#return; {18081#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:34:48,831 INFO L290 TraceCheckUtils]: 73: Hoare triple {17779#true} assume true; {17779#true} is VALID [2022-04-28 12:34:48,831 INFO L290 TraceCheckUtils]: 72: Hoare triple {17779#true} assume !(0 == ~cond); {17779#true} is VALID [2022-04-28 12:34:48,832 INFO L290 TraceCheckUtils]: 71: Hoare triple {17779#true} ~cond := #in~cond; {17779#true} is VALID [2022-04-28 12:34:48,832 INFO L272 TraceCheckUtils]: 70: Hoare triple {18081#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {17779#true} is VALID [2022-04-28 12:34:48,832 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {17779#true} {18081#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #106#return; {18081#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:34:48,832 INFO L290 TraceCheckUtils]: 68: Hoare triple {17779#true} assume true; {17779#true} is VALID [2022-04-28 12:34:48,833 INFO L290 TraceCheckUtils]: 67: Hoare triple {17779#true} assume !(0 == ~cond); {17779#true} is VALID [2022-04-28 12:34:48,833 INFO L290 TraceCheckUtils]: 66: Hoare triple {17779#true} ~cond := #in~cond; {17779#true} is VALID [2022-04-28 12:34:48,833 INFO L272 TraceCheckUtils]: 65: Hoare triple {18081#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {17779#true} is VALID [2022-04-28 12:34:48,834 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {17960#(not (= |__VERIFIER_assert_#in~cond| 0))} {18118#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {18081#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:34:48,834 INFO L290 TraceCheckUtils]: 63: Hoare triple {17960#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17960#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:34:48,834 INFO L290 TraceCheckUtils]: 62: Hoare triple {18128#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {17960#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:34:48,835 INFO L290 TraceCheckUtils]: 61: Hoare triple {17779#true} ~cond := #in~cond; {18128#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:34:48,835 INFO L272 TraceCheckUtils]: 60: Hoare triple {18118#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {17779#true} is VALID [2022-04-28 12:34:48,836 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {17960#(not (= |__VERIFIER_assert_#in~cond| 0))} {18135#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #102#return; {18118#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:34:48,836 INFO L290 TraceCheckUtils]: 58: Hoare triple {17960#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17960#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:34:48,836 INFO L290 TraceCheckUtils]: 57: Hoare triple {18128#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {17960#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:34:48,837 INFO L290 TraceCheckUtils]: 56: Hoare triple {17779#true} ~cond := #in~cond; {18128#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:34:48,837 INFO L272 TraceCheckUtils]: 55: Hoare triple {18135#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {17779#true} is VALID [2022-04-28 12:34:48,837 INFO L290 TraceCheckUtils]: 54: Hoare triple {18135#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {18135#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:34:48,969 INFO L290 TraceCheckUtils]: 53: Hoare triple {18154#(or (not (= (* main_~v~0 2) main_~c~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {18135#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:34:48,970 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {17779#true} {18154#(or (not (= (* main_~v~0 2) main_~c~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} #108#return; {18154#(or (not (= (* main_~v~0 2) main_~c~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} is VALID [2022-04-28 12:34:48,970 INFO L290 TraceCheckUtils]: 51: Hoare triple {17779#true} assume true; {17779#true} is VALID [2022-04-28 12:34:48,970 INFO L290 TraceCheckUtils]: 50: Hoare triple {17779#true} assume !(0 == ~cond); {17779#true} is VALID [2022-04-28 12:34:48,970 INFO L290 TraceCheckUtils]: 49: Hoare triple {17779#true} ~cond := #in~cond; {17779#true} is VALID [2022-04-28 12:34:48,970 INFO L272 TraceCheckUtils]: 48: Hoare triple {18154#(or (not (= (* main_~v~0 2) main_~c~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {17779#true} is VALID [2022-04-28 12:34:48,971 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17779#true} {18154#(or (not (= (* main_~v~0 2) main_~c~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} #106#return; {18154#(or (not (= (* main_~v~0 2) main_~c~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} is VALID [2022-04-28 12:34:48,971 INFO L290 TraceCheckUtils]: 46: Hoare triple {17779#true} assume true; {17779#true} is VALID [2022-04-28 12:34:48,971 INFO L290 TraceCheckUtils]: 45: Hoare triple {17779#true} assume !(0 == ~cond); {17779#true} is VALID [2022-04-28 12:34:48,971 INFO L290 TraceCheckUtils]: 44: Hoare triple {17779#true} ~cond := #in~cond; {17779#true} is VALID [2022-04-28 12:34:48,971 INFO L272 TraceCheckUtils]: 43: Hoare triple {18154#(or (not (= (* main_~v~0 2) main_~c~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {17779#true} is VALID [2022-04-28 12:34:48,972 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {17779#true} {18154#(or (not (= (* main_~v~0 2) main_~c~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} #104#return; {18154#(or (not (= (* main_~v~0 2) main_~c~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} is VALID [2022-04-28 12:34:48,972 INFO L290 TraceCheckUtils]: 41: Hoare triple {17779#true} assume true; {17779#true} is VALID [2022-04-28 12:34:48,972 INFO L290 TraceCheckUtils]: 40: Hoare triple {17779#true} assume !(0 == ~cond); {17779#true} is VALID [2022-04-28 12:34:48,972 INFO L290 TraceCheckUtils]: 39: Hoare triple {17779#true} ~cond := #in~cond; {17779#true} is VALID [2022-04-28 12:34:48,972 INFO L272 TraceCheckUtils]: 38: Hoare triple {18154#(or (not (= (* main_~v~0 2) main_~c~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {17779#true} is VALID [2022-04-28 12:34:48,973 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {17779#true} {18154#(or (not (= (* main_~v~0 2) main_~c~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} #102#return; {18154#(or (not (= (* main_~v~0 2) main_~c~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} is VALID [2022-04-28 12:34:48,973 INFO L290 TraceCheckUtils]: 36: Hoare triple {17779#true} assume true; {17779#true} is VALID [2022-04-28 12:34:48,973 INFO L290 TraceCheckUtils]: 35: Hoare triple {17779#true} assume !(0 == ~cond); {17779#true} is VALID [2022-04-28 12:34:48,973 INFO L290 TraceCheckUtils]: 34: Hoare triple {17779#true} ~cond := #in~cond; {17779#true} is VALID [2022-04-28 12:34:48,973 INFO L272 TraceCheckUtils]: 33: Hoare triple {18154#(or (not (= (* main_~v~0 2) main_~c~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {17779#true} is VALID [2022-04-28 12:34:48,974 INFO L290 TraceCheckUtils]: 32: Hoare triple {18154#(or (not (= (* main_~v~0 2) main_~c~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} assume !false; {18154#(or (not (= (* main_~v~0 2) main_~c~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} is VALID [2022-04-28 12:34:48,975 INFO L290 TraceCheckUtils]: 31: Hoare triple {18221#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 (* main_~b~0 2))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ main_~b~0 (* main_~y~0 (+ (* (* (+ main_~k~0 2) main_~s~0) (- 1)) main_~r~0)) (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 2) main_~q~0))))))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {18154#(or (not (= (* main_~v~0 2) main_~c~0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} is VALID [2022-04-28 12:34:48,975 INFO L290 TraceCheckUtils]: 30: Hoare triple {18221#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 (* main_~b~0 2))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ main_~b~0 (* main_~y~0 (+ (* (* (+ main_~k~0 2) main_~s~0) (- 1)) main_~r~0)) (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 2) main_~q~0))))))} assume !false; {18221#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 (* main_~b~0 2))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ main_~b~0 (* main_~y~0 (+ (* (* (+ main_~k~0 2) main_~s~0) (- 1)) main_~r~0)) (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 2) main_~q~0))))))} is VALID [2022-04-28 12:34:48,976 INFO L290 TraceCheckUtils]: 29: Hoare triple {17779#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {18221#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 (* main_~b~0 2))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ main_~b~0 (* main_~y~0 (+ (* (* (+ main_~k~0 2) main_~s~0) (- 1)) main_~r~0)) (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 2) main_~q~0))))))} is VALID [2022-04-28 12:34:48,976 INFO L290 TraceCheckUtils]: 28: Hoare triple {17779#true} assume !false; {17779#true} is VALID [2022-04-28 12:34:48,977 INFO L290 TraceCheckUtils]: 27: Hoare triple {17779#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {17779#true} is VALID [2022-04-28 12:34:48,977 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {17779#true} {17779#true} #100#return; {17779#true} is VALID [2022-04-28 12:34:48,977 INFO L290 TraceCheckUtils]: 25: Hoare triple {17779#true} assume true; {17779#true} is VALID [2022-04-28 12:34:48,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {17779#true} assume !(0 == ~cond); {17779#true} is VALID [2022-04-28 12:34:48,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {17779#true} ~cond := #in~cond; {17779#true} is VALID [2022-04-28 12:34:48,977 INFO L272 TraceCheckUtils]: 22: Hoare triple {17779#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {17779#true} is VALID [2022-04-28 12:34:48,977 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {17779#true} {17779#true} #98#return; {17779#true} is VALID [2022-04-28 12:34:48,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {17779#true} assume true; {17779#true} is VALID [2022-04-28 12:34:48,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {17779#true} assume !(0 == ~cond); {17779#true} is VALID [2022-04-28 12:34:48,977 INFO L290 TraceCheckUtils]: 18: Hoare triple {17779#true} ~cond := #in~cond; {17779#true} is VALID [2022-04-28 12:34:48,977 INFO L272 TraceCheckUtils]: 17: Hoare triple {17779#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {17779#true} is VALID [2022-04-28 12:34:48,977 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17779#true} {17779#true} #96#return; {17779#true} is VALID [2022-04-28 12:34:48,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {17779#true} assume true; {17779#true} is VALID [2022-04-28 12:34:48,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {17779#true} assume !(0 == ~cond); {17779#true} is VALID [2022-04-28 12:34:48,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {17779#true} ~cond := #in~cond; {17779#true} is VALID [2022-04-28 12:34:48,978 INFO L272 TraceCheckUtils]: 12: Hoare triple {17779#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {17779#true} is VALID [2022-04-28 12:34:48,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {17779#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {17779#true} is VALID [2022-04-28 12:34:48,978 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17779#true} {17779#true} #94#return; {17779#true} is VALID [2022-04-28 12:34:48,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {17779#true} assume true; {17779#true} is VALID [2022-04-28 12:34:48,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {17779#true} assume !(0 == ~cond); {17779#true} is VALID [2022-04-28 12:34:48,978 INFO L290 TraceCheckUtils]: 7: Hoare triple {17779#true} ~cond := #in~cond; {17779#true} is VALID [2022-04-28 12:34:48,978 INFO L272 TraceCheckUtils]: 6: Hoare triple {17779#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {17779#true} is VALID [2022-04-28 12:34:48,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {17779#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {17779#true} is VALID [2022-04-28 12:34:48,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {17779#true} call #t~ret6 := main(); {17779#true} is VALID [2022-04-28 12:34:48,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17779#true} {17779#true} #112#return; {17779#true} is VALID [2022-04-28 12:34:48,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {17779#true} assume true; {17779#true} is VALID [2022-04-28 12:34:48,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {17779#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {17779#true} is VALID [2022-04-28 12:34:48,978 INFO L272 TraceCheckUtils]: 0: Hoare triple {17779#true} call ULTIMATE.init(); {17779#true} is VALID [2022-04-28 12:34:48,979 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 40 proven. 22 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-28 12:34:48,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:34:48,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948986869] [2022-04-28 12:34:48,979 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:34:48,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867136629] [2022-04-28 12:34:48,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867136629] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:34:48,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:34:48,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2022-04-28 12:34:48,980 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:34:48,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [283579109] [2022-04-28 12:34:48,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [283579109] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:34:48,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:34:48,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 12:34:48,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090790260] [2022-04-28 12:34:48,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:34:48,980 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 86 [2022-04-28 12:34:48,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:34:48,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 12:34:49,033 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-28 12:34:49,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 12:34:49,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:34:49,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 12:34:49,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2022-04-28 12:34:49,034 INFO L87 Difference]: Start difference. First operand 265 states and 357 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 12:34:53,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:34:53,068 INFO L93 Difference]: Finished difference Result 348 states and 475 transitions. [2022-04-28 12:34:53,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 12:34:53,069 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 86 [2022-04-28 12:34:53,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:34:53,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 12:34:53,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 143 transitions. [2022-04-28 12:34:53,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 12:34:53,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 143 transitions. [2022-04-28 12:34:53,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 143 transitions. [2022-04-28 12:34:53,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:34:53,276 INFO L225 Difference]: With dead ends: 348 [2022-04-28 12:34:53,277 INFO L226 Difference]: Without dead ends: 345 [2022-04-28 12:34:53,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2022-04-28 12:34:53,279 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 54 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:34:53,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 351 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 12:34:53,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-04-28 12:34:54,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 330. [2022-04-28 12:34:54,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:34:54,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states. Second operand has 330 states, 191 states have (on average 1.193717277486911) internal successors, (228), 192 states have internal predecessors, (228), 115 states have call successors, (115), 24 states have call predecessors, (115), 23 states have return successors, (113), 113 states have call predecessors, (113), 113 states have call successors, (113) [2022-04-28 12:34:54,296 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand has 330 states, 191 states have (on average 1.193717277486911) internal successors, (228), 192 states have internal predecessors, (228), 115 states have call successors, (115), 24 states have call predecessors, (115), 23 states have return successors, (113), 113 states have call predecessors, (113), 113 states have call successors, (113) [2022-04-28 12:34:54,296 INFO L87 Difference]: Start difference. First operand 345 states. Second operand has 330 states, 191 states have (on average 1.193717277486911) internal successors, (228), 192 states have internal predecessors, (228), 115 states have call successors, (115), 24 states have call predecessors, (115), 23 states have return successors, (113), 113 states have call predecessors, (113), 113 states have call successors, (113) [2022-04-28 12:34:54,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:34:54,306 INFO L93 Difference]: Finished difference Result 345 states and 471 transitions. [2022-04-28 12:34:54,306 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 471 transitions. [2022-04-28 12:34:54,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:34:54,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:34:54,308 INFO L74 IsIncluded]: Start isIncluded. First operand has 330 states, 191 states have (on average 1.193717277486911) internal successors, (228), 192 states have internal predecessors, (228), 115 states have call successors, (115), 24 states have call predecessors, (115), 23 states have return successors, (113), 113 states have call predecessors, (113), 113 states have call successors, (113) Second operand 345 states. [2022-04-28 12:34:54,309 INFO L87 Difference]: Start difference. First operand has 330 states, 191 states have (on average 1.193717277486911) internal successors, (228), 192 states have internal predecessors, (228), 115 states have call successors, (115), 24 states have call predecessors, (115), 23 states have return successors, (113), 113 states have call predecessors, (113), 113 states have call successors, (113) Second operand 345 states. [2022-04-28 12:34:54,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:34:54,318 INFO L93 Difference]: Finished difference Result 345 states and 471 transitions. [2022-04-28 12:34:54,318 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 471 transitions. [2022-04-28 12:34:54,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:34:54,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:34:54,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:34:54,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:34:54,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 191 states have (on average 1.193717277486911) internal successors, (228), 192 states have internal predecessors, (228), 115 states have call successors, (115), 24 states have call predecessors, (115), 23 states have return successors, (113), 113 states have call predecessors, (113), 113 states have call successors, (113) [2022-04-28 12:34:54,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 456 transitions. [2022-04-28 12:34:54,333 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 456 transitions. Word has length 86 [2022-04-28 12:34:54,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:34:54,334 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 456 transitions. [2022-04-28 12:34:54,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 12:34:54,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 330 states and 456 transitions. [2022-04-28 12:34:55,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 456 edges. 456 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:34:55,409 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 456 transitions. [2022-04-28 12:34:55,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-28 12:34:55,410 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:34:55,410 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:34:55,434 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-28 12:34:55,610 WARN L477 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-28 12:34:55,610 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:34:55,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:34:55,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1455197645, now seen corresponding path program 3 times [2022-04-28 12:34:55,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:34:55,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1768658040] [2022-04-28 12:34:55,611 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:34:55,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1455197645, now seen corresponding path program 4 times [2022-04-28 12:34:55,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:34:55,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095220234] [2022-04-28 12:34:55,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:34:55,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:34:55,628 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:34:55,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1098170086] [2022-04-28 12:34:55,628 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:34:55,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:34:55,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:34:55,629 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-28 12:34:55,630 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-28 12:34:55,677 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:34:55,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:34:55,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-28 12:34:55,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:34:55,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:35:39,144 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:35:48,000 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:35:54,016 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:36:02,052 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:36:08,072 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:36:11,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {20371#true} call ULTIMATE.init(); {20371#true} is VALID [2022-04-28 12:36:11,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {20371#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {20371#true} is VALID [2022-04-28 12:36:11,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {20371#true} assume true; {20371#true} is VALID [2022-04-28 12:36:11,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20371#true} {20371#true} #112#return; {20371#true} is VALID [2022-04-28 12:36:11,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {20371#true} call #t~ret6 := main(); {20371#true} is VALID [2022-04-28 12:36:11,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {20371#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {20371#true} is VALID [2022-04-28 12:36:11,776 INFO L272 TraceCheckUtils]: 6: Hoare triple {20371#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {20371#true} is VALID [2022-04-28 12:36:11,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {20371#true} ~cond := #in~cond; {20371#true} is VALID [2022-04-28 12:36:11,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {20371#true} assume !(0 == ~cond); {20371#true} is VALID [2022-04-28 12:36:11,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {20371#true} assume true; {20371#true} is VALID [2022-04-28 12:36:11,777 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20371#true} {20371#true} #94#return; {20371#true} is VALID [2022-04-28 12:36:11,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {20371#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {20371#true} is VALID [2022-04-28 12:36:11,777 INFO L272 TraceCheckUtils]: 12: Hoare triple {20371#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {20371#true} is VALID [2022-04-28 12:36:11,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {20371#true} ~cond := #in~cond; {20371#true} is VALID [2022-04-28 12:36:11,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {20371#true} assume !(0 == ~cond); {20371#true} is VALID [2022-04-28 12:36:11,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {20371#true} assume true; {20371#true} is VALID [2022-04-28 12:36:11,777 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20371#true} {20371#true} #96#return; {20371#true} is VALID [2022-04-28 12:36:11,777 INFO L272 TraceCheckUtils]: 17: Hoare triple {20371#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {20371#true} is VALID [2022-04-28 12:36:11,777 INFO L290 TraceCheckUtils]: 18: Hoare triple {20371#true} ~cond := #in~cond; {20371#true} is VALID [2022-04-28 12:36:11,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {20371#true} assume !(0 == ~cond); {20371#true} is VALID [2022-04-28 12:36:11,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {20371#true} assume true; {20371#true} is VALID [2022-04-28 12:36:11,778 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {20371#true} {20371#true} #98#return; {20371#true} is VALID [2022-04-28 12:36:11,778 INFO L272 TraceCheckUtils]: 22: Hoare triple {20371#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {20371#true} is VALID [2022-04-28 12:36:11,778 INFO L290 TraceCheckUtils]: 23: Hoare triple {20371#true} ~cond := #in~cond; {20371#true} is VALID [2022-04-28 12:36:11,778 INFO L290 TraceCheckUtils]: 24: Hoare triple {20371#true} assume !(0 == ~cond); {20371#true} is VALID [2022-04-28 12:36:11,778 INFO L290 TraceCheckUtils]: 25: Hoare triple {20371#true} assume true; {20371#true} is VALID [2022-04-28 12:36:11,778 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20371#true} {20371#true} #100#return; {20371#true} is VALID [2022-04-28 12:36:11,778 INFO L290 TraceCheckUtils]: 27: Hoare triple {20371#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {20457#(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))} is VALID [2022-04-28 12:36:11,779 INFO L290 TraceCheckUtils]: 28: Hoare triple {20457#(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))} assume !false; {20457#(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))} is VALID [2022-04-28 12:36:11,779 INFO L290 TraceCheckUtils]: 29: Hoare triple {20457#(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))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {20464#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 12:36:11,780 INFO L290 TraceCheckUtils]: 30: Hoare triple {20464#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !false; {20464#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 12:36:11,780 INFO L290 TraceCheckUtils]: 31: Hoare triple {20464#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !(~c~0 >= ~b~0); {20464#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 12:36:11,780 INFO L290 TraceCheckUtils]: 32: Hoare triple {20464#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {20474#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 12:36:11,781 INFO L290 TraceCheckUtils]: 33: Hoare triple {20474#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !false; {20474#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 12:36:11,781 INFO L290 TraceCheckUtils]: 34: Hoare triple {20474#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {20481#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 12:36:11,782 INFO L290 TraceCheckUtils]: 35: Hoare triple {20481#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !false; {20481#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 12:36:11,782 INFO L290 TraceCheckUtils]: 36: Hoare triple {20481#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {20488#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 12:36:11,783 INFO L290 TraceCheckUtils]: 37: Hoare triple {20488#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !false; {20488#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 12:36:11,783 INFO L272 TraceCheckUtils]: 38: Hoare triple {20488#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20371#true} is VALID [2022-04-28 12:36:11,783 INFO L290 TraceCheckUtils]: 39: Hoare triple {20371#true} ~cond := #in~cond; {20371#true} is VALID [2022-04-28 12:36:11,783 INFO L290 TraceCheckUtils]: 40: Hoare triple {20371#true} assume !(0 == ~cond); {20371#true} is VALID [2022-04-28 12:36:11,783 INFO L290 TraceCheckUtils]: 41: Hoare triple {20371#true} assume true; {20371#true} is VALID [2022-04-28 12:36:11,784 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {20371#true} {20488#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #102#return; {20488#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 12:36:11,784 INFO L272 TraceCheckUtils]: 43: Hoare triple {20488#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20371#true} is VALID [2022-04-28 12:36:11,784 INFO L290 TraceCheckUtils]: 44: Hoare triple {20371#true} ~cond := #in~cond; {20371#true} is VALID [2022-04-28 12:36:11,784 INFO L290 TraceCheckUtils]: 45: Hoare triple {20371#true} assume !(0 == ~cond); {20371#true} is VALID [2022-04-28 12:36:11,784 INFO L290 TraceCheckUtils]: 46: Hoare triple {20371#true} assume true; {20371#true} is VALID [2022-04-28 12:36:11,785 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20371#true} {20488#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #104#return; {20488#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 12:36:11,785 INFO L272 TraceCheckUtils]: 48: Hoare triple {20488#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20371#true} is VALID [2022-04-28 12:36:11,785 INFO L290 TraceCheckUtils]: 49: Hoare triple {20371#true} ~cond := #in~cond; {20371#true} is VALID [2022-04-28 12:36:11,785 INFO L290 TraceCheckUtils]: 50: Hoare triple {20371#true} assume !(0 == ~cond); {20371#true} is VALID [2022-04-28 12:36:11,785 INFO L290 TraceCheckUtils]: 51: Hoare triple {20371#true} assume true; {20371#true} is VALID [2022-04-28 12:36:11,786 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {20371#true} {20488#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #106#return; {20488#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 12:36:11,786 INFO L272 TraceCheckUtils]: 53: Hoare triple {20488#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {20371#true} is VALID [2022-04-28 12:36:11,786 INFO L290 TraceCheckUtils]: 54: Hoare triple {20371#true} ~cond := #in~cond; {20371#true} is VALID [2022-04-28 12:36:11,786 INFO L290 TraceCheckUtils]: 55: Hoare triple {20371#true} assume !(0 == ~cond); {20371#true} is VALID [2022-04-28 12:36:11,786 INFO L290 TraceCheckUtils]: 56: Hoare triple {20371#true} assume true; {20371#true} is VALID [2022-04-28 12:36:11,787 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {20371#true} {20488#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #108#return; {20488#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 12:36:11,788 INFO L290 TraceCheckUtils]: 58: Hoare triple {20488#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {20555#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-28 12:36:11,788 INFO L290 TraceCheckUtils]: 59: Hoare triple {20555#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} assume !false; {20555#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-28 12:36:11,788 INFO L272 TraceCheckUtils]: 60: Hoare triple {20555#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20371#true} is VALID [2022-04-28 12:36:11,789 INFO L290 TraceCheckUtils]: 61: Hoare triple {20371#true} ~cond := #in~cond; {20565#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:36:11,789 INFO L290 TraceCheckUtils]: 62: Hoare triple {20565#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {20569#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:36:11,789 INFO L290 TraceCheckUtils]: 63: Hoare triple {20569#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {20569#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:36:11,790 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {20569#(not (= |__VERIFIER_assert_#in~cond| 0))} {20555#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} #102#return; {20576#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:36:11,790 INFO L272 TraceCheckUtils]: 65: Hoare triple {20576#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20371#true} is VALID [2022-04-28 12:36:11,791 INFO L290 TraceCheckUtils]: 66: Hoare triple {20371#true} ~cond := #in~cond; {20565#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:36:11,791 INFO L290 TraceCheckUtils]: 67: Hoare triple {20565#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {20569#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:36:11,791 INFO L290 TraceCheckUtils]: 68: Hoare triple {20569#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {20569#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:36:11,792 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {20569#(not (= |__VERIFIER_assert_#in~cond| 0))} {20576#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #104#return; {20592#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:36:11,792 INFO L272 TraceCheckUtils]: 70: Hoare triple {20592#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20371#true} is VALID [2022-04-28 12:36:11,792 INFO L290 TraceCheckUtils]: 71: Hoare triple {20371#true} ~cond := #in~cond; {20371#true} is VALID [2022-04-28 12:36:11,793 INFO L290 TraceCheckUtils]: 72: Hoare triple {20371#true} assume !(0 == ~cond); {20371#true} is VALID [2022-04-28 12:36:11,793 INFO L290 TraceCheckUtils]: 73: Hoare triple {20371#true} assume true; {20371#true} is VALID [2022-04-28 12:36:11,793 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {20371#true} {20592#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #106#return; {20592#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:36:11,793 INFO L272 TraceCheckUtils]: 75: Hoare triple {20592#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {20371#true} is VALID [2022-04-28 12:36:11,794 INFO L290 TraceCheckUtils]: 76: Hoare triple {20371#true} ~cond := #in~cond; {20565#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:36:11,794 INFO L290 TraceCheckUtils]: 77: Hoare triple {20565#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {20569#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:36:11,794 INFO L290 TraceCheckUtils]: 78: Hoare triple {20569#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {20569#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:36:11,795 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {20569#(not (= |__VERIFIER_assert_#in~cond| 0))} {20592#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #108#return; {20623#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:36:11,796 INFO L290 TraceCheckUtils]: 80: Hoare triple {20623#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !(~c~0 >= 2 * ~v~0); {20623#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:36:11,798 INFO L290 TraceCheckUtils]: 81: Hoare triple {20623#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {20630#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} is VALID [2022-04-28 12:36:11,799 INFO L290 TraceCheckUtils]: 82: Hoare triple {20630#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} assume !false; {20630#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} is VALID [2022-04-28 12:36:11,800 INFO L290 TraceCheckUtils]: 83: Hoare triple {20630#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} assume !(~c~0 >= ~b~0); {20630#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} is VALID [2022-04-28 12:36:13,802 WARN L290 TraceCheckUtils]: 84: Hoare triple {20630#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {20640#(and (= (div (+ (* (- 1) main_~s~0) 1) 2) 0) (= (mod (+ (* main_~q~0 main_~x~0) main_~b~0 main_~y~0) 2) 0) (= main_~r~0 0) (= 0 (div (+ (* main_~q~0 main_~x~0) main_~y~0 (* (- 1) main_~b~0)) 2)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (or (and (not (= main_~p~0 0)) (= (mod main_~q~0 2) 0) (= (mod (div (- main_~q~0) 2) main_~p~0) 0) (= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0))) (+ (* 2 (* main_~p~0 main_~x~0 (div (div (* (- 1) main_~q~0) 2) main_~p~0))) (* 2 (* main_~y~0 main_~r~0 (div (div (* (- 1) main_~q~0) 2) main_~p~0)))))) (and (= main_~p~0 0) (= (mod main_~q~0 2) 0) (= (div (- main_~q~0) 2) 0))) (= main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (mod (+ main_~s~0 1) 2) 0))} is UNKNOWN [2022-04-28 12:36:13,803 INFO L290 TraceCheckUtils]: 85: Hoare triple {20640#(and (= (div (+ (* (- 1) main_~s~0) 1) 2) 0) (= (mod (+ (* main_~q~0 main_~x~0) main_~b~0 main_~y~0) 2) 0) (= main_~r~0 0) (= 0 (div (+ (* main_~q~0 main_~x~0) main_~y~0 (* (- 1) main_~b~0)) 2)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (or (and (not (= main_~p~0 0)) (= (mod main_~q~0 2) 0) (= (mod (div (- main_~q~0) 2) main_~p~0) 0) (= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0))) (+ (* 2 (* main_~p~0 main_~x~0 (div (div (* (- 1) main_~q~0) 2) main_~p~0))) (* 2 (* main_~y~0 main_~r~0 (div (div (* (- 1) main_~q~0) 2) main_~p~0)))))) (and (= main_~p~0 0) (= (mod main_~q~0 2) 0) (= (div (- main_~q~0) 2) 0))) (= main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (mod (+ main_~s~0 1) 2) 0))} assume !false; {20640#(and (= (div (+ (* (- 1) main_~s~0) 1) 2) 0) (= (mod (+ (* main_~q~0 main_~x~0) main_~b~0 main_~y~0) 2) 0) (= main_~r~0 0) (= 0 (div (+ (* main_~q~0 main_~x~0) main_~y~0 (* (- 1) main_~b~0)) 2)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (or (and (not (= main_~p~0 0)) (= (mod main_~q~0 2) 0) (= (mod (div (- main_~q~0) 2) main_~p~0) 0) (= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0))) (+ (* 2 (* main_~p~0 main_~x~0 (div (div (* (- 1) main_~q~0) 2) main_~p~0))) (* 2 (* main_~y~0 main_~r~0 (div (div (* (- 1) main_~q~0) 2) main_~p~0)))))) (and (= main_~p~0 0) (= (mod main_~q~0 2) 0) (= (div (- main_~q~0) 2) 0))) (= main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (mod (+ main_~s~0 1) 2) 0))} is VALID [2022-04-28 12:36:13,805 INFO L290 TraceCheckUtils]: 86: Hoare triple {20640#(and (= (div (+ (* (- 1) main_~s~0) 1) 2) 0) (= (mod (+ (* main_~q~0 main_~x~0) main_~b~0 main_~y~0) 2) 0) (= main_~r~0 0) (= 0 (div (+ (* main_~q~0 main_~x~0) main_~y~0 (* (- 1) main_~b~0)) 2)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (or (and (not (= main_~p~0 0)) (= (mod main_~q~0 2) 0) (= (mod (div (- main_~q~0) 2) main_~p~0) 0) (= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0))) (+ (* 2 (* main_~p~0 main_~x~0 (div (div (* (- 1) main_~q~0) 2) main_~p~0))) (* 2 (* main_~y~0 main_~r~0 (div (div (* (- 1) main_~q~0) 2) main_~p~0)))))) (and (= main_~p~0 0) (= (mod main_~q~0 2) 0) (= (div (- main_~q~0) 2) 0))) (= main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (mod (+ main_~s~0 1) 2) 0))} assume !(0 != ~b~0); {20647#(and (= (div (+ (* (- 1) main_~s~0) 1) 2) 0) (= (mod (+ (* main_~q~0 main_~x~0) main_~y~0) 2) 0) (= main_~r~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (div (+ (* main_~q~0 main_~x~0) main_~y~0) 2) 0) (or (and (not (= main_~p~0 0)) (= (mod main_~q~0 2) 0) (= (mod (div (- main_~q~0) 2) main_~p~0) 0) (= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0))) (+ (* 2 (* main_~p~0 main_~x~0 (div (div (* (- 1) main_~q~0) 2) main_~p~0))) (* 2 (* main_~y~0 main_~r~0 (div (div (* (- 1) main_~q~0) 2) main_~p~0)))))) (and (= main_~p~0 0) (= (mod main_~q~0 2) 0) (= (div (- main_~q~0) 2) 0))) (= main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (mod (+ main_~s~0 1) 2) 0))} is VALID [2022-04-28 12:36:13,819 INFO L272 TraceCheckUtils]: 87: Hoare triple {20647#(and (= (div (+ (* (- 1) main_~s~0) 1) 2) 0) (= (mod (+ (* main_~q~0 main_~x~0) main_~y~0) 2) 0) (= main_~r~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (div (+ (* main_~q~0 main_~x~0) main_~y~0) 2) 0) (or (and (not (= main_~p~0 0)) (= (mod main_~q~0 2) 0) (= (mod (div (- main_~q~0) 2) main_~p~0) 0) (= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0))) (+ (* 2 (* main_~p~0 main_~x~0 (div (div (* (- 1) main_~q~0) 2) main_~p~0))) (* 2 (* main_~y~0 main_~r~0 (div (div (* (- 1) main_~q~0) 2) main_~p~0)))))) (and (= main_~p~0 0) (= (mod main_~q~0 2) 0) (= (div (- main_~q~0) 2) 0))) (= main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (mod (+ main_~s~0 1) 2) 0))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {20651#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:36:13,819 INFO L290 TraceCheckUtils]: 88: Hoare triple {20651#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20655#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:36:13,819 INFO L290 TraceCheckUtils]: 89: Hoare triple {20655#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20372#false} is VALID [2022-04-28 12:36:13,819 INFO L290 TraceCheckUtils]: 90: Hoare triple {20372#false} assume !false; {20372#false} is VALID [2022-04-28 12:36:13,820 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 52 proven. 28 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 12:36:13,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:37:17,509 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:37:22,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:37:22,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095220234] [2022-04-28 12:37:22,104 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:37:22,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098170086] [2022-04-28 12:37:22,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098170086] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 12:37:22,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 12:37:22,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2022-04-28 12:37:22,105 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:37:22,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1768658040] [2022-04-28 12:37:22,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1768658040] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:37:22,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:37:22,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 12:37:22,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51955675] [2022-04-28 12:37:22,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:37:22,106 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 91 [2022-04-28 12:37:22,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:37:22,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 12:37:24,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 63 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 12:37:24,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 12:37:24,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:37:24,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 12:37:24,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2022-04-28 12:37:24,182 INFO L87 Difference]: Start difference. First operand 330 states and 456 transitions. Second operand has 18 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 12:37:39,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:37:39,245 INFO L93 Difference]: Finished difference Result 418 states and 579 transitions. [2022-04-28 12:37:39,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 12:37:39,245 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 91 [2022-04-28 12:37:39,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:37:39,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 12:37:39,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 175 transitions. [2022-04-28 12:37:39,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 12:37:39,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 175 transitions. [2022-04-28 12:37:39,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 175 transitions. [2022-04-28 12:37:41,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 174 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 12:37:41,594 INFO L225 Difference]: With dead ends: 418 [2022-04-28 12:37:41,594 INFO L226 Difference]: Without dead ends: 415 [2022-04-28 12:37:41,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=172, Invalid=950, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 12:37:41,595 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 66 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-28 12:37:41,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 414 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-04-28 12:37:41,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-04-28 12:37:42,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 395. [2022-04-28 12:37:42,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:37:42,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 415 states. Second operand has 395 states, 225 states have (on average 1.2044444444444444) internal successors, (271), 226 states have internal predecessors, (271), 143 states have call successors, (143), 27 states have call predecessors, (143), 26 states have return successors, (141), 141 states have call predecessors, (141), 141 states have call successors, (141) [2022-04-28 12:37:42,796 INFO L74 IsIncluded]: Start isIncluded. First operand 415 states. Second operand has 395 states, 225 states have (on average 1.2044444444444444) internal successors, (271), 226 states have internal predecessors, (271), 143 states have call successors, (143), 27 states have call predecessors, (143), 26 states have return successors, (141), 141 states have call predecessors, (141), 141 states have call successors, (141) [2022-04-28 12:37:42,797 INFO L87 Difference]: Start difference. First operand 415 states. Second operand has 395 states, 225 states have (on average 1.2044444444444444) internal successors, (271), 226 states have internal predecessors, (271), 143 states have call successors, (143), 27 states have call predecessors, (143), 26 states have return successors, (141), 141 states have call predecessors, (141), 141 states have call successors, (141) [2022-04-28 12:37:42,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:37:42,811 INFO L93 Difference]: Finished difference Result 415 states and 575 transitions. [2022-04-28 12:37:42,811 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 575 transitions. [2022-04-28 12:37:42,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:37:42,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:37:42,813 INFO L74 IsIncluded]: Start isIncluded. First operand has 395 states, 225 states have (on average 1.2044444444444444) internal successors, (271), 226 states have internal predecessors, (271), 143 states have call successors, (143), 27 states have call predecessors, (143), 26 states have return successors, (141), 141 states have call predecessors, (141), 141 states have call successors, (141) Second operand 415 states. [2022-04-28 12:37:42,814 INFO L87 Difference]: Start difference. First operand has 395 states, 225 states have (on average 1.2044444444444444) internal successors, (271), 226 states have internal predecessors, (271), 143 states have call successors, (143), 27 states have call predecessors, (143), 26 states have return successors, (141), 141 states have call predecessors, (141), 141 states have call successors, (141) Second operand 415 states. [2022-04-28 12:37:42,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:37:42,828 INFO L93 Difference]: Finished difference Result 415 states and 575 transitions. [2022-04-28 12:37:42,828 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 575 transitions. [2022-04-28 12:37:42,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:37:42,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:37:42,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:37:42,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:37:42,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 225 states have (on average 1.2044444444444444) internal successors, (271), 226 states have internal predecessors, (271), 143 states have call successors, (143), 27 states have call predecessors, (143), 26 states have return successors, (141), 141 states have call predecessors, (141), 141 states have call successors, (141) [2022-04-28 12:37:42,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 555 transitions. [2022-04-28 12:37:42,845 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 555 transitions. Word has length 91 [2022-04-28 12:37:42,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:37:42,845 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 555 transitions. [2022-04-28 12:37:42,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 12:37:42,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 395 states and 555 transitions. [2022-04-28 12:37:44,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 555 edges. 555 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:37:44,777 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 555 transitions. [2022-04-28 12:37:44,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-28 12:37:44,778 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:37:44,778 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:37:44,805 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-28 12:37:45,000 WARN L477 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-28 12:37:45,001 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:37:45,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:37:45,001 INFO L85 PathProgramCache]: Analyzing trace with hash -100199667, now seen corresponding path program 7 times [2022-04-28 12:37:45,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:37:45,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [150812407] [2022-04-28 12:37:45,002 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:37:45,002 INFO L85 PathProgramCache]: Analyzing trace with hash -100199667, now seen corresponding path program 8 times [2022-04-28 12:37:45,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:37:45,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600710343] [2022-04-28 12:37:45,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:37:45,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:37:45,014 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:37:45,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1467324715] [2022-04-28 12:37:45,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:37:45,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:37:45,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:37:45,016 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-28 12:37:45,019 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-28 12:37:45,078 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:37:45,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:37:45,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 85 conjunts are in the unsatisfiable core [2022-04-28 12:37:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:37:45,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:38:08,069 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:38:23,534 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:38:23,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {23242#true} call ULTIMATE.init(); {23242#true} is VALID [2022-04-28 12:38:23,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {23242#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {23242#true} is VALID [2022-04-28 12:38:23,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {23242#true} assume true; {23242#true} is VALID [2022-04-28 12:38:23,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23242#true} {23242#true} #112#return; {23242#true} is VALID [2022-04-28 12:38:23,746 INFO L272 TraceCheckUtils]: 4: Hoare triple {23242#true} call #t~ret6 := main(); {23242#true} is VALID [2022-04-28 12:38:23,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {23242#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {23242#true} is VALID [2022-04-28 12:38:23,746 INFO L272 TraceCheckUtils]: 6: Hoare triple {23242#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {23242#true} is VALID [2022-04-28 12:38:23,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {23242#true} ~cond := #in~cond; {23242#true} is VALID [2022-04-28 12:38:23,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {23242#true} assume !(0 == ~cond); {23242#true} is VALID [2022-04-28 12:38:23,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {23242#true} assume true; {23242#true} is VALID [2022-04-28 12:38:23,746 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23242#true} {23242#true} #94#return; {23242#true} is VALID [2022-04-28 12:38:23,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {23242#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {23242#true} is VALID [2022-04-28 12:38:23,746 INFO L272 TraceCheckUtils]: 12: Hoare triple {23242#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {23242#true} is VALID [2022-04-28 12:38:23,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {23242#true} ~cond := #in~cond; {23242#true} is VALID [2022-04-28 12:38:23,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {23242#true} assume !(0 == ~cond); {23242#true} is VALID [2022-04-28 12:38:23,747 INFO L290 TraceCheckUtils]: 15: Hoare triple {23242#true} assume true; {23242#true} is VALID [2022-04-28 12:38:23,747 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {23242#true} {23242#true} #96#return; {23242#true} is VALID [2022-04-28 12:38:23,747 INFO L272 TraceCheckUtils]: 17: Hoare triple {23242#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {23242#true} is VALID [2022-04-28 12:38:23,747 INFO L290 TraceCheckUtils]: 18: Hoare triple {23242#true} ~cond := #in~cond; {23242#true} is VALID [2022-04-28 12:38:23,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {23242#true} assume !(0 == ~cond); {23242#true} is VALID [2022-04-28 12:38:23,747 INFO L290 TraceCheckUtils]: 20: Hoare triple {23242#true} assume true; {23242#true} is VALID [2022-04-28 12:38:23,747 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {23242#true} {23242#true} #98#return; {23242#true} is VALID [2022-04-28 12:38:23,747 INFO L272 TraceCheckUtils]: 22: Hoare triple {23242#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {23242#true} is VALID [2022-04-28 12:38:23,747 INFO L290 TraceCheckUtils]: 23: Hoare triple {23242#true} ~cond := #in~cond; {23242#true} is VALID [2022-04-28 12:38:23,747 INFO L290 TraceCheckUtils]: 24: Hoare triple {23242#true} assume !(0 == ~cond); {23242#true} is VALID [2022-04-28 12:38:23,747 INFO L290 TraceCheckUtils]: 25: Hoare triple {23242#true} assume true; {23242#true} is VALID [2022-04-28 12:38:23,747 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {23242#true} {23242#true} #100#return; {23242#true} is VALID [2022-04-28 12:38:23,748 INFO L290 TraceCheckUtils]: 27: Hoare triple {23242#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {23328#(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-28 12:38:23,748 INFO L290 TraceCheckUtils]: 28: Hoare triple {23328#(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; {23328#(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-28 12:38:23,749 INFO L290 TraceCheckUtils]: 29: Hoare triple {23328#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {23335#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:38:23,749 INFO L290 TraceCheckUtils]: 30: Hoare triple {23335#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {23335#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:38:23,749 INFO L290 TraceCheckUtils]: 31: Hoare triple {23335#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {23342#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:38:23,750 INFO L290 TraceCheckUtils]: 32: Hoare triple {23342#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {23342#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:38:23,750 INFO L272 TraceCheckUtils]: 33: Hoare triple {23342#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~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)); {23242#true} is VALID [2022-04-28 12:38:23,750 INFO L290 TraceCheckUtils]: 34: Hoare triple {23242#true} ~cond := #in~cond; {23352#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:38:23,751 INFO L290 TraceCheckUtils]: 35: Hoare triple {23352#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23356#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:38:23,751 INFO L290 TraceCheckUtils]: 36: Hoare triple {23356#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23356#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:38:23,752 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {23356#(not (= |__VERIFIER_assert_#in~cond| 0))} {23342#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #102#return; {23363#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:38:23,752 INFO L272 TraceCheckUtils]: 38: Hoare triple {23363#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23242#true} is VALID [2022-04-28 12:38:23,752 INFO L290 TraceCheckUtils]: 39: Hoare triple {23242#true} ~cond := #in~cond; {23352#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:38:23,752 INFO L290 TraceCheckUtils]: 40: Hoare triple {23352#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23356#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:38:23,753 INFO L290 TraceCheckUtils]: 41: Hoare triple {23356#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23356#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:38:23,753 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {23356#(not (= |__VERIFIER_assert_#in~cond| 0))} {23363#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #104#return; {23363#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:38:23,754 INFO L272 TraceCheckUtils]: 43: Hoare triple {23363#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23242#true} is VALID [2022-04-28 12:38:23,754 INFO L290 TraceCheckUtils]: 44: Hoare triple {23242#true} ~cond := #in~cond; {23242#true} is VALID [2022-04-28 12:38:23,754 INFO L290 TraceCheckUtils]: 45: Hoare triple {23242#true} assume !(0 == ~cond); {23242#true} is VALID [2022-04-28 12:38:23,754 INFO L290 TraceCheckUtils]: 46: Hoare triple {23242#true} assume true; {23242#true} is VALID [2022-04-28 12:38:23,754 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23242#true} {23363#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #106#return; {23363#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:38:23,755 INFO L272 TraceCheckUtils]: 48: Hoare triple {23363#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {23242#true} is VALID [2022-04-28 12:38:23,755 INFO L290 TraceCheckUtils]: 49: Hoare triple {23242#true} ~cond := #in~cond; {23242#true} is VALID [2022-04-28 12:38:23,755 INFO L290 TraceCheckUtils]: 50: Hoare triple {23242#true} assume !(0 == ~cond); {23242#true} is VALID [2022-04-28 12:38:23,755 INFO L290 TraceCheckUtils]: 51: Hoare triple {23242#true} assume true; {23242#true} is VALID [2022-04-28 12:38:23,755 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {23242#true} {23363#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #108#return; {23363#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:38:23,756 INFO L290 TraceCheckUtils]: 53: Hoare triple {23363#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {23363#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:38:23,756 INFO L290 TraceCheckUtils]: 54: Hoare triple {23363#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {23415#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 12:38:23,757 INFO L290 TraceCheckUtils]: 55: Hoare triple {23415#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {23415#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 12:38:23,757 INFO L290 TraceCheckUtils]: 56: Hoare triple {23415#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {23415#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 12:38:23,758 INFO L290 TraceCheckUtils]: 57: Hoare triple {23415#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {23425#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~q~0 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-28 12:38:23,758 INFO L290 TraceCheckUtils]: 58: Hoare triple {23425#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~q~0 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} assume !false; {23425#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~q~0 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-28 12:38:23,759 INFO L290 TraceCheckUtils]: 59: Hoare triple {23425#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~q~0 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {23432#(and (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~q~0 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-28 12:38:23,759 INFO L290 TraceCheckUtils]: 60: Hoare triple {23432#(and (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~q~0 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} assume !false; {23432#(and (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~q~0 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-28 12:38:23,759 INFO L290 TraceCheckUtils]: 61: Hoare triple {23432#(and (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~q~0 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {23439#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-28 12:38:23,760 INFO L290 TraceCheckUtils]: 62: Hoare triple {23439#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} assume !false; {23439#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} is VALID [2022-04-28 12:38:23,760 INFO L272 TraceCheckUtils]: 63: Hoare triple {23439#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 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)); {23242#true} is VALID [2022-04-28 12:38:23,760 INFO L290 TraceCheckUtils]: 64: Hoare triple {23242#true} ~cond := #in~cond; {23352#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:38:23,761 INFO L290 TraceCheckUtils]: 65: Hoare triple {23352#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23356#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:38:23,761 INFO L290 TraceCheckUtils]: 66: Hoare triple {23356#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23356#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:38:23,762 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {23356#(not (= |__VERIFIER_assert_#in~cond| 0))} {23439#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 1) (= main_~x~0 (+ main_~b~0 main_~a~0)))} #102#return; {23458#(and (= main_~b~0 main_~v~0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:38:23,762 INFO L272 TraceCheckUtils]: 68: Hoare triple {23458#(and (= main_~b~0 main_~v~0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23242#true} is VALID [2022-04-28 12:38:23,762 INFO L290 TraceCheckUtils]: 69: Hoare triple {23242#true} ~cond := #in~cond; {23352#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:38:23,763 INFO L290 TraceCheckUtils]: 70: Hoare triple {23352#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23356#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:38:23,763 INFO L290 TraceCheckUtils]: 71: Hoare triple {23356#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23356#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:38:23,764 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {23356#(not (= |__VERIFIER_assert_#in~cond| 0))} {23458#(and (= main_~b~0 main_~v~0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #104#return; {23474#(and (= main_~p~0 0) (= main_~k~0 0) (= main_~v~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 (+ main_~c~0 main_~v~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:38:23,764 INFO L272 TraceCheckUtils]: 73: Hoare triple {23474#(and (= main_~p~0 0) (= main_~k~0 0) (= main_~v~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 (+ main_~c~0 main_~v~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23242#true} is VALID [2022-04-28 12:38:23,764 INFO L290 TraceCheckUtils]: 74: Hoare triple {23242#true} ~cond := #in~cond; {23242#true} is VALID [2022-04-28 12:38:23,764 INFO L290 TraceCheckUtils]: 75: Hoare triple {23242#true} assume !(0 == ~cond); {23242#true} is VALID [2022-04-28 12:38:23,764 INFO L290 TraceCheckUtils]: 76: Hoare triple {23242#true} assume true; {23242#true} is VALID [2022-04-28 12:38:23,765 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {23242#true} {23474#(and (= main_~p~0 0) (= main_~k~0 0) (= main_~v~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 (+ main_~c~0 main_~v~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #106#return; {23474#(and (= main_~p~0 0) (= main_~k~0 0) (= main_~v~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 (+ main_~c~0 main_~v~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:38:23,765 INFO L272 TraceCheckUtils]: 78: Hoare triple {23474#(and (= main_~p~0 0) (= main_~k~0 0) (= main_~v~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 (+ main_~c~0 main_~v~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {23242#true} is VALID [2022-04-28 12:38:23,765 INFO L290 TraceCheckUtils]: 79: Hoare triple {23242#true} ~cond := #in~cond; {23242#true} is VALID [2022-04-28 12:38:23,765 INFO L290 TraceCheckUtils]: 80: Hoare triple {23242#true} assume !(0 == ~cond); {23242#true} is VALID [2022-04-28 12:38:23,765 INFO L290 TraceCheckUtils]: 81: Hoare triple {23242#true} assume true; {23242#true} is VALID [2022-04-28 12:38:23,766 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {23242#true} {23474#(and (= main_~p~0 0) (= main_~k~0 0) (= main_~v~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 (+ main_~c~0 main_~v~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #108#return; {23474#(and (= main_~p~0 0) (= main_~k~0 0) (= main_~v~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 (+ main_~c~0 main_~v~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:38:23,766 INFO L290 TraceCheckUtils]: 83: Hoare triple {23474#(and (= main_~p~0 0) (= main_~k~0 0) (= main_~v~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 (+ main_~c~0 main_~v~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !(~c~0 >= 2 * ~v~0); {23474#(and (= main_~p~0 0) (= main_~k~0 0) (= main_~v~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 (+ main_~c~0 main_~v~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:38:23,767 INFO L290 TraceCheckUtils]: 84: Hoare triple {23474#(and (= main_~p~0 0) (= main_~k~0 0) (= main_~v~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 (+ main_~c~0 main_~v~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {23511#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= (+ (* (- 1) main_~p~0 main_~x~0) (* (- 1) main_~y~0 main_~r~0) main_~x~0) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) (* (- 1) main_~y~0 main_~r~0)) (* (- 1) main_~x~0) (* main_~p~0 main_~x~0) (* (* (- 1) main_~p~0 main_~x~0) (- 1)))))} is VALID [2022-04-28 12:38:23,768 INFO L290 TraceCheckUtils]: 85: Hoare triple {23511#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= (+ (* (- 1) main_~p~0 main_~x~0) (* (- 1) main_~y~0 main_~r~0) main_~x~0) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) (* (- 1) main_~y~0 main_~r~0)) (* (- 1) main_~x~0) (* main_~p~0 main_~x~0) (* (* (- 1) main_~p~0 main_~x~0) (- 1)))))} assume !false; {23511#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= (+ (* (- 1) main_~p~0 main_~x~0) (* (- 1) main_~y~0 main_~r~0) main_~x~0) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) (* (- 1) main_~y~0 main_~r~0)) (* (- 1) main_~x~0) (* main_~p~0 main_~x~0) (* (* (- 1) main_~p~0 main_~x~0) (- 1)))))} is VALID [2022-04-28 12:38:23,769 INFO L290 TraceCheckUtils]: 86: Hoare triple {23511#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= (+ (* (- 1) main_~p~0 main_~x~0) (* (- 1) main_~y~0 main_~r~0) main_~x~0) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) (* (- 1) main_~y~0 main_~r~0)) (* (- 1) main_~x~0) (* main_~p~0 main_~x~0) (* (* (- 1) main_~p~0 main_~x~0) (- 1)))))} assume !(~c~0 >= ~b~0); {23511#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= (+ (* (- 1) main_~p~0 main_~x~0) (* (- 1) main_~y~0 main_~r~0) main_~x~0) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) (* (- 1) main_~y~0 main_~r~0)) (* (- 1) main_~x~0) (* main_~p~0 main_~x~0) (* (* (- 1) main_~p~0 main_~x~0) (- 1)))))} is VALID [2022-04-28 12:38:23,771 INFO L290 TraceCheckUtils]: 87: Hoare triple {23511#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= (+ (* (- 1) main_~p~0 main_~x~0) (* (- 1) main_~y~0 main_~r~0) main_~x~0) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) (* (- 1) main_~y~0 main_~r~0)) (* (- 1) main_~x~0) (* main_~p~0 main_~x~0) (* (* (- 1) main_~p~0 main_~x~0) (- 1)))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {23521#(and (= (+ (* main_~y~0 (div (+ (- 1) main_~s~0) main_~q~0)) main_~y~0) 0) (= (+ main_~q~0 1) 0) (= (* main_~y~0 2) (+ main_~b~0 main_~x~0)))} is VALID [2022-04-28 12:38:23,771 INFO L290 TraceCheckUtils]: 88: Hoare triple {23521#(and (= (+ (* main_~y~0 (div (+ (- 1) main_~s~0) main_~q~0)) main_~y~0) 0) (= (+ main_~q~0 1) 0) (= (* main_~y~0 2) (+ main_~b~0 main_~x~0)))} assume !false; {23521#(and (= (+ (* main_~y~0 (div (+ (- 1) main_~s~0) main_~q~0)) main_~y~0) 0) (= (+ main_~q~0 1) 0) (= (* main_~y~0 2) (+ main_~b~0 main_~x~0)))} is VALID [2022-04-28 12:38:23,771 INFO L290 TraceCheckUtils]: 89: Hoare triple {23521#(and (= (+ (* main_~y~0 (div (+ (- 1) main_~s~0) main_~q~0)) main_~y~0) 0) (= (+ main_~q~0 1) 0) (= (* main_~y~0 2) (+ main_~b~0 main_~x~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {23521#(and (= (+ (* main_~y~0 (div (+ (- 1) main_~s~0) main_~q~0)) main_~y~0) 0) (= (+ main_~q~0 1) 0) (= (* main_~y~0 2) (+ main_~b~0 main_~x~0)))} is VALID [2022-04-28 12:38:23,772 INFO L290 TraceCheckUtils]: 90: Hoare triple {23521#(and (= (+ (* main_~y~0 (div (+ (- 1) main_~s~0) main_~q~0)) main_~y~0) 0) (= (+ main_~q~0 1) 0) (= (* main_~y~0 2) (+ main_~b~0 main_~x~0)))} assume !false; {23521#(and (= (+ (* main_~y~0 (div (+ (- 1) main_~s~0) main_~q~0)) main_~y~0) 0) (= (+ main_~q~0 1) 0) (= (* main_~y~0 2) (+ main_~b~0 main_~x~0)))} is VALID [2022-04-28 12:38:23,772 INFO L290 TraceCheckUtils]: 91: Hoare triple {23521#(and (= (+ (* main_~y~0 (div (+ (- 1) main_~s~0) main_~q~0)) main_~y~0) 0) (= (+ main_~q~0 1) 0) (= (* main_~y~0 2) (+ main_~b~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {23521#(and (= (+ (* main_~y~0 (div (+ (- 1) main_~s~0) main_~q~0)) main_~y~0) 0) (= (+ main_~q~0 1) 0) (= (* main_~y~0 2) (+ main_~b~0 main_~x~0)))} is VALID [2022-04-28 12:38:23,773 INFO L290 TraceCheckUtils]: 92: Hoare triple {23521#(and (= (+ (* main_~y~0 (div (+ (- 1) main_~s~0) main_~q~0)) main_~y~0) 0) (= (+ main_~q~0 1) 0) (= (* main_~y~0 2) (+ main_~b~0 main_~x~0)))} assume !false; {23521#(and (= (+ (* main_~y~0 (div (+ (- 1) main_~s~0) main_~q~0)) main_~y~0) 0) (= (+ main_~q~0 1) 0) (= (* main_~y~0 2) (+ main_~b~0 main_~x~0)))} is VALID [2022-04-28 12:38:23,773 INFO L272 TraceCheckUtils]: 93: Hoare triple {23521#(and (= (+ (* main_~y~0 (div (+ (- 1) main_~s~0) main_~q~0)) main_~y~0) 0) (= (+ main_~q~0 1) 0) (= (* main_~y~0 2) (+ main_~b~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23242#true} is VALID [2022-04-28 12:38:23,773 INFO L290 TraceCheckUtils]: 94: Hoare triple {23242#true} ~cond := #in~cond; {23242#true} is VALID [2022-04-28 12:38:23,773 INFO L290 TraceCheckUtils]: 95: Hoare triple {23242#true} assume !(0 == ~cond); {23242#true} is VALID [2022-04-28 12:38:23,773 INFO L290 TraceCheckUtils]: 96: Hoare triple {23242#true} assume true; {23242#true} is VALID [2022-04-28 12:38:23,774 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {23242#true} {23521#(and (= (+ (* main_~y~0 (div (+ (- 1) main_~s~0) main_~q~0)) main_~y~0) 0) (= (+ main_~q~0 1) 0) (= (* main_~y~0 2) (+ main_~b~0 main_~x~0)))} #102#return; {23521#(and (= (+ (* main_~y~0 (div (+ (- 1) main_~s~0) main_~q~0)) main_~y~0) 0) (= (+ main_~q~0 1) 0) (= (* main_~y~0 2) (+ main_~b~0 main_~x~0)))} is VALID [2022-04-28 12:38:23,775 INFO L272 TraceCheckUtils]: 98: Hoare triple {23521#(and (= (+ (* main_~y~0 (div (+ (- 1) main_~s~0) main_~q~0)) main_~y~0) 0) (= (+ main_~q~0 1) 0) (= (* main_~y~0 2) (+ main_~b~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23555#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:38:23,775 INFO L290 TraceCheckUtils]: 99: Hoare triple {23555#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23559#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:38:23,775 INFO L290 TraceCheckUtils]: 100: Hoare triple {23559#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23243#false} is VALID [2022-04-28 12:38:23,775 INFO L290 TraceCheckUtils]: 101: Hoare triple {23243#false} assume !false; {23243#false} is VALID [2022-04-28 12:38:23,776 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 26 proven. 92 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-04-28 12:38:23,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:39:20,204 INFO L290 TraceCheckUtils]: 101: Hoare triple {23243#false} assume !false; {23243#false} is VALID [2022-04-28 12:39:20,204 INFO L290 TraceCheckUtils]: 100: Hoare triple {23559#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23243#false} is VALID [2022-04-28 12:39:20,205 INFO L290 TraceCheckUtils]: 99: Hoare triple {23555#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23559#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:39:20,205 INFO L272 TraceCheckUtils]: 98: Hoare triple {23575#(= 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)); {23555#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:39:20,206 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {23242#true} {23575#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #102#return; {23575#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:39:20,206 INFO L290 TraceCheckUtils]: 96: Hoare triple {23242#true} assume true; {23242#true} is VALID [2022-04-28 12:39:20,206 INFO L290 TraceCheckUtils]: 95: Hoare triple {23242#true} assume !(0 == ~cond); {23242#true} is VALID [2022-04-28 12:39:20,206 INFO L290 TraceCheckUtils]: 94: Hoare triple {23242#true} ~cond := #in~cond; {23242#true} is VALID [2022-04-28 12:39:20,206 INFO L272 TraceCheckUtils]: 93: Hoare triple {23575#(= 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)); {23242#true} is VALID [2022-04-28 12:39:20,207 INFO L290 TraceCheckUtils]: 92: Hoare triple {23575#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {23575#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:39:20,207 INFO L290 TraceCheckUtils]: 91: Hoare triple {23575#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {23575#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:39:20,207 INFO L290 TraceCheckUtils]: 90: Hoare triple {23575#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {23575#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:39:20,208 INFO L290 TraceCheckUtils]: 89: Hoare triple {23575#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {23575#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:39:20,208 INFO L290 TraceCheckUtils]: 88: Hoare triple {23575#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {23575#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:39:22,006 INFO L290 TraceCheckUtils]: 87: Hoare triple {23609#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {23575#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:39:22,006 INFO L290 TraceCheckUtils]: 86: Hoare triple {23609#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} assume !(~c~0 >= ~b~0); {23609#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-28 12:39:22,007 INFO L290 TraceCheckUtils]: 85: Hoare triple {23609#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} assume !false; {23609#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-28 12:39:22,618 INFO L290 TraceCheckUtils]: 84: Hoare triple {23619#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {23609#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-28 12:39:22,618 INFO L290 TraceCheckUtils]: 83: Hoare triple {23619#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !(~c~0 >= 2 * ~v~0); {23619#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:39:22,619 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {23242#true} {23619#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #108#return; {23619#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:39:22,619 INFO L290 TraceCheckUtils]: 81: Hoare triple {23242#true} assume true; {23242#true} is VALID [2022-04-28 12:39:22,619 INFO L290 TraceCheckUtils]: 80: Hoare triple {23242#true} assume !(0 == ~cond); {23242#true} is VALID [2022-04-28 12:39:22,619 INFO L290 TraceCheckUtils]: 79: Hoare triple {23242#true} ~cond := #in~cond; {23242#true} is VALID [2022-04-28 12:39:22,619 INFO L272 TraceCheckUtils]: 78: Hoare triple {23619#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {23242#true} is VALID [2022-04-28 12:39:22,620 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {23242#true} {23619#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #106#return; {23619#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:39:22,620 INFO L290 TraceCheckUtils]: 76: Hoare triple {23242#true} assume true; {23242#true} is VALID [2022-04-28 12:39:22,620 INFO L290 TraceCheckUtils]: 75: Hoare triple {23242#true} assume !(0 == ~cond); {23242#true} is VALID [2022-04-28 12:39:22,620 INFO L290 TraceCheckUtils]: 74: Hoare triple {23242#true} ~cond := #in~cond; {23242#true} is VALID [2022-04-28 12:39:22,620 INFO L272 TraceCheckUtils]: 73: Hoare triple {23619#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23242#true} is VALID [2022-04-28 12:39:22,621 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {23356#(not (= |__VERIFIER_assert_#in~cond| 0))} {23656#(or (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #104#return; {23619#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:39:22,622 INFO L290 TraceCheckUtils]: 71: Hoare triple {23356#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23356#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:39:22,622 INFO L290 TraceCheckUtils]: 70: Hoare triple {23666#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {23356#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:39:22,622 INFO L290 TraceCheckUtils]: 69: Hoare triple {23242#true} ~cond := #in~cond; {23666#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:39:22,622 INFO L272 TraceCheckUtils]: 68: Hoare triple {23656#(or (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23242#true} is VALID [2022-04-28 12:39:22,623 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {23356#(not (= |__VERIFIER_assert_#in~cond| 0))} {23673#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #102#return; {23656#(or (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 12:39:22,624 INFO L290 TraceCheckUtils]: 66: Hoare triple {23356#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23356#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:39:22,624 INFO L290 TraceCheckUtils]: 65: Hoare triple {23666#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {23356#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:39:22,624 INFO L290 TraceCheckUtils]: 64: Hoare triple {23242#true} ~cond := #in~cond; {23666#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:39:22,625 INFO L272 TraceCheckUtils]: 63: Hoare triple {23673#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23242#true} is VALID [2022-04-28 12:39:22,625 INFO L290 TraceCheckUtils]: 62: Hoare triple {23673#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !false; {23673#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 12:39:22,626 INFO L290 TraceCheckUtils]: 61: Hoare triple {23692#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) main_~c~0 (* (- 1) main_~b~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {23673#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 12:39:22,626 INFO L290 TraceCheckUtils]: 60: Hoare triple {23692#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) main_~c~0 (* (- 1) main_~b~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !false; {23692#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) main_~c~0 (* (- 1) main_~b~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:39:22,628 INFO L290 TraceCheckUtils]: 59: Hoare triple {23242#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {23692#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) main_~c~0 (* (- 1) main_~b~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:39:22,628 INFO L290 TraceCheckUtils]: 58: Hoare triple {23242#true} assume !false; {23242#true} is VALID [2022-04-28 12:39:22,628 INFO L290 TraceCheckUtils]: 57: Hoare triple {23242#true} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {23242#true} is VALID [2022-04-28 12:39:22,628 INFO L290 TraceCheckUtils]: 56: Hoare triple {23242#true} assume !(~c~0 >= ~b~0); {23242#true} is VALID [2022-04-28 12:39:22,628 INFO L290 TraceCheckUtils]: 55: Hoare triple {23242#true} assume !false; {23242#true} is VALID [2022-04-28 12:39:22,628 INFO L290 TraceCheckUtils]: 54: Hoare triple {23242#true} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {23242#true} is VALID [2022-04-28 12:39:22,628 INFO L290 TraceCheckUtils]: 53: Hoare triple {23242#true} assume !(~c~0 >= 2 * ~v~0); {23242#true} is VALID [2022-04-28 12:39:22,628 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {23242#true} {23242#true} #108#return; {23242#true} is VALID [2022-04-28 12:39:22,628 INFO L290 TraceCheckUtils]: 51: Hoare triple {23242#true} assume true; {23242#true} is VALID [2022-04-28 12:39:22,628 INFO L290 TraceCheckUtils]: 50: Hoare triple {23242#true} assume !(0 == ~cond); {23242#true} is VALID [2022-04-28 12:39:22,628 INFO L290 TraceCheckUtils]: 49: Hoare triple {23242#true} ~cond := #in~cond; {23242#true} is VALID [2022-04-28 12:39:22,628 INFO L272 TraceCheckUtils]: 48: Hoare triple {23242#true} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {23242#true} is VALID [2022-04-28 12:39:22,628 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23242#true} {23242#true} #106#return; {23242#true} is VALID [2022-04-28 12:39:22,628 INFO L290 TraceCheckUtils]: 46: Hoare triple {23242#true} assume true; {23242#true} is VALID [2022-04-28 12:39:22,629 INFO L290 TraceCheckUtils]: 45: Hoare triple {23242#true} assume !(0 == ~cond); {23242#true} is VALID [2022-04-28 12:39:22,629 INFO L290 TraceCheckUtils]: 44: Hoare triple {23242#true} ~cond := #in~cond; {23242#true} is VALID [2022-04-28 12:39:22,629 INFO L272 TraceCheckUtils]: 43: Hoare triple {23242#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23242#true} is VALID [2022-04-28 12:39:22,629 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {23242#true} {23242#true} #104#return; {23242#true} is VALID [2022-04-28 12:39:22,629 INFO L290 TraceCheckUtils]: 41: Hoare triple {23242#true} assume true; {23242#true} is VALID [2022-04-28 12:39:22,629 INFO L290 TraceCheckUtils]: 40: Hoare triple {23242#true} assume !(0 == ~cond); {23242#true} is VALID [2022-04-28 12:39:22,629 INFO L290 TraceCheckUtils]: 39: Hoare triple {23242#true} ~cond := #in~cond; {23242#true} is VALID [2022-04-28 12:39:22,629 INFO L272 TraceCheckUtils]: 38: Hoare triple {23242#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23242#true} is VALID [2022-04-28 12:39:22,629 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {23242#true} {23242#true} #102#return; {23242#true} is VALID [2022-04-28 12:39:22,629 INFO L290 TraceCheckUtils]: 36: Hoare triple {23242#true} assume true; {23242#true} is VALID [2022-04-28 12:39:22,629 INFO L290 TraceCheckUtils]: 35: Hoare triple {23242#true} assume !(0 == ~cond); {23242#true} is VALID [2022-04-28 12:39:22,630 INFO L290 TraceCheckUtils]: 34: Hoare triple {23242#true} ~cond := #in~cond; {23242#true} is VALID [2022-04-28 12:39:22,630 INFO L272 TraceCheckUtils]: 33: Hoare triple {23242#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23242#true} is VALID [2022-04-28 12:39:22,630 INFO L290 TraceCheckUtils]: 32: Hoare triple {23242#true} assume !false; {23242#true} is VALID [2022-04-28 12:39:22,630 INFO L290 TraceCheckUtils]: 31: Hoare triple {23242#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {23242#true} is VALID [2022-04-28 12:39:22,630 INFO L290 TraceCheckUtils]: 30: Hoare triple {23242#true} assume !false; {23242#true} is VALID [2022-04-28 12:39:22,630 INFO L290 TraceCheckUtils]: 29: Hoare triple {23242#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {23242#true} is VALID [2022-04-28 12:39:22,630 INFO L290 TraceCheckUtils]: 28: Hoare triple {23242#true} assume !false; {23242#true} is VALID [2022-04-28 12:39:22,630 INFO L290 TraceCheckUtils]: 27: Hoare triple {23242#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {23242#true} is VALID [2022-04-28 12:39:22,630 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {23242#true} {23242#true} #100#return; {23242#true} is VALID [2022-04-28 12:39:22,630 INFO L290 TraceCheckUtils]: 25: Hoare triple {23242#true} assume true; {23242#true} is VALID [2022-04-28 12:39:22,631 INFO L290 TraceCheckUtils]: 24: Hoare triple {23242#true} assume !(0 == ~cond); {23242#true} is VALID [2022-04-28 12:39:22,631 INFO L290 TraceCheckUtils]: 23: Hoare triple {23242#true} ~cond := #in~cond; {23242#true} is VALID [2022-04-28 12:39:22,631 INFO L272 TraceCheckUtils]: 22: Hoare triple {23242#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {23242#true} is VALID [2022-04-28 12:39:22,631 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {23242#true} {23242#true} #98#return; {23242#true} is VALID [2022-04-28 12:39:22,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {23242#true} assume true; {23242#true} is VALID [2022-04-28 12:39:22,631 INFO L290 TraceCheckUtils]: 19: Hoare triple {23242#true} assume !(0 == ~cond); {23242#true} is VALID [2022-04-28 12:39:22,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {23242#true} ~cond := #in~cond; {23242#true} is VALID [2022-04-28 12:39:22,631 INFO L272 TraceCheckUtils]: 17: Hoare triple {23242#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {23242#true} is VALID [2022-04-28 12:39:22,631 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {23242#true} {23242#true} #96#return; {23242#true} is VALID [2022-04-28 12:39:22,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {23242#true} assume true; {23242#true} is VALID [2022-04-28 12:39:22,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {23242#true} assume !(0 == ~cond); {23242#true} is VALID [2022-04-28 12:39:22,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {23242#true} ~cond := #in~cond; {23242#true} is VALID [2022-04-28 12:39:22,632 INFO L272 TraceCheckUtils]: 12: Hoare triple {23242#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {23242#true} is VALID [2022-04-28 12:39:22,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {23242#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {23242#true} is VALID [2022-04-28 12:39:22,632 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23242#true} {23242#true} #94#return; {23242#true} is VALID [2022-04-28 12:39:22,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {23242#true} assume true; {23242#true} is VALID [2022-04-28 12:39:22,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {23242#true} assume !(0 == ~cond); {23242#true} is VALID [2022-04-28 12:39:22,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {23242#true} ~cond := #in~cond; {23242#true} is VALID [2022-04-28 12:39:22,632 INFO L272 TraceCheckUtils]: 6: Hoare triple {23242#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {23242#true} is VALID [2022-04-28 12:39:22,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {23242#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {23242#true} is VALID [2022-04-28 12:39:22,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {23242#true} call #t~ret6 := main(); {23242#true} is VALID [2022-04-28 12:39:22,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23242#true} {23242#true} #112#return; {23242#true} is VALID [2022-04-28 12:39:22,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {23242#true} assume true; {23242#true} is VALID [2022-04-28 12:39:22,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {23242#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {23242#true} is VALID [2022-04-28 12:39:22,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {23242#true} call ULTIMATE.init(); {23242#true} is VALID [2022-04-28 12:39:22,634 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 69 proven. 27 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-04-28 12:39:22,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:39:22,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600710343] [2022-04-28 12:39:22,634 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:39:22,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467324715] [2022-04-28 12:39:22,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467324715] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:39:22,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:39:22,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 25 [2022-04-28 12:39:22,635 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:39:22,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [150812407] [2022-04-28 12:39:22,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [150812407] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:39:22,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:39:22,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 12:39:22,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851463527] [2022-04-28 12:39:22,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:39:22,635 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 7 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) Word has length 102 [2022-04-28 12:39:22,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:39:22,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 7 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-28 12:39:22,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:39:22,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 12:39:22,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:39:22,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 12:39:22,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2022-04-28 12:39:22,710 INFO L87 Difference]: Start difference. First operand 395 states and 555 transitions. Second operand has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 7 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-28 12:39:27,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:39:27,620 INFO L93 Difference]: Finished difference Result 470 states and 646 transitions. [2022-04-28 12:39:27,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 12:39:27,620 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 7 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) Word has length 102 [2022-04-28 12:39:27,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:39:27,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 7 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-28 12:39:27,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 163 transitions. [2022-04-28 12:39:27,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 7 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-28 12:39:27,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 163 transitions. [2022-04-28 12:39:27,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 163 transitions. [2022-04-28 12:39:27,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:39:27,861 INFO L225 Difference]: With dead ends: 470 [2022-04-28 12:39:27,861 INFO L226 Difference]: Without dead ends: 468 [2022-04-28 12:39:27,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 179 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2022-04-28 12:39:27,861 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 61 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 12:39:27,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 424 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 984 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 12:39:27,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-04-28 12:39:29,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 407. [2022-04-28 12:39:29,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:39:29,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 468 states. Second operand has 407 states, 234 states have (on average 1.1965811965811965) internal successors, (280), 235 states have internal predecessors, (280), 143 states have call successors, (143), 30 states have call predecessors, (143), 29 states have return successors, (141), 141 states have call predecessors, (141), 141 states have call successors, (141) [2022-04-28 12:39:29,107 INFO L74 IsIncluded]: Start isIncluded. First operand 468 states. Second operand has 407 states, 234 states have (on average 1.1965811965811965) internal successors, (280), 235 states have internal predecessors, (280), 143 states have call successors, (143), 30 states have call predecessors, (143), 29 states have return successors, (141), 141 states have call predecessors, (141), 141 states have call successors, (141) [2022-04-28 12:39:29,108 INFO L87 Difference]: Start difference. First operand 468 states. Second operand has 407 states, 234 states have (on average 1.1965811965811965) internal successors, (280), 235 states have internal predecessors, (280), 143 states have call successors, (143), 30 states have call predecessors, (143), 29 states have return successors, (141), 141 states have call predecessors, (141), 141 states have call successors, (141) [2022-04-28 12:39:29,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:39:29,123 INFO L93 Difference]: Finished difference Result 468 states and 644 transitions. [2022-04-28 12:39:29,123 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 644 transitions. [2022-04-28 12:39:29,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:39:29,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:39:29,126 INFO L74 IsIncluded]: Start isIncluded. First operand has 407 states, 234 states have (on average 1.1965811965811965) internal successors, (280), 235 states have internal predecessors, (280), 143 states have call successors, (143), 30 states have call predecessors, (143), 29 states have return successors, (141), 141 states have call predecessors, (141), 141 states have call successors, (141) Second operand 468 states. [2022-04-28 12:39:29,127 INFO L87 Difference]: Start difference. First operand has 407 states, 234 states have (on average 1.1965811965811965) internal successors, (280), 235 states have internal predecessors, (280), 143 states have call successors, (143), 30 states have call predecessors, (143), 29 states have return successors, (141), 141 states have call predecessors, (141), 141 states have call successors, (141) Second operand 468 states. [2022-04-28 12:39:29,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:39:29,142 INFO L93 Difference]: Finished difference Result 468 states and 644 transitions. [2022-04-28 12:39:29,142 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 644 transitions. [2022-04-28 12:39:29,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:39:29,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:39:29,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:39:29,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:39:29,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 234 states have (on average 1.1965811965811965) internal successors, (280), 235 states have internal predecessors, (280), 143 states have call successors, (143), 30 states have call predecessors, (143), 29 states have return successors, (141), 141 states have call predecessors, (141), 141 states have call successors, (141) [2022-04-28 12:39:29,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 564 transitions. [2022-04-28 12:39:29,159 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 564 transitions. Word has length 102 [2022-04-28 12:39:29,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:39:29,159 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 564 transitions. [2022-04-28 12:39:29,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 7 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-28 12:39:29,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 407 states and 564 transitions. [2022-04-28 12:39:31,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 564 edges. 564 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:39:31,153 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 564 transitions. [2022-04-28 12:39:31,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-28 12:39:31,155 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:39:31,155 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:39:31,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 12:39:31,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 12:39:31,376 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:39:31,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:39:31,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1948981098, now seen corresponding path program 5 times [2022-04-28 12:39:31,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:39:31,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1978096433] [2022-04-28 12:39:31,376 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:39:31,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1948981098, now seen corresponding path program 6 times [2022-04-28 12:39:31,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:39:31,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066192964] [2022-04-28 12:39:31,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:39:31,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:39:31,387 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:39:31,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1022672984] [2022-04-28 12:39:31,387 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:39:31,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:39:31,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:39:31,388 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:39:31,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 12:39:31,535 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 12:39:31,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:39:31,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-28 12:39:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:39:31,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:40:04,765 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:40:12,077 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:40:12,351 INFO L272 TraceCheckUtils]: 0: Hoare triple {26578#true} call ULTIMATE.init(); {26578#true} is VALID [2022-04-28 12:40:12,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {26578#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {26578#true} is VALID [2022-04-28 12:40:12,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {26578#true} assume true; {26578#true} is VALID [2022-04-28 12:40:12,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26578#true} {26578#true} #112#return; {26578#true} is VALID [2022-04-28 12:40:12,352 INFO L272 TraceCheckUtils]: 4: Hoare triple {26578#true} call #t~ret6 := main(); {26578#true} is VALID [2022-04-28 12:40:12,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {26578#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {26578#true} is VALID [2022-04-28 12:40:12,352 INFO L272 TraceCheckUtils]: 6: Hoare triple {26578#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {26578#true} is VALID [2022-04-28 12:40:12,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {26578#true} ~cond := #in~cond; {26578#true} is VALID [2022-04-28 12:40:12,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {26578#true} assume !(0 == ~cond); {26578#true} is VALID [2022-04-28 12:40:12,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {26578#true} assume true; {26578#true} is VALID [2022-04-28 12:40:12,352 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26578#true} {26578#true} #94#return; {26578#true} is VALID [2022-04-28 12:40:12,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {26578#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {26578#true} is VALID [2022-04-28 12:40:12,353 INFO L272 TraceCheckUtils]: 12: Hoare triple {26578#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {26578#true} is VALID [2022-04-28 12:40:12,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {26578#true} ~cond := #in~cond; {26578#true} is VALID [2022-04-28 12:40:12,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {26578#true} assume !(0 == ~cond); {26578#true} is VALID [2022-04-28 12:40:12,353 INFO L290 TraceCheckUtils]: 15: Hoare triple {26578#true} assume true; {26578#true} is VALID [2022-04-28 12:40:12,353 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {26578#true} {26578#true} #96#return; {26578#true} is VALID [2022-04-28 12:40:12,353 INFO L272 TraceCheckUtils]: 17: Hoare triple {26578#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {26578#true} is VALID [2022-04-28 12:40:12,353 INFO L290 TraceCheckUtils]: 18: Hoare triple {26578#true} ~cond := #in~cond; {26578#true} is VALID [2022-04-28 12:40:12,353 INFO L290 TraceCheckUtils]: 19: Hoare triple {26578#true} assume !(0 == ~cond); {26578#true} is VALID [2022-04-28 12:40:12,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {26578#true} assume true; {26578#true} is VALID [2022-04-28 12:40:12,353 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {26578#true} {26578#true} #98#return; {26578#true} is VALID [2022-04-28 12:40:12,353 INFO L272 TraceCheckUtils]: 22: Hoare triple {26578#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {26578#true} is VALID [2022-04-28 12:40:12,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {26578#true} ~cond := #in~cond; {26578#true} is VALID [2022-04-28 12:40:12,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {26578#true} assume !(0 == ~cond); {26578#true} is VALID [2022-04-28 12:40:12,353 INFO L290 TraceCheckUtils]: 25: Hoare triple {26578#true} assume true; {26578#true} is VALID [2022-04-28 12:40:12,353 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {26578#true} {26578#true} #100#return; {26578#true} is VALID [2022-04-28 12:40:12,354 INFO L290 TraceCheckUtils]: 27: Hoare triple {26578#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {26664#(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-28 12:40:12,354 INFO L290 TraceCheckUtils]: 28: Hoare triple {26664#(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; {26664#(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-28 12:40:12,355 INFO L290 TraceCheckUtils]: 29: Hoare triple {26664#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:40:12,355 INFO L290 TraceCheckUtils]: 30: Hoare triple {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:40:12,355 INFO L290 TraceCheckUtils]: 31: Hoare triple {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:40:12,356 INFO L290 TraceCheckUtils]: 32: Hoare triple {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:40:12,356 INFO L272 TraceCheckUtils]: 33: Hoare triple {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {26578#true} is VALID [2022-04-28 12:40:12,356 INFO L290 TraceCheckUtils]: 34: Hoare triple {26578#true} ~cond := #in~cond; {26578#true} is VALID [2022-04-28 12:40:12,356 INFO L290 TraceCheckUtils]: 35: Hoare triple {26578#true} assume !(0 == ~cond); {26578#true} is VALID [2022-04-28 12:40:12,356 INFO L290 TraceCheckUtils]: 36: Hoare triple {26578#true} assume true; {26578#true} is VALID [2022-04-28 12:40:12,357 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {26578#true} {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #102#return; {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:40:12,357 INFO L272 TraceCheckUtils]: 38: Hoare triple {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {26578#true} is VALID [2022-04-28 12:40:12,358 INFO L290 TraceCheckUtils]: 39: Hoare triple {26578#true} ~cond := #in~cond; {26702#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:40:12,358 INFO L290 TraceCheckUtils]: 40: Hoare triple {26702#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {26706#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:40:12,358 INFO L290 TraceCheckUtils]: 41: Hoare triple {26706#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {26706#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:40:12,359 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {26706#(not (= |__VERIFIER_assert_#in~cond| 0))} {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #104#return; {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:40:12,359 INFO L272 TraceCheckUtils]: 43: Hoare triple {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {26578#true} is VALID [2022-04-28 12:40:12,359 INFO L290 TraceCheckUtils]: 44: Hoare triple {26578#true} ~cond := #in~cond; {26578#true} is VALID [2022-04-28 12:40:12,359 INFO L290 TraceCheckUtils]: 45: Hoare triple {26578#true} assume !(0 == ~cond); {26578#true} is VALID [2022-04-28 12:40:12,359 INFO L290 TraceCheckUtils]: 46: Hoare triple {26578#true} assume true; {26578#true} is VALID [2022-04-28 12:40:12,360 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {26578#true} {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #106#return; {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:40:12,360 INFO L272 TraceCheckUtils]: 48: Hoare triple {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {26578#true} is VALID [2022-04-28 12:40:12,360 INFO L290 TraceCheckUtils]: 49: Hoare triple {26578#true} ~cond := #in~cond; {26578#true} is VALID [2022-04-28 12:40:12,360 INFO L290 TraceCheckUtils]: 50: Hoare triple {26578#true} assume !(0 == ~cond); {26578#true} is VALID [2022-04-28 12:40:12,360 INFO L290 TraceCheckUtils]: 51: Hoare triple {26578#true} assume true; {26578#true} is VALID [2022-04-28 12:40:12,361 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {26578#true} {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #108#return; {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:40:12,361 INFO L290 TraceCheckUtils]: 53: Hoare triple {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:40:12,362 INFO L290 TraceCheckUtils]: 54: Hoare triple {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:40:12,362 INFO L272 TraceCheckUtils]: 55: Hoare triple {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {26578#true} is VALID [2022-04-28 12:40:12,362 INFO L290 TraceCheckUtils]: 56: Hoare triple {26578#true} ~cond := #in~cond; {26578#true} is VALID [2022-04-28 12:40:12,362 INFO L290 TraceCheckUtils]: 57: Hoare triple {26578#true} assume !(0 == ~cond); {26578#true} is VALID [2022-04-28 12:40:12,362 INFO L290 TraceCheckUtils]: 58: Hoare triple {26578#true} assume true; {26578#true} is VALID [2022-04-28 12:40:12,363 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {26578#true} {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #102#return; {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:40:12,363 INFO L272 TraceCheckUtils]: 60: Hoare triple {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {26578#true} is VALID [2022-04-28 12:40:12,363 INFO L290 TraceCheckUtils]: 61: Hoare triple {26578#true} ~cond := #in~cond; {26578#true} is VALID [2022-04-28 12:40:12,363 INFO L290 TraceCheckUtils]: 62: Hoare triple {26578#true} assume !(0 == ~cond); {26578#true} is VALID [2022-04-28 12:40:12,363 INFO L290 TraceCheckUtils]: 63: Hoare triple {26578#true} assume true; {26578#true} is VALID [2022-04-28 12:40:12,364 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {26578#true} {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #104#return; {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:40:12,364 INFO L272 TraceCheckUtils]: 65: Hoare triple {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {26578#true} is VALID [2022-04-28 12:40:12,364 INFO L290 TraceCheckUtils]: 66: Hoare triple {26578#true} ~cond := #in~cond; {26578#true} is VALID [2022-04-28 12:40:12,364 INFO L290 TraceCheckUtils]: 67: Hoare triple {26578#true} assume !(0 == ~cond); {26578#true} is VALID [2022-04-28 12:40:12,364 INFO L290 TraceCheckUtils]: 68: Hoare triple {26578#true} assume true; {26578#true} is VALID [2022-04-28 12:40:12,365 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {26578#true} {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #106#return; {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:40:12,365 INFO L272 TraceCheckUtils]: 70: Hoare triple {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {26578#true} is VALID [2022-04-28 12:40:12,365 INFO L290 TraceCheckUtils]: 71: Hoare triple {26578#true} ~cond := #in~cond; {26578#true} is VALID [2022-04-28 12:40:12,365 INFO L290 TraceCheckUtils]: 72: Hoare triple {26578#true} assume !(0 == ~cond); {26578#true} is VALID [2022-04-28 12:40:12,365 INFO L290 TraceCheckUtils]: 73: Hoare triple {26578#true} assume true; {26578#true} is VALID [2022-04-28 12:40:12,366 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {26578#true} {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #108#return; {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:40:12,366 INFO L290 TraceCheckUtils]: 75: Hoare triple {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:40:12,367 INFO L290 TraceCheckUtils]: 76: Hoare triple {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:40:12,367 INFO L272 TraceCheckUtils]: 77: Hoare triple {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {26578#true} is VALID [2022-04-28 12:40:12,367 INFO L290 TraceCheckUtils]: 78: Hoare triple {26578#true} ~cond := #in~cond; {26578#true} is VALID [2022-04-28 12:40:12,367 INFO L290 TraceCheckUtils]: 79: Hoare triple {26578#true} assume !(0 == ~cond); {26578#true} is VALID [2022-04-28 12:40:12,367 INFO L290 TraceCheckUtils]: 80: Hoare triple {26578#true} assume true; {26578#true} is VALID [2022-04-28 12:40:12,368 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {26578#true} {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #102#return; {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:40:12,368 INFO L272 TraceCheckUtils]: 82: Hoare triple {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {26578#true} is VALID [2022-04-28 12:40:12,368 INFO L290 TraceCheckUtils]: 83: Hoare triple {26578#true} ~cond := #in~cond; {26578#true} is VALID [2022-04-28 12:40:12,368 INFO L290 TraceCheckUtils]: 84: Hoare triple {26578#true} assume !(0 == ~cond); {26578#true} is VALID [2022-04-28 12:40:12,368 INFO L290 TraceCheckUtils]: 85: Hoare triple {26578#true} assume true; {26578#true} is VALID [2022-04-28 12:40:12,369 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {26578#true} {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #104#return; {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:40:12,369 INFO L272 TraceCheckUtils]: 87: Hoare triple {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {26578#true} is VALID [2022-04-28 12:40:12,369 INFO L290 TraceCheckUtils]: 88: Hoare triple {26578#true} ~cond := #in~cond; {26578#true} is VALID [2022-04-28 12:40:12,369 INFO L290 TraceCheckUtils]: 89: Hoare triple {26578#true} assume !(0 == ~cond); {26578#true} is VALID [2022-04-28 12:40:12,369 INFO L290 TraceCheckUtils]: 90: Hoare triple {26578#true} assume true; {26578#true} is VALID [2022-04-28 12:40:12,370 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {26578#true} {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #106#return; {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:40:12,370 INFO L272 TraceCheckUtils]: 92: Hoare triple {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {26578#true} is VALID [2022-04-28 12:40:12,370 INFO L290 TraceCheckUtils]: 93: Hoare triple {26578#true} ~cond := #in~cond; {26702#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:40:12,370 INFO L290 TraceCheckUtils]: 94: Hoare triple {26702#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {26706#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:40:12,370 INFO L290 TraceCheckUtils]: 95: Hoare triple {26706#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {26706#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:40:12,371 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {26706#(not (= |__VERIFIER_assert_#in~cond| 0))} {26671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #108#return; {26875#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:40:12,372 INFO L290 TraceCheckUtils]: 97: Hoare triple {26875#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {26879#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (<= (* main_~v~0 2) main_~c~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:40:12,375 INFO L290 TraceCheckUtils]: 98: Hoare triple {26879#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (<= (* main_~v~0 2) main_~c~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {26883#(and (= main_~r~0 0) (= (+ (* (- 1) main_~c~0) main_~x~0) (* main_~b~0 main_~k~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (<= main_~x~0 (* main_~c~0 2))) (= main_~p~0 1))} is VALID [2022-04-28 12:40:12,376 INFO L290 TraceCheckUtils]: 99: Hoare triple {26883#(and (= main_~r~0 0) (= (+ (* (- 1) main_~c~0) main_~x~0) (* main_~b~0 main_~k~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (<= main_~x~0 (* main_~c~0 2))) (= main_~p~0 1))} assume !false; {26883#(and (= main_~r~0 0) (= (+ (* (- 1) main_~c~0) main_~x~0) (* main_~b~0 main_~k~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (<= main_~x~0 (* main_~c~0 2))) (= main_~p~0 1))} is VALID [2022-04-28 12:40:12,376 INFO L290 TraceCheckUtils]: 100: Hoare triple {26883#(and (= main_~r~0 0) (= (+ (* (- 1) main_~c~0) main_~x~0) (* main_~b~0 main_~k~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (<= main_~x~0 (* main_~c~0 2))) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {26883#(and (= main_~r~0 0) (= (+ (* (- 1) main_~c~0) main_~x~0) (* main_~b~0 main_~k~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (<= main_~x~0 (* main_~c~0 2))) (= main_~p~0 1))} is VALID [2022-04-28 12:40:12,379 INFO L290 TraceCheckUtils]: 101: Hoare triple {26883#(and (= main_~r~0 0) (= (+ (* (- 1) main_~c~0) main_~x~0) (* main_~b~0 main_~k~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (<= main_~x~0 (* main_~c~0 2))) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {26893#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 (* (* main_~y~0 (div (* (- 1) main_~s~0) main_~r~0)) 2)) (= main_~q~0 1) (= (+ (* main_~y~0 (div (* (- 1) main_~s~0) main_~r~0)) main_~b~0) main_~x~0))} is VALID [2022-04-28 12:40:12,379 INFO L290 TraceCheckUtils]: 102: Hoare triple {26893#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 (* (* main_~y~0 (div (* (- 1) main_~s~0) main_~r~0)) 2)) (= main_~q~0 1) (= (+ (* main_~y~0 (div (* (- 1) main_~s~0) main_~r~0)) main_~b~0) main_~x~0))} assume !false; {26893#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 (* (* main_~y~0 (div (* (- 1) main_~s~0) main_~r~0)) 2)) (= main_~q~0 1) (= (+ (* main_~y~0 (div (* (- 1) main_~s~0) main_~r~0)) main_~b~0) main_~x~0))} is VALID [2022-04-28 12:40:12,380 INFO L290 TraceCheckUtils]: 103: Hoare triple {26893#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 (* (* main_~y~0 (div (* (- 1) main_~s~0) main_~r~0)) 2)) (= main_~q~0 1) (= (+ (* main_~y~0 (div (* (- 1) main_~s~0) main_~r~0)) main_~b~0) main_~x~0))} assume !(0 != ~b~0); {26900#(and (= main_~p~0 0) (= (* main_~y~0 (div (* (- 1) main_~s~0) main_~r~0)) main_~x~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 (* (* main_~y~0 (div (* (- 1) main_~s~0) main_~r~0)) 2)) (= main_~q~0 1))} is VALID [2022-04-28 12:40:12,382 INFO L272 TraceCheckUtils]: 104: Hoare triple {26900#(and (= main_~p~0 0) (= (* main_~y~0 (div (* (- 1) main_~s~0) main_~r~0)) main_~x~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 (* (* main_~y~0 (div (* (- 1) main_~s~0) main_~r~0)) 2)) (= main_~q~0 1))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {26904#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:40:12,383 INFO L290 TraceCheckUtils]: 105: Hoare triple {26904#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26908#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:40:12,383 INFO L290 TraceCheckUtils]: 106: Hoare triple {26908#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26579#false} is VALID [2022-04-28 12:40:12,383 INFO L290 TraceCheckUtils]: 107: Hoare triple {26579#false} assume !false; {26579#false} is VALID [2022-04-28 12:40:12,384 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 57 proven. 33 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2022-04-28 12:40:12,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:40:26,860 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful