/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_valuebound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 15:01:54,912 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 15:01:54,914 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 15:01:54,958 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 15:01:54,959 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 15:01:54,960 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 15:01:54,961 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 15:01:54,962 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 15:01:54,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 15:01:54,964 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 15:01:54,965 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 15:01:54,966 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 15:01:54,966 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 15:01:54,967 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 15:01:54,968 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 15:01:54,969 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 15:01:54,969 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 15:01:54,970 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 15:01:54,971 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 15:01:54,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 15:01:54,974 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 15:01:54,975 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 15:01:54,976 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 15:01:54,977 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 15:01:54,978 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 15:01:54,980 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 15:01:54,980 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 15:01:54,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 15:01:54,981 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 15:01:54,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 15:01:54,982 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 15:01:54,982 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 15:01:54,983 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 15:01:54,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 15:01:54,984 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 15:01:54,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 15:01:54,985 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 15:01:54,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 15:01:54,986 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 15:01:54,986 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 15:01:54,987 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 15:01:54,990 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 15:01:54,990 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 15:01:54,997 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 15:01:54,998 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 15:01:55,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 15:01:55,003 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 15:01:55,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 15:01:55,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 15:01:55,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 15:01:55,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 15:01:55,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 15:01:55,004 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 15:01:55,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 15:01:55,005 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 15:01:55,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 15:01:55,005 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 15:01:55,005 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 15:01:55,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 15:01:55,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 15:01:55,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 15:01:55,005 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 15:01:55,006 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 15:01:55,006 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 15:01:55,006 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 15:01:55,006 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 15:01:55,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 15:01:55,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 15:01:55,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 15:01:55,212 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 15:01:55,215 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 15:01:55,216 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound2.c [2022-04-15 15:01:55,262 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc5a51ca2/90d322a10e9f49d7b1e726bf6f561731/FLAG2be0a6b03 [2022-04-15 15:01:55,571 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 15:01:55,572 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound2.c [2022-04-15 15:01:55,582 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc5a51ca2/90d322a10e9f49d7b1e726bf6f561731/FLAG2be0a6b03 [2022-04-15 15:01:56,007 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc5a51ca2/90d322a10e9f49d7b1e726bf6f561731 [2022-04-15 15:01:56,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 15:01:56,010 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 15:01:56,015 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 15:01:56,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 15:01:56,018 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 15:01:56,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:01:56" (1/1) ... [2022-04-15 15:01:56,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50ed7c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:01:56, skipping insertion in model container [2022-04-15 15:01:56,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:01:56" (1/1) ... [2022-04-15 15:01:56,026 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 15:01:56,042 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 15:01:56,244 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound2.c[490,503] [2022-04-15 15:01:56,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 15:01:56,277 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 15:01:56,295 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound2.c[490,503] [2022-04-15 15:01:56,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 15:01:56,322 INFO L208 MainTranslator]: Completed translation [2022-04-15 15:01:56,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:01:56 WrapperNode [2022-04-15 15:01:56,323 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 15:01:56,324 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 15:01:56,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 15:01:56,324 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 15:01:56,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:01:56" (1/1) ... [2022-04-15 15:01:56,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:01:56" (1/1) ... [2022-04-15 15:01:56,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:01:56" (1/1) ... [2022-04-15 15:01:56,340 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:01:56" (1/1) ... [2022-04-15 15:01:56,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:01:56" (1/1) ... [2022-04-15 15:01:56,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:01:56" (1/1) ... [2022-04-15 15:01:56,363 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:01:56" (1/1) ... [2022-04-15 15:01:56,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 15:01:56,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 15:01:56,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 15:01:56,366 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 15:01:56,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:01:56" (1/1) ... [2022-04-15 15:01:56,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 15:01:56,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:01:56,396 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 15:01:56,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 15:01:56,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 15:01:56,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 15:01:56,434 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 15:01:56,435 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 15:01:56,435 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 15:01:56,436 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 15:01:56,436 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 15:01:56,436 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 15:01:56,436 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 15:01:56,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 15:01:56,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 15:01:56,437 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 15:01:56,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 15:01:56,437 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 15:01:56,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 15:01:56,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 15:01:56,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 15:01:56,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 15:01:56,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 15:01:56,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 15:01:56,496 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 15:01:56,498 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 15:01:56,646 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 15:01:56,652 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 15:01:56,652 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-15 15:01:56,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:01:56 BoogieIcfgContainer [2022-04-15 15:01:56,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 15:01:56,655 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 15:01:56,655 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 15:01:56,657 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 15:01:56,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 03:01:56" (1/3) ... [2022-04-15 15:01:56,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a8f36b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:01:56, skipping insertion in model container [2022-04-15 15:01:56,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:01:56" (2/3) ... [2022-04-15 15:01:56,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a8f36b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:01:56, skipping insertion in model container [2022-04-15 15:01:56,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:01:56" (3/3) ... [2022-04-15 15:01:56,659 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_valuebound2.c [2022-04-15 15:01:56,663 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 15:01:56,663 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 15:01:56,697 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 15:01:56,702 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 15:01:56,702 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 15:01:56,747 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-15 15:01:56,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 15:01:56,753 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:01:56,754 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:01:56,754 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:01:56,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:01:56,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1237885594, now seen corresponding path program 1 times [2022-04-15 15:01:56,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:01:56,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2087356405] [2022-04-15 15:01:56,785 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:01:56,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1237885594, now seen corresponding path program 2 times [2022-04-15 15:01:56,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:01:56,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905248253] [2022-04-15 15:01:56,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:01:56,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:01:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:01:56,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 15:01:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:01:57,011 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-15 15:01:57,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-15 15:01:57,012 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #112#return; {43#true} is VALID [2022-04-15 15:01:57,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 15:01:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:01:57,046 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-15 15:01:57,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-15 15:01:57,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-15 15:01:57,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} #94#return; {44#false} is VALID [2022-04-15 15:01:57,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 15:01:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:01:57,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-15 15:01:57,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-15 15:01:57,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-15 15:01:57,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #96#return; {44#false} is VALID [2022-04-15 15:01:57,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-15 15:01:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:01:57,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-15 15:01:57,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-15 15:01:57,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-15 15:01:57,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #98#return; {44#false} is VALID [2022-04-15 15:01:57,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-15 15:01:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:01:57,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-15 15:01:57,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-15 15:01:57,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-15 15:01:57,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #100#return; {44#false} is VALID [2022-04-15 15:01:57,082 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-15 15:01:57,082 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-15 15:01:57,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-15 15:01:57,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #112#return; {43#true} is VALID [2022-04-15 15:01:57,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret6 := main(); {43#true} is VALID [2022-04-15 15:01:57,083 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-15 15:01:57,083 INFO L272 TraceCheckUtils]: 6: Hoare triple {43#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {43#true} is VALID [2022-04-15 15:01:57,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-15 15:01:57,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-15 15:01:57,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-15 15:01:57,086 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} #94#return; {44#false} is VALID [2022-04-15 15:01:57,086 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-15 15:01:57,086 INFO L272 TraceCheckUtils]: 12: Hoare triple {44#false} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {43#true} is VALID [2022-04-15 15:01:57,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-15 15:01:57,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-15 15:01:57,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-15 15:01:57,087 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {44#false} {44#false} #96#return; {44#false} is VALID [2022-04-15 15:01:57,087 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-15 15:01:57,087 INFO L290 TraceCheckUtils]: 18: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-15 15:01:57,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-15 15:01:57,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-15 15:01:57,089 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {44#false} {44#false} #98#return; {44#false} is VALID [2022-04-15 15:01:57,089 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-15 15:01:57,089 INFO L290 TraceCheckUtils]: 23: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-15 15:01:57,090 INFO L290 TraceCheckUtils]: 24: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-15 15:01:57,092 INFO L290 TraceCheckUtils]: 25: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-15 15:01:57,092 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {44#false} {44#false} #100#return; {44#false} is VALID [2022-04-15 15:01:57,092 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-15 15:01:57,092 INFO L290 TraceCheckUtils]: 28: Hoare triple {44#false} assume false; {44#false} is VALID [2022-04-15 15:01:57,092 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-15 15:01:57,093 INFO L290 TraceCheckUtils]: 30: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2022-04-15 15:01:57,093 INFO L290 TraceCheckUtils]: 31: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2022-04-15 15:01:57,093 INFO L290 TraceCheckUtils]: 32: Hoare triple {44#false} assume !false; {44#false} is VALID [2022-04-15 15:01:57,093 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 15:01:57,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:01:57,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905248253] [2022-04-15 15:01:57,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905248253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:01:57,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:01:57,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 15:01:57,097 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:01:57,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2087356405] [2022-04-15 15:01:57,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2087356405] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:01:57,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:01:57,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 15:01:57,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589219524] [2022-04-15 15:01:57,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:01:57,103 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-15 15:01:57,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:01:57,109 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-15 15:01:57,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:01:57,149 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 15:01:57,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:01:57,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 15:01:57,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 15:01:57,180 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-15 15:01:57,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:01:57,363 INFO L93 Difference]: Finished difference Result 73 states and 115 transitions. [2022-04-15 15:01:57,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 15:01:57,363 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-15 15:01:57,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:01:57,364 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-15 15:01:57,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2022-04-15 15:01:57,374 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-15 15:01:57,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2022-04-15 15:01:57,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 115 transitions. [2022-04-15 15:01:57,559 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-15 15:01:57,570 INFO L225 Difference]: With dead ends: 73 [2022-04-15 15:01:57,570 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 15:01:57,575 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 15:01:57,578 INFO L913 BasicCegarLoop]: 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-15 15:01:57,579 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 43 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:01:57,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 15:01:57,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 15:01:57,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:01:57,617 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-15 15:01:57,619 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-15 15:01:57,620 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-15 15:01:57,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:01:57,626 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-15 15:01:57,626 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-15 15:01:57,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:01:57,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:01:57,627 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-15 15:01:57,627 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-15 15:01:57,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:01:57,635 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-15 15:01:57,635 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-15 15:01:57,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:01:57,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:01:57,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:01:57,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:01:57,636 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-15 15:01:57,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-15 15:01:57,646 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 33 [2022-04-15 15:01:57,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:01:57,646 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-15 15:01:57,646 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 15:01:57,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 44 transitions. [2022-04-15 15:01:57,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:01:57,701 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-15 15:01:57,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 15:01:57,703 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:01:57,703 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:01:57,704 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 15:01:57,704 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:01:57,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:01:57,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1569470122, now seen corresponding path program 1 times [2022-04-15 15:01:57,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:01:57,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [229446682] [2022-04-15 15:01:57,706 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:01:57,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1569470122, now seen corresponding path program 2 times [2022-04-15 15:01:57,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:01:57,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686377068] [2022-04-15 15:01:57,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:01:57,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:01:57,756 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:01:57,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [264381075] [2022-04-15 15:01:57,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:01:57,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:01:57,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:01:57,759 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:01:57,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 15:01:57,814 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 15:01:57,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:01:57,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 15:01:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:01:57,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:01:58,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {353#true} call ULTIMATE.init(); {353#true} is VALID [2022-04-15 15:01:58,167 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-15 15:01:58,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {353#true} assume true; {353#true} is VALID [2022-04-15 15:01:58,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {353#true} {353#true} #112#return; {353#true} is VALID [2022-04-15 15:01:58,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {353#true} call #t~ret6 := main(); {353#true} is VALID [2022-04-15 15:01:58,170 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-15 15:01:58,170 INFO L272 TraceCheckUtils]: 6: Hoare triple {353#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {353#true} is VALID [2022-04-15 15:01:58,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {353#true} ~cond := #in~cond; {353#true} is VALID [2022-04-15 15:01:58,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {353#true} assume !(0 == ~cond); {353#true} is VALID [2022-04-15 15:01:58,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {353#true} assume true; {353#true} is VALID [2022-04-15 15:01:58,171 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {353#true} {353#true} #94#return; {353#true} is VALID [2022-04-15 15:01:58,171 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-15 15:01:58,171 INFO L272 TraceCheckUtils]: 12: Hoare triple {353#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {353#true} is VALID [2022-04-15 15:01:58,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {353#true} ~cond := #in~cond; {353#true} is VALID [2022-04-15 15:01:58,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {353#true} assume !(0 == ~cond); {353#true} is VALID [2022-04-15 15:01:58,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {353#true} assume true; {353#true} is VALID [2022-04-15 15:01:58,172 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {353#true} {353#true} #96#return; {353#true} is VALID [2022-04-15 15:01:58,172 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-15 15:01:58,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {353#true} ~cond := #in~cond; {353#true} is VALID [2022-04-15 15:01:58,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {353#true} assume !(0 == ~cond); {353#true} is VALID [2022-04-15 15:01:58,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {353#true} assume true; {353#true} is VALID [2022-04-15 15:01:58,176 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {353#true} {353#true} #98#return; {353#true} is VALID [2022-04-15 15:01:58,177 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-15 15:01:58,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {353#true} ~cond := #in~cond; {353#true} is VALID [2022-04-15 15:01:58,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {353#true} assume !(0 == ~cond); {353#true} is VALID [2022-04-15 15:01:58,178 INFO L290 TraceCheckUtils]: 25: Hoare triple {353#true} assume true; {353#true} is VALID [2022-04-15 15:01:58,178 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {353#true} {353#true} #100#return; {353#true} is VALID [2022-04-15 15:01:58,179 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-15 15:01:58,180 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-15 15:01:58,181 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-15 15:01:58,182 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-15 15:01:58,182 INFO L290 TraceCheckUtils]: 31: Hoare triple {450#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {454#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:01:58,183 INFO L290 TraceCheckUtils]: 32: Hoare triple {454#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {354#false} is VALID [2022-04-15 15:01:58,183 INFO L290 TraceCheckUtils]: 33: Hoare triple {354#false} assume !false; {354#false} is VALID [2022-04-15 15:01:58,184 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 15:01:58,184 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:01:58,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:01:58,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686377068] [2022-04-15 15:01:58,185 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:01:58,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264381075] [2022-04-15 15:01:58,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264381075] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:01:58,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:01:58,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 15:01:58,187 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:01:58,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [229446682] [2022-04-15 15:01:58,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [229446682] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:01:58,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:01:58,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 15:01:58,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209582861] [2022-04-15 15:01:58,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:01:58,188 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-15 15:01:58,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:01:58,189 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-15 15:01:58,211 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-15 15:01:58,211 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 15:01:58,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:01:58,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 15:01:58,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 15:01:58,222 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-15 15:01:58,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:01:58,584 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2022-04-15 15:01:58,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 15:01:58,585 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-15 15:01:58,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:01:58,585 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-15 15:01:58,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-15 15:01:58,589 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-15 15:01:58,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-15 15:01:58,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2022-04-15 15:01:58,649 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-15 15:01:58,652 INFO L225 Difference]: With dead ends: 54 [2022-04-15 15:01:58,652 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 15:01:58,652 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 15:01:58,653 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 14 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:01:58,654 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 158 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 15:01:58,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 15:01:58,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-15 15:01:58,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:01:58,666 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-15 15:01:58,667 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-15 15:01:58,667 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-15 15:01:58,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:01:58,670 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2022-04-15 15:01:58,671 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2022-04-15 15:01:58,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:01:58,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:01:58,672 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-15 15:01:58,672 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-15 15:01:58,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:01:58,675 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2022-04-15 15:01:58,675 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2022-04-15 15:01:58,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:01:58,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:01:58,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:01:58,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:01:58,677 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-15 15:01:58,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-15 15:01:58,679 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 34 [2022-04-15 15:01:58,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:01:58,680 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-04-15 15:01:58,680 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 15:01:58,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 64 transitions. [2022-04-15 15:01:58,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:01:58,743 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-15 15:01:58,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 15:01:58,744 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:01:58,744 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:01:58,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 15:01:58,959 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:01:58,960 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:01:58,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:01:58,960 INFO L85 PathProgramCache]: Analyzing trace with hash 584996456, now seen corresponding path program 1 times [2022-04-15 15:01:58,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:01:58,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [626553793] [2022-04-15 15:01:58,961 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:01:58,961 INFO L85 PathProgramCache]: Analyzing trace with hash 584996456, now seen corresponding path program 2 times [2022-04-15 15:01:58,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:01:58,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275902644] [2022-04-15 15:01:58,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:01:58,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:01:58,993 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:01:58,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [387555457] [2022-04-15 15:01:58,994 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:01:58,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:01:58,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:01:58,995 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:01:58,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 15:01:59,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:01:59,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:01:59,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 15:01:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:01:59,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:01:59,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {774#true} call ULTIMATE.init(); {774#true} is VALID [2022-04-15 15:01:59,260 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-15 15:01:59,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-15 15:01:59,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {774#true} {774#true} #112#return; {774#true} is VALID [2022-04-15 15:01:59,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {774#true} call #t~ret6 := main(); {774#true} is VALID [2022-04-15 15:01:59,260 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-15 15:01:59,260 INFO L272 TraceCheckUtils]: 6: Hoare triple {774#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {774#true} is VALID [2022-04-15 15:01:59,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-15 15:01:59,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-15 15:01:59,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-15 15:01:59,261 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {774#true} {774#true} #94#return; {774#true} is VALID [2022-04-15 15:01:59,261 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-15 15:01:59,261 INFO L272 TraceCheckUtils]: 12: Hoare triple {774#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {774#true} is VALID [2022-04-15 15:01:59,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-15 15:01:59,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-15 15:01:59,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-15 15:01:59,265 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {774#true} {774#true} #96#return; {774#true} is VALID [2022-04-15 15:01:59,265 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-15 15:01:59,265 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-15 15:01:59,266 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-15 15:01:59,267 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-15 15:01:59,272 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-15 15:01:59,272 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-15 15:01:59,273 INFO L290 TraceCheckUtils]: 23: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-15 15:01:59,273 INFO L290 TraceCheckUtils]: 24: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-15 15:01:59,273 INFO L290 TraceCheckUtils]: 25: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-15 15:01:59,274 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {774#true} {844#(<= 1 main_~x~0)} #100#return; {844#(<= 1 main_~x~0)} is VALID [2022-04-15 15:01:59,274 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-15 15:01:59,276 INFO L290 TraceCheckUtils]: 28: Hoare triple {863#(<= 1 main_~a~0)} assume !false; {863#(<= 1 main_~a~0)} is VALID [2022-04-15 15:01:59,276 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-15 15:01:59,277 INFO L290 TraceCheckUtils]: 30: Hoare triple {870#(<= 1 main_~c~0)} assume !false; {870#(<= 1 main_~c~0)} is VALID [2022-04-15 15:01:59,279 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-15 15:01:59,280 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-15 15:01:59,292 INFO L290 TraceCheckUtils]: 33: Hoare triple {880#(<= 1 main_~b~0)} assume !false; {880#(<= 1 main_~b~0)} is VALID [2022-04-15 15:01:59,293 INFO L290 TraceCheckUtils]: 34: Hoare triple {880#(<= 1 main_~b~0)} assume !(0 != ~b~0); {775#false} is VALID [2022-04-15 15:01:59,293 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-15 15:01:59,293 INFO L290 TraceCheckUtils]: 36: Hoare triple {775#false} ~cond := #in~cond; {775#false} is VALID [2022-04-15 15:01:59,294 INFO L290 TraceCheckUtils]: 37: Hoare triple {775#false} assume 0 == ~cond; {775#false} is VALID [2022-04-15 15:01:59,294 INFO L290 TraceCheckUtils]: 38: Hoare triple {775#false} assume !false; {775#false} is VALID [2022-04-15 15:01:59,294 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-15 15:01:59,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:01:59,570 INFO L290 TraceCheckUtils]: 38: Hoare triple {775#false} assume !false; {775#false} is VALID [2022-04-15 15:01:59,570 INFO L290 TraceCheckUtils]: 37: Hoare triple {775#false} assume 0 == ~cond; {775#false} is VALID [2022-04-15 15:01:59,570 INFO L290 TraceCheckUtils]: 36: Hoare triple {775#false} ~cond := #in~cond; {775#false} is VALID [2022-04-15 15:01:59,570 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-15 15:01:59,571 INFO L290 TraceCheckUtils]: 34: Hoare triple {880#(<= 1 main_~b~0)} assume !(0 != ~b~0); {775#false} is VALID [2022-04-15 15:01:59,571 INFO L290 TraceCheckUtils]: 33: Hoare triple {880#(<= 1 main_~b~0)} assume !false; {880#(<= 1 main_~b~0)} is VALID [2022-04-15 15:01:59,572 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-15 15:01:59,572 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-15 15:01:59,572 INFO L290 TraceCheckUtils]: 30: Hoare triple {870#(<= 1 main_~c~0)} assume !false; {870#(<= 1 main_~c~0)} is VALID [2022-04-15 15:01:59,573 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-15 15:01:59,575 INFO L290 TraceCheckUtils]: 28: Hoare triple {863#(<= 1 main_~a~0)} assume !false; {863#(<= 1 main_~a~0)} is VALID [2022-04-15 15:01:59,576 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-15 15:01:59,577 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {774#true} {844#(<= 1 main_~x~0)} #100#return; {844#(<= 1 main_~x~0)} is VALID [2022-04-15 15:01:59,577 INFO L290 TraceCheckUtils]: 25: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-15 15:01:59,577 INFO L290 TraceCheckUtils]: 24: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-15 15:01:59,577 INFO L290 TraceCheckUtils]: 23: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-15 15:01:59,578 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-15 15:01:59,578 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-15 15:01:59,579 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-15 15:01:59,579 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-15 15:01:59,579 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-15 15:01:59,580 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-15 15:01:59,580 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {774#true} {774#true} #96#return; {774#true} is VALID [2022-04-15 15:01:59,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-15 15:01:59,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-15 15:01:59,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-15 15:01:59,580 INFO L272 TraceCheckUtils]: 12: Hoare triple {774#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {774#true} is VALID [2022-04-15 15:01:59,580 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-15 15:01:59,580 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {774#true} {774#true} #94#return; {774#true} is VALID [2022-04-15 15:01:59,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-15 15:01:59,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-15 15:01:59,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-15 15:01:59,581 INFO L272 TraceCheckUtils]: 6: Hoare triple {774#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {774#true} is VALID [2022-04-15 15:01:59,581 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-15 15:01:59,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {774#true} call #t~ret6 := main(); {774#true} is VALID [2022-04-15 15:01:59,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {774#true} {774#true} #112#return; {774#true} is VALID [2022-04-15 15:01:59,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-15 15:01:59,582 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-15 15:01:59,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {774#true} call ULTIMATE.init(); {774#true} is VALID [2022-04-15 15:01:59,583 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-15 15:01:59,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:01:59,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275902644] [2022-04-15 15:01:59,583 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:01:59,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387555457] [2022-04-15 15:01:59,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387555457] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:01:59,584 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:01:59,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-15 15:01:59,584 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:01:59,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [626553793] [2022-04-15 15:01:59,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [626553793] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:01:59,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:01:59,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 15:01:59,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648918244] [2022-04-15 15:01:59,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:01:59,585 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-15 15:01:59,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:01:59,587 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-15 15:01:59,609 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-15 15:01:59,610 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 15:01:59,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:01:59,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 15:01:59,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-15 15:01:59,611 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-15 15:02:00,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:02:00,283 INFO L93 Difference]: Finished difference Result 103 states and 143 transitions. [2022-04-15 15:02:00,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 15:02:00,283 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-15 15:02:00,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:02:00,284 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-15 15:02:00,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-15 15:02:00,288 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-15 15:02:00,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-15 15:02:00,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 108 transitions. [2022-04-15 15:02:00,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:02:00,381 INFO L225 Difference]: With dead ends: 103 [2022-04-15 15:02:00,382 INFO L226 Difference]: Without dead ends: 96 [2022-04-15 15:02:00,382 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-15 15:02:00,383 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 68 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 15:02:00,383 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 232 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 15:02:00,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-15 15:02:00,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2022-04-15 15:02:00,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:02:00,457 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-15 15:02:00,458 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-15 15:02:00,458 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-15 15:02:00,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:02:00,464 INFO L93 Difference]: Finished difference Result 96 states and 136 transitions. [2022-04-15 15:02:00,464 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 136 transitions. [2022-04-15 15:02:00,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:02:00,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:02:00,466 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-15 15:02:00,467 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-15 15:02:00,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:02:00,472 INFO L93 Difference]: Finished difference Result 96 states and 136 transitions. [2022-04-15 15:02:00,472 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 136 transitions. [2022-04-15 15:02:00,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:02:00,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:02:00,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:02:00,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:02:00,474 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-15 15:02:00,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 95 transitions. [2022-04-15 15:02:00,477 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 95 transitions. Word has length 39 [2022-04-15 15:02:00,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:02:00,477 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 95 transitions. [2022-04-15 15:02:00,478 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 15:02:00,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 95 transitions. [2022-04-15 15:02:00,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:02:00,578 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 95 transitions. [2022-04-15 15:02:00,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 15:02:00,579 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:02:00,579 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:02:00,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 15:02:00,795 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 15:02:00,795 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:02:00,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:02:00,796 INFO L85 PathProgramCache]: Analyzing trace with hash -974923140, now seen corresponding path program 1 times [2022-04-15 15:02:00,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:02:00,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [342478527] [2022-04-15 15:02:00,796 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:02:00,797 INFO L85 PathProgramCache]: Analyzing trace with hash -974923140, now seen corresponding path program 2 times [2022-04-15 15:02:00,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:02:00,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884045959] [2022-04-15 15:02:00,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:02:00,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:02:00,817 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:02:00,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1642545245] [2022-04-15 15:02:00,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:02:00,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:02:00,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:02:00,820 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:02:00,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 15:02:00,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:02:00,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:02:00,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-15 15:02:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:02:00,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:02:01,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1566#true} is VALID [2022-04-15 15:02:01,458 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-15 15:02:01,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-15 15:02:01,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #112#return; {1566#true} is VALID [2022-04-15 15:02:01,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret6 := main(); {1566#true} is VALID [2022-04-15 15:02:01,458 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-15 15:02:01,459 INFO L272 TraceCheckUtils]: 6: Hoare triple {1566#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {1566#true} is VALID [2022-04-15 15:02:01,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-15 15:02:01,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-15 15:02:01,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-15 15:02:01,459 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1566#true} {1566#true} #94#return; {1566#true} is VALID [2022-04-15 15:02:01,459 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-15 15:02:01,459 INFO L272 TraceCheckUtils]: 12: Hoare triple {1566#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {1566#true} is VALID [2022-04-15 15:02:01,460 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-15 15:02:01,460 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-15 15:02:01,461 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-15 15:02:01,461 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1614#(not (= |assume_abort_if_not_#in~cond| 0))} {1566#true} #96#return; {1621#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 15:02:01,461 INFO L272 TraceCheckUtils]: 17: Hoare triple {1621#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1566#true} is VALID [2022-04-15 15:02:01,462 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-15 15:02:01,462 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-15 15:02:01,463 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-15 15:02:01,463 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1614#(not (= |assume_abort_if_not_#in~cond| 0))} {1621#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #98#return; {1637#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2))} is VALID [2022-04-15 15:02:01,463 INFO L272 TraceCheckUtils]: 22: Hoare triple {1637#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1566#true} is VALID [2022-04-15 15:02:01,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-15 15:02:01,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-15 15:02:01,464 INFO L290 TraceCheckUtils]: 25: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-15 15:02:01,464 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1566#true} {1637#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2))} #100#return; {1637#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2))} is VALID [2022-04-15 15:02:01,465 INFO L290 TraceCheckUtils]: 27: Hoare triple {1637#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1656#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 15:02:01,465 INFO L290 TraceCheckUtils]: 28: Hoare triple {1656#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !false; {1656#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 15:02:01,466 INFO L290 TraceCheckUtils]: 29: Hoare triple {1656#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1663#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-15 15:02:01,466 INFO L290 TraceCheckUtils]: 30: Hoare triple {1663#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !false; {1663#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-15 15:02:01,467 INFO L290 TraceCheckUtils]: 31: Hoare triple {1663#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !(~c~0 >= ~b~0); {1663#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-15 15:02:01,467 INFO L290 TraceCheckUtils]: 32: Hoare triple {1663#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {1673#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-15 15:02:01,468 INFO L290 TraceCheckUtils]: 33: Hoare triple {1673#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !false; {1673#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-15 15:02:01,471 INFO L290 TraceCheckUtils]: 34: Hoare triple {1673#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1680#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-15 15:02:01,472 INFO L290 TraceCheckUtils]: 35: Hoare triple {1680#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !false; {1680#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-15 15:02:01,473 INFO L290 TraceCheckUtils]: 36: Hoare triple {1680#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {1687#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (<= main_~x~0 main_~a~0))} is VALID [2022-04-15 15:02:01,473 INFO L290 TraceCheckUtils]: 37: Hoare triple {1687#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (<= main_~x~0 main_~a~0))} assume !false; {1687#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (<= main_~x~0 main_~a~0))} is VALID [2022-04-15 15:02:01,474 INFO L272 TraceCheckUtils]: 38: Hoare triple {1687#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (<= main_~x~0 main_~a~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1694#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:02:01,474 INFO L290 TraceCheckUtils]: 39: Hoare triple {1694#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1698#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:02:01,475 INFO L290 TraceCheckUtils]: 40: Hoare triple {1698#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1567#false} is VALID [2022-04-15 15:02:01,475 INFO L290 TraceCheckUtils]: 41: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2022-04-15 15:02:01,475 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-15 15:02:01,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:02:01,886 INFO L290 TraceCheckUtils]: 41: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2022-04-15 15:02:01,887 INFO L290 TraceCheckUtils]: 40: Hoare triple {1698#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1567#false} is VALID [2022-04-15 15:02:01,887 INFO L290 TraceCheckUtils]: 39: Hoare triple {1694#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1698#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:02:01,888 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-15 15:02:01,889 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-15 15:02:01,889 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-15 15:02:01,890 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-15 15:02:01,890 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-15 15:02:01,891 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-15 15:02:01,891 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-15 15:02:01,892 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-15 15:02:01,892 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-15 15:02:01,893 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-15 15:02:01,893 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-15 15:02:01,894 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-15 15:02:01,894 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1566#true} {1566#true} #100#return; {1566#true} is VALID [2022-04-15 15:02:01,894 INFO L290 TraceCheckUtils]: 25: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-15 15:02:01,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-15 15:02:01,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-15 15:02:01,894 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-15 15:02:01,895 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1566#true} {1566#true} #98#return; {1566#true} is VALID [2022-04-15 15:02:01,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-15 15:02:01,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-15 15:02:01,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-15 15:02:01,895 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-15 15:02:01,895 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1566#true} {1566#true} #96#return; {1566#true} is VALID [2022-04-15 15:02:01,895 INFO L290 TraceCheckUtils]: 15: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-15 15:02:01,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-15 15:02:01,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-15 15:02:01,896 INFO L272 TraceCheckUtils]: 12: Hoare triple {1566#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {1566#true} is VALID [2022-04-15 15:02:01,896 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-15 15:02:01,896 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1566#true} {1566#true} #94#return; {1566#true} is VALID [2022-04-15 15:02:01,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-15 15:02:01,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-15 15:02:01,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-15 15:02:01,896 INFO L272 TraceCheckUtils]: 6: Hoare triple {1566#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {1566#true} is VALID [2022-04-15 15:02:01,897 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-15 15:02:01,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret6 := main(); {1566#true} is VALID [2022-04-15 15:02:01,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #112#return; {1566#true} is VALID [2022-04-15 15:02:01,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-15 15:02:01,897 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-15 15:02:01,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1566#true} is VALID [2022-04-15 15:02:01,897 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-15 15:02:01,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:02:01,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884045959] [2022-04-15 15:02:01,898 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:02:01,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642545245] [2022-04-15 15:02:01,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642545245] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:02:01,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:02:01,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 18 [2022-04-15 15:02:01,899 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:02:01,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [342478527] [2022-04-15 15:02:01,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [342478527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:02:01,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:02:01,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 15:02:01,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553331334] [2022-04-15 15:02:01,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:02:01,900 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-15 15:02:01,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:02:01,900 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-15 15:02:01,930 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-15 15:02:01,930 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 15:02:01,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:02:01,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 15:02:01,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-04-15 15:02:01,931 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-15 15:02:03,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:02:03,304 INFO L93 Difference]: Finished difference Result 112 states and 151 transitions. [2022-04-15 15:02:03,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 15:02:03,305 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-15 15:02:03,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:02:03,305 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-15 15:02:03,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 117 transitions. [2022-04-15 15:02:03,309 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-15 15:02:03,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 117 transitions. [2022-04-15 15:02:03,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 117 transitions. [2022-04-15 15:02:03,424 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-15 15:02:03,427 INFO L225 Difference]: With dead ends: 112 [2022-04-15 15:02:03,428 INFO L226 Difference]: Without dead ends: 110 [2022-04-15 15:02:03,428 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2022-04-15 15:02:03,429 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 89 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-15 15:02:03,429 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 245 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 15:02:03,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-15 15:02:03,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 93. [2022-04-15 15:02:03,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:02:03,591 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-15 15:02:03,592 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-15 15:02:03,592 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-15 15:02:03,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:02:03,597 INFO L93 Difference]: Finished difference Result 110 states and 149 transitions. [2022-04-15 15:02:03,597 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 149 transitions. [2022-04-15 15:02:03,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:02:03,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:02:03,598 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-15 15:02:03,598 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-15 15:02:03,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:02:03,603 INFO L93 Difference]: Finished difference Result 110 states and 149 transitions. [2022-04-15 15:02:03,603 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 149 transitions. [2022-04-15 15:02:03,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:02:03,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:02:03,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:02:03,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:02:03,604 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-15 15:02:03,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 122 transitions. [2022-04-15 15:02:03,608 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 122 transitions. Word has length 42 [2022-04-15 15:02:03,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:02:03,608 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 122 transitions. [2022-04-15 15:02:03,608 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 15:02:03,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 122 transitions. [2022-04-15 15:02:03,748 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-15 15:02:03,748 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 122 transitions. [2022-04-15 15:02:03,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 15:02:03,751 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:02:03,751 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:02:03,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 15:02:03,959 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:02:03,959 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:02:03,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:02:03,960 INFO L85 PathProgramCache]: Analyzing trace with hash 81990170, now seen corresponding path program 1 times [2022-04-15 15:02:03,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:02:03,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [221544606] [2022-04-15 15:02:03,960 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:02:03,960 INFO L85 PathProgramCache]: Analyzing trace with hash 81990170, now seen corresponding path program 2 times [2022-04-15 15:02:03,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:02:03,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186392395] [2022-04-15 15:02:03,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:02:03,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:02:03,985 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:02:03,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [641397272] [2022-04-15 15:02:03,986 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:02:03,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:02:03,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:02:03,987 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:02:03,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 15:02:04,032 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:02:04,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:02:04,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 15:02:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:02:04,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:02:04,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {2475#true} call ULTIMATE.init(); {2475#true} is VALID [2022-04-15 15:02:04,347 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-15 15:02:04,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-15 15:02:04,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2475#true} {2475#true} #112#return; {2475#true} is VALID [2022-04-15 15:02:04,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {2475#true} call #t~ret6 := main(); {2475#true} is VALID [2022-04-15 15:02:04,348 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-15 15:02:04,348 INFO L272 TraceCheckUtils]: 6: Hoare triple {2475#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {2475#true} is VALID [2022-04-15 15:02:04,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-15 15:02:04,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-15 15:02:04,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-15 15:02:04,351 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2475#true} {2475#true} #94#return; {2475#true} is VALID [2022-04-15 15:02:04,351 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-15 15:02:04,351 INFO L272 TraceCheckUtils]: 12: Hoare triple {2475#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {2475#true} is VALID [2022-04-15 15:02:04,352 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-15 15:02:04,352 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-15 15:02:04,353 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-15 15:02:04,353 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2523#(not (= |assume_abort_if_not_#in~cond| 0))} {2475#true} #96#return; {2530#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 15:02:04,353 INFO L272 TraceCheckUtils]: 17: Hoare triple {2530#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2475#true} is VALID [2022-04-15 15:02:04,354 INFO L290 TraceCheckUtils]: 18: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-15 15:02:04,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-15 15:02:04,354 INFO L290 TraceCheckUtils]: 20: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-15 15:02:04,354 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2475#true} {2530#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #98#return; {2530#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 15:02:04,354 INFO L272 TraceCheckUtils]: 22: Hoare triple {2530#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2475#true} is VALID [2022-04-15 15:02:04,354 INFO L290 TraceCheckUtils]: 23: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-15 15:02:04,355 INFO L290 TraceCheckUtils]: 24: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-15 15:02:04,355 INFO L290 TraceCheckUtils]: 25: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-15 15:02:04,355 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2475#true} {2530#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #100#return; {2530#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 15:02:04,356 INFO L290 TraceCheckUtils]: 27: Hoare triple {2530#(and (<= 0 main_~y~0) (<= main_~y~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2564#(<= 0 main_~b~0)} is VALID [2022-04-15 15:02:04,356 INFO L290 TraceCheckUtils]: 28: Hoare triple {2564#(<= 0 main_~b~0)} assume !false; {2564#(<= 0 main_~b~0)} is VALID [2022-04-15 15:02:04,356 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-15 15:02:04,357 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-15 15:02:04,357 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-15 15:02:04,358 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-15 15:02:04,358 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-15 15:02:04,358 INFO L290 TraceCheckUtils]: 34: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-15 15:02:04,358 INFO L290 TraceCheckUtils]: 35: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-15 15:02:04,358 INFO L290 TraceCheckUtils]: 36: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-15 15:02:04,359 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-15 15:02:04,359 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-15 15:02:04,359 INFO L290 TraceCheckUtils]: 39: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-15 15:02:04,359 INFO L290 TraceCheckUtils]: 40: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-15 15:02:04,359 INFO L290 TraceCheckUtils]: 41: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-15 15:02:04,360 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-15 15:02:04,361 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-15 15:02:04,361 INFO L290 TraceCheckUtils]: 44: Hoare triple {2614#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2618#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:02:04,361 INFO L290 TraceCheckUtils]: 45: Hoare triple {2618#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2476#false} is VALID [2022-04-15 15:02:04,361 INFO L290 TraceCheckUtils]: 46: Hoare triple {2476#false} assume !false; {2476#false} is VALID [2022-04-15 15:02:04,364 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-15 15:02:04,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:02:04,575 INFO L290 TraceCheckUtils]: 46: Hoare triple {2476#false} assume !false; {2476#false} is VALID [2022-04-15 15:02:04,575 INFO L290 TraceCheckUtils]: 45: Hoare triple {2618#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2476#false} is VALID [2022-04-15 15:02:04,576 INFO L290 TraceCheckUtils]: 44: Hoare triple {2614#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2618#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:02:04,576 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-15 15:02:04,577 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-15 15:02:04,577 INFO L290 TraceCheckUtils]: 41: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-15 15:02:04,577 INFO L290 TraceCheckUtils]: 40: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-15 15:02:04,577 INFO L290 TraceCheckUtils]: 39: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-15 15:02:04,577 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-15 15:02:04,578 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-15 15:02:04,578 INFO L290 TraceCheckUtils]: 36: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-15 15:02:04,578 INFO L290 TraceCheckUtils]: 35: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-15 15:02:04,578 INFO L290 TraceCheckUtils]: 34: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-15 15:02:04,579 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-15 15:02:04,583 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-15 15:02:04,584 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-15 15:02:04,584 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-15 15:02:04,584 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-15 15:02:04,585 INFO L290 TraceCheckUtils]: 28: Hoare triple {2475#true} assume !false; {2475#true} is VALID [2022-04-15 15:02:04,585 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-15 15:02:04,585 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2475#true} {2475#true} #100#return; {2475#true} is VALID [2022-04-15 15:02:04,585 INFO L290 TraceCheckUtils]: 25: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-15 15:02:04,585 INFO L290 TraceCheckUtils]: 24: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-15 15:02:04,585 INFO L290 TraceCheckUtils]: 23: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-15 15:02:04,585 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-15 15:02:04,585 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2475#true} {2475#true} #98#return; {2475#true} is VALID [2022-04-15 15:02:04,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-15 15:02:04,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-15 15:02:04,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-15 15:02:04,586 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-15 15:02:04,586 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2475#true} {2475#true} #96#return; {2475#true} is VALID [2022-04-15 15:02:04,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-15 15:02:04,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-15 15:02:04,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-15 15:02:04,587 INFO L272 TraceCheckUtils]: 12: Hoare triple {2475#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {2475#true} is VALID [2022-04-15 15:02:04,587 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-15 15:02:04,587 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2475#true} {2475#true} #94#return; {2475#true} is VALID [2022-04-15 15:02:04,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-15 15:02:04,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-15 15:02:04,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-15 15:02:04,587 INFO L272 TraceCheckUtils]: 6: Hoare triple {2475#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {2475#true} is VALID [2022-04-15 15:02:04,588 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-15 15:02:04,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {2475#true} call #t~ret6 := main(); {2475#true} is VALID [2022-04-15 15:02:04,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2475#true} {2475#true} #112#return; {2475#true} is VALID [2022-04-15 15:02:04,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-15 15:02:04,588 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-15 15:02:04,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {2475#true} call ULTIMATE.init(); {2475#true} is VALID [2022-04-15 15:02:04,588 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 15:02:04,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:02:04,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186392395] [2022-04-15 15:02:04,590 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:02:04,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641397272] [2022-04-15 15:02:04,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641397272] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 15:02:04,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 15:02:04,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-15 15:02:04,592 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:02:04,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [221544606] [2022-04-15 15:02:04,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [221544606] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:02:04,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:02:04,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 15:02:04,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770793463] [2022-04-15 15:02:04,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:02:04,593 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-15 15:02:04,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:02:04,593 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-15 15:02:04,617 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-15 15:02:04,617 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 15:02:04,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:02:04,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 15:02:04,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-15 15:02:04,619 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-15 15:02:05,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:02:05,052 INFO L93 Difference]: Finished difference Result 130 states and 179 transitions. [2022-04-15 15:02:05,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 15:02:05,052 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-15 15:02:05,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:02:05,052 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-15 15:02:05,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-15 15:02:05,054 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-15 15:02:05,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-15 15:02:05,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-15 15:02:05,109 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-15 15:02:05,112 INFO L225 Difference]: With dead ends: 130 [2022-04-15 15:02:05,112 INFO L226 Difference]: Without dead ends: 128 [2022-04-15 15:02:05,113 INFO L912 BasicCegarLoop]: 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-15 15:02:05,117 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 8 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:02:05,117 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 141 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:02:05,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-15 15:02:05,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2022-04-15 15:02:05,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:02:05,372 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-15 15:02:05,372 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-15 15:02:05,372 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-15 15:02:05,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:02:05,377 INFO L93 Difference]: Finished difference Result 128 states and 177 transitions. [2022-04-15 15:02:05,377 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 177 transitions. [2022-04-15 15:02:05,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:02:05,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:02:05,379 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-15 15:02:05,379 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-15 15:02:05,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:02:05,384 INFO L93 Difference]: Finished difference Result 128 states and 177 transitions. [2022-04-15 15:02:05,384 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 177 transitions. [2022-04-15 15:02:05,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:02:05,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:02:05,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:02:05,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:02:05,386 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-15 15:02:05,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 172 transitions. [2022-04-15 15:02:05,391 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 172 transitions. Word has length 47 [2022-04-15 15:02:05,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:02:05,391 INFO L478 AbstractCegarLoop]: Abstraction has 123 states and 172 transitions. [2022-04-15 15:02:05,391 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 15:02:05,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 172 transitions. [2022-04-15 15:02:05,623 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-15 15:02:05,623 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 172 transitions. [2022-04-15 15:02:05,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 15:02:05,623 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:02:05,624 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:02:05,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 15:02:05,824 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:02:05,824 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:02:05,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:02:05,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1524769911, now seen corresponding path program 1 times [2022-04-15 15:02:05,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:02:05,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [295873569] [2022-04-15 15:02:05,825 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:02:05,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1524769911, now seen corresponding path program 2 times [2022-04-15 15:02:05,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:02:05,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694455299] [2022-04-15 15:02:05,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:02:05,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:02:05,846 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:02:05,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [584956269] [2022-04-15 15:02:05,846 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:02:05,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:02:05,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:02:05,847 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:02:05,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 15:02:05,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:02:05,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:02:05,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-15 15:02:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:02:05,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:02:06,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {3530#true} call ULTIMATE.init(); {3530#true} is VALID [2022-04-15 15:02:06,533 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-15 15:02:06,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-15 15:02:06,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3530#true} {3530#true} #112#return; {3530#true} is VALID [2022-04-15 15:02:06,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {3530#true} call #t~ret6 := main(); {3530#true} is VALID [2022-04-15 15:02:06,534 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-15 15:02:06,534 INFO L272 TraceCheckUtils]: 6: Hoare triple {3530#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {3530#true} is VALID [2022-04-15 15:02:06,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-15 15:02:06,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-15 15:02:06,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-15 15:02:06,534 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3530#true} {3530#true} #94#return; {3530#true} is VALID [2022-04-15 15:02:06,534 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-15 15:02:06,534 INFO L272 TraceCheckUtils]: 12: Hoare triple {3530#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {3530#true} is VALID [2022-04-15 15:02:06,539 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-15 15:02:06,540 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-15 15:02:06,540 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-15 15:02:06,541 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3578#(not (= |assume_abort_if_not_#in~cond| 0))} {3530#true} #96#return; {3585#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 15:02:06,541 INFO L272 TraceCheckUtils]: 17: Hoare triple {3585#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3530#true} is VALID [2022-04-15 15:02:06,541 INFO L290 TraceCheckUtils]: 18: Hoare triple {3530#true} ~cond := #in~cond; {3574#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 15:02:06,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {3574#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3578#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 15:02:06,542 INFO L290 TraceCheckUtils]: 20: Hoare triple {3578#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3578#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 15:02:06,543 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3578#(not (= |assume_abort_if_not_#in~cond| 0))} {3585#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #98#return; {3601#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2))} is VALID [2022-04-15 15:02:06,543 INFO L272 TraceCheckUtils]: 22: Hoare triple {3601#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3530#true} is VALID [2022-04-15 15:02:06,543 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-15 15:02:06,543 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-15 15:02:06,544 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-15 15:02:06,545 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3578#(not (= |assume_abort_if_not_#in~cond| 0))} {3601#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2))} #100#return; {3617#(and (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0))} is VALID [2022-04-15 15:02:06,545 INFO L290 TraceCheckUtils]: 27: Hoare triple {3617#(and (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3621#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 15:02:06,546 INFO L290 TraceCheckUtils]: 28: Hoare triple {3621#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {3621#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 15:02:06,546 INFO L290 TraceCheckUtils]: 29: Hoare triple {3621#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3628#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 15:02:06,547 INFO L290 TraceCheckUtils]: 30: Hoare triple {3628#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {3628#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 15:02:06,548 INFO L290 TraceCheckUtils]: 31: Hoare triple {3628#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {3635#(and (= main_~r~0 0) (<= 1 main_~x~0) (< main_~c~0 main_~y~0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 15:02:06,553 INFO L290 TraceCheckUtils]: 32: Hoare triple {3635#(and (= main_~r~0 0) (<= 1 main_~x~0) (< main_~c~0 main_~y~0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-15 15:02:06,558 INFO L290 TraceCheckUtils]: 33: Hoare triple {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-15 15:02:06,559 INFO L290 TraceCheckUtils]: 34: Hoare triple {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-15 15:02:06,559 INFO L290 TraceCheckUtils]: 35: Hoare triple {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-15 15:02:06,560 INFO L290 TraceCheckUtils]: 36: Hoare triple {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-15 15:02:06,560 INFO L290 TraceCheckUtils]: 37: Hoare triple {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-15 15:02:06,563 INFO L272 TraceCheckUtils]: 38: Hoare triple {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3530#true} is VALID [2022-04-15 15:02:06,563 INFO L290 TraceCheckUtils]: 39: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-15 15:02:06,563 INFO L290 TraceCheckUtils]: 40: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-15 15:02:06,563 INFO L290 TraceCheckUtils]: 41: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-15 15:02:06,564 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3530#true} {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #102#return; {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-15 15:02:06,565 INFO L272 TraceCheckUtils]: 43: Hoare triple {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3673#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:02:06,565 INFO L290 TraceCheckUtils]: 44: Hoare triple {3673#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3677#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:02:06,566 INFO L290 TraceCheckUtils]: 45: Hoare triple {3677#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3531#false} is VALID [2022-04-15 15:02:06,566 INFO L290 TraceCheckUtils]: 46: Hoare triple {3531#false} assume !false; {3531#false} is VALID [2022-04-15 15:02:06,566 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 15:02:06,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:02:06,997 INFO L290 TraceCheckUtils]: 46: Hoare triple {3531#false} assume !false; {3531#false} is VALID [2022-04-15 15:02:06,998 INFO L290 TraceCheckUtils]: 45: Hoare triple {3677#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3531#false} is VALID [2022-04-15 15:02:06,998 INFO L290 TraceCheckUtils]: 44: Hoare triple {3673#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3677#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:02:06,999 INFO L272 TraceCheckUtils]: 43: Hoare triple {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3673#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:02:07,000 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3530#true} {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #102#return; {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 15:02:07,000 INFO L290 TraceCheckUtils]: 41: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-15 15:02:07,000 INFO L290 TraceCheckUtils]: 40: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-15 15:02:07,000 INFO L290 TraceCheckUtils]: 39: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-15 15:02:07,000 INFO L272 TraceCheckUtils]: 38: Hoare triple {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3530#true} is VALID [2022-04-15 15:02:07,000 INFO L290 TraceCheckUtils]: 37: Hoare triple {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 15:02:07,001 INFO L290 TraceCheckUtils]: 36: Hoare triple {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 15:02:07,001 INFO L290 TraceCheckUtils]: 35: Hoare triple {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 15:02:07,001 INFO L290 TraceCheckUtils]: 34: Hoare triple {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 15:02:07,002 INFO L290 TraceCheckUtils]: 33: Hoare triple {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-15 15:02:09,003 WARN L290 TraceCheckUtils]: 32: Hoare triple {3727#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is UNKNOWN [2022-04-15 15:02:09,004 INFO L290 TraceCheckUtils]: 31: Hoare triple {3731#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} assume !(~c~0 >= ~b~0); {3727#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-15 15:02:09,004 INFO L290 TraceCheckUtils]: 30: Hoare triple {3731#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} assume !false; {3731#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} is VALID [2022-04-15 15:02:09,005 INFO L290 TraceCheckUtils]: 29: Hoare triple {3738#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3731#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} is VALID [2022-04-15 15:02:09,005 INFO L290 TraceCheckUtils]: 28: Hoare triple {3738#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} assume !false; {3738#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-15 15:02:09,006 INFO L290 TraceCheckUtils]: 27: Hoare triple {3530#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3738#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-15 15:02:09,006 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3530#true} {3530#true} #100#return; {3530#true} is VALID [2022-04-15 15:02:09,006 INFO L290 TraceCheckUtils]: 25: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-15 15:02:09,006 INFO L290 TraceCheckUtils]: 24: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-15 15:02:09,006 INFO L290 TraceCheckUtils]: 23: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-15 15:02:09,006 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-15 15:02:09,006 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3530#true} {3530#true} #98#return; {3530#true} is VALID [2022-04-15 15:02:09,007 INFO L290 TraceCheckUtils]: 20: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-15 15:02:09,007 INFO L290 TraceCheckUtils]: 19: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-15 15:02:09,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-15 15:02:09,007 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-15 15:02:09,007 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3530#true} {3530#true} #96#return; {3530#true} is VALID [2022-04-15 15:02:09,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-15 15:02:09,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-15 15:02:09,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-15 15:02:09,007 INFO L272 TraceCheckUtils]: 12: Hoare triple {3530#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {3530#true} is VALID [2022-04-15 15:02:09,008 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-15 15:02:09,008 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3530#true} {3530#true} #94#return; {3530#true} is VALID [2022-04-15 15:02:09,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-15 15:02:09,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-15 15:02:09,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-15 15:02:09,008 INFO L272 TraceCheckUtils]: 6: Hoare triple {3530#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {3530#true} is VALID [2022-04-15 15:02:09,008 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-15 15:02:09,008 INFO L272 TraceCheckUtils]: 4: Hoare triple {3530#true} call #t~ret6 := main(); {3530#true} is VALID [2022-04-15 15:02:09,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3530#true} {3530#true} #112#return; {3530#true} is VALID [2022-04-15 15:02:09,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-15 15:02:09,009 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-15 15:02:09,009 INFO L272 TraceCheckUtils]: 0: Hoare triple {3530#true} call ULTIMATE.init(); {3530#true} is VALID [2022-04-15 15:02:09,009 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-15 15:02:09,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:02:09,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694455299] [2022-04-15 15:02:09,009 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:02:09,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584956269] [2022-04-15 15:02:09,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584956269] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:02:09,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:02:09,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 17 [2022-04-15 15:02:09,010 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:02:09,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [295873569] [2022-04-15 15:02:09,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [295873569] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:02:09,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:02:09,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 15:02:09,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591846545] [2022-04-15 15:02:09,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:02:09,011 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 47 [2022-04-15 15:02:09,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:02:09,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 15:02:09,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:02:09,087 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 15:02:09,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:02:09,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 15:02:09,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-04-15 15:02:09,088 INFO L87 Difference]: Start difference. First operand 123 states and 172 transitions. Second operand has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 15:02:10,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:02:10,514 INFO L93 Difference]: Finished difference Result 137 states and 184 transitions. [2022-04-15 15:02:10,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 15:02:10,515 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 47 [2022-04-15 15:02:10,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:02:10,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 15:02:10,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 101 transitions. [2022-04-15 15:02:10,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 15:02:10,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 101 transitions. [2022-04-15 15:02:10,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 101 transitions. [2022-04-15 15:02:10,654 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-15 15:02:10,657 INFO L225 Difference]: With dead ends: 137 [2022-04-15 15:02:10,657 INFO L226 Difference]: Without dead ends: 135 [2022-04-15 15:02:10,658 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2022-04-15 15:02:10,659 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 50 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 15:02:10,659 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 259 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 15:02:10,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-15 15:02:10,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2022-04-15 15:02:10,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:02:10,963 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-15 15:02:10,963 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-15 15:02:10,964 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-15 15:02:10,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:02:10,969 INFO L93 Difference]: Finished difference Result 135 states and 182 transitions. [2022-04-15 15:02:10,969 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 182 transitions. [2022-04-15 15:02:10,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:02:10,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:02:10,971 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-15 15:02:10,971 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-15 15:02:10,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:02:10,976 INFO L93 Difference]: Finished difference Result 135 states and 182 transitions. [2022-04-15 15:02:10,976 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 182 transitions. [2022-04-15 15:02:10,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:02:10,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:02:10,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:02:10,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:02:10,978 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-15 15:02:10,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 178 transitions. [2022-04-15 15:02:10,983 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 178 transitions. Word has length 47 [2022-04-15 15:02:10,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:02:10,983 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 178 transitions. [2022-04-15 15:02:10,984 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 15:02:10,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 178 transitions. [2022-04-15 15:02:11,177 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-15 15:02:11,178 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 178 transitions. [2022-04-15 15:02:11,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 15:02:11,178 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:02:11,178 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:02:11,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-15 15:02:11,383 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:02:11,383 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:02:11,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:02:11,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1836145722, now seen corresponding path program 3 times [2022-04-15 15:02:11,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:02:11,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1506496347] [2022-04-15 15:02:11,384 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:02:11,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1836145722, now seen corresponding path program 4 times [2022-04-15 15:02:11,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:02:11,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289251348] [2022-04-15 15:02:11,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:02:11,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:02:11,403 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:02:11,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [836122783] [2022-04-15 15:02:11,403 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:02:11,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:02:11,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:02:11,404 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:02:11,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 15:02:11,454 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:02:11,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:02:11,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 15:02:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:02:11,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:02:11,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {4642#true} call ULTIMATE.init(); {4642#true} is VALID [2022-04-15 15:02:11,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {4642#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {4642#true} is VALID [2022-04-15 15:02:11,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {4642#true} assume true; {4642#true} is VALID [2022-04-15 15:02:11,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4642#true} {4642#true} #112#return; {4642#true} is VALID [2022-04-15 15:02:11,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {4642#true} call #t~ret6 := main(); {4642#true} is VALID [2022-04-15 15:02:11,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {4642#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4642#true} is VALID [2022-04-15 15:02:11,582 INFO L272 TraceCheckUtils]: 6: Hoare triple {4642#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {4642#true} is VALID [2022-04-15 15:02:11,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {4642#true} ~cond := #in~cond; {4642#true} is VALID [2022-04-15 15:02:11,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {4642#true} assume !(0 == ~cond); {4642#true} is VALID [2022-04-15 15:02:11,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {4642#true} assume true; {4642#true} is VALID [2022-04-15 15:02:11,582 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4642#true} {4642#true} #94#return; {4642#true} is VALID [2022-04-15 15:02:11,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {4642#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4642#true} is VALID [2022-04-15 15:02:11,582 INFO L272 TraceCheckUtils]: 12: Hoare triple {4642#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {4642#true} is VALID [2022-04-15 15:02:11,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {4642#true} ~cond := #in~cond; {4642#true} is VALID [2022-04-15 15:02:11,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {4642#true} assume !(0 == ~cond); {4642#true} is VALID [2022-04-15 15:02:11,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {4642#true} assume true; {4642#true} is VALID [2022-04-15 15:02:11,582 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4642#true} {4642#true} #96#return; {4642#true} is VALID [2022-04-15 15:02:11,582 INFO L272 TraceCheckUtils]: 17: Hoare triple {4642#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4642#true} is VALID [2022-04-15 15:02:11,582 INFO L290 TraceCheckUtils]: 18: Hoare triple {4642#true} ~cond := #in~cond; {4642#true} is VALID [2022-04-15 15:02:11,582 INFO L290 TraceCheckUtils]: 19: Hoare triple {4642#true} assume !(0 == ~cond); {4642#true} is VALID [2022-04-15 15:02:11,583 INFO L290 TraceCheckUtils]: 20: Hoare triple {4642#true} assume true; {4642#true} is VALID [2022-04-15 15:02:11,583 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4642#true} {4642#true} #98#return; {4642#true} is VALID [2022-04-15 15:02:11,583 INFO L272 TraceCheckUtils]: 22: Hoare triple {4642#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4642#true} is VALID [2022-04-15 15:02:11,583 INFO L290 TraceCheckUtils]: 23: Hoare triple {4642#true} ~cond := #in~cond; {4642#true} is VALID [2022-04-15 15:02:11,583 INFO L290 TraceCheckUtils]: 24: Hoare triple {4642#true} assume !(0 == ~cond); {4642#true} is VALID [2022-04-15 15:02:11,583 INFO L290 TraceCheckUtils]: 25: Hoare triple {4642#true} assume true; {4642#true} is VALID [2022-04-15 15:02:11,583 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4642#true} {4642#true} #100#return; {4642#true} is VALID [2022-04-15 15:02:11,583 INFO L290 TraceCheckUtils]: 27: Hoare triple {4642#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4642#true} is VALID [2022-04-15 15:02:11,583 INFO L290 TraceCheckUtils]: 28: Hoare triple {4642#true} assume !false; {4642#true} is VALID [2022-04-15 15:02:11,583 INFO L290 TraceCheckUtils]: 29: Hoare triple {4642#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4642#true} is VALID [2022-04-15 15:02:11,584 INFO L290 TraceCheckUtils]: 30: Hoare triple {4642#true} assume !false; {4642#true} is VALID [2022-04-15 15:02:11,589 INFO L290 TraceCheckUtils]: 31: Hoare triple {4642#true} assume !(~c~0 >= ~b~0); {4740#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-15 15:02:11,590 INFO L290 TraceCheckUtils]: 32: Hoare triple {4740#(not (<= main_~b~0 main_~c~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {4744#(< main_~b~0 main_~a~0)} is VALID [2022-04-15 15:02:11,590 INFO L290 TraceCheckUtils]: 33: Hoare triple {4744#(< main_~b~0 main_~a~0)} assume !false; {4744#(< main_~b~0 main_~a~0)} is VALID [2022-04-15 15:02:11,590 INFO L290 TraceCheckUtils]: 34: Hoare triple {4744#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4751#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 15:02:11,590 INFO L290 TraceCheckUtils]: 35: Hoare triple {4751#(< main_~b~0 main_~c~0)} assume !false; {4751#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 15:02:11,591 INFO L290 TraceCheckUtils]: 36: Hoare triple {4751#(< main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {4643#false} is VALID [2022-04-15 15:02:11,591 INFO L290 TraceCheckUtils]: 37: Hoare triple {4643#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {4643#false} is VALID [2022-04-15 15:02:11,591 INFO L290 TraceCheckUtils]: 38: Hoare triple {4643#false} assume !false; {4643#false} is VALID [2022-04-15 15:02:11,591 INFO L290 TraceCheckUtils]: 39: Hoare triple {4643#false} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4643#false} is VALID [2022-04-15 15:02:11,591 INFO L290 TraceCheckUtils]: 40: Hoare triple {4643#false} assume !false; {4643#false} is VALID [2022-04-15 15:02:11,591 INFO L290 TraceCheckUtils]: 41: Hoare triple {4643#false} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {4643#false} is VALID [2022-04-15 15:02:11,591 INFO L290 TraceCheckUtils]: 42: Hoare triple {4643#false} assume !false; {4643#false} is VALID [2022-04-15 15:02:11,591 INFO L272 TraceCheckUtils]: 43: Hoare triple {4643#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4643#false} is VALID [2022-04-15 15:02:11,591 INFO L290 TraceCheckUtils]: 44: Hoare triple {4643#false} ~cond := #in~cond; {4643#false} is VALID [2022-04-15 15:02:11,591 INFO L290 TraceCheckUtils]: 45: Hoare triple {4643#false} assume 0 == ~cond; {4643#false} is VALID [2022-04-15 15:02:11,592 INFO L290 TraceCheckUtils]: 46: Hoare triple {4643#false} assume !false; {4643#false} is VALID [2022-04-15 15:02:11,592 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-15 15:02:11,592 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:02:11,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:02:11,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289251348] [2022-04-15 15:02:11,592 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:02:11,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836122783] [2022-04-15 15:02:11,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836122783] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:02:11,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:02:11,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 15:02:11,592 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:02:11,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1506496347] [2022-04-15 15:02:11,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1506496347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:02:11,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:02:11,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 15:02:11,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479784733] [2022-04-15 15:02:11,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:02:11,593 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-15 15:02:11,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:02:11,593 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-15 15:02:11,619 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-15 15:02:11,619 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 15:02:11,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:02:11,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 15:02:11,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 15:02:11,619 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-15 15:02:12,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:02:12,128 INFO L93 Difference]: Finished difference Result 170 states and 230 transitions. [2022-04-15 15:02:12,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 15:02:12,128 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-15 15:02:12,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:02:12,129 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-15 15:02:12,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2022-04-15 15:02:12,131 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-15 15:02:12,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2022-04-15 15:02:12,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 102 transitions. [2022-04-15 15:02:12,217 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-15 15:02:12,219 INFO L225 Difference]: With dead ends: 170 [2022-04-15 15:02:12,219 INFO L226 Difference]: Without dead ends: 114 [2022-04-15 15:02:12,220 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-15 15:02:12,220 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 18 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:02:12,221 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 155 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 15:02:12,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-15 15:02:12,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2022-04-15 15:02:12,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:02:12,460 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-15 15:02:12,460 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-15 15:02:12,461 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-15 15:02:12,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:02:12,464 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2022-04-15 15:02:12,464 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 146 transitions. [2022-04-15 15:02:12,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:02:12,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:02:12,465 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-15 15:02:12,466 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-15 15:02:12,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:02:12,469 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2022-04-15 15:02:12,469 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 146 transitions. [2022-04-15 15:02:12,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:02:12,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:02:12,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:02:12,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:02:12,470 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-15 15:02:12,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 137 transitions. [2022-04-15 15:02:12,474 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 137 transitions. Word has length 47 [2022-04-15 15:02:12,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:02:12,474 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 137 transitions. [2022-04-15 15:02:12,474 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 15:02:12,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 137 transitions. [2022-04-15 15:02:12,652 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-15 15:02:12,653 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 137 transitions. [2022-04-15 15:02:12,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-15 15:02:12,653 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:02:12,653 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:02:12,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 15:02:12,853 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:02:12,854 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:02:12,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:02:12,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1952108775, now seen corresponding path program 1 times [2022-04-15 15:02:12,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:02:12,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1144067519] [2022-04-15 15:02:12,855 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:02:12,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1952108775, now seen corresponding path program 2 times [2022-04-15 15:02:12,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:02:12,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858900303] [2022-04-15 15:02:12,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:02:12,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:02:12,867 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:02:12,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [703931805] [2022-04-15 15:02:12,867 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:02:12,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:02:12,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:02:12,868 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:02:12,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 15:02:12,905 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:02:12,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:02:12,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 15:02:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:02:12,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:02:13,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {5572#true} call ULTIMATE.init(); {5572#true} is VALID [2022-04-15 15:02:13,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {5572#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {5572#true} is VALID [2022-04-15 15:02:13,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {5572#true} assume true; {5572#true} is VALID [2022-04-15 15:02:13,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5572#true} {5572#true} #112#return; {5572#true} is VALID [2022-04-15 15:02:13,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {5572#true} call #t~ret6 := main(); {5572#true} is VALID [2022-04-15 15:02:13,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {5572#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {5572#true} is VALID [2022-04-15 15:02:13,065 INFO L272 TraceCheckUtils]: 6: Hoare triple {5572#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {5572#true} is VALID [2022-04-15 15:02:13,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {5572#true} ~cond := #in~cond; {5572#true} is VALID [2022-04-15 15:02:13,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {5572#true} assume !(0 == ~cond); {5572#true} is VALID [2022-04-15 15:02:13,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {5572#true} assume true; {5572#true} is VALID [2022-04-15 15:02:13,065 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5572#true} {5572#true} #94#return; {5572#true} is VALID [2022-04-15 15:02:13,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {5572#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5572#true} is VALID [2022-04-15 15:02:13,065 INFO L272 TraceCheckUtils]: 12: Hoare triple {5572#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {5572#true} is VALID [2022-04-15 15:02:13,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {5572#true} ~cond := #in~cond; {5572#true} is VALID [2022-04-15 15:02:13,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {5572#true} assume !(0 == ~cond); {5572#true} is VALID [2022-04-15 15:02:13,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {5572#true} assume true; {5572#true} is VALID [2022-04-15 15:02:13,065 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5572#true} {5572#true} #96#return; {5572#true} is VALID [2022-04-15 15:02:13,065 INFO L272 TraceCheckUtils]: 17: Hoare triple {5572#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5572#true} is VALID [2022-04-15 15:02:13,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {5572#true} ~cond := #in~cond; {5572#true} is VALID [2022-04-15 15:02:13,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {5572#true} assume !(0 == ~cond); {5572#true} is VALID [2022-04-15 15:02:13,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {5572#true} assume true; {5572#true} is VALID [2022-04-15 15:02:13,066 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5572#true} {5572#true} #98#return; {5572#true} is VALID [2022-04-15 15:02:13,066 INFO L272 TraceCheckUtils]: 22: Hoare triple {5572#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5572#true} is VALID [2022-04-15 15:02:13,066 INFO L290 TraceCheckUtils]: 23: Hoare triple {5572#true} ~cond := #in~cond; {5572#true} is VALID [2022-04-15 15:02:13,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {5572#true} assume !(0 == ~cond); {5572#true} is VALID [2022-04-15 15:02:13,066 INFO L290 TraceCheckUtils]: 25: Hoare triple {5572#true} assume true; {5572#true} is VALID [2022-04-15 15:02:13,066 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5572#true} {5572#true} #100#return; {5572#true} is VALID [2022-04-15 15:02:13,066 INFO L290 TraceCheckUtils]: 27: Hoare triple {5572#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {5572#true} is VALID [2022-04-15 15:02:13,066 INFO L290 TraceCheckUtils]: 28: Hoare triple {5572#true} assume !false; {5572#true} is VALID [2022-04-15 15:02:13,067 INFO L290 TraceCheckUtils]: 29: Hoare triple {5572#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {5572#true} is VALID [2022-04-15 15:02:13,067 INFO L290 TraceCheckUtils]: 30: Hoare triple {5572#true} assume !false; {5572#true} is VALID [2022-04-15 15:02:13,067 INFO L290 TraceCheckUtils]: 31: Hoare triple {5572#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-15 15:02:13,067 INFO L290 TraceCheckUtils]: 32: Hoare triple {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} assume !false; {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-15 15:02:13,067 INFO L272 TraceCheckUtils]: 33: Hoare triple {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {5572#true} is VALID [2022-04-15 15:02:13,067 INFO L290 TraceCheckUtils]: 34: Hoare triple {5572#true} ~cond := #in~cond; {5572#true} is VALID [2022-04-15 15:02:13,068 INFO L290 TraceCheckUtils]: 35: Hoare triple {5572#true} assume !(0 == ~cond); {5572#true} is VALID [2022-04-15 15:02:13,068 INFO L290 TraceCheckUtils]: 36: Hoare triple {5572#true} assume true; {5572#true} is VALID [2022-04-15 15:02:13,068 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5572#true} {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #102#return; {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-15 15:02:13,068 INFO L272 TraceCheckUtils]: 38: Hoare triple {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {5572#true} is VALID [2022-04-15 15:02:13,068 INFO L290 TraceCheckUtils]: 39: Hoare triple {5572#true} ~cond := #in~cond; {5572#true} is VALID [2022-04-15 15:02:13,068 INFO L290 TraceCheckUtils]: 40: Hoare triple {5572#true} assume !(0 == ~cond); {5572#true} is VALID [2022-04-15 15:02:13,068 INFO L290 TraceCheckUtils]: 41: Hoare triple {5572#true} assume true; {5572#true} is VALID [2022-04-15 15:02:13,069 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5572#true} {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #104#return; {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-15 15:02:13,069 INFO L272 TraceCheckUtils]: 43: Hoare triple {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {5572#true} is VALID [2022-04-15 15:02:13,069 INFO L290 TraceCheckUtils]: 44: Hoare triple {5572#true} ~cond := #in~cond; {5572#true} is VALID [2022-04-15 15:02:13,069 INFO L290 TraceCheckUtils]: 45: Hoare triple {5572#true} assume !(0 == ~cond); {5572#true} is VALID [2022-04-15 15:02:13,069 INFO L290 TraceCheckUtils]: 46: Hoare triple {5572#true} assume true; {5572#true} is VALID [2022-04-15 15:02:13,070 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5572#true} {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #106#return; {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-15 15:02:13,070 INFO L272 TraceCheckUtils]: 48: Hoare triple {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {5722#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:02:13,071 INFO L290 TraceCheckUtils]: 49: Hoare triple {5722#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5726#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:02:13,071 INFO L290 TraceCheckUtils]: 50: Hoare triple {5726#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5573#false} is VALID [2022-04-15 15:02:13,071 INFO L290 TraceCheckUtils]: 51: Hoare triple {5573#false} assume !false; {5573#false} is VALID [2022-04-15 15:02:13,071 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-15 15:02:13,071 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:02:13,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:02:13,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858900303] [2022-04-15 15:02:13,071 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:02:13,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703931805] [2022-04-15 15:02:13,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703931805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:02:13,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:02:13,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 15:02:13,072 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:02:13,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1144067519] [2022-04-15 15:02:13,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1144067519] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:02:13,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:02:13,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 15:02:13,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292337036] [2022-04-15 15:02:13,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:02:13,072 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-15 15:02:13,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:02:13,073 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-15 15:02:13,097 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-15 15:02:13,098 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 15:02:13,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:02:13,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 15:02:13,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 15:02:13,098 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-15 15:02:13,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:02:13,614 INFO L93 Difference]: Finished difference Result 158 states and 221 transitions. [2022-04-15 15:02:13,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 15:02:13,615 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-15 15:02:13,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:02:13,615 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-15 15:02:13,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-15 15:02:13,616 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-15 15:02:13,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-15 15:02:13,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-15 15:02:13,665 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-15 15:02:13,668 INFO L225 Difference]: With dead ends: 158 [2022-04-15 15:02:13,668 INFO L226 Difference]: Without dead ends: 156 [2022-04-15 15:02:13,669 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 15:02:13,669 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 9 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:02:13,669 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 156 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:02:13,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-04-15 15:02:14,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 140. [2022-04-15 15:02:14,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:02:14,036 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-15 15:02:14,037 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-15 15:02:14,037 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-15 15:02:14,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:02:14,043 INFO L93 Difference]: Finished difference Result 156 states and 219 transitions. [2022-04-15 15:02:14,043 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 219 transitions. [2022-04-15 15:02:14,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:02:14,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:02:14,045 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-15 15:02:14,045 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-15 15:02:14,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:02:14,051 INFO L93 Difference]: Finished difference Result 156 states and 219 transitions. [2022-04-15 15:02:14,051 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 219 transitions. [2022-04-15 15:02:14,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:02:14,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:02:14,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:02:14,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:02:14,052 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-15 15:02:14,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2022-04-15 15:02:14,057 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 52 [2022-04-15 15:02:14,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:02:14,058 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2022-04-15 15:02:14,058 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-15 15:02:14,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 194 transitions. [2022-04-15 15:02:14,320 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-15 15:02:14,321 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2022-04-15 15:02:14,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-15 15:02:14,321 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:02:14,322 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:02:14,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 15:02:14,522 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:02:14,522 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:02:14,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:02:14,523 INFO L85 PathProgramCache]: Analyzing trace with hash 188363668, now seen corresponding path program 1 times [2022-04-15 15:02:14,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:02:14,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1022961220] [2022-04-15 15:02:14,523 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:02:14,523 INFO L85 PathProgramCache]: Analyzing trace with hash 188363668, now seen corresponding path program 2 times [2022-04-15 15:02:14,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:02:14,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774167968] [2022-04-15 15:02:14,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:02:14,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:02:14,540 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:02:14,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [411890794] [2022-04-15 15:02:14,541 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:02:14,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:02:14,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:02:14,542 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:02:14,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 15:02:14,594 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:02:14,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:02:14,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-15 15:02:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:02:14,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:02:15,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {6642#true} call ULTIMATE.init(); {6642#true} is VALID [2022-04-15 15:02:15,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {6642#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {6642#true} is VALID [2022-04-15 15:02:15,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-15 15:02:15,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6642#true} {6642#true} #112#return; {6642#true} is VALID [2022-04-15 15:02:15,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {6642#true} call #t~ret6 := main(); {6642#true} is VALID [2022-04-15 15:02:15,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {6642#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {6642#true} is VALID [2022-04-15 15:02:15,288 INFO L272 TraceCheckUtils]: 6: Hoare triple {6642#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {6642#true} is VALID [2022-04-15 15:02:15,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-15 15:02:15,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-15 15:02:15,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-15 15:02:15,289 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6642#true} {6642#true} #94#return; {6642#true} is VALID [2022-04-15 15:02:15,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {6642#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6642#true} is VALID [2022-04-15 15:02:15,289 INFO L272 TraceCheckUtils]: 12: Hoare triple {6642#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {6642#true} is VALID [2022-04-15 15:02:15,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-15 15:02:15,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-15 15:02:15,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-15 15:02:15,289 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6642#true} {6642#true} #96#return; {6642#true} is VALID [2022-04-15 15:02:15,289 INFO L272 TraceCheckUtils]: 17: Hoare triple {6642#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6642#true} is VALID [2022-04-15 15:02:15,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-15 15:02:15,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-15 15:02:15,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-15 15:02:15,290 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6642#true} {6642#true} #98#return; {6642#true} is VALID [2022-04-15 15:02:15,290 INFO L272 TraceCheckUtils]: 22: Hoare triple {6642#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6642#true} is VALID [2022-04-15 15:02:15,290 INFO L290 TraceCheckUtils]: 23: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-15 15:02:15,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-15 15:02:15,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-15 15:02:15,290 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6642#true} {6642#true} #100#return; {6642#true} is VALID [2022-04-15 15:02:15,291 INFO L290 TraceCheckUtils]: 27: Hoare triple {6642#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {6728#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 15:02:15,291 INFO L290 TraceCheckUtils]: 28: Hoare triple {6728#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {6728#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 15:02:15,292 INFO L290 TraceCheckUtils]: 29: Hoare triple {6728#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {6735#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 15:02:15,292 INFO L290 TraceCheckUtils]: 30: Hoare triple {6735#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {6735#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 15:02:15,293 INFO L290 TraceCheckUtils]: 31: Hoare triple {6735#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {6742#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 15:02:15,293 INFO L290 TraceCheckUtils]: 32: Hoare triple {6742#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {6742#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 15:02:15,293 INFO L272 TraceCheckUtils]: 33: Hoare triple {6742#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6642#true} is VALID [2022-04-15 15:02:15,294 INFO L290 TraceCheckUtils]: 34: Hoare triple {6642#true} ~cond := #in~cond; {6752#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:02:15,294 INFO L290 TraceCheckUtils]: 35: Hoare triple {6752#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:02:15,294 INFO L290 TraceCheckUtils]: 36: Hoare triple {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:02:15,296 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} {6742#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #102#return; {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 15:02:15,296 INFO L272 TraceCheckUtils]: 38: Hoare triple {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6642#true} is VALID [2022-04-15 15:02:15,296 INFO L290 TraceCheckUtils]: 39: Hoare triple {6642#true} ~cond := #in~cond; {6752#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:02:15,297 INFO L290 TraceCheckUtils]: 40: Hoare triple {6752#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:02:15,297 INFO L290 TraceCheckUtils]: 41: Hoare triple {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:02:15,298 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #104#return; {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 15:02:15,298 INFO L272 TraceCheckUtils]: 43: Hoare triple {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {6642#true} is VALID [2022-04-15 15:02:15,298 INFO L290 TraceCheckUtils]: 44: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-15 15:02:15,298 INFO L290 TraceCheckUtils]: 45: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-15 15:02:15,298 INFO L290 TraceCheckUtils]: 46: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-15 15:02:15,299 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6642#true} {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #106#return; {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 15:02:15,299 INFO L272 TraceCheckUtils]: 48: Hoare triple {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {6642#true} is VALID [2022-04-15 15:02:15,299 INFO L290 TraceCheckUtils]: 49: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-15 15:02:15,299 INFO L290 TraceCheckUtils]: 50: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-15 15:02:15,299 INFO L290 TraceCheckUtils]: 51: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-15 15:02:15,300 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6642#true} {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #108#return; {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 15:02:15,301 INFO L290 TraceCheckUtils]: 53: Hoare triple {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 15:02:15,301 INFO L290 TraceCheckUtils]: 54: Hoare triple {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {6815#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 15:02:15,302 INFO L290 TraceCheckUtils]: 55: Hoare triple {6815#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {6815#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 15:02:15,303 INFO L290 TraceCheckUtils]: 56: Hoare triple {6815#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {6815#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 15:02:15,303 INFO L290 TraceCheckUtils]: 57: Hoare triple {6815#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {6825#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (+ main_~s~0 1) 0))} is VALID [2022-04-15 15:02:15,304 INFO L290 TraceCheckUtils]: 58: Hoare triple {6825#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (+ main_~s~0 1) 0))} assume !false; {6825#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (+ main_~s~0 1) 0))} is VALID [2022-04-15 15:02:15,304 INFO L290 TraceCheckUtils]: 59: Hoare triple {6825#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (+ main_~s~0 1) 0))} assume !(0 != ~b~0); {6832#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~s~0 1) 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0))} is VALID [2022-04-15 15:02:15,305 INFO L272 TraceCheckUtils]: 60: Hoare triple {6832#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~s~0 1) 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {6836#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:02:15,306 INFO L290 TraceCheckUtils]: 61: Hoare triple {6836#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6840#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:02:15,306 INFO L290 TraceCheckUtils]: 62: Hoare triple {6840#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6643#false} is VALID [2022-04-15 15:02:15,306 INFO L290 TraceCheckUtils]: 63: Hoare triple {6643#false} assume !false; {6643#false} is VALID [2022-04-15 15:02:15,307 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-15 15:02:15,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:02:54,850 INFO L290 TraceCheckUtils]: 63: Hoare triple {6643#false} assume !false; {6643#false} is VALID [2022-04-15 15:02:54,851 INFO L290 TraceCheckUtils]: 62: Hoare triple {6840#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6643#false} is VALID [2022-04-15 15:02:54,851 INFO L290 TraceCheckUtils]: 61: Hoare triple {6836#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6840#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:02:54,852 INFO L272 TraceCheckUtils]: 60: Hoare triple {6856#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {6836#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:02:54,852 INFO L290 TraceCheckUtils]: 59: Hoare triple {6860#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !(0 != ~b~0); {6856#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 15:02:54,853 INFO L290 TraceCheckUtils]: 58: Hoare triple {6860#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !false; {6860#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-15 15:02:54,977 INFO L290 TraceCheckUtils]: 57: Hoare triple {6867#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {6860#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-15 15:02:54,977 INFO L290 TraceCheckUtils]: 56: Hoare triple {6867#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {6867#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:02:54,978 INFO L290 TraceCheckUtils]: 55: Hoare triple {6867#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {6867#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:02:55,089 INFO L290 TraceCheckUtils]: 54: Hoare triple {6877#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {6867#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:02:55,090 INFO L290 TraceCheckUtils]: 53: Hoare triple {6877#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= 2 * ~v~0); {6877#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:02:55,091 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6642#true} {6877#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #108#return; {6877#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:02:55,091 INFO L290 TraceCheckUtils]: 51: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-15 15:02:55,091 INFO L290 TraceCheckUtils]: 50: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-15 15:02:55,091 INFO L290 TraceCheckUtils]: 49: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-15 15:02:55,091 INFO L272 TraceCheckUtils]: 48: Hoare triple {6877#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {6642#true} is VALID [2022-04-15 15:02:55,092 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6642#true} {6877#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #106#return; {6877#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:02:55,092 INFO L290 TraceCheckUtils]: 46: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-15 15:02:55,092 INFO L290 TraceCheckUtils]: 45: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-15 15:02:55,092 INFO L290 TraceCheckUtils]: 44: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-15 15:02:55,092 INFO L272 TraceCheckUtils]: 43: Hoare triple {6877#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {6642#true} is VALID [2022-04-15 15:02:55,093 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} {6914#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {6877#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:02:55,094 INFO L290 TraceCheckUtils]: 41: Hoare triple {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:02:55,094 INFO L290 TraceCheckUtils]: 40: Hoare triple {6924#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:02:55,094 INFO L290 TraceCheckUtils]: 39: Hoare triple {6642#true} ~cond := #in~cond; {6924#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 15:02:55,094 INFO L272 TraceCheckUtils]: 38: Hoare triple {6914#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6642#true} is VALID [2022-04-15 15:02:55,095 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} {6931#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #102#return; {6914#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:02:55,096 INFO L290 TraceCheckUtils]: 36: Hoare triple {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:02:55,096 INFO L290 TraceCheckUtils]: 35: Hoare triple {6924#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:02:55,096 INFO L290 TraceCheckUtils]: 34: Hoare triple {6642#true} ~cond := #in~cond; {6924#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 15:02:55,096 INFO L272 TraceCheckUtils]: 33: Hoare triple {6931#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6642#true} is VALID [2022-04-15 15:02:55,097 INFO L290 TraceCheckUtils]: 32: Hoare triple {6931#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {6931#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:02:55,098 INFO L290 TraceCheckUtils]: 31: Hoare triple {6950#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {6931#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:02:55,099 INFO L290 TraceCheckUtils]: 30: Hoare triple {6950#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} assume !false; {6950#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-15 15:02:55,099 INFO L290 TraceCheckUtils]: 29: Hoare triple {6642#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {6950#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-15 15:02:55,099 INFO L290 TraceCheckUtils]: 28: Hoare triple {6642#true} assume !false; {6642#true} is VALID [2022-04-15 15:02:55,099 INFO L290 TraceCheckUtils]: 27: Hoare triple {6642#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {6642#true} is VALID [2022-04-15 15:02:55,099 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6642#true} {6642#true} #100#return; {6642#true} is VALID [2022-04-15 15:02:55,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-15 15:02:55,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-15 15:02:55,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-15 15:02:55,100 INFO L272 TraceCheckUtils]: 22: Hoare triple {6642#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6642#true} is VALID [2022-04-15 15:02:55,100 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6642#true} {6642#true} #98#return; {6642#true} is VALID [2022-04-15 15:02:55,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-15 15:02:55,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-15 15:02:55,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-15 15:02:55,100 INFO L272 TraceCheckUtils]: 17: Hoare triple {6642#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6642#true} is VALID [2022-04-15 15:02:55,100 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6642#true} {6642#true} #96#return; {6642#true} is VALID [2022-04-15 15:02:55,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-15 15:02:55,100 INFO L290 TraceCheckUtils]: 14: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-15 15:02:55,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-15 15:02:55,100 INFO L272 TraceCheckUtils]: 12: Hoare triple {6642#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {6642#true} is VALID [2022-04-15 15:02:55,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {6642#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6642#true} is VALID [2022-04-15 15:02:55,100 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6642#true} {6642#true} #94#return; {6642#true} is VALID [2022-04-15 15:02:55,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-15 15:02:55,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-15 15:02:55,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-15 15:02:55,101 INFO L272 TraceCheckUtils]: 6: Hoare triple {6642#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {6642#true} is VALID [2022-04-15 15:02:55,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {6642#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {6642#true} is VALID [2022-04-15 15:02:55,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {6642#true} call #t~ret6 := main(); {6642#true} is VALID [2022-04-15 15:02:55,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6642#true} {6642#true} #112#return; {6642#true} is VALID [2022-04-15 15:02:55,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-15 15:02:55,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {6642#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {6642#true} is VALID [2022-04-15 15:02:55,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {6642#true} call ULTIMATE.init(); {6642#true} is VALID [2022-04-15 15:02:55,101 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-15 15:02:55,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:02:55,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774167968] [2022-04-15 15:02:55,102 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:02:55,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411890794] [2022-04-15 15:02:55,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411890794] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:02:55,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:02:55,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2022-04-15 15:02:55,102 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:02:55,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1022961220] [2022-04-15 15:02:55,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1022961220] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:02:55,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:02:55,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 15:02:55,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563390039] [2022-04-15 15:02:55,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:02:55,103 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-15 15:02:55,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:02:55,103 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-15 15:02:55,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:02:55,143 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 15:02:55,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:02:55,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 15:02:55,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-04-15 15:02:55,144 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-15 15:02:57,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:02:57,310 INFO L93 Difference]: Finished difference Result 200 states and 283 transitions. [2022-04-15 15:02:57,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 15:02:57,311 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-15 15:02:57,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:02:57,311 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-15 15:02:57,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 131 transitions. [2022-04-15 15:02:57,320 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-15 15:02:57,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 131 transitions. [2022-04-15 15:02:57,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 131 transitions. [2022-04-15 15:02:57,456 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-15 15:02:57,460 INFO L225 Difference]: With dead ends: 200 [2022-04-15 15:02:57,461 INFO L226 Difference]: Without dead ends: 197 [2022-04-15 15:02:57,461 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-04-15 15:02:57,462 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 48 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 15:02:57,462 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 306 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 15:02:57,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-15 15:02:57,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 193. [2022-04-15 15:02:57,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:02:57,961 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-15 15:02:57,961 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-15 15:02:57,962 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-15 15:02:57,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:02:57,970 INFO L93 Difference]: Finished difference Result 197 states and 279 transitions. [2022-04-15 15:02:57,970 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 279 transitions. [2022-04-15 15:02:57,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:02:57,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:02:57,972 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-15 15:02:57,973 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-15 15:02:57,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:02:57,981 INFO L93 Difference]: Finished difference Result 197 states and 279 transitions. [2022-04-15 15:02:57,981 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 279 transitions. [2022-04-15 15:02:57,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:02:57,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:02:57,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:02:57,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:02:57,983 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-15 15:02:57,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 275 transitions. [2022-04-15 15:02:57,989 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 275 transitions. Word has length 64 [2022-04-15 15:02:57,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:02:57,990 INFO L478 AbstractCegarLoop]: Abstraction has 193 states and 275 transitions. [2022-04-15 15:02:57,990 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 15:02:57,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 193 states and 275 transitions. [2022-04-15 15:02:58,405 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-15 15:02:58,405 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 275 transitions. [2022-04-15 15:02:58,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 15:02:58,406 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:02:58,406 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:02:58,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 15:02:58,619 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-15 15:02:58,619 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:02:58,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:02:58,620 INFO L85 PathProgramCache]: Analyzing trace with hash -368004398, now seen corresponding path program 3 times [2022-04-15 15:02:58,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:02:58,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1028545949] [2022-04-15 15:02:58,620 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:02:58,620 INFO L85 PathProgramCache]: Analyzing trace with hash -368004398, now seen corresponding path program 4 times [2022-04-15 15:02:58,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:02:58,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178152656] [2022-04-15 15:02:58,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:02:58,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:02:58,634 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:02:58,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1747628268] [2022-04-15 15:02:58,635 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:02:58,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:02:58,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:02:58,636 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:02:58,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 15:02:58,697 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:02:58,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:02:58,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 15:02:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:02:58,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:02:58,963 INFO L272 TraceCheckUtils]: 0: Hoare triple {8234#true} call ULTIMATE.init(); {8234#true} is VALID [2022-04-15 15:02:58,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {8234#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {8234#true} is VALID [2022-04-15 15:02:58,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-15 15:02:58,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8234#true} {8234#true} #112#return; {8234#true} is VALID [2022-04-15 15:02:58,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {8234#true} call #t~ret6 := main(); {8234#true} is VALID [2022-04-15 15:02:58,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {8234#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {8234#true} is VALID [2022-04-15 15:02:58,964 INFO L272 TraceCheckUtils]: 6: Hoare triple {8234#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {8234#true} is VALID [2022-04-15 15:02:58,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-15 15:02:58,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-15 15:02:58,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-15 15:02:58,967 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8234#true} {8234#true} #94#return; {8234#true} is VALID [2022-04-15 15:02:58,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {8234#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8234#true} is VALID [2022-04-15 15:02:58,967 INFO L272 TraceCheckUtils]: 12: Hoare triple {8234#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {8234#true} is VALID [2022-04-15 15:02:58,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-15 15:02:58,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-15 15:02:58,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-15 15:02:58,968 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8234#true} {8234#true} #96#return; {8234#true} is VALID [2022-04-15 15:02:58,968 INFO L272 TraceCheckUtils]: 17: Hoare triple {8234#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8234#true} is VALID [2022-04-15 15:02:58,968 INFO L290 TraceCheckUtils]: 18: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-15 15:02:58,968 INFO L290 TraceCheckUtils]: 19: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-15 15:02:58,968 INFO L290 TraceCheckUtils]: 20: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-15 15:02:58,968 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8234#true} {8234#true} #98#return; {8234#true} is VALID [2022-04-15 15:02:58,968 INFO L272 TraceCheckUtils]: 22: Hoare triple {8234#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8234#true} is VALID [2022-04-15 15:02:58,968 INFO L290 TraceCheckUtils]: 23: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-15 15:02:58,968 INFO L290 TraceCheckUtils]: 24: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-15 15:02:58,968 INFO L290 TraceCheckUtils]: 25: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-15 15:02:58,969 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8234#true} {8234#true} #100#return; {8234#true} is VALID [2022-04-15 15:02:58,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {8234#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {8234#true} is VALID [2022-04-15 15:02:58,969 INFO L290 TraceCheckUtils]: 28: Hoare triple {8234#true} assume !false; {8234#true} is VALID [2022-04-15 15:02:58,969 INFO L290 TraceCheckUtils]: 29: Hoare triple {8234#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {8234#true} is VALID [2022-04-15 15:02:58,969 INFO L290 TraceCheckUtils]: 30: Hoare triple {8234#true} assume !false; {8234#true} is VALID [2022-04-15 15:02:58,969 INFO L290 TraceCheckUtils]: 31: Hoare triple {8234#true} assume !(~c~0 >= ~b~0); {8332#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-15 15:02:58,970 INFO L290 TraceCheckUtils]: 32: Hoare triple {8332#(not (<= main_~b~0 main_~c~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {8336#(< main_~b~0 main_~a~0)} is VALID [2022-04-15 15:02:58,970 INFO L290 TraceCheckUtils]: 33: Hoare triple {8336#(< main_~b~0 main_~a~0)} assume !false; {8336#(< main_~b~0 main_~a~0)} is VALID [2022-04-15 15:02:58,971 INFO L290 TraceCheckUtils]: 34: Hoare triple {8336#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {8343#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 15:02:58,971 INFO L290 TraceCheckUtils]: 35: Hoare triple {8343#(< main_~b~0 main_~c~0)} assume !false; {8343#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 15:02:58,972 INFO L290 TraceCheckUtils]: 36: Hoare triple {8343#(< main_~b~0 main_~c~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-15 15:02:58,972 INFO L290 TraceCheckUtils]: 37: Hoare triple {8350#(< main_~v~0 main_~c~0)} assume !false; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-15 15:02:58,972 INFO L272 TraceCheckUtils]: 38: Hoare triple {8350#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8234#true} is VALID [2022-04-15 15:02:58,972 INFO L290 TraceCheckUtils]: 39: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-15 15:02:58,972 INFO L290 TraceCheckUtils]: 40: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-15 15:02:58,972 INFO L290 TraceCheckUtils]: 41: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-15 15:02:58,973 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8234#true} {8350#(< main_~v~0 main_~c~0)} #102#return; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-15 15:02:58,973 INFO L272 TraceCheckUtils]: 43: Hoare triple {8350#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8234#true} is VALID [2022-04-15 15:02:58,974 INFO L290 TraceCheckUtils]: 44: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-15 15:02:58,974 INFO L290 TraceCheckUtils]: 45: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-15 15:02:58,974 INFO L290 TraceCheckUtils]: 46: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-15 15:02:58,975 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8234#true} {8350#(< main_~v~0 main_~c~0)} #104#return; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-15 15:02:58,975 INFO L272 TraceCheckUtils]: 48: Hoare triple {8350#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8234#true} is VALID [2022-04-15 15:02:58,975 INFO L290 TraceCheckUtils]: 49: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-15 15:02:58,975 INFO L290 TraceCheckUtils]: 50: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-15 15:02:58,975 INFO L290 TraceCheckUtils]: 51: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-15 15:02:58,976 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8234#true} {8350#(< main_~v~0 main_~c~0)} #106#return; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-15 15:02:58,976 INFO L272 TraceCheckUtils]: 53: Hoare triple {8350#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {8234#true} is VALID [2022-04-15 15:02:58,976 INFO L290 TraceCheckUtils]: 54: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-15 15:02:58,976 INFO L290 TraceCheckUtils]: 55: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-15 15:02:58,976 INFO L290 TraceCheckUtils]: 56: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-15 15:02:58,977 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {8234#true} {8350#(< main_~v~0 main_~c~0)} #108#return; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-15 15:02:58,977 INFO L290 TraceCheckUtils]: 58: Hoare triple {8350#(< main_~v~0 main_~c~0)} assume !(~c~0 >= 2 * ~v~0); {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-15 15:02:58,978 INFO L290 TraceCheckUtils]: 59: Hoare triple {8350#(< main_~v~0 main_~c~0)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {8420#(< 0 main_~c~0)} is VALID [2022-04-15 15:02:58,978 INFO L290 TraceCheckUtils]: 60: Hoare triple {8420#(< 0 main_~c~0)} assume !false; {8420#(< 0 main_~c~0)} is VALID [2022-04-15 15:02:58,979 INFO L290 TraceCheckUtils]: 61: Hoare triple {8420#(< 0 main_~c~0)} assume !(~c~0 >= ~b~0); {8420#(< 0 main_~c~0)} is VALID [2022-04-15 15:02:58,979 INFO L290 TraceCheckUtils]: 62: Hoare triple {8420#(< 0 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {8430#(< 0 main_~b~0)} is VALID [2022-04-15 15:02:58,980 INFO L290 TraceCheckUtils]: 63: Hoare triple {8430#(< 0 main_~b~0)} assume !false; {8430#(< 0 main_~b~0)} is VALID [2022-04-15 15:02:58,980 INFO L290 TraceCheckUtils]: 64: Hoare triple {8430#(< 0 main_~b~0)} assume !(0 != ~b~0); {8235#false} is VALID [2022-04-15 15:02:58,980 INFO L272 TraceCheckUtils]: 65: Hoare triple {8235#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {8235#false} is VALID [2022-04-15 15:02:58,980 INFO L290 TraceCheckUtils]: 66: Hoare triple {8235#false} ~cond := #in~cond; {8235#false} is VALID [2022-04-15 15:02:58,980 INFO L290 TraceCheckUtils]: 67: Hoare triple {8235#false} assume 0 == ~cond; {8235#false} is VALID [2022-04-15 15:02:58,981 INFO L290 TraceCheckUtils]: 68: Hoare triple {8235#false} assume !false; {8235#false} is VALID [2022-04-15 15:02:58,981 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-15 15:02:58,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:02:59,225 INFO L290 TraceCheckUtils]: 68: Hoare triple {8235#false} assume !false; {8235#false} is VALID [2022-04-15 15:02:59,225 INFO L290 TraceCheckUtils]: 67: Hoare triple {8235#false} assume 0 == ~cond; {8235#false} is VALID [2022-04-15 15:02:59,225 INFO L290 TraceCheckUtils]: 66: Hoare triple {8235#false} ~cond := #in~cond; {8235#false} is VALID [2022-04-15 15:02:59,226 INFO L272 TraceCheckUtils]: 65: Hoare triple {8235#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {8235#false} is VALID [2022-04-15 15:02:59,226 INFO L290 TraceCheckUtils]: 64: Hoare triple {8430#(< 0 main_~b~0)} assume !(0 != ~b~0); {8235#false} is VALID [2022-04-15 15:02:59,226 INFO L290 TraceCheckUtils]: 63: Hoare triple {8430#(< 0 main_~b~0)} assume !false; {8430#(< 0 main_~b~0)} is VALID [2022-04-15 15:02:59,227 INFO L290 TraceCheckUtils]: 62: Hoare triple {8420#(< 0 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {8430#(< 0 main_~b~0)} is VALID [2022-04-15 15:02:59,227 INFO L290 TraceCheckUtils]: 61: Hoare triple {8420#(< 0 main_~c~0)} assume !(~c~0 >= ~b~0); {8420#(< 0 main_~c~0)} is VALID [2022-04-15 15:02:59,227 INFO L290 TraceCheckUtils]: 60: Hoare triple {8420#(< 0 main_~c~0)} assume !false; {8420#(< 0 main_~c~0)} is VALID [2022-04-15 15:02:59,228 INFO L290 TraceCheckUtils]: 59: Hoare triple {8350#(< main_~v~0 main_~c~0)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {8420#(< 0 main_~c~0)} is VALID [2022-04-15 15:02:59,228 INFO L290 TraceCheckUtils]: 58: Hoare triple {8350#(< main_~v~0 main_~c~0)} assume !(~c~0 >= 2 * ~v~0); {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-15 15:02:59,228 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {8234#true} {8350#(< main_~v~0 main_~c~0)} #108#return; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-15 15:02:59,228 INFO L290 TraceCheckUtils]: 56: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-15 15:02:59,229 INFO L290 TraceCheckUtils]: 55: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-15 15:02:59,229 INFO L290 TraceCheckUtils]: 54: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-15 15:02:59,229 INFO L272 TraceCheckUtils]: 53: Hoare triple {8350#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {8234#true} is VALID [2022-04-15 15:02:59,229 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8234#true} {8350#(< main_~v~0 main_~c~0)} #106#return; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-15 15:02:59,229 INFO L290 TraceCheckUtils]: 51: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-15 15:02:59,229 INFO L290 TraceCheckUtils]: 50: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-15 15:02:59,229 INFO L290 TraceCheckUtils]: 49: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-15 15:02:59,229 INFO L272 TraceCheckUtils]: 48: Hoare triple {8350#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8234#true} is VALID [2022-04-15 15:02:59,230 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8234#true} {8350#(< main_~v~0 main_~c~0)} #104#return; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-15 15:02:59,230 INFO L290 TraceCheckUtils]: 46: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-15 15:02:59,230 INFO L290 TraceCheckUtils]: 45: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-15 15:02:59,230 INFO L290 TraceCheckUtils]: 44: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-15 15:02:59,230 INFO L272 TraceCheckUtils]: 43: Hoare triple {8350#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8234#true} is VALID [2022-04-15 15:02:59,231 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8234#true} {8350#(< main_~v~0 main_~c~0)} #102#return; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-15 15:02:59,231 INFO L290 TraceCheckUtils]: 41: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-15 15:02:59,231 INFO L290 TraceCheckUtils]: 40: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-15 15:02:59,231 INFO L290 TraceCheckUtils]: 39: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-15 15:02:59,231 INFO L272 TraceCheckUtils]: 38: Hoare triple {8350#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8234#true} is VALID [2022-04-15 15:02:59,251 INFO L290 TraceCheckUtils]: 37: Hoare triple {8350#(< main_~v~0 main_~c~0)} assume !false; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-15 15:02:59,252 INFO L290 TraceCheckUtils]: 36: Hoare triple {8343#(< main_~b~0 main_~c~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-15 15:02:59,252 INFO L290 TraceCheckUtils]: 35: Hoare triple {8343#(< main_~b~0 main_~c~0)} assume !false; {8343#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 15:02:59,253 INFO L290 TraceCheckUtils]: 34: Hoare triple {8336#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {8343#(< main_~b~0 main_~c~0)} is VALID [2022-04-15 15:02:59,254 INFO L290 TraceCheckUtils]: 33: Hoare triple {8336#(< main_~b~0 main_~a~0)} assume !false; {8336#(< main_~b~0 main_~a~0)} is VALID [2022-04-15 15:02:59,254 INFO L290 TraceCheckUtils]: 32: Hoare triple {8332#(not (<= main_~b~0 main_~c~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {8336#(< main_~b~0 main_~a~0)} is VALID [2022-04-15 15:02:59,255 INFO L290 TraceCheckUtils]: 31: Hoare triple {8234#true} assume !(~c~0 >= ~b~0); {8332#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-15 15:02:59,255 INFO L290 TraceCheckUtils]: 30: Hoare triple {8234#true} assume !false; {8234#true} is VALID [2022-04-15 15:02:59,255 INFO L290 TraceCheckUtils]: 29: Hoare triple {8234#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {8234#true} is VALID [2022-04-15 15:02:59,255 INFO L290 TraceCheckUtils]: 28: Hoare triple {8234#true} assume !false; {8234#true} is VALID [2022-04-15 15:02:59,255 INFO L290 TraceCheckUtils]: 27: Hoare triple {8234#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {8234#true} is VALID [2022-04-15 15:02:59,255 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8234#true} {8234#true} #100#return; {8234#true} is VALID [2022-04-15 15:02:59,255 INFO L290 TraceCheckUtils]: 25: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-15 15:02:59,255 INFO L290 TraceCheckUtils]: 24: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-15 15:02:59,256 INFO L290 TraceCheckUtils]: 23: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-15 15:02:59,256 INFO L272 TraceCheckUtils]: 22: Hoare triple {8234#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8234#true} is VALID [2022-04-15 15:02:59,256 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8234#true} {8234#true} #98#return; {8234#true} is VALID [2022-04-15 15:02:59,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-15 15:02:59,256 INFO L290 TraceCheckUtils]: 19: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-15 15:02:59,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-15 15:02:59,256 INFO L272 TraceCheckUtils]: 17: Hoare triple {8234#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8234#true} is VALID [2022-04-15 15:02:59,256 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8234#true} {8234#true} #96#return; {8234#true} is VALID [2022-04-15 15:02:59,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-15 15:02:59,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-15 15:02:59,256 INFO L290 TraceCheckUtils]: 13: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-15 15:02:59,256 INFO L272 TraceCheckUtils]: 12: Hoare triple {8234#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {8234#true} is VALID [2022-04-15 15:02:59,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {8234#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8234#true} is VALID [2022-04-15 15:02:59,257 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8234#true} {8234#true} #94#return; {8234#true} is VALID [2022-04-15 15:02:59,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-15 15:02:59,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-15 15:02:59,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-15 15:02:59,257 INFO L272 TraceCheckUtils]: 6: Hoare triple {8234#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {8234#true} is VALID [2022-04-15 15:02:59,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {8234#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {8234#true} is VALID [2022-04-15 15:02:59,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {8234#true} call #t~ret6 := main(); {8234#true} is VALID [2022-04-15 15:02:59,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8234#true} {8234#true} #112#return; {8234#true} is VALID [2022-04-15 15:02:59,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-15 15:02:59,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {8234#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {8234#true} is VALID [2022-04-15 15:02:59,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {8234#true} call ULTIMATE.init(); {8234#true} is VALID [2022-04-15 15:02:59,258 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-15 15:02:59,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:02:59,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178152656] [2022-04-15 15:02:59,258 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:02:59,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747628268] [2022-04-15 15:02:59,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747628268] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:02:59,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:02:59,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-15 15:02:59,259 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:02:59,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1028545949] [2022-04-15 15:02:59,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1028545949] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:02:59,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:02:59,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 15:02:59,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543621035] [2022-04-15 15:02:59,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:02:59,259 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-15 15:02:59,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:02:59,260 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-15 15:02:59,295 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-15 15:02:59,296 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 15:02:59,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:02:59,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 15:02:59,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-15 15:02:59,296 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-15 15:03:01,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:03:01,315 INFO L93 Difference]: Finished difference Result 288 states and 424 transitions. [2022-04-15 15:03:01,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 15:03:01,315 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-15 15:03:01,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:03:01,315 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-15 15:03:01,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 158 transitions. [2022-04-15 15:03:01,318 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-15 15:03:01,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 158 transitions. [2022-04-15 15:03:01,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 158 transitions. [2022-04-15 15:03:01,460 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-15 15:03:01,468 INFO L225 Difference]: With dead ends: 288 [2022-04-15 15:03:01,468 INFO L226 Difference]: Without dead ends: 281 [2022-04-15 15:03:01,468 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2022-04-15 15:03:01,468 INFO L913 BasicCegarLoop]: 87 mSDtfsCounter, 48 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 15:03:01,469 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 318 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 15:03:01,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-04-15 15:03:02,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 208. [2022-04-15 15:03:02,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:03:02,039 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-15 15:03:02,040 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-15 15:03:02,040 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-15 15:03:02,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:03:02,050 INFO L93 Difference]: Finished difference Result 281 states and 417 transitions. [2022-04-15 15:03:02,050 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 417 transitions. [2022-04-15 15:03:02,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:03:02,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:03:02,052 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-15 15:03:02,053 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-15 15:03:02,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:03:02,063 INFO L93 Difference]: Finished difference Result 281 states and 417 transitions. [2022-04-15 15:03:02,063 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 417 transitions. [2022-04-15 15:03:02,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:03:02,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:03:02,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:03:02,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:03:02,066 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-15 15:03:02,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 296 transitions. [2022-04-15 15:03:02,073 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 296 transitions. Word has length 69 [2022-04-15 15:03:02,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:03:02,073 INFO L478 AbstractCegarLoop]: Abstraction has 208 states and 296 transitions. [2022-04-15 15:03:02,073 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-15 15:03:02,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 208 states and 296 transitions. [2022-04-15 15:03:02,574 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-15 15:03:02,574 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 296 transitions. [2022-04-15 15:03:02,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-15 15:03:02,575 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:03:02,575 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:03:02,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 15:03:02,776 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-15 15:03:02,777 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:03:02,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:03:02,777 INFO L85 PathProgramCache]: Analyzing trace with hash -298771846, now seen corresponding path program 1 times [2022-04-15 15:03:02,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:03:02,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [145984060] [2022-04-15 15:03:02,777 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:03:02,777 INFO L85 PathProgramCache]: Analyzing trace with hash -298771846, now seen corresponding path program 2 times [2022-04-15 15:03:02,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:03:02,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088943212] [2022-04-15 15:03:02,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:03:02,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:03:02,804 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:03:02,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [823738873] [2022-04-15 15:03:02,804 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:03:02,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:03:02,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:03:02,809 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:03:02,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 15:03:02,858 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:03:02,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:03:02,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 15:03:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:03:02,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:03:03,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {10236#true} call ULTIMATE.init(); {10236#true} is VALID [2022-04-15 15:03:03,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {10236#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {10236#true} is VALID [2022-04-15 15:03:03,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-15 15:03:03,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10236#true} {10236#true} #112#return; {10236#true} is VALID [2022-04-15 15:03:03,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {10236#true} call #t~ret6 := main(); {10236#true} is VALID [2022-04-15 15:03:03,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {10236#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {10236#true} is VALID [2022-04-15 15:03:03,952 INFO L272 TraceCheckUtils]: 6: Hoare triple {10236#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {10236#true} is VALID [2022-04-15 15:03:03,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {10236#true} ~cond := #in~cond; {10262#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 15:03:03,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {10262#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {10266#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 15:03:03,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {10266#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {10266#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 15:03:03,953 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10266#(not (= |assume_abort_if_not_#in~cond| 0))} {10236#true} #94#return; {10273#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 15:03:03,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {10273#(and (<= 0 main_~x~0) (<= main_~x~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10273#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 15:03:03,954 INFO L272 TraceCheckUtils]: 12: Hoare triple {10273#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {10236#true} is VALID [2022-04-15 15:03:03,954 INFO L290 TraceCheckUtils]: 13: Hoare triple {10236#true} ~cond := #in~cond; {10262#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 15:03:03,954 INFO L290 TraceCheckUtils]: 14: Hoare triple {10262#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {10266#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 15:03:03,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {10266#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {10266#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 15:03:03,955 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10266#(not (= |assume_abort_if_not_#in~cond| 0))} {10273#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #96#return; {10292#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 15:03:03,955 INFO L272 TraceCheckUtils]: 17: Hoare triple {10292#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10236#true} is VALID [2022-04-15 15:03:03,955 INFO L290 TraceCheckUtils]: 18: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-15 15:03:03,955 INFO L290 TraceCheckUtils]: 19: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-15 15:03:03,955 INFO L290 TraceCheckUtils]: 20: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-15 15:03:03,956 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10236#true} {10292#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} #98#return; {10292#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 15:03:03,956 INFO L272 TraceCheckUtils]: 22: Hoare triple {10292#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10236#true} is VALID [2022-04-15 15:03:03,956 INFO L290 TraceCheckUtils]: 23: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-15 15:03:03,956 INFO L290 TraceCheckUtils]: 24: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-15 15:03:03,956 INFO L290 TraceCheckUtils]: 25: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-15 15:03:03,956 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10236#true} {10292#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} #100#return; {10292#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 15:03:03,957 INFO L290 TraceCheckUtils]: 27: Hoare triple {10292#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {10326#(and (<= main_~b~0 2) (<= main_~a~0 2) (<= 0 main_~b~0))} is VALID [2022-04-15 15:03:03,957 INFO L290 TraceCheckUtils]: 28: Hoare triple {10326#(and (<= main_~b~0 2) (<= main_~a~0 2) (<= 0 main_~b~0))} assume !false; {10326#(and (<= main_~b~0 2) (<= main_~a~0 2) (<= 0 main_~b~0))} is VALID [2022-04-15 15:03:03,958 INFO L290 TraceCheckUtils]: 29: Hoare triple {10326#(and (<= main_~b~0 2) (<= main_~a~0 2) (<= 0 main_~b~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {10333#(and (<= main_~b~0 2) (<= main_~c~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 15:03:03,958 INFO L290 TraceCheckUtils]: 30: Hoare triple {10333#(and (<= main_~b~0 2) (<= main_~c~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !false; {10333#(and (<= main_~b~0 2) (<= main_~c~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 15:03:03,959 INFO L290 TraceCheckUtils]: 31: Hoare triple {10333#(and (<= main_~b~0 2) (<= main_~c~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 15:03:03,960 INFO L290 TraceCheckUtils]: 32: Hoare triple {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !false; {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 15:03:03,960 INFO L272 TraceCheckUtils]: 33: Hoare triple {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10236#true} is VALID [2022-04-15 15:03:03,960 INFO L290 TraceCheckUtils]: 34: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-15 15:03:03,960 INFO L290 TraceCheckUtils]: 35: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-15 15:03:03,960 INFO L290 TraceCheckUtils]: 36: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-15 15:03:03,961 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {10236#true} {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #102#return; {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 15:03:03,961 INFO L272 TraceCheckUtils]: 38: Hoare triple {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10236#true} is VALID [2022-04-15 15:03:03,961 INFO L290 TraceCheckUtils]: 39: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-15 15:03:03,961 INFO L290 TraceCheckUtils]: 40: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-15 15:03:03,961 INFO L290 TraceCheckUtils]: 41: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-15 15:03:03,962 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10236#true} {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #104#return; {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 15:03:03,962 INFO L272 TraceCheckUtils]: 43: Hoare triple {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10236#true} is VALID [2022-04-15 15:03:03,962 INFO L290 TraceCheckUtils]: 44: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-15 15:03:03,963 INFO L290 TraceCheckUtils]: 45: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-15 15:03:03,963 INFO L290 TraceCheckUtils]: 46: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-15 15:03:03,963 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10236#true} {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #106#return; {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 15:03:03,963 INFO L272 TraceCheckUtils]: 48: Hoare triple {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {10236#true} is VALID [2022-04-15 15:03:03,964 INFO L290 TraceCheckUtils]: 49: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-15 15:03:03,964 INFO L290 TraceCheckUtils]: 50: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-15 15:03:03,964 INFO L290 TraceCheckUtils]: 51: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-15 15:03:03,964 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10236#true} {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #108#return; {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 15:03:03,965 INFO L290 TraceCheckUtils]: 53: Hoare triple {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 15:03:03,966 INFO L290 TraceCheckUtils]: 54: Hoare triple {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !false; {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 15:03:03,966 INFO L272 TraceCheckUtils]: 55: Hoare triple {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10236#true} is VALID [2022-04-15 15:03:03,966 INFO L290 TraceCheckUtils]: 56: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-15 15:03:03,966 INFO L290 TraceCheckUtils]: 57: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-15 15:03:03,966 INFO L290 TraceCheckUtils]: 58: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-15 15:03:03,967 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10236#true} {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #102#return; {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 15:03:03,967 INFO L272 TraceCheckUtils]: 60: Hoare triple {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10236#true} is VALID [2022-04-15 15:03:03,967 INFO L290 TraceCheckUtils]: 61: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-15 15:03:03,967 INFO L290 TraceCheckUtils]: 62: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-15 15:03:03,967 INFO L290 TraceCheckUtils]: 63: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-15 15:03:03,968 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {10236#true} {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #104#return; {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 15:03:03,968 INFO L272 TraceCheckUtils]: 65: Hoare triple {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10236#true} is VALID [2022-04-15 15:03:03,968 INFO L290 TraceCheckUtils]: 66: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-15 15:03:03,968 INFO L290 TraceCheckUtils]: 67: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-15 15:03:03,968 INFO L290 TraceCheckUtils]: 68: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-15 15:03:03,969 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {10236#true} {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #106#return; {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 15:03:03,970 INFO L272 TraceCheckUtils]: 70: Hoare triple {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {10459#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:03:03,970 INFO L290 TraceCheckUtils]: 71: Hoare triple {10459#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10463#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:03:03,970 INFO L290 TraceCheckUtils]: 72: Hoare triple {10463#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10237#false} is VALID [2022-04-15 15:03:03,971 INFO L290 TraceCheckUtils]: 73: Hoare triple {10237#false} assume !false; {10237#false} is VALID [2022-04-15 15:03:03,971 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-04-15 15:03:03,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:03:04,379 INFO L290 TraceCheckUtils]: 73: Hoare triple {10237#false} assume !false; {10237#false} is VALID [2022-04-15 15:03:04,379 INFO L290 TraceCheckUtils]: 72: Hoare triple {10463#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10237#false} is VALID [2022-04-15 15:03:04,380 INFO L290 TraceCheckUtils]: 71: Hoare triple {10459#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10463#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:03:04,380 INFO L272 TraceCheckUtils]: 70: Hoare triple {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {10459#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:03:04,381 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {10236#true} {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} #106#return; {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-15 15:03:04,381 INFO L290 TraceCheckUtils]: 68: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-15 15:03:04,381 INFO L290 TraceCheckUtils]: 67: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-15 15:03:04,381 INFO L290 TraceCheckUtils]: 66: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-15 15:03:04,381 INFO L272 TraceCheckUtils]: 65: Hoare triple {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10236#true} is VALID [2022-04-15 15:03:04,386 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {10236#true} {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} #104#return; {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-15 15:03:04,386 INFO L290 TraceCheckUtils]: 63: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-15 15:03:04,387 INFO L290 TraceCheckUtils]: 62: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-15 15:03:04,387 INFO L290 TraceCheckUtils]: 61: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-15 15:03:04,387 INFO L272 TraceCheckUtils]: 60: Hoare triple {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10236#true} is VALID [2022-04-15 15:03:04,388 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10236#true} {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} #102#return; {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-15 15:03:04,388 INFO L290 TraceCheckUtils]: 58: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-15 15:03:04,388 INFO L290 TraceCheckUtils]: 57: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-15 15:03:04,388 INFO L290 TraceCheckUtils]: 56: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-15 15:03:04,388 INFO L272 TraceCheckUtils]: 55: Hoare triple {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10236#true} is VALID [2022-04-15 15:03:04,388 INFO L290 TraceCheckUtils]: 54: Hoare triple {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} assume !false; {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-15 15:03:04,391 INFO L290 TraceCheckUtils]: 53: Hoare triple {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-15 15:03:04,392 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10236#true} {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} #108#return; {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-15 15:03:04,392 INFO L290 TraceCheckUtils]: 51: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-15 15:03:04,392 INFO L290 TraceCheckUtils]: 50: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-15 15:03:04,392 INFO L290 TraceCheckUtils]: 49: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-15 15:03:04,392 INFO L272 TraceCheckUtils]: 48: Hoare triple {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {10236#true} is VALID [2022-04-15 15:03:04,393 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10236#true} {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} #106#return; {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-15 15:03:04,393 INFO L290 TraceCheckUtils]: 46: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-15 15:03:04,393 INFO L290 TraceCheckUtils]: 45: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-15 15:03:04,393 INFO L290 TraceCheckUtils]: 44: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-15 15:03:04,393 INFO L272 TraceCheckUtils]: 43: Hoare triple {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10236#true} is VALID [2022-04-15 15:03:04,394 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10236#true} {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} #104#return; {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-15 15:03:04,394 INFO L290 TraceCheckUtils]: 41: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-15 15:03:04,394 INFO L290 TraceCheckUtils]: 40: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-15 15:03:04,394 INFO L290 TraceCheckUtils]: 39: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-15 15:03:04,394 INFO L272 TraceCheckUtils]: 38: Hoare triple {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10236#true} is VALID [2022-04-15 15:03:04,394 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {10236#true} {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} #102#return; {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-15 15:03:04,395 INFO L290 TraceCheckUtils]: 36: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-15 15:03:04,395 INFO L290 TraceCheckUtils]: 35: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-15 15:03:04,395 INFO L290 TraceCheckUtils]: 34: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-15 15:03:04,395 INFO L272 TraceCheckUtils]: 33: Hoare triple {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10236#true} is VALID [2022-04-15 15:03:04,395 INFO L290 TraceCheckUtils]: 32: Hoare triple {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} assume !false; {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-15 15:03:04,395 INFO L290 TraceCheckUtils]: 31: Hoare triple {10236#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-15 15:03:04,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {10236#true} assume !false; {10236#true} is VALID [2022-04-15 15:03:04,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {10236#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {10236#true} is VALID [2022-04-15 15:03:04,396 INFO L290 TraceCheckUtils]: 28: Hoare triple {10236#true} assume !false; {10236#true} is VALID [2022-04-15 15:03:04,396 INFO L290 TraceCheckUtils]: 27: Hoare triple {10236#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {10236#true} is VALID [2022-04-15 15:03:04,396 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10236#true} {10236#true} #100#return; {10236#true} is VALID [2022-04-15 15:03:04,396 INFO L290 TraceCheckUtils]: 25: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-15 15:03:04,396 INFO L290 TraceCheckUtils]: 24: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-15 15:03:04,396 INFO L290 TraceCheckUtils]: 23: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-15 15:03:04,396 INFO L272 TraceCheckUtils]: 22: Hoare triple {10236#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10236#true} is VALID [2022-04-15 15:03:04,396 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10236#true} {10236#true} #98#return; {10236#true} is VALID [2022-04-15 15:03:04,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-15 15:03:04,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-15 15:03:04,396 INFO L290 TraceCheckUtils]: 18: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-15 15:03:04,396 INFO L272 TraceCheckUtils]: 17: Hoare triple {10236#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10236#true} is VALID [2022-04-15 15:03:04,396 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10236#true} {10236#true} #96#return; {10236#true} is VALID [2022-04-15 15:03:04,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-15 15:03:04,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-15 15:03:04,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-15 15:03:04,397 INFO L272 TraceCheckUtils]: 12: Hoare triple {10236#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {10236#true} is VALID [2022-04-15 15:03:04,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {10236#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10236#true} is VALID [2022-04-15 15:03:04,397 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10236#true} {10236#true} #94#return; {10236#true} is VALID [2022-04-15 15:03:04,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-15 15:03:04,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-15 15:03:04,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-15 15:03:04,397 INFO L272 TraceCheckUtils]: 6: Hoare triple {10236#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {10236#true} is VALID [2022-04-15 15:03:04,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {10236#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {10236#true} is VALID [2022-04-15 15:03:04,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {10236#true} call #t~ret6 := main(); {10236#true} is VALID [2022-04-15 15:03:04,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10236#true} {10236#true} #112#return; {10236#true} is VALID [2022-04-15 15:03:04,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-15 15:03:04,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {10236#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {10236#true} is VALID [2022-04-15 15:03:04,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {10236#true} call ULTIMATE.init(); {10236#true} is VALID [2022-04-15 15:03:04,397 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-04-15 15:03:04,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:03:04,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088943212] [2022-04-15 15:03:04,398 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:03:04,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823738873] [2022-04-15 15:03:04,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823738873] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 15:03:04,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 15:03:04,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 14 [2022-04-15 15:03:04,398 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:03:04,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [145984060] [2022-04-15 15:03:04,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [145984060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:03:04,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:03:04,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 15:03:04,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053447021] [2022-04-15 15:03:04,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:03:04,399 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 74 [2022-04-15 15:03:04,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:03:04,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-15 15:03:04,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:03:04,438 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 15:03:04,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:03:04,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 15:03:04,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-15 15:03:04,439 INFO L87 Difference]: Start difference. First operand 208 states and 296 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-15 15:03:05,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:03:05,308 INFO L93 Difference]: Finished difference Result 214 states and 301 transitions. [2022-04-15 15:03:05,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 15:03:05,308 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 74 [2022-04-15 15:03:05,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:03:05,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-15 15:03:05,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-15 15:03:05,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-15 15:03:05,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-15 15:03:05,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-15 15:03:05,365 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-15 15:03:05,370 INFO L225 Difference]: With dead ends: 214 [2022-04-15 15:03:05,370 INFO L226 Difference]: Without dead ends: 212 [2022-04-15 15:03:05,370 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-04-15 15:03:05,370 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 9 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:03:05,371 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 166 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:03:05,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-04-15 15:03:05,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2022-04-15 15:03:05,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:03:05,936 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-15 15:03:05,936 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-15 15:03:05,936 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-15 15:03:05,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:03:05,943 INFO L93 Difference]: Finished difference Result 212 states and 299 transitions. [2022-04-15 15:03:05,943 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 299 transitions. [2022-04-15 15:03:05,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:03:05,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:03:05,944 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-15 15:03:05,945 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-15 15:03:05,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:03:05,951 INFO L93 Difference]: Finished difference Result 212 states and 299 transitions. [2022-04-15 15:03:05,951 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 299 transitions. [2022-04-15 15:03:05,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:03:05,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:03:05,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:03:05,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:03:05,952 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-15 15:03:05,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 299 transitions. [2022-04-15 15:03:05,959 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 299 transitions. Word has length 74 [2022-04-15 15:03:05,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:03:05,959 INFO L478 AbstractCegarLoop]: Abstraction has 212 states and 299 transitions. [2022-04-15 15:03:05,959 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-15 15:03:05,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 212 states and 299 transitions. [2022-04-15 15:03:06,516 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-15 15:03:06,516 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 299 transitions. [2022-04-15 15:03:06,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-15 15:03:06,517 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:03:06,517 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:03:06,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 15:03:06,717 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-15 15:03:06,718 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:03:06,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:03:06,718 INFO L85 PathProgramCache]: Analyzing trace with hash -2089538094, now seen corresponding path program 1 times [2022-04-15 15:03:06,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:03:06,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1948916959] [2022-04-15 15:03:06,718 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:03:06,719 INFO L85 PathProgramCache]: Analyzing trace with hash -2089538094, now seen corresponding path program 2 times [2022-04-15 15:03:06,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:03:06,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126530945] [2022-04-15 15:03:06,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:03:06,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:03:06,732 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:03:06,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [875681725] [2022-04-15 15:03:06,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:03:06,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:03:06,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:03:06,733 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:03:06,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 15:03:06,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:03:06,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:03:06,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 15:03:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:03:06,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:03:07,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {11971#true} call ULTIMATE.init(); {11971#true} is VALID [2022-04-15 15:03:07,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {11971#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {11971#true} is VALID [2022-04-15 15:03:07,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-15 15:03:07,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11971#true} {11971#true} #112#return; {11971#true} is VALID [2022-04-15 15:03:07,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {11971#true} call #t~ret6 := main(); {11971#true} is VALID [2022-04-15 15:03:07,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {11971#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {11971#true} is VALID [2022-04-15 15:03:07,140 INFO L272 TraceCheckUtils]: 6: Hoare triple {11971#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {11971#true} is VALID [2022-04-15 15:03:07,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-15 15:03:07,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-15 15:03:07,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-15 15:03:07,140 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11971#true} {11971#true} #94#return; {11971#true} is VALID [2022-04-15 15:03:07,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {11971#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11971#true} is VALID [2022-04-15 15:03:07,140 INFO L272 TraceCheckUtils]: 12: Hoare triple {11971#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {11971#true} is VALID [2022-04-15 15:03:07,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {11971#true} ~cond := #in~cond; {12015#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 15:03:07,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {12015#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {12019#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 15:03:07,141 INFO L290 TraceCheckUtils]: 15: Hoare triple {12019#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {12019#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 15:03:07,141 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12019#(not (= |assume_abort_if_not_#in~cond| 0))} {11971#true} #96#return; {12026#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 15:03:07,141 INFO L272 TraceCheckUtils]: 17: Hoare triple {12026#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11971#true} is VALID [2022-04-15 15:03:07,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-15 15:03:07,141 INFO L290 TraceCheckUtils]: 19: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-15 15:03:07,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-15 15:03:07,142 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11971#true} {12026#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #98#return; {12026#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 15:03:07,142 INFO L272 TraceCheckUtils]: 22: Hoare triple {12026#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11971#true} is VALID [2022-04-15 15:03:07,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-15 15:03:07,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-15 15:03:07,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-15 15:03:07,142 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11971#true} {12026#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #100#return; {12026#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 15:03:07,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {12026#(and (<= 0 main_~y~0) (<= main_~y~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {12060#(<= main_~b~0 2)} is VALID [2022-04-15 15:03:07,143 INFO L290 TraceCheckUtils]: 28: Hoare triple {12060#(<= main_~b~0 2)} assume !false; {12060#(<= main_~b~0 2)} is VALID [2022-04-15 15:03:07,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {12060#(<= main_~b~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12060#(<= main_~b~0 2)} is VALID [2022-04-15 15:03:07,144 INFO L290 TraceCheckUtils]: 30: Hoare triple {12060#(<= main_~b~0 2)} assume !false; {12060#(<= main_~b~0 2)} is VALID [2022-04-15 15:03:07,144 INFO L290 TraceCheckUtils]: 31: Hoare triple {12060#(<= main_~b~0 2)} assume !(~c~0 >= ~b~0); {12073#(and (<= main_~b~0 2) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-15 15:03:07,145 INFO L290 TraceCheckUtils]: 32: Hoare triple {12073#(and (<= main_~b~0 2) (not (<= main_~b~0 main_~c~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {12077#(and (< main_~b~0 main_~a~0) (< main_~b~0 2))} is VALID [2022-04-15 15:03:07,145 INFO L290 TraceCheckUtils]: 33: Hoare triple {12077#(and (< main_~b~0 main_~a~0) (< main_~b~0 2))} assume !false; {12077#(and (< main_~b~0 main_~a~0) (< main_~b~0 2))} is VALID [2022-04-15 15:03:07,145 INFO L290 TraceCheckUtils]: 34: Hoare triple {12077#(and (< main_~b~0 main_~a~0) (< main_~b~0 2))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12084#(and (< main_~b~0 main_~c~0) (< main_~b~0 2))} is VALID [2022-04-15 15:03:07,146 INFO L290 TraceCheckUtils]: 35: Hoare triple {12084#(and (< main_~b~0 main_~c~0) (< main_~b~0 2))} assume !false; {12084#(and (< main_~b~0 main_~c~0) (< main_~b~0 2))} is VALID [2022-04-15 15:03:07,147 INFO L290 TraceCheckUtils]: 36: Hoare triple {12084#(and (< main_~b~0 main_~c~0) (< main_~b~0 2))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} is VALID [2022-04-15 15:03:07,148 INFO L290 TraceCheckUtils]: 37: Hoare triple {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} assume !false; {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} is VALID [2022-04-15 15:03:07,148 INFO L272 TraceCheckUtils]: 38: Hoare triple {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11971#true} is VALID [2022-04-15 15:03:07,148 INFO L290 TraceCheckUtils]: 39: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-15 15:03:07,148 INFO L290 TraceCheckUtils]: 40: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-15 15:03:07,148 INFO L290 TraceCheckUtils]: 41: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-15 15:03:07,149 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11971#true} {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} #102#return; {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} is VALID [2022-04-15 15:03:07,149 INFO L272 TraceCheckUtils]: 43: Hoare triple {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11971#true} is VALID [2022-04-15 15:03:07,149 INFO L290 TraceCheckUtils]: 44: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-15 15:03:07,149 INFO L290 TraceCheckUtils]: 45: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-15 15:03:07,149 INFO L290 TraceCheckUtils]: 46: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-15 15:03:07,150 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11971#true} {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} #104#return; {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} is VALID [2022-04-15 15:03:07,150 INFO L272 TraceCheckUtils]: 48: Hoare triple {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11971#true} is VALID [2022-04-15 15:03:07,150 INFO L290 TraceCheckUtils]: 49: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-15 15:03:07,150 INFO L290 TraceCheckUtils]: 50: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-15 15:03:07,150 INFO L290 TraceCheckUtils]: 51: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-15 15:03:07,151 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11971#true} {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} #106#return; {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} is VALID [2022-04-15 15:03:07,151 INFO L272 TraceCheckUtils]: 53: Hoare triple {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {11971#true} is VALID [2022-04-15 15:03:07,151 INFO L290 TraceCheckUtils]: 54: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-15 15:03:07,151 INFO L290 TraceCheckUtils]: 55: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-15 15:03:07,151 INFO L290 TraceCheckUtils]: 56: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-15 15:03:07,155 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {11971#true} {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} #108#return; {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} is VALID [2022-04-15 15:03:07,156 INFO L290 TraceCheckUtils]: 58: Hoare triple {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} assume !(~c~0 >= 2 * ~v~0); {11972#false} is VALID [2022-04-15 15:03:07,156 INFO L290 TraceCheckUtils]: 59: Hoare triple {11972#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {11972#false} is VALID [2022-04-15 15:03:07,156 INFO L290 TraceCheckUtils]: 60: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-15 15:03:07,156 INFO L290 TraceCheckUtils]: 61: Hoare triple {11972#false} assume !(~c~0 >= ~b~0); {11972#false} is VALID [2022-04-15 15:03:07,156 INFO L290 TraceCheckUtils]: 62: Hoare triple {11972#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {11972#false} is VALID [2022-04-15 15:03:07,157 INFO L290 TraceCheckUtils]: 63: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-15 15:03:07,157 INFO L290 TraceCheckUtils]: 64: Hoare triple {11972#false} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11972#false} is VALID [2022-04-15 15:03:07,157 INFO L290 TraceCheckUtils]: 65: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-15 15:03:07,157 INFO L290 TraceCheckUtils]: 66: Hoare triple {11972#false} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {11972#false} is VALID [2022-04-15 15:03:07,157 INFO L290 TraceCheckUtils]: 67: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-15 15:03:07,157 INFO L272 TraceCheckUtils]: 68: Hoare triple {11972#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11972#false} is VALID [2022-04-15 15:03:07,157 INFO L290 TraceCheckUtils]: 69: Hoare triple {11972#false} ~cond := #in~cond; {11972#false} is VALID [2022-04-15 15:03:07,157 INFO L290 TraceCheckUtils]: 70: Hoare triple {11972#false} assume 0 == ~cond; {11972#false} is VALID [2022-04-15 15:03:07,157 INFO L290 TraceCheckUtils]: 71: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-15 15:03:07,157 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-04-15 15:03:07,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:03:07,789 INFO L290 TraceCheckUtils]: 71: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-15 15:03:07,790 INFO L290 TraceCheckUtils]: 70: Hoare triple {11972#false} assume 0 == ~cond; {11972#false} is VALID [2022-04-15 15:03:07,790 INFO L290 TraceCheckUtils]: 69: Hoare triple {11972#false} ~cond := #in~cond; {11972#false} is VALID [2022-04-15 15:03:07,790 INFO L272 TraceCheckUtils]: 68: Hoare triple {11972#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11972#false} is VALID [2022-04-15 15:03:07,790 INFO L290 TraceCheckUtils]: 67: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-15 15:03:07,790 INFO L290 TraceCheckUtils]: 66: Hoare triple {11972#false} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {11972#false} is VALID [2022-04-15 15:03:07,790 INFO L290 TraceCheckUtils]: 65: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-15 15:03:07,790 INFO L290 TraceCheckUtils]: 64: Hoare triple {11972#false} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11972#false} is VALID [2022-04-15 15:03:07,790 INFO L290 TraceCheckUtils]: 63: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-15 15:03:07,790 INFO L290 TraceCheckUtils]: 62: Hoare triple {11972#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {11972#false} is VALID [2022-04-15 15:03:07,790 INFO L290 TraceCheckUtils]: 61: Hoare triple {11972#false} assume !(~c~0 >= ~b~0); {11972#false} is VALID [2022-04-15 15:03:07,790 INFO L290 TraceCheckUtils]: 60: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-15 15:03:07,790 INFO L290 TraceCheckUtils]: 59: Hoare triple {11972#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {11972#false} is VALID [2022-04-15 15:03:07,791 INFO L290 TraceCheckUtils]: 58: Hoare triple {12236#(<= (* main_~v~0 2) main_~c~0)} assume !(~c~0 >= 2 * ~v~0); {11972#false} is VALID [2022-04-15 15:03:07,791 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {11971#true} {12236#(<= (* main_~v~0 2) main_~c~0)} #108#return; {12236#(<= (* main_~v~0 2) main_~c~0)} is VALID [2022-04-15 15:03:07,791 INFO L290 TraceCheckUtils]: 56: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-15 15:03:07,791 INFO L290 TraceCheckUtils]: 55: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-15 15:03:07,791 INFO L290 TraceCheckUtils]: 54: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-15 15:03:07,791 INFO L272 TraceCheckUtils]: 53: Hoare triple {12236#(<= (* main_~v~0 2) main_~c~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {11971#true} is VALID [2022-04-15 15:03:07,792 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11971#true} {12236#(<= (* main_~v~0 2) main_~c~0)} #106#return; {12236#(<= (* main_~v~0 2) main_~c~0)} is VALID [2022-04-15 15:03:07,792 INFO L290 TraceCheckUtils]: 51: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-15 15:03:07,792 INFO L290 TraceCheckUtils]: 50: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-15 15:03:07,793 INFO L290 TraceCheckUtils]: 49: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-15 15:03:07,793 INFO L272 TraceCheckUtils]: 48: Hoare triple {12236#(<= (* main_~v~0 2) main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11971#true} is VALID [2022-04-15 15:03:07,794 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11971#true} {12236#(<= (* main_~v~0 2) main_~c~0)} #104#return; {12236#(<= (* main_~v~0 2) main_~c~0)} is VALID [2022-04-15 15:03:07,794 INFO L290 TraceCheckUtils]: 46: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-15 15:03:07,794 INFO L290 TraceCheckUtils]: 45: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-15 15:03:07,794 INFO L290 TraceCheckUtils]: 44: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-15 15:03:07,795 INFO L272 TraceCheckUtils]: 43: Hoare triple {12236#(<= (* main_~v~0 2) main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11971#true} is VALID [2022-04-15 15:03:07,795 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11971#true} {12236#(<= (* main_~v~0 2) main_~c~0)} #102#return; {12236#(<= (* main_~v~0 2) main_~c~0)} is VALID [2022-04-15 15:03:07,795 INFO L290 TraceCheckUtils]: 41: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-15 15:03:07,795 INFO L290 TraceCheckUtils]: 40: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-15 15:03:07,795 INFO L290 TraceCheckUtils]: 39: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-15 15:03:07,795 INFO L272 TraceCheckUtils]: 38: Hoare triple {12236#(<= (* main_~v~0 2) main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11971#true} is VALID [2022-04-15 15:03:07,796 INFO L290 TraceCheckUtils]: 37: Hoare triple {12236#(<= (* main_~v~0 2) main_~c~0)} assume !false; {12236#(<= (* main_~v~0 2) main_~c~0)} is VALID [2022-04-15 15:03:07,796 INFO L290 TraceCheckUtils]: 36: Hoare triple {12303#(<= main_~b~0 (div main_~c~0 2))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {12236#(<= (* main_~v~0 2) main_~c~0)} is VALID [2022-04-15 15:03:07,797 INFO L290 TraceCheckUtils]: 35: Hoare triple {12303#(<= main_~b~0 (div main_~c~0 2))} assume !false; {12303#(<= main_~b~0 (div main_~c~0 2))} is VALID [2022-04-15 15:03:07,797 INFO L290 TraceCheckUtils]: 34: Hoare triple {12310#(<= main_~b~0 (+ (div (+ (- 2) main_~a~0) 2) 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12303#(<= main_~b~0 (div main_~c~0 2))} is VALID [2022-04-15 15:03:07,797 INFO L290 TraceCheckUtils]: 33: Hoare triple {12310#(<= main_~b~0 (+ (div (+ (- 2) main_~a~0) 2) 1))} assume !false; {12310#(<= main_~b~0 (+ (div (+ (- 2) main_~a~0) 2) 1))} is VALID [2022-04-15 15:03:07,798 INFO L290 TraceCheckUtils]: 32: Hoare triple {12317#(<= main_~c~0 (+ (div (+ main_~b~0 (- 4)) 2) 2))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {12310#(<= main_~b~0 (+ (div (+ (- 2) main_~a~0) 2) 1))} is VALID [2022-04-15 15:03:07,799 INFO L290 TraceCheckUtils]: 31: Hoare triple {12060#(<= main_~b~0 2)} assume !(~c~0 >= ~b~0); {12317#(<= main_~c~0 (+ (div (+ main_~b~0 (- 4)) 2) 2))} is VALID [2022-04-15 15:03:07,799 INFO L290 TraceCheckUtils]: 30: Hoare triple {12060#(<= main_~b~0 2)} assume !false; {12060#(<= main_~b~0 2)} is VALID [2022-04-15 15:03:07,799 INFO L290 TraceCheckUtils]: 29: Hoare triple {12060#(<= main_~b~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12060#(<= main_~b~0 2)} is VALID [2022-04-15 15:03:07,800 INFO L290 TraceCheckUtils]: 28: Hoare triple {12060#(<= main_~b~0 2)} assume !false; {12060#(<= main_~b~0 2)} is VALID [2022-04-15 15:03:07,800 INFO L290 TraceCheckUtils]: 27: Hoare triple {12333#(<= main_~y~0 2)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {12060#(<= main_~b~0 2)} is VALID [2022-04-15 15:03:07,800 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11971#true} {12333#(<= main_~y~0 2)} #100#return; {12333#(<= main_~y~0 2)} is VALID [2022-04-15 15:03:07,800 INFO L290 TraceCheckUtils]: 25: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-15 15:03:07,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-15 15:03:07,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-15 15:03:07,800 INFO L272 TraceCheckUtils]: 22: Hoare triple {12333#(<= main_~y~0 2)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11971#true} is VALID [2022-04-15 15:03:07,801 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11971#true} {12333#(<= main_~y~0 2)} #98#return; {12333#(<= main_~y~0 2)} is VALID [2022-04-15 15:03:07,801 INFO L290 TraceCheckUtils]: 20: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-15 15:03:07,801 INFO L290 TraceCheckUtils]: 19: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-15 15:03:07,801 INFO L290 TraceCheckUtils]: 18: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-15 15:03:07,801 INFO L272 TraceCheckUtils]: 17: Hoare triple {12333#(<= main_~y~0 2)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11971#true} is VALID [2022-04-15 15:03:07,802 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12019#(not (= |assume_abort_if_not_#in~cond| 0))} {11971#true} #96#return; {12333#(<= main_~y~0 2)} is VALID [2022-04-15 15:03:07,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {12019#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {12019#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 15:03:07,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {12376#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {12019#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 15:03:07,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {11971#true} ~cond := #in~cond; {12376#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 15:03:07,802 INFO L272 TraceCheckUtils]: 12: Hoare triple {11971#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {11971#true} is VALID [2022-04-15 15:03:07,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {11971#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11971#true} is VALID [2022-04-15 15:03:07,803 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11971#true} {11971#true} #94#return; {11971#true} is VALID [2022-04-15 15:03:07,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-15 15:03:07,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-15 15:03:07,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-15 15:03:07,803 INFO L272 TraceCheckUtils]: 6: Hoare triple {11971#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {11971#true} is VALID [2022-04-15 15:03:07,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {11971#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {11971#true} is VALID [2022-04-15 15:03:07,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {11971#true} call #t~ret6 := main(); {11971#true} is VALID [2022-04-15 15:03:07,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11971#true} {11971#true} #112#return; {11971#true} is VALID [2022-04-15 15:03:07,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-15 15:03:07,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {11971#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {11971#true} is VALID [2022-04-15 15:03:07,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {11971#true} call ULTIMATE.init(); {11971#true} is VALID [2022-04-15 15:03:07,803 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-04-15 15:03:07,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:03:07,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126530945] [2022-04-15 15:03:07,804 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:03:07,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875681725] [2022-04-15 15:03:07,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875681725] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:03:07,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:03:07,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-15 15:03:07,804 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:03:07,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1948916959] [2022-04-15 15:03:07,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1948916959] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:03:07,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:03:07,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 15:03:07,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145159475] [2022-04-15 15:03:07,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:03:07,805 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 72 [2022-04-15 15:03:07,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:03:07,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 15:03:07,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:03:07,859 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 15:03:07,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:03:07,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 15:03:07,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-04-15 15:03:07,860 INFO L87 Difference]: Start difference. First operand 212 states and 299 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 15:03:09,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:03:09,335 INFO L93 Difference]: Finished difference Result 306 states and 427 transitions. [2022-04-15 15:03:09,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 15:03:09,335 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 72 [2022-04-15 15:03:09,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:03:09,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 15:03:09,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2022-04-15 15:03:09,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 15:03:09,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2022-04-15 15:03:09,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 112 transitions. [2022-04-15 15:03:09,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:03:09,456 INFO L225 Difference]: With dead ends: 306 [2022-04-15 15:03:09,456 INFO L226 Difference]: Without dead ends: 204 [2022-04-15 15:03:09,459 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2022-04-15 15:03:09,459 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 39 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 15:03:09,459 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 253 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 15:03:09,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-04-15 15:03:10,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 200. [2022-04-15 15:03:10,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:03:10,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 204 states. Second operand has 200 states, 107 states have (on average 1.1682242990654206) internal successors, (125), 113 states have internal predecessors, (125), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-15 15:03:10,131 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand has 200 states, 107 states have (on average 1.1682242990654206) internal successors, (125), 113 states have internal predecessors, (125), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-15 15:03:10,131 INFO L87 Difference]: Start difference. First operand 204 states. Second operand has 200 states, 107 states have (on average 1.1682242990654206) internal successors, (125), 113 states have internal predecessors, (125), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-15 15:03:10,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:03:10,137 INFO L93 Difference]: Finished difference Result 204 states and 285 transitions. [2022-04-15 15:03:10,137 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 285 transitions. [2022-04-15 15:03:10,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:03:10,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:03:10,139 INFO L74 IsIncluded]: Start isIncluded. First operand has 200 states, 107 states have (on average 1.1682242990654206) internal successors, (125), 113 states have internal predecessors, (125), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) Second operand 204 states. [2022-04-15 15:03:10,139 INFO L87 Difference]: Start difference. First operand has 200 states, 107 states have (on average 1.1682242990654206) internal successors, (125), 113 states have internal predecessors, (125), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) Second operand 204 states. [2022-04-15 15:03:10,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:03:10,145 INFO L93 Difference]: Finished difference Result 204 states and 285 transitions. [2022-04-15 15:03:10,145 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 285 transitions. [2022-04-15 15:03:10,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:03:10,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:03:10,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:03:10,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:03:10,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 107 states have (on average 1.1682242990654206) internal successors, (125), 113 states have internal predecessors, (125), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-15 15:03:10,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 281 transitions. [2022-04-15 15:03:10,153 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 281 transitions. Word has length 72 [2022-04-15 15:03:10,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:03:10,153 INFO L478 AbstractCegarLoop]: Abstraction has 200 states and 281 transitions. [2022-04-15 15:03:10,153 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 15:03:10,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 200 states and 281 transitions. [2022-04-15 15:03:10,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:03:10,628 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 281 transitions. [2022-04-15 15:03:10,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-15 15:03:10,629 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:03:10,629 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:03:10,645 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-15 15:03:10,829 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-15 15:03:10,830 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:03:10,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:03:10,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1679616651, now seen corresponding path program 1 times [2022-04-15 15:03:10,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:03:10,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [749738975] [2022-04-15 15:03:10,831 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:03:10,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1679616651, now seen corresponding path program 2 times [2022-04-15 15:03:10,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:03:10,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918901015] [2022-04-15 15:03:10,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:03:10,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:03:10,844 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:03:10,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [339617084] [2022-04-15 15:03:10,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:03:10,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:03:10,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:03:10,845 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:03:10,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 15:03:10,896 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:03:10,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:03:10,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 63 conjunts are in the unsatisfiable core [2022-04-15 15:03:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:03:10,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:03:12,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {13852#true} call ULTIMATE.init(); {13852#true} is VALID [2022-04-15 15:03:12,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {13852#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {13852#true} is VALID [2022-04-15 15:03:12,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-15 15:03:12,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13852#true} {13852#true} #112#return; {13852#true} is VALID [2022-04-15 15:03:12,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {13852#true} call #t~ret6 := main(); {13852#true} is VALID [2022-04-15 15:03:12,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {13852#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {13852#true} is VALID [2022-04-15 15:03:12,220 INFO L272 TraceCheckUtils]: 6: Hoare triple {13852#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {13852#true} is VALID [2022-04-15 15:03:12,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {13852#true} ~cond := #in~cond; {13878#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 15:03:12,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {13878#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {13882#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 15:03:12,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {13882#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {13882#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 15:03:12,222 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13882#(not (= |assume_abort_if_not_#in~cond| 0))} {13852#true} #94#return; {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 15:03:12,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 15:03:12,222 INFO L272 TraceCheckUtils]: 12: Hoare triple {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {13852#true} is VALID [2022-04-15 15:03:12,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-15 15:03:12,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-15 15:03:12,222 INFO L290 TraceCheckUtils]: 15: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-15 15:03:12,223 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13852#true} {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #96#return; {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 15:03:12,223 INFO L272 TraceCheckUtils]: 17: Hoare triple {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {13852#true} is VALID [2022-04-15 15:03:12,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-15 15:03:12,223 INFO L290 TraceCheckUtils]: 19: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-15 15:03:12,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-15 15:03:12,223 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {13852#true} {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #98#return; {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 15:03:12,223 INFO L272 TraceCheckUtils]: 22: Hoare triple {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {13852#true} is VALID [2022-04-15 15:03:12,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-15 15:03:12,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-15 15:03:12,224 INFO L290 TraceCheckUtils]: 25: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-15 15:03:12,224 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {13852#true} {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #100#return; {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 15:03:12,224 INFO L290 TraceCheckUtils]: 27: Hoare triple {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {13941#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:03:12,225 INFO L290 TraceCheckUtils]: 28: Hoare triple {13941#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {13941#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:03:12,225 INFO L290 TraceCheckUtils]: 29: Hoare triple {13941#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {13948#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:03:12,226 INFO L290 TraceCheckUtils]: 30: Hoare triple {13948#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {13948#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:03:12,226 INFO L290 TraceCheckUtils]: 31: Hoare triple {13948#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:03:12,226 INFO L290 TraceCheckUtils]: 32: Hoare triple {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:03:12,226 INFO L272 TraceCheckUtils]: 33: Hoare triple {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13852#true} is VALID [2022-04-15 15:03:12,227 INFO L290 TraceCheckUtils]: 34: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-15 15:03:12,227 INFO L290 TraceCheckUtils]: 35: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-15 15:03:12,227 INFO L290 TraceCheckUtils]: 36: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-15 15:03:12,227 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {13852#true} {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #102#return; {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:03:12,228 INFO L272 TraceCheckUtils]: 38: Hoare triple {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13852#true} is VALID [2022-04-15 15:03:12,228 INFO L290 TraceCheckUtils]: 39: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-15 15:03:12,228 INFO L290 TraceCheckUtils]: 40: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-15 15:03:12,228 INFO L290 TraceCheckUtils]: 41: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-15 15:03:12,228 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {13852#true} {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #104#return; {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:03:12,228 INFO L272 TraceCheckUtils]: 43: Hoare triple {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13852#true} is VALID [2022-04-15 15:03:12,229 INFO L290 TraceCheckUtils]: 44: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-15 15:03:12,229 INFO L290 TraceCheckUtils]: 45: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-15 15:03:12,229 INFO L290 TraceCheckUtils]: 46: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-15 15:03:12,229 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13852#true} {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #106#return; {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:03:12,229 INFO L272 TraceCheckUtils]: 48: Hoare triple {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {13852#true} is VALID [2022-04-15 15:03:12,230 INFO L290 TraceCheckUtils]: 49: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-15 15:03:12,230 INFO L290 TraceCheckUtils]: 50: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-15 15:03:12,230 INFO L290 TraceCheckUtils]: 51: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-15 15:03:12,230 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13852#true} {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #108#return; {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:03:12,231 INFO L290 TraceCheckUtils]: 53: Hoare triple {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:03:12,231 INFO L290 TraceCheckUtils]: 54: Hoare triple {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:03:12,231 INFO L272 TraceCheckUtils]: 55: Hoare triple {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13852#true} is VALID [2022-04-15 15:03:12,231 INFO L290 TraceCheckUtils]: 56: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-15 15:03:12,232 INFO L290 TraceCheckUtils]: 57: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-15 15:03:12,232 INFO L290 TraceCheckUtils]: 58: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-15 15:03:12,232 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13852#true} {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #102#return; {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:03:12,232 INFO L272 TraceCheckUtils]: 60: Hoare triple {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13852#true} is VALID [2022-04-15 15:03:12,233 INFO L290 TraceCheckUtils]: 61: Hoare triple {13852#true} ~cond := #in~cond; {14047#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:03:12,233 INFO L290 TraceCheckUtils]: 62: Hoare triple {14047#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {14051#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:03:12,233 INFO L290 TraceCheckUtils]: 63: Hoare triple {14051#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14051#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:03:12,234 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14051#(not (= |__VERIFIER_assert_#in~cond| 0))} {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #104#return; {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:03:12,234 INFO L272 TraceCheckUtils]: 65: Hoare triple {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13852#true} is VALID [2022-04-15 15:03:12,234 INFO L290 TraceCheckUtils]: 66: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-15 15:03:12,234 INFO L290 TraceCheckUtils]: 67: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-15 15:03:12,234 INFO L290 TraceCheckUtils]: 68: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-15 15:03:12,235 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {13852#true} {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #106#return; {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:03:12,235 INFO L272 TraceCheckUtils]: 70: Hoare triple {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {13852#true} is VALID [2022-04-15 15:03:12,235 INFO L290 TraceCheckUtils]: 71: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-15 15:03:12,235 INFO L290 TraceCheckUtils]: 72: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-15 15:03:12,235 INFO L290 TraceCheckUtils]: 73: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-15 15:03:12,236 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13852#true} {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #108#return; {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:03:12,236 INFO L290 TraceCheckUtils]: 75: Hoare triple {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:03:12,237 INFO L290 TraceCheckUtils]: 76: Hoare triple {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {14094#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:03:12,238 INFO L290 TraceCheckUtils]: 77: Hoare triple {14094#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {14094#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:03:12,238 INFO L290 TraceCheckUtils]: 78: Hoare triple {14094#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (<= main_~x~0 2) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {14101#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (< main_~c~0 main_~b~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:03:12,239 INFO L290 TraceCheckUtils]: 79: Hoare triple {14101#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (< main_~c~0 main_~b~0) (<= main_~x~0 2) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {14105#(and (<= (* main_~y~0 2) main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (* main_~p~0 2) main_~q~0) 1) (< main_~x~0 (* main_~y~0 3)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (<= main_~x~0 2) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-15 15:03:12,240 INFO L290 TraceCheckUtils]: 80: Hoare triple {14105#(and (<= (* main_~y~0 2) main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (* main_~p~0 2) main_~q~0) 1) (< main_~x~0 (* main_~y~0 3)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (<= main_~x~0 2) (= (+ main_~s~0 (* main_~r~0 2)) 0))} assume !false; {14105#(and (<= (* main_~y~0 2) main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (* main_~p~0 2) main_~q~0) 1) (< main_~x~0 (* main_~y~0 3)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (<= main_~x~0 2) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-15 15:03:12,240 INFO L290 TraceCheckUtils]: 81: Hoare triple {14105#(and (<= (* main_~y~0 2) main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (* main_~p~0 2) main_~q~0) 1) (< main_~x~0 (* main_~y~0 3)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (<= main_~x~0 2) (= (+ main_~s~0 (* main_~r~0 2)) 0))} assume !(0 != ~b~0); {14112#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (* main_~p~0 2) main_~q~0) 1) (= main_~x~0 (* main_~y~0 2)) (< main_~x~0 (* main_~y~0 3)) (<= main_~x~0 2) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-15 15:03:12,241 INFO L272 TraceCheckUtils]: 82: Hoare triple {14112#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (* main_~p~0 2) main_~q~0) 1) (= main_~x~0 (* main_~y~0 2)) (< main_~x~0 (* main_~y~0 3)) (<= main_~x~0 2) (= (+ main_~s~0 (* main_~r~0 2)) 0))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {14116#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:03:12,241 INFO L290 TraceCheckUtils]: 83: Hoare triple {14116#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14120#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:03:12,242 INFO L290 TraceCheckUtils]: 84: Hoare triple {14120#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13853#false} is VALID [2022-04-15 15:03:12,242 INFO L290 TraceCheckUtils]: 85: Hoare triple {13853#false} assume !false; {13853#false} is VALID [2022-04-15 15:03:12,242 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 30 proven. 26 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-04-15 15:03:12,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:03:41,435 INFO L290 TraceCheckUtils]: 85: Hoare triple {13853#false} assume !false; {13853#false} is VALID [2022-04-15 15:03:41,436 INFO L290 TraceCheckUtils]: 84: Hoare triple {14120#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13853#false} is VALID [2022-04-15 15:03:41,436 INFO L290 TraceCheckUtils]: 83: Hoare triple {14116#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14120#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:03:41,437 INFO L272 TraceCheckUtils]: 82: Hoare triple {14136#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {14116#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:03:41,437 INFO L290 TraceCheckUtils]: 81: Hoare triple {14140#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !(0 != ~b~0); {14136#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 15:03:41,438 INFO L290 TraceCheckUtils]: 80: Hoare triple {14140#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !false; {14140#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-15 15:03:41,860 INFO L290 TraceCheckUtils]: 79: Hoare triple {14147#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {14140#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-15 15:03:41,860 INFO L290 TraceCheckUtils]: 78: Hoare triple {14151#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {14147#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:03:41,861 INFO L290 TraceCheckUtils]: 77: Hoare triple {14151#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {14151#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:03:42,299 INFO L290 TraceCheckUtils]: 76: Hoare triple {14158#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {14151#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:03:42,300 INFO L290 TraceCheckUtils]: 75: Hoare triple {14158#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= 2 * ~v~0); {14158#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:03:42,301 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13852#true} {14158#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #108#return; {14158#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:03:42,301 INFO L290 TraceCheckUtils]: 73: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-15 15:03:42,301 INFO L290 TraceCheckUtils]: 72: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-15 15:03:42,301 INFO L290 TraceCheckUtils]: 71: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-15 15:03:42,301 INFO L272 TraceCheckUtils]: 70: Hoare triple {14158#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {13852#true} is VALID [2022-04-15 15:03:42,302 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {13852#true} {14158#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #106#return; {14158#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:03:42,302 INFO L290 TraceCheckUtils]: 68: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-15 15:03:42,302 INFO L290 TraceCheckUtils]: 67: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-15 15:03:42,302 INFO L290 TraceCheckUtils]: 66: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-15 15:03:42,302 INFO L272 TraceCheckUtils]: 65: Hoare triple {14158#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13852#true} is VALID [2022-04-15 15:03:42,303 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14051#(not (= |__VERIFIER_assert_#in~cond| 0))} {14195#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {14158#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:03:42,303 INFO L290 TraceCheckUtils]: 63: Hoare triple {14051#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14051#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:03:42,303 INFO L290 TraceCheckUtils]: 62: Hoare triple {14205#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {14051#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:03:42,304 INFO L290 TraceCheckUtils]: 61: Hoare triple {13852#true} ~cond := #in~cond; {14205#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 15:03:42,304 INFO L272 TraceCheckUtils]: 60: Hoare triple {14195#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13852#true} is VALID [2022-04-15 15:03:42,304 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13852#true} {14195#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #102#return; {14195#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:03:42,305 INFO L290 TraceCheckUtils]: 58: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-15 15:03:42,305 INFO L290 TraceCheckUtils]: 57: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-15 15:03:42,305 INFO L290 TraceCheckUtils]: 56: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-15 15:03:42,305 INFO L272 TraceCheckUtils]: 55: Hoare triple {14195#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13852#true} is VALID [2022-04-15 15:03:42,305 INFO L290 TraceCheckUtils]: 54: Hoare triple {14195#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {14195#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:03:42,310 INFO L290 TraceCheckUtils]: 53: Hoare triple {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {14195#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:03:42,311 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13852#true} {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} #108#return; {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} is VALID [2022-04-15 15:03:42,311 INFO L290 TraceCheckUtils]: 51: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-15 15:03:42,311 INFO L290 TraceCheckUtils]: 50: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-15 15:03:42,311 INFO L290 TraceCheckUtils]: 49: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-15 15:03:42,311 INFO L272 TraceCheckUtils]: 48: Hoare triple {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {13852#true} is VALID [2022-04-15 15:03:42,312 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13852#true} {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} #106#return; {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} is VALID [2022-04-15 15:03:42,312 INFO L290 TraceCheckUtils]: 46: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-15 15:03:42,312 INFO L290 TraceCheckUtils]: 45: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-15 15:03:42,312 INFO L290 TraceCheckUtils]: 44: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-15 15:03:42,312 INFO L272 TraceCheckUtils]: 43: Hoare triple {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13852#true} is VALID [2022-04-15 15:03:42,313 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {13852#true} {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} #104#return; {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} is VALID [2022-04-15 15:03:42,313 INFO L290 TraceCheckUtils]: 41: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-15 15:03:42,313 INFO L290 TraceCheckUtils]: 40: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-15 15:03:42,313 INFO L290 TraceCheckUtils]: 39: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-15 15:03:42,313 INFO L272 TraceCheckUtils]: 38: Hoare triple {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13852#true} is VALID [2022-04-15 15:03:42,314 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {13852#true} {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} #102#return; {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} is VALID [2022-04-15 15:03:42,314 INFO L290 TraceCheckUtils]: 36: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-15 15:03:42,314 INFO L290 TraceCheckUtils]: 35: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-15 15:03:42,314 INFO L290 TraceCheckUtils]: 34: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-15 15:03:42,314 INFO L272 TraceCheckUtils]: 33: Hoare triple {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13852#true} is VALID [2022-04-15 15:03:42,314 INFO L290 TraceCheckUtils]: 32: Hoare triple {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} assume !false; {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} is VALID [2022-04-15 15:03:42,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {14297#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} is VALID [2022-04-15 15:03:42,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {14297#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} assume !false; {14297#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} is VALID [2022-04-15 15:03:42,316 INFO L290 TraceCheckUtils]: 29: Hoare triple {14304#(or (not (= main_~a~0 (* main_~b~0 2))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0 0) (* main_~y~0 main_~s~0))))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {14297#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} is VALID [2022-04-15 15:03:42,317 INFO L290 TraceCheckUtils]: 28: Hoare triple {14304#(or (not (= main_~a~0 (* main_~b~0 2))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0 0) (* main_~y~0 main_~s~0))))} assume !false; {14304#(or (not (= main_~a~0 (* main_~b~0 2))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0 0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:03:42,317 INFO L290 TraceCheckUtils]: 27: Hoare triple {13852#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {14304#(or (not (= main_~a~0 (* main_~b~0 2))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0 0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:03:42,317 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {13852#true} {13852#true} #100#return; {13852#true} is VALID [2022-04-15 15:03:42,317 INFO L290 TraceCheckUtils]: 25: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-15 15:03:42,317 INFO L290 TraceCheckUtils]: 24: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-15 15:03:42,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-15 15:03:42,317 INFO L272 TraceCheckUtils]: 22: Hoare triple {13852#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {13852#true} is VALID [2022-04-15 15:03:42,317 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {13852#true} {13852#true} #98#return; {13852#true} is VALID [2022-04-15 15:03:42,317 INFO L290 TraceCheckUtils]: 20: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-15 15:03:42,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-15 15:03:42,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-15 15:03:42,318 INFO L272 TraceCheckUtils]: 17: Hoare triple {13852#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {13852#true} is VALID [2022-04-15 15:03:42,318 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13852#true} {13852#true} #96#return; {13852#true} is VALID [2022-04-15 15:03:42,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-15 15:03:42,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-15 15:03:42,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-15 15:03:42,318 INFO L272 TraceCheckUtils]: 12: Hoare triple {13852#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {13852#true} is VALID [2022-04-15 15:03:42,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {13852#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {13852#true} is VALID [2022-04-15 15:03:42,318 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13852#true} {13852#true} #94#return; {13852#true} is VALID [2022-04-15 15:03:42,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-15 15:03:42,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-15 15:03:42,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-15 15:03:42,318 INFO L272 TraceCheckUtils]: 6: Hoare triple {13852#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {13852#true} is VALID [2022-04-15 15:03:42,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {13852#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {13852#true} is VALID [2022-04-15 15:03:42,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {13852#true} call #t~ret6 := main(); {13852#true} is VALID [2022-04-15 15:03:42,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13852#true} {13852#true} #112#return; {13852#true} is VALID [2022-04-15 15:03:42,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-15 15:03:42,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {13852#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {13852#true} is VALID [2022-04-15 15:03:42,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {13852#true} call ULTIMATE.init(); {13852#true} is VALID [2022-04-15 15:03:42,319 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 30 proven. 17 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-04-15 15:03:42,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:03:42,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918901015] [2022-04-15 15:03:42,319 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:03:42,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339617084] [2022-04-15 15:03:42,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339617084] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:03:42,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:03:42,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 27 [2022-04-15 15:03:42,320 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:03:42,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [749738975] [2022-04-15 15:03:42,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [749738975] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:03:42,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:03:42,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 15:03:42,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127252497] [2022-04-15 15:03:42,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:03:42,320 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 86 [2022-04-15 15:03:42,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:03:42,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-15 15:03:42,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:03:42,376 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 15:03:42,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:03:42,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 15:03:42,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2022-04-15 15:03:42,377 INFO L87 Difference]: Start difference. First operand 200 states and 281 transitions. Second operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-15 15:03:45,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:03:45,549 INFO L93 Difference]: Finished difference Result 285 states and 397 transitions. [2022-04-15 15:03:45,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 15:03:45,549 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 86 [2022-04-15 15:03:45,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:03:45,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-15 15:03:45,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 151 transitions. [2022-04-15 15:03:45,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-15 15:03:45,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 151 transitions. [2022-04-15 15:03:45,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 151 transitions. [2022-04-15 15:03:45,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:03:45,750 INFO L225 Difference]: With dead ends: 285 [2022-04-15 15:03:45,750 INFO L226 Difference]: Without dead ends: 231 [2022-04-15 15:03:45,751 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=190, Invalid=1000, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 15:03:45,751 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 59 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:03:45,751 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 196 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 15:03:45,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-04-15 15:03:46,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 228. [2022-04-15 15:03:46,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:03:46,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 231 states. Second operand has 228 states, 121 states have (on average 1.165289256198347) internal successors, (141), 128 states have internal predecessors, (141), 91 states have call successors, (91), 16 states have call predecessors, (91), 15 states have return successors, (89), 83 states have call predecessors, (89), 89 states have call successors, (89) [2022-04-15 15:03:46,619 INFO L74 IsIncluded]: Start isIncluded. First operand 231 states. Second operand has 228 states, 121 states have (on average 1.165289256198347) internal successors, (141), 128 states have internal predecessors, (141), 91 states have call successors, (91), 16 states have call predecessors, (91), 15 states have return successors, (89), 83 states have call predecessors, (89), 89 states have call successors, (89) [2022-04-15 15:03:46,619 INFO L87 Difference]: Start difference. First operand 231 states. Second operand has 228 states, 121 states have (on average 1.165289256198347) internal successors, (141), 128 states have internal predecessors, (141), 91 states have call successors, (91), 16 states have call predecessors, (91), 15 states have return successors, (89), 83 states have call predecessors, (89), 89 states have call successors, (89) [2022-04-15 15:03:46,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:03:46,626 INFO L93 Difference]: Finished difference Result 231 states and 324 transitions. [2022-04-15 15:03:46,626 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 324 transitions. [2022-04-15 15:03:46,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:03:46,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:03:46,627 INFO L74 IsIncluded]: Start isIncluded. First operand has 228 states, 121 states have (on average 1.165289256198347) internal successors, (141), 128 states have internal predecessors, (141), 91 states have call successors, (91), 16 states have call predecessors, (91), 15 states have return successors, (89), 83 states have call predecessors, (89), 89 states have call successors, (89) Second operand 231 states. [2022-04-15 15:03:46,628 INFO L87 Difference]: Start difference. First operand has 228 states, 121 states have (on average 1.165289256198347) internal successors, (141), 128 states have internal predecessors, (141), 91 states have call successors, (91), 16 states have call predecessors, (91), 15 states have return successors, (89), 83 states have call predecessors, (89), 89 states have call successors, (89) Second operand 231 states. [2022-04-15 15:03:46,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:03:46,634 INFO L93 Difference]: Finished difference Result 231 states and 324 transitions. [2022-04-15 15:03:46,634 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 324 transitions. [2022-04-15 15:03:46,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:03:46,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:03:46,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:03:46,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:03:46,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 121 states have (on average 1.165289256198347) internal successors, (141), 128 states have internal predecessors, (141), 91 states have call successors, (91), 16 states have call predecessors, (91), 15 states have return successors, (89), 83 states have call predecessors, (89), 89 states have call successors, (89) [2022-04-15 15:03:46,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 321 transitions. [2022-04-15 15:03:46,643 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 321 transitions. Word has length 86 [2022-04-15 15:03:46,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:03:46,644 INFO L478 AbstractCegarLoop]: Abstraction has 228 states and 321 transitions. [2022-04-15 15:03:46,644 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-15 15:03:46,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 228 states and 321 transitions. [2022-04-15 15:03:47,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 321 edges. 321 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:03:47,273 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 321 transitions. [2022-04-15 15:03:47,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-15 15:03:47,276 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:03:47,276 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:03:47,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 15:03:47,491 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 15:03:47,491 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:03:47,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:03:47,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1654964248, now seen corresponding path program 5 times [2022-04-15 15:03:47,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:03:47,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [234627803] [2022-04-15 15:03:47,492 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:03:47,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1654964248, now seen corresponding path program 6 times [2022-04-15 15:03:47,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:03:47,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751648545] [2022-04-15 15:03:47,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:03:47,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:03:47,519 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:03:47,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2026017860] [2022-04-15 15:03:47,520 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:03:47,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:03:47,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:03:47,521 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:03:47,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 15:03:47,594 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 15:03:47,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:03:47,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 15:03:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:03:47,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:03:47,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {15898#true} call ULTIMATE.init(); {15898#true} is VALID [2022-04-15 15:03:47,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {15898#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {15898#true} is VALID [2022-04-15 15:03:47,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-15 15:03:47,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15898#true} {15898#true} #112#return; {15898#true} is VALID [2022-04-15 15:03:47,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {15898#true} call #t~ret6 := main(); {15898#true} is VALID [2022-04-15 15:03:47,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {15898#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {15898#true} is VALID [2022-04-15 15:03:47,873 INFO L272 TraceCheckUtils]: 6: Hoare triple {15898#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {15898#true} is VALID [2022-04-15 15:03:47,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-15 15:03:47,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-15 15:03:47,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-15 15:03:47,874 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15898#true} {15898#true} #94#return; {15898#true} is VALID [2022-04-15 15:03:47,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {15898#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {15898#true} is VALID [2022-04-15 15:03:47,874 INFO L272 TraceCheckUtils]: 12: Hoare triple {15898#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {15898#true} is VALID [2022-04-15 15:03:47,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-15 15:03:47,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-15 15:03:47,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-15 15:03:47,874 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15898#true} {15898#true} #96#return; {15898#true} is VALID [2022-04-15 15:03:47,874 INFO L272 TraceCheckUtils]: 17: Hoare triple {15898#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {15898#true} is VALID [2022-04-15 15:03:47,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-15 15:03:47,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-15 15:03:47,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-15 15:03:47,874 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {15898#true} {15898#true} #98#return; {15898#true} is VALID [2022-04-15 15:03:47,874 INFO L272 TraceCheckUtils]: 22: Hoare triple {15898#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {15898#true} is VALID [2022-04-15 15:03:47,874 INFO L290 TraceCheckUtils]: 23: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-15 15:03:47,874 INFO L290 TraceCheckUtils]: 24: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-15 15:03:47,875 INFO L290 TraceCheckUtils]: 25: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-15 15:03:47,875 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {15898#true} {15898#true} #100#return; {15898#true} is VALID [2022-04-15 15:03:47,875 INFO L290 TraceCheckUtils]: 27: Hoare triple {15898#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {15898#true} is VALID [2022-04-15 15:03:47,875 INFO L290 TraceCheckUtils]: 28: Hoare triple {15898#true} assume !false; {15898#true} is VALID [2022-04-15 15:03:47,875 INFO L290 TraceCheckUtils]: 29: Hoare triple {15898#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {15898#true} is VALID [2022-04-15 15:03:47,875 INFO L290 TraceCheckUtils]: 30: Hoare triple {15898#true} assume !false; {15898#true} is VALID [2022-04-15 15:03:47,875 INFO L290 TraceCheckUtils]: 31: Hoare triple {15898#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-15 15:03:47,875 INFO L290 TraceCheckUtils]: 32: Hoare triple {15996#(<= main_~v~0 main_~b~0)} assume !false; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-15 15:03:47,875 INFO L272 TraceCheckUtils]: 33: Hoare triple {15996#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {15898#true} is VALID [2022-04-15 15:03:47,876 INFO L290 TraceCheckUtils]: 34: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-15 15:03:47,876 INFO L290 TraceCheckUtils]: 35: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-15 15:03:47,876 INFO L290 TraceCheckUtils]: 36: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-15 15:03:47,879 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {15898#true} {15996#(<= main_~v~0 main_~b~0)} #102#return; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-15 15:03:47,879 INFO L272 TraceCheckUtils]: 38: Hoare triple {15996#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {15898#true} is VALID [2022-04-15 15:03:47,879 INFO L290 TraceCheckUtils]: 39: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-15 15:03:47,879 INFO L290 TraceCheckUtils]: 40: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-15 15:03:47,879 INFO L290 TraceCheckUtils]: 41: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-15 15:03:47,882 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15898#true} {15996#(<= main_~v~0 main_~b~0)} #104#return; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-15 15:03:47,882 INFO L272 TraceCheckUtils]: 43: Hoare triple {15996#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {15898#true} is VALID [2022-04-15 15:03:47,883 INFO L290 TraceCheckUtils]: 44: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-15 15:03:47,883 INFO L290 TraceCheckUtils]: 45: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-15 15:03:47,883 INFO L290 TraceCheckUtils]: 46: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-15 15:03:47,883 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {15898#true} {15996#(<= main_~v~0 main_~b~0)} #106#return; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-15 15:03:47,883 INFO L272 TraceCheckUtils]: 48: Hoare triple {15996#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {15898#true} is VALID [2022-04-15 15:03:47,883 INFO L290 TraceCheckUtils]: 49: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-15 15:03:47,883 INFO L290 TraceCheckUtils]: 50: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-15 15:03:47,883 INFO L290 TraceCheckUtils]: 51: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-15 15:03:47,884 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {15898#true} {15996#(<= main_~v~0 main_~b~0)} #108#return; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-15 15:03:47,884 INFO L290 TraceCheckUtils]: 53: Hoare triple {15996#(<= main_~v~0 main_~b~0)} assume !(~c~0 >= 2 * ~v~0); {16063#(and (<= main_~v~0 main_~b~0) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-15 15:03:47,885 INFO L290 TraceCheckUtils]: 54: Hoare triple {16063#(and (<= main_~v~0 main_~b~0) (not (<= (* main_~v~0 2) main_~c~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {16067#(< main_~c~0 main_~b~0)} is VALID [2022-04-15 15:03:47,885 INFO L290 TraceCheckUtils]: 55: Hoare triple {16067#(< main_~c~0 main_~b~0)} assume !false; {16067#(< main_~c~0 main_~b~0)} is VALID [2022-04-15 15:03:47,885 INFO L290 TraceCheckUtils]: 56: Hoare triple {16067#(< main_~c~0 main_~b~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-15 15:03:47,886 INFO L290 TraceCheckUtils]: 57: Hoare triple {16074#(< main_~c~0 main_~v~0)} assume !false; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-15 15:03:47,886 INFO L272 TraceCheckUtils]: 58: Hoare triple {16074#(< main_~c~0 main_~v~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {15898#true} is VALID [2022-04-15 15:03:47,886 INFO L290 TraceCheckUtils]: 59: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-15 15:03:47,886 INFO L290 TraceCheckUtils]: 60: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-15 15:03:47,886 INFO L290 TraceCheckUtils]: 61: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-15 15:03:47,886 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {15898#true} {16074#(< main_~c~0 main_~v~0)} #102#return; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-15 15:03:47,886 INFO L272 TraceCheckUtils]: 63: Hoare triple {16074#(< main_~c~0 main_~v~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {15898#true} is VALID [2022-04-15 15:03:47,887 INFO L290 TraceCheckUtils]: 64: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-15 15:03:47,887 INFO L290 TraceCheckUtils]: 65: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-15 15:03:47,887 INFO L290 TraceCheckUtils]: 66: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-15 15:03:47,887 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {15898#true} {16074#(< main_~c~0 main_~v~0)} #104#return; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-15 15:03:47,887 INFO L272 TraceCheckUtils]: 68: Hoare triple {16074#(< main_~c~0 main_~v~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {15898#true} is VALID [2022-04-15 15:03:47,887 INFO L290 TraceCheckUtils]: 69: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-15 15:03:47,887 INFO L290 TraceCheckUtils]: 70: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-15 15:03:47,887 INFO L290 TraceCheckUtils]: 71: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-15 15:03:47,891 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {15898#true} {16074#(< main_~c~0 main_~v~0)} #106#return; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-15 15:03:47,891 INFO L272 TraceCheckUtils]: 73: Hoare triple {16074#(< main_~c~0 main_~v~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {15898#true} is VALID [2022-04-15 15:03:47,892 INFO L290 TraceCheckUtils]: 74: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-15 15:03:47,892 INFO L290 TraceCheckUtils]: 75: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-15 15:03:47,892 INFO L290 TraceCheckUtils]: 76: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-15 15:03:47,892 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {15898#true} {16074#(< main_~c~0 main_~v~0)} #108#return; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-15 15:03:47,893 INFO L290 TraceCheckUtils]: 78: Hoare triple {16074#(< main_~c~0 main_~v~0)} assume !(~c~0 >= 2 * ~v~0); {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-15 15:03:47,893 INFO L290 TraceCheckUtils]: 79: Hoare triple {16074#(< main_~c~0 main_~v~0)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {16144#(< main_~c~0 0)} is VALID [2022-04-15 15:03:47,894 INFO L290 TraceCheckUtils]: 80: Hoare triple {16144#(< main_~c~0 0)} assume !false; {16144#(< main_~c~0 0)} is VALID [2022-04-15 15:03:47,894 INFO L290 TraceCheckUtils]: 81: Hoare triple {16144#(< main_~c~0 0)} assume !(~c~0 >= ~b~0); {16144#(< main_~c~0 0)} is VALID [2022-04-15 15:03:47,894 INFO L290 TraceCheckUtils]: 82: Hoare triple {16144#(< main_~c~0 0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {16154#(< main_~b~0 0)} is VALID [2022-04-15 15:03:47,895 INFO L290 TraceCheckUtils]: 83: Hoare triple {16154#(< main_~b~0 0)} assume !false; {16154#(< main_~b~0 0)} is VALID [2022-04-15 15:03:47,895 INFO L290 TraceCheckUtils]: 84: Hoare triple {16154#(< main_~b~0 0)} assume !(0 != ~b~0); {15899#false} is VALID [2022-04-15 15:03:47,895 INFO L272 TraceCheckUtils]: 85: Hoare triple {15899#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {15899#false} is VALID [2022-04-15 15:03:47,895 INFO L290 TraceCheckUtils]: 86: Hoare triple {15899#false} ~cond := #in~cond; {15899#false} is VALID [2022-04-15 15:03:47,895 INFO L290 TraceCheckUtils]: 87: Hoare triple {15899#false} assume 0 == ~cond; {15899#false} is VALID [2022-04-15 15:03:47,896 INFO L290 TraceCheckUtils]: 88: Hoare triple {15899#false} assume !false; {15899#false} is VALID [2022-04-15 15:03:47,896 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-15 15:03:47,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:03:48,161 INFO L290 TraceCheckUtils]: 88: Hoare triple {15899#false} assume !false; {15899#false} is VALID [2022-04-15 15:03:48,161 INFO L290 TraceCheckUtils]: 87: Hoare triple {15899#false} assume 0 == ~cond; {15899#false} is VALID [2022-04-15 15:03:48,161 INFO L290 TraceCheckUtils]: 86: Hoare triple {15899#false} ~cond := #in~cond; {15899#false} is VALID [2022-04-15 15:03:48,161 INFO L272 TraceCheckUtils]: 85: Hoare triple {15899#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {15899#false} is VALID [2022-04-15 15:03:48,161 INFO L290 TraceCheckUtils]: 84: Hoare triple {16154#(< main_~b~0 0)} assume !(0 != ~b~0); {15899#false} is VALID [2022-04-15 15:03:48,162 INFO L290 TraceCheckUtils]: 83: Hoare triple {16154#(< main_~b~0 0)} assume !false; {16154#(< main_~b~0 0)} is VALID [2022-04-15 15:03:48,162 INFO L290 TraceCheckUtils]: 82: Hoare triple {16144#(< main_~c~0 0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {16154#(< main_~b~0 0)} is VALID [2022-04-15 15:03:48,162 INFO L290 TraceCheckUtils]: 81: Hoare triple {16144#(< main_~c~0 0)} assume !(~c~0 >= ~b~0); {16144#(< main_~c~0 0)} is VALID [2022-04-15 15:03:48,162 INFO L290 TraceCheckUtils]: 80: Hoare triple {16144#(< main_~c~0 0)} assume !false; {16144#(< main_~c~0 0)} is VALID [2022-04-15 15:03:48,163 INFO L290 TraceCheckUtils]: 79: Hoare triple {16074#(< main_~c~0 main_~v~0)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {16144#(< main_~c~0 0)} is VALID [2022-04-15 15:03:48,163 INFO L290 TraceCheckUtils]: 78: Hoare triple {16074#(< main_~c~0 main_~v~0)} assume !(~c~0 >= 2 * ~v~0); {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-15 15:03:48,164 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {15898#true} {16074#(< main_~c~0 main_~v~0)} #108#return; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-15 15:03:48,164 INFO L290 TraceCheckUtils]: 76: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-15 15:03:48,164 INFO L290 TraceCheckUtils]: 75: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-15 15:03:48,164 INFO L290 TraceCheckUtils]: 74: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-15 15:03:48,164 INFO L272 TraceCheckUtils]: 73: Hoare triple {16074#(< main_~c~0 main_~v~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {15898#true} is VALID [2022-04-15 15:03:48,165 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {15898#true} {16074#(< main_~c~0 main_~v~0)} #106#return; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-15 15:03:48,165 INFO L290 TraceCheckUtils]: 71: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-15 15:03:48,165 INFO L290 TraceCheckUtils]: 70: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-15 15:03:48,165 INFO L290 TraceCheckUtils]: 69: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-15 15:03:48,165 INFO L272 TraceCheckUtils]: 68: Hoare triple {16074#(< main_~c~0 main_~v~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {15898#true} is VALID [2022-04-15 15:03:48,165 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {15898#true} {16074#(< main_~c~0 main_~v~0)} #104#return; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-15 15:03:48,165 INFO L290 TraceCheckUtils]: 66: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-15 15:03:48,165 INFO L290 TraceCheckUtils]: 65: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-15 15:03:48,165 INFO L290 TraceCheckUtils]: 64: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-15 15:03:48,166 INFO L272 TraceCheckUtils]: 63: Hoare triple {16074#(< main_~c~0 main_~v~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {15898#true} is VALID [2022-04-15 15:03:48,166 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {15898#true} {16074#(< main_~c~0 main_~v~0)} #102#return; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-15 15:03:48,166 INFO L290 TraceCheckUtils]: 61: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-15 15:03:48,166 INFO L290 TraceCheckUtils]: 60: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-15 15:03:48,166 INFO L290 TraceCheckUtils]: 59: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-15 15:03:48,166 INFO L272 TraceCheckUtils]: 58: Hoare triple {16074#(< main_~c~0 main_~v~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {15898#true} is VALID [2022-04-15 15:03:48,167 INFO L290 TraceCheckUtils]: 57: Hoare triple {16074#(< main_~c~0 main_~v~0)} assume !false; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-15 15:03:48,167 INFO L290 TraceCheckUtils]: 56: Hoare triple {16067#(< main_~c~0 main_~b~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-15 15:03:48,167 INFO L290 TraceCheckUtils]: 55: Hoare triple {16067#(< main_~c~0 main_~b~0)} assume !false; {16067#(< main_~c~0 main_~b~0)} is VALID [2022-04-15 15:03:48,168 INFO L290 TraceCheckUtils]: 54: Hoare triple {16275#(< main_~c~0 (+ main_~b~0 main_~v~0))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {16067#(< main_~c~0 main_~b~0)} is VALID [2022-04-15 15:03:48,168 INFO L290 TraceCheckUtils]: 53: Hoare triple {15996#(<= main_~v~0 main_~b~0)} assume !(~c~0 >= 2 * ~v~0); {16275#(< main_~c~0 (+ main_~b~0 main_~v~0))} is VALID [2022-04-15 15:03:48,169 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {15898#true} {15996#(<= main_~v~0 main_~b~0)} #108#return; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-15 15:03:48,169 INFO L290 TraceCheckUtils]: 51: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-15 15:03:48,169 INFO L290 TraceCheckUtils]: 50: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-15 15:03:48,169 INFO L290 TraceCheckUtils]: 49: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-15 15:03:48,169 INFO L272 TraceCheckUtils]: 48: Hoare triple {15996#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {15898#true} is VALID [2022-04-15 15:03:48,170 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {15898#true} {15996#(<= main_~v~0 main_~b~0)} #106#return; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-15 15:03:48,170 INFO L290 TraceCheckUtils]: 46: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-15 15:03:48,170 INFO L290 TraceCheckUtils]: 45: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-15 15:03:48,170 INFO L290 TraceCheckUtils]: 44: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-15 15:03:48,170 INFO L272 TraceCheckUtils]: 43: Hoare triple {15996#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {15898#true} is VALID [2022-04-15 15:03:48,170 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15898#true} {15996#(<= main_~v~0 main_~b~0)} #104#return; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-15 15:03:48,170 INFO L290 TraceCheckUtils]: 41: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-15 15:03:48,170 INFO L290 TraceCheckUtils]: 40: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-15 15:03:48,171 INFO L290 TraceCheckUtils]: 39: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-15 15:03:48,171 INFO L272 TraceCheckUtils]: 38: Hoare triple {15996#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {15898#true} is VALID [2022-04-15 15:03:48,171 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {15898#true} {15996#(<= main_~v~0 main_~b~0)} #102#return; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-15 15:03:48,171 INFO L290 TraceCheckUtils]: 36: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-15 15:03:48,171 INFO L290 TraceCheckUtils]: 35: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-15 15:03:48,171 INFO L290 TraceCheckUtils]: 34: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-15 15:03:48,171 INFO L272 TraceCheckUtils]: 33: Hoare triple {15996#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {15898#true} is VALID [2022-04-15 15:03:48,172 INFO L290 TraceCheckUtils]: 32: Hoare triple {15996#(<= main_~v~0 main_~b~0)} assume !false; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-15 15:03:48,172 INFO L290 TraceCheckUtils]: 31: Hoare triple {15898#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-15 15:03:48,172 INFO L290 TraceCheckUtils]: 30: Hoare triple {15898#true} assume !false; {15898#true} is VALID [2022-04-15 15:03:48,172 INFO L290 TraceCheckUtils]: 29: Hoare triple {15898#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {15898#true} is VALID [2022-04-15 15:03:48,172 INFO L290 TraceCheckUtils]: 28: Hoare triple {15898#true} assume !false; {15898#true} is VALID [2022-04-15 15:03:48,172 INFO L290 TraceCheckUtils]: 27: Hoare triple {15898#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {15898#true} is VALID [2022-04-15 15:03:48,172 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {15898#true} {15898#true} #100#return; {15898#true} is VALID [2022-04-15 15:03:48,172 INFO L290 TraceCheckUtils]: 25: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-15 15:03:48,172 INFO L290 TraceCheckUtils]: 24: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-15 15:03:48,172 INFO L290 TraceCheckUtils]: 23: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-15 15:03:48,172 INFO L272 TraceCheckUtils]: 22: Hoare triple {15898#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {15898#true} is VALID [2022-04-15 15:03:48,173 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {15898#true} {15898#true} #98#return; {15898#true} is VALID [2022-04-15 15:03:48,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-15 15:03:48,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-15 15:03:48,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-15 15:03:48,173 INFO L272 TraceCheckUtils]: 17: Hoare triple {15898#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {15898#true} is VALID [2022-04-15 15:03:48,173 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15898#true} {15898#true} #96#return; {15898#true} is VALID [2022-04-15 15:03:48,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-15 15:03:48,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-15 15:03:48,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-15 15:03:48,173 INFO L272 TraceCheckUtils]: 12: Hoare triple {15898#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {15898#true} is VALID [2022-04-15 15:03:48,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {15898#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {15898#true} is VALID [2022-04-15 15:03:48,173 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15898#true} {15898#true} #94#return; {15898#true} is VALID [2022-04-15 15:03:48,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-15 15:03:48,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-15 15:03:48,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-15 15:03:48,173 INFO L272 TraceCheckUtils]: 6: Hoare triple {15898#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {15898#true} is VALID [2022-04-15 15:03:48,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {15898#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {15898#true} is VALID [2022-04-15 15:03:48,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {15898#true} call #t~ret6 := main(); {15898#true} is VALID [2022-04-15 15:03:48,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15898#true} {15898#true} #112#return; {15898#true} is VALID [2022-04-15 15:03:48,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-15 15:03:48,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {15898#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {15898#true} is VALID [2022-04-15 15:03:48,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {15898#true} call ULTIMATE.init(); {15898#true} is VALID [2022-04-15 15:03:48,174 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-15 15:03:48,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:03:48,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751648545] [2022-04-15 15:03:48,174 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:03:48,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026017860] [2022-04-15 15:03:48,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026017860] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:03:48,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:03:48,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-15 15:03:48,175 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:03:48,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [234627803] [2022-04-15 15:03:48,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [234627803] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:03:48,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:03:48,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 15:03:48,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782345859] [2022-04-15 15:03:48,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:03:48,175 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 89 [2022-04-15 15:03:48,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:03:48,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-15 15:03:48,221 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-15 15:03:48,222 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 15:03:48,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:03:48,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 15:03:48,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-15 15:03:48,222 INFO L87 Difference]: Start difference. First operand 228 states and 321 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-15 15:03:49,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:03:49,447 INFO L93 Difference]: Finished difference Result 361 states and 505 transitions. [2022-04-15 15:03:49,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 15:03:49,447 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 89 [2022-04-15 15:03:49,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:03:49,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-15 15:03:49,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2022-04-15 15:03:49,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-15 15:03:49,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2022-04-15 15:03:49,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 89 transitions. [2022-04-15 15:03:49,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:03:49,549 INFO L225 Difference]: With dead ends: 361 [2022-04-15 15:03:49,549 INFO L226 Difference]: Without dead ends: 238 [2022-04-15 15:03:49,550 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-15 15:03:49,551 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 7 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:03:49,552 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 260 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 15:03:49,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-04-15 15:03:50,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 225. [2022-04-15 15:03:50,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:03:50,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states. Second operand has 225 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 127 states have internal predecessors, (149), 83 states have call successors, (83), 16 states have call predecessors, (83), 15 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2022-04-15 15:03:50,467 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand has 225 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 127 states have internal predecessors, (149), 83 states have call successors, (83), 16 states have call predecessors, (83), 15 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2022-04-15 15:03:50,467 INFO L87 Difference]: Start difference. First operand 238 states. Second operand has 225 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 127 states have internal predecessors, (149), 83 states have call successors, (83), 16 states have call predecessors, (83), 15 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2022-04-15 15:03:50,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:03:50,477 INFO L93 Difference]: Finished difference Result 238 states and 327 transitions. [2022-04-15 15:03:50,477 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 327 transitions. [2022-04-15 15:03:50,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:03:50,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:03:50,478 INFO L74 IsIncluded]: Start isIncluded. First operand has 225 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 127 states have internal predecessors, (149), 83 states have call successors, (83), 16 states have call predecessors, (83), 15 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) Second operand 238 states. [2022-04-15 15:03:50,479 INFO L87 Difference]: Start difference. First operand has 225 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 127 states have internal predecessors, (149), 83 states have call successors, (83), 16 states have call predecessors, (83), 15 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) Second operand 238 states. [2022-04-15 15:03:50,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:03:50,485 INFO L93 Difference]: Finished difference Result 238 states and 327 transitions. [2022-04-15 15:03:50,485 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 327 transitions. [2022-04-15 15:03:50,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:03:50,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:03:50,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:03:50,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:03:50,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 127 states have internal predecessors, (149), 83 states have call successors, (83), 16 states have call predecessors, (83), 15 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2022-04-15 15:03:50,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 313 transitions. [2022-04-15 15:03:50,495 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 313 transitions. Word has length 89 [2022-04-15 15:03:50,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:03:50,495 INFO L478 AbstractCegarLoop]: Abstraction has 225 states and 313 transitions. [2022-04-15 15:03:50,495 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-15 15:03:50,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 225 states and 313 transitions. [2022-04-15 15:03:51,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 313 edges. 313 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:03:51,107 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 313 transitions. [2022-04-15 15:03:51,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-15 15:03:51,108 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:03:51,109 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:03:51,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 15:03:51,331 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-15 15:03:51,332 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:03:51,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:03:51,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1455197645, now seen corresponding path program 3 times [2022-04-15 15:03:51,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:03:51,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1042935853] [2022-04-15 15:03:51,333 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:03:51,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1455197645, now seen corresponding path program 4 times [2022-04-15 15:03:51,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:03:51,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051166792] [2022-04-15 15:03:51,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:03:51,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:03:51,344 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:03:51,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [266386848] [2022-04-15 15:03:51,344 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:03:51,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:03:51,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:03:51,346 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:03:51,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 15:03:51,402 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:03:51,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:03:51,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 88 conjunts are in the unsatisfiable core [2022-04-15 15:03:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:03:51,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:03:59,957 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 15:04:06,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {18091#true} call ULTIMATE.init(); {18091#true} is VALID [2022-04-15 15:04:06,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {18091#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {18091#true} is VALID [2022-04-15 15:04:06,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-15 15:04:06,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18091#true} {18091#true} #112#return; {18091#true} is VALID [2022-04-15 15:04:06,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {18091#true} call #t~ret6 := main(); {18091#true} is VALID [2022-04-15 15:04:06,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {18091#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {18091#true} is VALID [2022-04-15 15:04:06,578 INFO L272 TraceCheckUtils]: 6: Hoare triple {18091#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {18091#true} is VALID [2022-04-15 15:04:06,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-15 15:04:06,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-15 15:04:06,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-15 15:04:06,578 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18091#true} {18091#true} #94#return; {18091#true} is VALID [2022-04-15 15:04:06,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {18091#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {18091#true} is VALID [2022-04-15 15:04:06,578 INFO L272 TraceCheckUtils]: 12: Hoare triple {18091#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {18091#true} is VALID [2022-04-15 15:04:06,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {18091#true} ~cond := #in~cond; {18135#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 15:04:06,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {18135#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {18139#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 15:04:06,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {18139#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {18139#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 15:04:06,580 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {18139#(not (= |assume_abort_if_not_#in~cond| 0))} {18091#true} #96#return; {18146#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 15:04:06,580 INFO L272 TraceCheckUtils]: 17: Hoare triple {18146#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18091#true} is VALID [2022-04-15 15:04:06,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-15 15:04:06,580 INFO L290 TraceCheckUtils]: 19: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-15 15:04:06,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-15 15:04:06,581 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {18091#true} {18146#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #98#return; {18146#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 15:04:06,581 INFO L272 TraceCheckUtils]: 22: Hoare triple {18146#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18091#true} is VALID [2022-04-15 15:04:06,581 INFO L290 TraceCheckUtils]: 23: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-15 15:04:06,581 INFO L290 TraceCheckUtils]: 24: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-15 15:04:06,581 INFO L290 TraceCheckUtils]: 25: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-15 15:04:06,582 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18091#true} {18146#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #100#return; {18146#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 15:04:06,582 INFO L290 TraceCheckUtils]: 27: Hoare triple {18146#(and (<= 0 main_~y~0) (<= main_~y~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {18180#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 15:04:06,583 INFO L290 TraceCheckUtils]: 28: Hoare triple {18180#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !false; {18180#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 15:04:06,583 INFO L290 TraceCheckUtils]: 29: Hoare triple {18180#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {18187#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-15 15:04:06,584 INFO L290 TraceCheckUtils]: 30: Hoare triple {18187#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !false; {18187#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-15 15:04:06,584 INFO L290 TraceCheckUtils]: 31: Hoare triple {18187#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !(~c~0 >= ~b~0); {18194#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-15 15:04:06,585 INFO L290 TraceCheckUtils]: 32: Hoare triple {18194#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~q~0 0) (= main_~c~0 main_~x~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {18198#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-15 15:04:06,585 INFO L290 TraceCheckUtils]: 33: Hoare triple {18198#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !false; {18198#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-15 15:04:06,586 INFO L290 TraceCheckUtils]: 34: Hoare triple {18198#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {18205#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-15 15:04:06,586 INFO L290 TraceCheckUtils]: 35: Hoare triple {18205#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !false; {18205#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-15 15:04:06,587 INFO L290 TraceCheckUtils]: 36: Hoare triple {18205#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-15 15:04:06,588 INFO L290 TraceCheckUtils]: 37: Hoare triple {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !false; {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-15 15:04:06,588 INFO L272 TraceCheckUtils]: 38: Hoare triple {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18091#true} is VALID [2022-04-15 15:04:06,588 INFO L290 TraceCheckUtils]: 39: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-15 15:04:06,588 INFO L290 TraceCheckUtils]: 40: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-15 15:04:06,588 INFO L290 TraceCheckUtils]: 41: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-15 15:04:06,589 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {18091#true} {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #102#return; {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-15 15:04:06,589 INFO L272 TraceCheckUtils]: 43: Hoare triple {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18091#true} is VALID [2022-04-15 15:04:06,589 INFO L290 TraceCheckUtils]: 44: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-15 15:04:06,589 INFO L290 TraceCheckUtils]: 45: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-15 15:04:06,589 INFO L290 TraceCheckUtils]: 46: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-15 15:04:06,590 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18091#true} {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #104#return; {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-15 15:04:06,590 INFO L272 TraceCheckUtils]: 48: Hoare triple {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18091#true} is VALID [2022-04-15 15:04:06,590 INFO L290 TraceCheckUtils]: 49: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-15 15:04:06,590 INFO L290 TraceCheckUtils]: 50: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-15 15:04:06,590 INFO L290 TraceCheckUtils]: 51: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-15 15:04:06,591 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {18091#true} {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #106#return; {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-15 15:04:06,591 INFO L272 TraceCheckUtils]: 53: Hoare triple {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {18091#true} is VALID [2022-04-15 15:04:06,592 INFO L290 TraceCheckUtils]: 54: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-15 15:04:06,592 INFO L290 TraceCheckUtils]: 55: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-15 15:04:06,592 INFO L290 TraceCheckUtils]: 56: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-15 15:04:06,593 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {18091#true} {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #108#return; {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-15 15:04:06,594 INFO L290 TraceCheckUtils]: 58: Hoare triple {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {18279#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-15 15:04:06,595 INFO L290 TraceCheckUtils]: 59: Hoare triple {18279#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} assume !false; {18279#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-15 15:04:06,595 INFO L272 TraceCheckUtils]: 60: Hoare triple {18279#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18091#true} is VALID [2022-04-15 15:04:06,595 INFO L290 TraceCheckUtils]: 61: Hoare triple {18091#true} ~cond := #in~cond; {18289#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:04:06,596 INFO L290 TraceCheckUtils]: 62: Hoare triple {18289#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:04:06,596 INFO L290 TraceCheckUtils]: 63: Hoare triple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:04:06,597 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} {18279#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} #102#return; {18279#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-15 15:04:06,597 INFO L272 TraceCheckUtils]: 65: Hoare triple {18279#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18091#true} is VALID [2022-04-15 15:04:06,597 INFO L290 TraceCheckUtils]: 66: Hoare triple {18091#true} ~cond := #in~cond; {18289#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:04:06,598 INFO L290 TraceCheckUtils]: 67: Hoare triple {18289#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:04:06,598 INFO L290 TraceCheckUtils]: 68: Hoare triple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:04:06,599 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} {18279#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} #104#return; {18315#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-15 15:04:06,599 INFO L272 TraceCheckUtils]: 70: Hoare triple {18315#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18091#true} is VALID [2022-04-15 15:04:06,600 INFO L290 TraceCheckUtils]: 71: Hoare triple {18091#true} ~cond := #in~cond; {18289#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:04:06,600 INFO L290 TraceCheckUtils]: 72: Hoare triple {18289#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:04:06,601 INFO L290 TraceCheckUtils]: 73: Hoare triple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:04:06,602 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} {18315#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} #106#return; {18331#(and (<= 0 main_~y~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-15 15:04:06,602 INFO L272 TraceCheckUtils]: 75: Hoare triple {18331#(and (<= 0 main_~y~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {18091#true} is VALID [2022-04-15 15:04:06,602 INFO L290 TraceCheckUtils]: 76: Hoare triple {18091#true} ~cond := #in~cond; {18289#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:04:06,603 INFO L290 TraceCheckUtils]: 77: Hoare triple {18289#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:04:06,603 INFO L290 TraceCheckUtils]: 78: Hoare triple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:04:06,604 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} {18331#(and (<= 0 main_~y~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} #108#return; {18347#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (<= 0 main_~y~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-15 15:04:06,605 INFO L290 TraceCheckUtils]: 80: Hoare triple {18347#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (<= 0 main_~y~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} assume !(~c~0 >= 2 * ~v~0); {18347#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (<= 0 main_~y~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-15 15:04:06,608 INFO L290 TraceCheckUtils]: 81: Hoare triple {18347#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (<= 0 main_~y~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {18354#(and (<= 0 main_~y~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~y~0 2) (= main_~p~0 0) (= (+ main_~c~0 (* main_~b~0 2)) main_~y~0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} is VALID [2022-04-15 15:04:06,609 INFO L290 TraceCheckUtils]: 82: Hoare triple {18354#(and (<= 0 main_~y~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~y~0 2) (= main_~p~0 0) (= (+ main_~c~0 (* main_~b~0 2)) main_~y~0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} assume !false; {18354#(and (<= 0 main_~y~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~y~0 2) (= main_~p~0 0) (= (+ main_~c~0 (* main_~b~0 2)) main_~y~0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} is VALID [2022-04-15 15:04:06,610 INFO L290 TraceCheckUtils]: 83: Hoare triple {18354#(and (<= 0 main_~y~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~y~0 2) (= main_~p~0 0) (= (+ main_~c~0 (* main_~b~0 2)) main_~y~0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} assume !(~c~0 >= ~b~0); {18361#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~y~0 2) (= main_~p~0 0) (= (+ main_~c~0 (* main_~b~0 2)) main_~y~0) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (< main_~c~0 main_~b~0))} is VALID [2022-04-15 15:04:06,614 INFO L290 TraceCheckUtils]: 84: Hoare triple {18361#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~y~0 2) (= main_~p~0 0) (= (+ main_~c~0 (* main_~b~0 2)) main_~y~0) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (< main_~c~0 main_~b~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {18365#(and (= main_~r~0 0) (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= main_~y~0 2) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ main_~q~0 (* main_~p~0 (div (* main_~x~0 2) main_~x~0))) 0) (= main_~a~0 main_~x~0) (< main_~y~0 (* main_~x~0 3)))} is VALID [2022-04-15 15:04:06,615 INFO L290 TraceCheckUtils]: 85: Hoare triple {18365#(and (= main_~r~0 0) (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= main_~y~0 2) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ main_~q~0 (* main_~p~0 (div (* main_~x~0 2) main_~x~0))) 0) (= main_~a~0 main_~x~0) (< main_~y~0 (* main_~x~0 3)))} assume !false; {18365#(and (= main_~r~0 0) (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= main_~y~0 2) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ main_~q~0 (* main_~p~0 (div (* main_~x~0 2) main_~x~0))) 0) (= main_~a~0 main_~x~0) (< main_~y~0 (* main_~x~0 3)))} is VALID [2022-04-15 15:04:06,615 INFO L290 TraceCheckUtils]: 86: Hoare triple {18365#(and (= main_~r~0 0) (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= main_~y~0 2) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ main_~q~0 (* main_~p~0 (div (* main_~x~0 2) main_~x~0))) 0) (= main_~a~0 main_~x~0) (< main_~y~0 (* main_~x~0 3)))} assume !(0 != ~b~0); {18372#(and (= main_~r~0 0) (= (* main_~x~0 2) main_~y~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ main_~q~0 (* main_~p~0 (div (* main_~x~0 2) main_~x~0))) 0) (= main_~a~0 main_~x~0) (< main_~y~0 (* main_~x~0 3)))} is VALID [2022-04-15 15:04:06,618 INFO L272 TraceCheckUtils]: 87: Hoare triple {18372#(and (= main_~r~0 0) (= (* main_~x~0 2) main_~y~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ main_~q~0 (* main_~p~0 (div (* main_~x~0 2) main_~x~0))) 0) (= main_~a~0 main_~x~0) (< main_~y~0 (* main_~x~0 3)))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {18376#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:04:06,619 INFO L290 TraceCheckUtils]: 88: Hoare triple {18376#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18380#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:04:06,619 INFO L290 TraceCheckUtils]: 89: Hoare triple {18380#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18092#false} is VALID [2022-04-15 15:04:06,619 INFO L290 TraceCheckUtils]: 90: Hoare triple {18092#false} assume !false; {18092#false} is VALID [2022-04-15 15:04:06,620 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 63 proven. 29 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-04-15 15:04:06,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:05:03,843 INFO L290 TraceCheckUtils]: 90: Hoare triple {18092#false} assume !false; {18092#false} is VALID [2022-04-15 15:05:03,844 INFO L290 TraceCheckUtils]: 89: Hoare triple {18380#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18092#false} is VALID [2022-04-15 15:05:03,844 INFO L290 TraceCheckUtils]: 88: Hoare triple {18376#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18380#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:05:03,845 INFO L272 TraceCheckUtils]: 87: Hoare triple {18396#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {18376#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:05:03,845 INFO L290 TraceCheckUtils]: 86: Hoare triple {18400#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !(0 != ~b~0); {18396#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 15:05:03,845 INFO L290 TraceCheckUtils]: 85: Hoare triple {18400#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !false; {18400#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-15 15:05:04,065 INFO L290 TraceCheckUtils]: 84: Hoare triple {18407#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {18400#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-15 15:05:04,066 INFO L290 TraceCheckUtils]: 83: Hoare triple {18411#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {18407#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:05:04,066 INFO L290 TraceCheckUtils]: 82: Hoare triple {18411#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {18411#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:05:04,364 INFO L290 TraceCheckUtils]: 81: Hoare triple {18418#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {18411#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:05:04,365 INFO L290 TraceCheckUtils]: 80: Hoare triple {18418#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= 2 * ~v~0); {18418#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:05:04,366 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} {18425#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #108#return; {18418#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:05:04,366 INFO L290 TraceCheckUtils]: 78: Hoare triple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:05:04,367 INFO L290 TraceCheckUtils]: 77: Hoare triple {18435#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:05:04,367 INFO L290 TraceCheckUtils]: 76: Hoare triple {18091#true} ~cond := #in~cond; {18435#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 15:05:04,367 INFO L272 TraceCheckUtils]: 75: Hoare triple {18425#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {18091#true} is VALID [2022-04-15 15:05:04,368 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} {18442#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #106#return; {18425#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:05:04,368 INFO L290 TraceCheckUtils]: 73: Hoare triple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:05:04,369 INFO L290 TraceCheckUtils]: 72: Hoare triple {18435#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:05:04,369 INFO L290 TraceCheckUtils]: 71: Hoare triple {18091#true} ~cond := #in~cond; {18435#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 15:05:04,369 INFO L272 TraceCheckUtils]: 70: Hoare triple {18442#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18091#true} is VALID [2022-04-15 15:05:04,370 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} {18458#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {18442#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:05:04,370 INFO L290 TraceCheckUtils]: 68: Hoare triple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:05:04,371 INFO L290 TraceCheckUtils]: 67: Hoare triple {18435#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:05:04,371 INFO L290 TraceCheckUtils]: 66: Hoare triple {18091#true} ~cond := #in~cond; {18435#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 15:05:04,371 INFO L272 TraceCheckUtils]: 65: Hoare triple {18458#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18091#true} is VALID [2022-04-15 15:05:06,376 WARN L284 TraceCheckUtils]: 64: Hoare quadruple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} {18091#true} #102#return; {18458#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is UNKNOWN [2022-04-15 15:05:06,376 INFO L290 TraceCheckUtils]: 63: Hoare triple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:05:06,377 INFO L290 TraceCheckUtils]: 62: Hoare triple {18435#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:05:06,377 INFO L290 TraceCheckUtils]: 61: Hoare triple {18091#true} ~cond := #in~cond; {18435#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 15:05:06,377 INFO L272 TraceCheckUtils]: 60: Hoare triple {18091#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18091#true} is VALID [2022-04-15 15:05:06,377 INFO L290 TraceCheckUtils]: 59: Hoare triple {18091#true} assume !false; {18091#true} is VALID [2022-04-15 15:05:06,377 INFO L290 TraceCheckUtils]: 58: Hoare triple {18091#true} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {18091#true} is VALID [2022-04-15 15:05:06,377 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {18091#true} {18091#true} #108#return; {18091#true} is VALID [2022-04-15 15:05:06,378 INFO L290 TraceCheckUtils]: 56: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-15 15:05:06,378 INFO L290 TraceCheckUtils]: 55: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-15 15:05:06,378 INFO L290 TraceCheckUtils]: 54: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-15 15:05:06,378 INFO L272 TraceCheckUtils]: 53: Hoare triple {18091#true} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {18091#true} is VALID [2022-04-15 15:05:06,378 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {18091#true} {18091#true} #106#return; {18091#true} is VALID [2022-04-15 15:05:06,378 INFO L290 TraceCheckUtils]: 51: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-15 15:05:06,378 INFO L290 TraceCheckUtils]: 50: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-15 15:05:06,378 INFO L290 TraceCheckUtils]: 49: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-15 15:05:06,378 INFO L272 TraceCheckUtils]: 48: Hoare triple {18091#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18091#true} is VALID [2022-04-15 15:05:06,378 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18091#true} {18091#true} #104#return; {18091#true} is VALID [2022-04-15 15:05:06,379 INFO L290 TraceCheckUtils]: 46: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-15 15:05:06,379 INFO L290 TraceCheckUtils]: 45: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-15 15:05:06,379 INFO L290 TraceCheckUtils]: 44: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-15 15:05:06,379 INFO L272 TraceCheckUtils]: 43: Hoare triple {18091#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18091#true} is VALID [2022-04-15 15:05:06,379 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {18091#true} {18091#true} #102#return; {18091#true} is VALID [2022-04-15 15:05:06,379 INFO L290 TraceCheckUtils]: 41: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-15 15:05:06,379 INFO L290 TraceCheckUtils]: 40: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-15 15:05:06,379 INFO L290 TraceCheckUtils]: 39: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-15 15:05:06,379 INFO L272 TraceCheckUtils]: 38: Hoare triple {18091#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18091#true} is VALID [2022-04-15 15:05:06,379 INFO L290 TraceCheckUtils]: 37: Hoare triple {18091#true} assume !false; {18091#true} is VALID [2022-04-15 15:05:06,379 INFO L290 TraceCheckUtils]: 36: Hoare triple {18091#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {18091#true} is VALID [2022-04-15 15:05:06,380 INFO L290 TraceCheckUtils]: 35: Hoare triple {18091#true} assume !false; {18091#true} is VALID [2022-04-15 15:05:06,380 INFO L290 TraceCheckUtils]: 34: Hoare triple {18091#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {18091#true} is VALID [2022-04-15 15:05:06,380 INFO L290 TraceCheckUtils]: 33: Hoare triple {18091#true} assume !false; {18091#true} is VALID [2022-04-15 15:05:06,380 INFO L290 TraceCheckUtils]: 32: Hoare triple {18091#true} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {18091#true} is VALID [2022-04-15 15:05:06,380 INFO L290 TraceCheckUtils]: 31: Hoare triple {18091#true} assume !(~c~0 >= ~b~0); {18091#true} is VALID [2022-04-15 15:05:06,380 INFO L290 TraceCheckUtils]: 30: Hoare triple {18091#true} assume !false; {18091#true} is VALID [2022-04-15 15:05:06,380 INFO L290 TraceCheckUtils]: 29: Hoare triple {18091#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {18091#true} is VALID [2022-04-15 15:05:06,380 INFO L290 TraceCheckUtils]: 28: Hoare triple {18091#true} assume !false; {18091#true} is VALID [2022-04-15 15:05:06,380 INFO L290 TraceCheckUtils]: 27: Hoare triple {18091#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {18091#true} is VALID [2022-04-15 15:05:06,381 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18091#true} {18091#true} #100#return; {18091#true} is VALID [2022-04-15 15:05:06,381 INFO L290 TraceCheckUtils]: 25: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-15 15:05:06,381 INFO L290 TraceCheckUtils]: 24: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-15 15:05:06,381 INFO L290 TraceCheckUtils]: 23: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-15 15:05:06,381 INFO L272 TraceCheckUtils]: 22: Hoare triple {18091#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18091#true} is VALID [2022-04-15 15:05:06,381 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {18091#true} {18091#true} #98#return; {18091#true} is VALID [2022-04-15 15:05:06,381 INFO L290 TraceCheckUtils]: 20: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-15 15:05:06,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-15 15:05:06,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-15 15:05:06,381 INFO L272 TraceCheckUtils]: 17: Hoare triple {18091#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18091#true} is VALID [2022-04-15 15:05:06,382 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {18091#true} {18091#true} #96#return; {18091#true} is VALID [2022-04-15 15:05:06,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-15 15:05:06,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-15 15:05:06,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-15 15:05:06,382 INFO L272 TraceCheckUtils]: 12: Hoare triple {18091#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {18091#true} is VALID [2022-04-15 15:05:06,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {18091#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {18091#true} is VALID [2022-04-15 15:05:06,382 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18091#true} {18091#true} #94#return; {18091#true} is VALID [2022-04-15 15:05:06,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-15 15:05:06,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-15 15:05:06,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-15 15:05:06,383 INFO L272 TraceCheckUtils]: 6: Hoare triple {18091#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {18091#true} is VALID [2022-04-15 15:05:06,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {18091#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {18091#true} is VALID [2022-04-15 15:05:06,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {18091#true} call #t~ret6 := main(); {18091#true} is VALID [2022-04-15 15:05:06,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18091#true} {18091#true} #112#return; {18091#true} is VALID [2022-04-15 15:05:06,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-15 15:05:06,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {18091#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {18091#true} is VALID [2022-04-15 15:05:06,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {18091#true} call ULTIMATE.init(); {18091#true} is VALID [2022-04-15 15:05:06,384 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 73 proven. 4 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-04-15 15:05:06,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:05:06,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051166792] [2022-04-15 15:05:06,384 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:05:06,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266386848] [2022-04-15 15:05:06,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266386848] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:05:06,384 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:05:06,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 14] total 32 [2022-04-15 15:05:06,385 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:05:06,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1042935853] [2022-04-15 15:05:06,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1042935853] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:05:06,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:05:06,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 15:05:06,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587943697] [2022-04-15 15:05:06,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:05:06,386 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) Word has length 91 [2022-04-15 15:05:06,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:05:06,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-15 15:05:06,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:05:06,489 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 15:05:06,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:05:06,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 15:05:06,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2022-04-15 15:05:06,490 INFO L87 Difference]: Start difference. First operand 225 states and 313 transitions. Second operand has 23 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-15 15:05:12,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:05:12,311 INFO L93 Difference]: Finished difference Result 328 states and 448 transitions. [2022-04-15 15:05:12,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 15:05:12,311 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) Word has length 91 [2022-04-15 15:05:12,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:05:12,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-15 15:05:12,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 181 transitions. [2022-04-15 15:05:12,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-15 15:05:12,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 181 transitions. [2022-04-15 15:05:12,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 181 transitions. [2022-04-15 15:05:12,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:05:12,552 INFO L225 Difference]: With dead ends: 328 [2022-04-15 15:05:12,553 INFO L226 Difference]: Without dead ends: 270 [2022-04-15 15:05:12,555 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 149 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=229, Invalid=1331, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 15:05:12,556 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 101 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:05:12,556 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 283 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-15 15:05:12,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-04-15 15:05:13,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 258. [2022-04-15 15:05:13,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:05:13,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 270 states. Second operand has 258 states, 144 states have (on average 1.1805555555555556) internal successors, (170), 145 states have internal predecessors, (170), 95 states have call successors, (95), 19 states have call predecessors, (95), 18 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2022-04-15 15:05:13,535 INFO L74 IsIncluded]: Start isIncluded. First operand 270 states. Second operand has 258 states, 144 states have (on average 1.1805555555555556) internal successors, (170), 145 states have internal predecessors, (170), 95 states have call successors, (95), 19 states have call predecessors, (95), 18 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2022-04-15 15:05:13,536 INFO L87 Difference]: Start difference. First operand 270 states. Second operand has 258 states, 144 states have (on average 1.1805555555555556) internal successors, (170), 145 states have internal predecessors, (170), 95 states have call successors, (95), 19 states have call predecessors, (95), 18 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2022-04-15 15:05:13,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:05:13,543 INFO L93 Difference]: Finished difference Result 270 states and 370 transitions. [2022-04-15 15:05:13,543 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 370 transitions. [2022-04-15 15:05:13,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:05:13,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:05:13,545 INFO L74 IsIncluded]: Start isIncluded. First operand has 258 states, 144 states have (on average 1.1805555555555556) internal successors, (170), 145 states have internal predecessors, (170), 95 states have call successors, (95), 19 states have call predecessors, (95), 18 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) Second operand 270 states. [2022-04-15 15:05:13,546 INFO L87 Difference]: Start difference. First operand has 258 states, 144 states have (on average 1.1805555555555556) internal successors, (170), 145 states have internal predecessors, (170), 95 states have call successors, (95), 19 states have call predecessors, (95), 18 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) Second operand 270 states. [2022-04-15 15:05:13,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:05:13,553 INFO L93 Difference]: Finished difference Result 270 states and 370 transitions. [2022-04-15 15:05:13,553 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 370 transitions. [2022-04-15 15:05:13,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:05:13,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:05:13,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:05:13,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:05:13,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 144 states have (on average 1.1805555555555556) internal successors, (170), 145 states have internal predecessors, (170), 95 states have call successors, (95), 19 states have call predecessors, (95), 18 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2022-04-15 15:05:13,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 358 transitions. [2022-04-15 15:05:13,563 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 358 transitions. Word has length 91 [2022-04-15 15:05:13,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:05:13,563 INFO L478 AbstractCegarLoop]: Abstraction has 258 states and 358 transitions. [2022-04-15 15:05:13,564 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-15 15:05:13,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 258 states and 358 transitions. [2022-04-15 15:05:14,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 358 edges. 358 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:05:14,355 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 358 transitions. [2022-04-15 15:05:14,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-15 15:05:14,357 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:05:14,357 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:05:14,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-15 15:05:14,579 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:05:14,579 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:05:14,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:05:14,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1948981098, now seen corresponding path program 5 times [2022-04-15 15:05:14,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:05:14,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1308292571] [2022-04-15 15:05:14,580 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:05:14,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1948981098, now seen corresponding path program 6 times [2022-04-15 15:05:14,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:05:14,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451939240] [2022-04-15 15:05:14,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:05:14,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:05:14,591 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:05:14,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [799941477] [2022-04-15 15:05:14,592 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:05:14,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:05:14,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:05:14,593 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:05:14,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 15:05:14,655 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 15:05:14,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:05:14,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-15 15:05:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:05:14,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:05:16,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {20396#true} call ULTIMATE.init(); {20396#true} is VALID [2022-04-15 15:05:16,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {20396#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {20396#true} is VALID [2022-04-15 15:05:16,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-15 15:05:16,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20396#true} {20396#true} #112#return; {20396#true} is VALID [2022-04-15 15:05:16,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {20396#true} call #t~ret6 := main(); {20396#true} is VALID [2022-04-15 15:05:16,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {20396#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {20396#true} is VALID [2022-04-15 15:05:16,689 INFO L272 TraceCheckUtils]: 6: Hoare triple {20396#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {20396#true} is VALID [2022-04-15 15:05:16,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {20396#true} ~cond := #in~cond; {20422#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 15:05:16,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {20422#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {20426#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 15:05:16,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {20426#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {20426#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 15:05:16,691 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20426#(not (= |assume_abort_if_not_#in~cond| 0))} {20396#true} #94#return; {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 15:05:16,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 15:05:16,691 INFO L272 TraceCheckUtils]: 12: Hoare triple {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {20396#true} is VALID [2022-04-15 15:05:16,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-15 15:05:16,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-15 15:05:16,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-15 15:05:16,692 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20396#true} {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #96#return; {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 15:05:16,692 INFO L272 TraceCheckUtils]: 17: Hoare triple {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {20396#true} is VALID [2022-04-15 15:05:16,692 INFO L290 TraceCheckUtils]: 18: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-15 15:05:16,692 INFO L290 TraceCheckUtils]: 19: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-15 15:05:16,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-15 15:05:16,692 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {20396#true} {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #98#return; {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 15:05:16,692 INFO L272 TraceCheckUtils]: 22: Hoare triple {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {20396#true} is VALID [2022-04-15 15:05:16,692 INFO L290 TraceCheckUtils]: 23: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-15 15:05:16,693 INFO L290 TraceCheckUtils]: 24: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-15 15:05:16,693 INFO L290 TraceCheckUtils]: 25: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-15 15:05:16,693 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20396#true} {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #100#return; {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 15:05:16,693 INFO L290 TraceCheckUtils]: 27: Hoare triple {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {20485#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:05:16,694 INFO L290 TraceCheckUtils]: 28: Hoare triple {20485#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {20485#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:05:16,694 INFO L290 TraceCheckUtils]: 29: Hoare triple {20485#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:05:16,695 INFO L290 TraceCheckUtils]: 30: Hoare triple {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:05:16,695 INFO L290 TraceCheckUtils]: 31: Hoare triple {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:05:16,695 INFO L290 TraceCheckUtils]: 32: Hoare triple {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:05:16,696 INFO L272 TraceCheckUtils]: 33: Hoare triple {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20396#true} is VALID [2022-04-15 15:05:16,696 INFO L290 TraceCheckUtils]: 34: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-15 15:05:16,696 INFO L290 TraceCheckUtils]: 35: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-15 15:05:16,696 INFO L290 TraceCheckUtils]: 36: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-15 15:05:16,696 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {20396#true} {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #102#return; {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:05:16,696 INFO L272 TraceCheckUtils]: 38: Hoare triple {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20396#true} is VALID [2022-04-15 15:05:16,697 INFO L290 TraceCheckUtils]: 39: Hoare triple {20396#true} ~cond := #in~cond; {20523#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:05:16,697 INFO L290 TraceCheckUtils]: 40: Hoare triple {20523#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:05:16,697 INFO L290 TraceCheckUtils]: 41: Hoare triple {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:05:16,698 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #104#return; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:05:16,698 INFO L272 TraceCheckUtils]: 43: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20396#true} is VALID [2022-04-15 15:05:16,698 INFO L290 TraceCheckUtils]: 44: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-15 15:05:16,698 INFO L290 TraceCheckUtils]: 45: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-15 15:05:16,698 INFO L290 TraceCheckUtils]: 46: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-15 15:05:16,699 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20396#true} {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #106#return; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:05:16,699 INFO L272 TraceCheckUtils]: 48: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {20396#true} is VALID [2022-04-15 15:05:16,699 INFO L290 TraceCheckUtils]: 49: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-15 15:05:16,699 INFO L290 TraceCheckUtils]: 50: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-15 15:05:16,699 INFO L290 TraceCheckUtils]: 51: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-15 15:05:16,700 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {20396#true} {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #108#return; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:05:16,700 INFO L290 TraceCheckUtils]: 53: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:05:16,701 INFO L290 TraceCheckUtils]: 54: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:05:16,701 INFO L272 TraceCheckUtils]: 55: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20396#true} is VALID [2022-04-15 15:05:16,701 INFO L290 TraceCheckUtils]: 56: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-15 15:05:16,701 INFO L290 TraceCheckUtils]: 57: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-15 15:05:16,701 INFO L290 TraceCheckUtils]: 58: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-15 15:05:16,702 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {20396#true} {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #102#return; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:05:16,702 INFO L272 TraceCheckUtils]: 60: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20396#true} is VALID [2022-04-15 15:05:16,702 INFO L290 TraceCheckUtils]: 61: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-15 15:05:16,702 INFO L290 TraceCheckUtils]: 62: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-15 15:05:16,702 INFO L290 TraceCheckUtils]: 63: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-15 15:05:16,703 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {20396#true} {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #104#return; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:05:16,703 INFO L272 TraceCheckUtils]: 65: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20396#true} is VALID [2022-04-15 15:05:16,703 INFO L290 TraceCheckUtils]: 66: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-15 15:05:16,703 INFO L290 TraceCheckUtils]: 67: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-15 15:05:16,703 INFO L290 TraceCheckUtils]: 68: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-15 15:05:16,704 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {20396#true} {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #106#return; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:05:16,704 INFO L272 TraceCheckUtils]: 70: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {20396#true} is VALID [2022-04-15 15:05:16,704 INFO L290 TraceCheckUtils]: 71: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-15 15:05:16,704 INFO L290 TraceCheckUtils]: 72: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-15 15:05:16,704 INFO L290 TraceCheckUtils]: 73: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-15 15:05:16,705 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {20396#true} {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #108#return; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:05:16,705 INFO L290 TraceCheckUtils]: 75: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:05:16,705 INFO L290 TraceCheckUtils]: 76: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:05:16,706 INFO L272 TraceCheckUtils]: 77: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20396#true} is VALID [2022-04-15 15:05:16,706 INFO L290 TraceCheckUtils]: 78: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-15 15:05:16,706 INFO L290 TraceCheckUtils]: 79: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-15 15:05:16,706 INFO L290 TraceCheckUtils]: 80: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-15 15:05:16,706 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {20396#true} {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #102#return; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:05:16,706 INFO L272 TraceCheckUtils]: 82: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20396#true} is VALID [2022-04-15 15:05:16,707 INFO L290 TraceCheckUtils]: 83: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-15 15:05:16,707 INFO L290 TraceCheckUtils]: 84: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-15 15:05:16,707 INFO L290 TraceCheckUtils]: 85: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-15 15:05:16,707 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {20396#true} {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #104#return; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:05:16,707 INFO L272 TraceCheckUtils]: 87: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20396#true} is VALID [2022-04-15 15:05:16,707 INFO L290 TraceCheckUtils]: 88: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-15 15:05:16,707 INFO L290 TraceCheckUtils]: 89: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-15 15:05:16,708 INFO L290 TraceCheckUtils]: 90: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-15 15:05:16,708 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {20396#true} {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #106#return; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:05:16,708 INFO L272 TraceCheckUtils]: 92: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {20396#true} is VALID [2022-04-15 15:05:16,708 INFO L290 TraceCheckUtils]: 93: Hoare triple {20396#true} ~cond := #in~cond; {20523#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:05:16,709 INFO L290 TraceCheckUtils]: 94: Hoare triple {20523#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:05:16,709 INFO L290 TraceCheckUtils]: 95: Hoare triple {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:05:16,710 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #108#return; {20697#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:05:16,711 INFO L290 TraceCheckUtils]: 97: Hoare triple {20697#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {20701#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (not (<= (* main_~v~0 2) main_~c~0)) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:05:16,712 INFO L290 TraceCheckUtils]: 98: Hoare triple {20701#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (not (<= (* main_~v~0 2) main_~c~0)) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {20705#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (not (<= (* main_~b~0 main_~k~0) main_~c~0)) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:05:16,713 INFO L290 TraceCheckUtils]: 99: Hoare triple {20705#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (not (<= (* main_~b~0 main_~k~0) main_~c~0)) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {20705#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (not (<= (* main_~b~0 main_~k~0) main_~c~0)) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:05:16,713 INFO L290 TraceCheckUtils]: 100: Hoare triple {20705#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (not (<= (* main_~b~0 main_~k~0) main_~c~0)) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (<= main_~x~0 2) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {20712#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (not (<= (* main_~b~0 main_~k~0) main_~c~0)) (= main_~s~0 1) (<= 0 main_~x~0) (not (<= main_~b~0 main_~c~0)) (= main_~q~0 0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-15 15:05:16,715 INFO L290 TraceCheckUtils]: 101: Hoare triple {20712#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (not (<= (* main_~b~0 main_~k~0) main_~c~0)) (= main_~s~0 1) (<= 0 main_~x~0) (not (<= main_~b~0 main_~c~0)) (= main_~q~0 0) (<= main_~x~0 2) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {20716#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~p~0 0) (= main_~b~0 (+ main_~x~0 (* main_~a~0 main_~s~0))) (<= 0 main_~x~0) (= main_~r~0 1) (= (+ main_~q~0 (* main_~p~0 (* (- 1) main_~s~0))) 1) (not (<= 0 (+ main_~x~0 (* 2 (* main_~a~0 main_~s~0))))) (not (<= main_~a~0 (+ main_~x~0 (* main_~a~0 main_~s~0)))) (<= main_~x~0 2))} is VALID [2022-04-15 15:05:16,716 INFO L290 TraceCheckUtils]: 102: Hoare triple {20716#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~p~0 0) (= main_~b~0 (+ main_~x~0 (* main_~a~0 main_~s~0))) (<= 0 main_~x~0) (= main_~r~0 1) (= (+ main_~q~0 (* main_~p~0 (* (- 1) main_~s~0))) 1) (not (<= 0 (+ main_~x~0 (* 2 (* main_~a~0 main_~s~0))))) (not (<= main_~a~0 (+ main_~x~0 (* main_~a~0 main_~s~0)))) (<= main_~x~0 2))} assume !false; {20716#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~p~0 0) (= main_~b~0 (+ main_~x~0 (* main_~a~0 main_~s~0))) (<= 0 main_~x~0) (= main_~r~0 1) (= (+ main_~q~0 (* main_~p~0 (* (- 1) main_~s~0))) 1) (not (<= 0 (+ main_~x~0 (* 2 (* main_~a~0 main_~s~0))))) (not (<= main_~a~0 (+ main_~x~0 (* main_~a~0 main_~s~0)))) (<= main_~x~0 2))} is VALID [2022-04-15 15:05:16,717 INFO L290 TraceCheckUtils]: 103: Hoare triple {20716#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~p~0 0) (= main_~b~0 (+ main_~x~0 (* main_~a~0 main_~s~0))) (<= 0 main_~x~0) (= main_~r~0 1) (= (+ main_~q~0 (* main_~p~0 (* (- 1) main_~s~0))) 1) (not (<= 0 (+ main_~x~0 (* 2 (* main_~a~0 main_~s~0))))) (not (<= main_~a~0 (+ main_~x~0 (* main_~a~0 main_~s~0)))) (<= main_~x~0 2))} assume !(0 != ~b~0); {20723#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= (+ main_~x~0 (* main_~a~0 main_~s~0)) 0) (< (+ main_~x~0 (* 2 (* main_~a~0 main_~s~0))) 0) (= main_~p~0 0) (< (+ main_~x~0 (* main_~a~0 main_~s~0)) main_~a~0) (= main_~r~0 1) (= main_~q~0 (+ (* main_~p~0 main_~s~0) 1)) (<= main_~x~0 2))} is VALID [2022-04-15 15:05:16,718 INFO L272 TraceCheckUtils]: 104: Hoare triple {20723#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= (+ main_~x~0 (* main_~a~0 main_~s~0)) 0) (< (+ main_~x~0 (* 2 (* main_~a~0 main_~s~0))) 0) (= main_~p~0 0) (< (+ main_~x~0 (* main_~a~0 main_~s~0)) main_~a~0) (= main_~r~0 1) (= main_~q~0 (+ (* main_~p~0 main_~s~0) 1)) (<= main_~x~0 2))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {20727#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:05:16,719 INFO L290 TraceCheckUtils]: 105: Hoare triple {20727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:05:16,719 INFO L290 TraceCheckUtils]: 106: Hoare triple {20731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20397#false} is VALID [2022-04-15 15:05:16,719 INFO L290 TraceCheckUtils]: 107: Hoare triple {20397#false} assume !false; {20397#false} is VALID [2022-04-15 15:05:16,720 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 63 proven. 42 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2022-04-15 15:05:16,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:05:35,639 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 15:07:13,908 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 15:07:45,669 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 15:08:52,647 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 15:11:56,901 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 15:15:37,609 INFO L290 TraceCheckUtils]: 107: Hoare triple {20397#false} assume !false; {20397#false} is VALID [2022-04-15 15:15:37,610 INFO L290 TraceCheckUtils]: 106: Hoare triple {20731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20397#false} is VALID [2022-04-15 15:15:37,611 INFO L290 TraceCheckUtils]: 105: Hoare triple {20727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:15:37,612 INFO L272 TraceCheckUtils]: 104: Hoare triple {20747#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {20727#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:15:37,612 INFO L290 TraceCheckUtils]: 103: Hoare triple {20751#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !(0 != ~b~0); {20747#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-15 15:15:37,613 INFO L290 TraceCheckUtils]: 102: Hoare triple {20751#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !false; {20751#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-15 15:15:37,798 INFO L290 TraceCheckUtils]: 101: Hoare triple {20758#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {20751#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-15 15:15:37,799 INFO L290 TraceCheckUtils]: 100: Hoare triple {20762#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {20758#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:15:37,799 INFO L290 TraceCheckUtils]: 99: Hoare triple {20762#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {20762#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:15:37,873 INFO L290 TraceCheckUtils]: 98: Hoare triple {20769#(or (<= (+ main_~b~0 main_~v~0) main_~c~0) (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {20762#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:15:37,874 INFO L290 TraceCheckUtils]: 97: Hoare triple {20773#(or (<= (* main_~v~0 2) main_~c~0) (<= (+ main_~b~0 main_~v~0) main_~c~0) (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= 2 * ~v~0); {20769#(or (<= (+ main_~b~0 main_~v~0) main_~c~0) (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:15:39,877 WARN L284 TraceCheckUtils]: 96: Hoare quadruple {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #108#return; {20773#(or (<= (* main_~v~0 2) main_~c~0) (<= (+ main_~b~0 main_~v~0) main_~c~0) (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is UNKNOWN [2022-04-15 15:15:39,878 INFO L290 TraceCheckUtils]: 95: Hoare triple {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:15:39,878 INFO L290 TraceCheckUtils]: 94: Hoare triple {20787#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:15:39,878 INFO L290 TraceCheckUtils]: 93: Hoare triple {20396#true} ~cond := #in~cond; {20787#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 15:15:39,878 INFO L272 TraceCheckUtils]: 92: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {20396#true} is VALID [2022-04-15 15:15:39,879 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {20396#true} {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #106#return; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:15:39,879 INFO L290 TraceCheckUtils]: 90: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-15 15:15:39,879 INFO L290 TraceCheckUtils]: 89: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-15 15:15:39,879 INFO L290 TraceCheckUtils]: 88: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-15 15:15:39,879 INFO L272 TraceCheckUtils]: 87: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20396#true} is VALID [2022-04-15 15:15:39,886 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {20396#true} {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:15:39,886 INFO L290 TraceCheckUtils]: 85: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-15 15:15:39,887 INFO L290 TraceCheckUtils]: 84: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-15 15:15:39,887 INFO L290 TraceCheckUtils]: 83: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-15 15:15:39,887 INFO L272 TraceCheckUtils]: 82: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20396#true} is VALID [2022-04-15 15:15:39,887 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {20396#true} {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #102#return; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:15:39,887 INFO L290 TraceCheckUtils]: 80: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-15 15:15:39,887 INFO L290 TraceCheckUtils]: 79: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-15 15:15:39,888 INFO L290 TraceCheckUtils]: 78: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-15 15:15:39,888 INFO L272 TraceCheckUtils]: 77: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20396#true} is VALID [2022-04-15 15:15:39,888 INFO L290 TraceCheckUtils]: 76: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:15:39,889 INFO L290 TraceCheckUtils]: 75: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:15:39,890 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {20396#true} {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #108#return; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:15:39,890 INFO L290 TraceCheckUtils]: 73: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-15 15:15:39,890 INFO L290 TraceCheckUtils]: 72: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-15 15:15:39,890 INFO L290 TraceCheckUtils]: 71: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-15 15:15:39,890 INFO L272 TraceCheckUtils]: 70: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {20396#true} is VALID [2022-04-15 15:15:39,890 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {20396#true} {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #106#return; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:15:39,891 INFO L290 TraceCheckUtils]: 68: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-15 15:15:39,891 INFO L290 TraceCheckUtils]: 67: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-15 15:15:39,891 INFO L290 TraceCheckUtils]: 66: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-15 15:15:39,891 INFO L272 TraceCheckUtils]: 65: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20396#true} is VALID [2022-04-15 15:15:39,891 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {20396#true} {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:15:39,891 INFO L290 TraceCheckUtils]: 63: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-15 15:15:39,891 INFO L290 TraceCheckUtils]: 62: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-15 15:15:39,892 INFO L290 TraceCheckUtils]: 61: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-15 15:15:39,892 INFO L272 TraceCheckUtils]: 60: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20396#true} is VALID [2022-04-15 15:15:39,892 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {20396#true} {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #102#return; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:15:39,892 INFO L290 TraceCheckUtils]: 58: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-15 15:15:39,892 INFO L290 TraceCheckUtils]: 57: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-15 15:15:39,892 INFO L290 TraceCheckUtils]: 56: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-15 15:15:39,893 INFO L272 TraceCheckUtils]: 55: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20396#true} is VALID [2022-04-15 15:15:39,893 INFO L290 TraceCheckUtils]: 54: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:15:39,894 INFO L290 TraceCheckUtils]: 53: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:15:39,894 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {20396#true} {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #108#return; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:15:39,894 INFO L290 TraceCheckUtils]: 51: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-15 15:15:39,894 INFO L290 TraceCheckUtils]: 50: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-15 15:15:39,895 INFO L290 TraceCheckUtils]: 49: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-15 15:15:39,895 INFO L272 TraceCheckUtils]: 48: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {20396#true} is VALID [2022-04-15 15:15:39,896 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20396#true} {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #106#return; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:15:39,896 INFO L290 TraceCheckUtils]: 46: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-15 15:15:39,896 INFO L290 TraceCheckUtils]: 45: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-15 15:15:39,896 INFO L290 TraceCheckUtils]: 44: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-15 15:15:39,896 INFO L272 TraceCheckUtils]: 43: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20396#true} is VALID [2022-04-15 15:15:39,897 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:15:39,897 INFO L290 TraceCheckUtils]: 41: Hoare triple {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:15:39,897 INFO L290 TraceCheckUtils]: 40: Hoare triple {20787#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:15:39,898 INFO L290 TraceCheckUtils]: 39: Hoare triple {20396#true} ~cond := #in~cond; {20787#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 15:15:39,898 INFO L272 TraceCheckUtils]: 38: Hoare triple {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20396#true} is VALID [2022-04-15 15:15:39,898 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {20396#true} {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #102#return; {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:15:39,898 INFO L290 TraceCheckUtils]: 36: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-15 15:15:39,899 INFO L290 TraceCheckUtils]: 35: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-15 15:15:39,899 INFO L290 TraceCheckUtils]: 34: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-15 15:15:39,899 INFO L272 TraceCheckUtils]: 33: Hoare triple {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20396#true} is VALID [2022-04-15 15:15:39,899 INFO L290 TraceCheckUtils]: 32: Hoare triple {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:15:39,900 INFO L290 TraceCheckUtils]: 31: Hoare triple {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:15:39,900 INFO L290 TraceCheckUtils]: 30: Hoare triple {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:15:39,901 INFO L290 TraceCheckUtils]: 29: Hoare triple {20981#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 0) (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~y~0 main_~s~0 0) (* main_~y~0 main_~s~0) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0)))) (<= main_~a~0 0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-15 15:15:39,901 INFO L290 TraceCheckUtils]: 28: Hoare triple {20981#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 0) (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~y~0 main_~s~0 0) (* main_~y~0 main_~s~0) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0)))) (<= main_~a~0 0))} assume !false; {20981#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 0) (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~y~0 main_~s~0 0) (* main_~y~0 main_~s~0) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0)))) (<= main_~a~0 0))} is VALID [2022-04-15 15:15:39,903 INFO L290 TraceCheckUtils]: 27: Hoare triple {20396#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {20981#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 0) (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~y~0 main_~s~0 0) (* main_~y~0 main_~s~0) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0)))) (<= main_~a~0 0))} is VALID [2022-04-15 15:15:39,903 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20396#true} {20396#true} #100#return; {20396#true} is VALID [2022-04-15 15:15:39,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-15 15:15:39,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-15 15:15:39,903 INFO L290 TraceCheckUtils]: 23: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-15 15:15:39,903 INFO L272 TraceCheckUtils]: 22: Hoare triple {20396#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {20396#true} is VALID [2022-04-15 15:15:39,903 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {20396#true} {20396#true} #98#return; {20396#true} is VALID [2022-04-15 15:15:39,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-15 15:15:39,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-15 15:15:39,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-15 15:15:39,903 INFO L272 TraceCheckUtils]: 17: Hoare triple {20396#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {20396#true} is VALID [2022-04-15 15:15:39,903 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20396#true} {20396#true} #96#return; {20396#true} is VALID [2022-04-15 15:15:39,903 INFO L290 TraceCheckUtils]: 15: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-15 15:15:39,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-15 15:15:39,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-15 15:15:39,903 INFO L272 TraceCheckUtils]: 12: Hoare triple {20396#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {20396#true} is VALID [2022-04-15 15:15:39,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {20396#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {20396#true} is VALID [2022-04-15 15:15:39,904 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20396#true} {20396#true} #94#return; {20396#true} is VALID [2022-04-15 15:15:39,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-15 15:15:39,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-15 15:15:39,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-15 15:15:39,904 INFO L272 TraceCheckUtils]: 6: Hoare triple {20396#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {20396#true} is VALID [2022-04-15 15:15:39,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {20396#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {20396#true} is VALID [2022-04-15 15:15:39,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {20396#true} call #t~ret6 := main(); {20396#true} is VALID [2022-04-15 15:15:39,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20396#true} {20396#true} #112#return; {20396#true} is VALID [2022-04-15 15:15:39,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-15 15:15:39,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {20396#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {20396#true} is VALID [2022-04-15 15:15:39,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {20396#true} call ULTIMATE.init(); {20396#true} is VALID [2022-04-15 15:15:39,905 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 61 proven. 35 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-04-15 15:15:39,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:15:39,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451939240] [2022-04-15 15:15:39,905 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:15:39,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799941477] [2022-04-15 15:15:39,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799941477] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:15:39,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:15:39,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 28 [2022-04-15 15:15:39,905 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:15:39,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1308292571] [2022-04-15 15:15:39,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1308292571] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:15:39,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:15:39,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 15:15:39,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311138519] [2022-04-15 15:15:39,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:15:39,906 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 108 [2022-04-15 15:15:39,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:15:39,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-15 15:15:39,966 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-15 15:15:39,966 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 15:15:39,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:15:39,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 15:15:39,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2022-04-15 15:15:39,967 INFO L87 Difference]: Start difference. First operand 258 states and 358 transitions. Second operand has 18 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-15 15:15:45,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:45,048 INFO L93 Difference]: Finished difference Result 330 states and 459 transitions. [2022-04-15 15:15:45,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 15:15:45,049 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 108 [2022-04-15 15:15:45,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:15:45,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-15 15:15:45,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 128 transitions. [2022-04-15 15:15:45,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-15 15:15:45,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 128 transitions. [2022-04-15 15:15:45,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 128 transitions. [2022-04-15 15:15:45,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:15:45,258 INFO L225 Difference]: With dead ends: 330 [2022-04-15 15:15:45,258 INFO L226 Difference]: Without dead ends: 327 [2022-04-15 15:15:45,259 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=231, Invalid=1175, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 15:15:45,260 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 70 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-15 15:15:45,260 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 256 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-15 15:15:45,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-04-15 15:15:46,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 317. [2022-04-15 15:15:46,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:15:46,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 327 states. Second operand has 317 states, 176 states have (on average 1.1875) internal successors, (209), 177 states have internal predecessors, (209), 119 states have call successors, (119), 22 states have call predecessors, (119), 21 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2022-04-15 15:15:46,596 INFO L74 IsIncluded]: Start isIncluded. First operand 327 states. Second operand has 317 states, 176 states have (on average 1.1875) internal successors, (209), 177 states have internal predecessors, (209), 119 states have call successors, (119), 22 states have call predecessors, (119), 21 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2022-04-15 15:15:46,596 INFO L87 Difference]: Start difference. First operand 327 states. Second operand has 317 states, 176 states have (on average 1.1875) internal successors, (209), 177 states have internal predecessors, (209), 119 states have call successors, (119), 22 states have call predecessors, (119), 21 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2022-04-15 15:15:46,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:46,605 INFO L93 Difference]: Finished difference Result 327 states and 455 transitions. [2022-04-15 15:15:46,605 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 455 transitions. [2022-04-15 15:15:46,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:15:46,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:15:46,607 INFO L74 IsIncluded]: Start isIncluded. First operand has 317 states, 176 states have (on average 1.1875) internal successors, (209), 177 states have internal predecessors, (209), 119 states have call successors, (119), 22 states have call predecessors, (119), 21 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) Second operand 327 states. [2022-04-15 15:15:46,608 INFO L87 Difference]: Start difference. First operand has 317 states, 176 states have (on average 1.1875) internal successors, (209), 177 states have internal predecessors, (209), 119 states have call successors, (119), 22 states have call predecessors, (119), 21 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) Second operand 327 states. [2022-04-15 15:15:46,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:46,618 INFO L93 Difference]: Finished difference Result 327 states and 455 transitions. [2022-04-15 15:15:46,618 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 455 transitions. [2022-04-15 15:15:46,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:15:46,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:15:46,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:15:46,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:15:46,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 176 states have (on average 1.1875) internal successors, (209), 177 states have internal predecessors, (209), 119 states have call successors, (119), 22 states have call predecessors, (119), 21 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2022-04-15 15:15:46,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 445 transitions. [2022-04-15 15:15:46,631 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 445 transitions. Word has length 108 [2022-04-15 15:15:46,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:15:46,631 INFO L478 AbstractCegarLoop]: Abstraction has 317 states and 445 transitions. [2022-04-15 15:15:46,631 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-15 15:15:46,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 317 states and 445 transitions. [2022-04-15 15:15:47,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:15:47,688 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 445 transitions. [2022-04-15 15:15:47,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-15 15:15:47,691 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:15:47,691 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:15:47,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-15 15:15:47,905 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-15 15:15:47,906 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:15:47,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:15:47,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1002671399, now seen corresponding path program 7 times [2022-04-15 15:15:47,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:15:47,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1868846716] [2022-04-15 15:15:47,907 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:15:47,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1002671399, now seen corresponding path program 8 times [2022-04-15 15:15:47,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:15:47,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366053324] [2022-04-15 15:15:47,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:15:47,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:15:47,923 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:15:47,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1828947207] [2022-04-15 15:15:47,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:15:47,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:15:47,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:15:47,925 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:15:47,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 15:15:47,983 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:15:47,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:15:47,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 15:15:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:15:48,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:15:48,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {23039#true} call ULTIMATE.init(); {23039#true} is VALID [2022-04-15 15:15:48,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {23039#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {23039#true} is VALID [2022-04-15 15:15:48,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-15 15:15:48,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23039#true} {23039#true} #112#return; {23039#true} is VALID [2022-04-15 15:15:48,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {23039#true} call #t~ret6 := main(); {23039#true} is VALID [2022-04-15 15:15:48,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {23039#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {23039#true} is VALID [2022-04-15 15:15:48,835 INFO L272 TraceCheckUtils]: 6: Hoare triple {23039#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {23039#true} is VALID [2022-04-15 15:15:48,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {23039#true} ~cond := #in~cond; {23065#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 15:15:48,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {23065#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {23069#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 15:15:48,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {23069#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {23069#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 15:15:48,837 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23069#(not (= |assume_abort_if_not_#in~cond| 0))} {23039#true} #94#return; {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 15:15:48,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 15:15:48,837 INFO L272 TraceCheckUtils]: 12: Hoare triple {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {23039#true} is VALID [2022-04-15 15:15:48,837 INFO L290 TraceCheckUtils]: 13: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-15 15:15:48,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-15 15:15:48,838 INFO L290 TraceCheckUtils]: 15: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-15 15:15:48,838 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {23039#true} {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #96#return; {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 15:15:48,838 INFO L272 TraceCheckUtils]: 17: Hoare triple {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {23039#true} is VALID [2022-04-15 15:15:48,838 INFO L290 TraceCheckUtils]: 18: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-15 15:15:48,838 INFO L290 TraceCheckUtils]: 19: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-15 15:15:48,838 INFO L290 TraceCheckUtils]: 20: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-15 15:15:48,839 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {23039#true} {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #98#return; {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 15:15:48,839 INFO L272 TraceCheckUtils]: 22: Hoare triple {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {23039#true} is VALID [2022-04-15 15:15:48,839 INFO L290 TraceCheckUtils]: 23: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-15 15:15:48,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-15 15:15:48,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-15 15:15:48,839 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {23039#true} {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #100#return; {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 15:15:48,840 INFO L290 TraceCheckUtils]: 27: Hoare triple {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {23128#(<= main_~a~0 2)} is VALID [2022-04-15 15:15:48,840 INFO L290 TraceCheckUtils]: 28: Hoare triple {23128#(<= main_~a~0 2)} assume !false; {23128#(<= main_~a~0 2)} is VALID [2022-04-15 15:15:48,841 INFO L290 TraceCheckUtils]: 29: Hoare triple {23128#(<= main_~a~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {23135#(<= main_~c~0 2)} is VALID [2022-04-15 15:15:48,841 INFO L290 TraceCheckUtils]: 30: Hoare triple {23135#(<= main_~c~0 2)} assume !false; {23135#(<= main_~c~0 2)} is VALID [2022-04-15 15:15:48,841 INFO L290 TraceCheckUtils]: 31: Hoare triple {23135#(<= main_~c~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-15 15:15:48,842 INFO L290 TraceCheckUtils]: 32: Hoare triple {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} assume !false; {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-15 15:15:48,842 INFO L272 TraceCheckUtils]: 33: Hoare triple {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23039#true} is VALID [2022-04-15 15:15:48,842 INFO L290 TraceCheckUtils]: 34: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-15 15:15:48,842 INFO L290 TraceCheckUtils]: 35: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-15 15:15:48,842 INFO L290 TraceCheckUtils]: 36: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-15 15:15:48,843 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {23039#true} {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} #102#return; {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-15 15:15:48,843 INFO L272 TraceCheckUtils]: 38: Hoare triple {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23039#true} is VALID [2022-04-15 15:15:48,843 INFO L290 TraceCheckUtils]: 39: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-15 15:15:48,843 INFO L290 TraceCheckUtils]: 40: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-15 15:15:48,843 INFO L290 TraceCheckUtils]: 41: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-15 15:15:48,844 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {23039#true} {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} #104#return; {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-15 15:15:48,844 INFO L272 TraceCheckUtils]: 43: Hoare triple {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23039#true} is VALID [2022-04-15 15:15:48,844 INFO L290 TraceCheckUtils]: 44: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-15 15:15:48,844 INFO L290 TraceCheckUtils]: 45: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-15 15:15:48,844 INFO L290 TraceCheckUtils]: 46: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-15 15:15:48,845 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23039#true} {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} #106#return; {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-15 15:15:48,845 INFO L272 TraceCheckUtils]: 48: Hoare triple {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {23039#true} is VALID [2022-04-15 15:15:48,845 INFO L290 TraceCheckUtils]: 49: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-15 15:15:48,845 INFO L290 TraceCheckUtils]: 50: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-15 15:15:48,845 INFO L290 TraceCheckUtils]: 51: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-15 15:15:48,846 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {23039#true} {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} #108#return; {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-15 15:15:48,846 INFO L290 TraceCheckUtils]: 53: Hoare triple {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-15 15:15:48,847 INFO L290 TraceCheckUtils]: 54: Hoare triple {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} assume !false; {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-15 15:15:48,847 INFO L272 TraceCheckUtils]: 55: Hoare triple {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23039#true} is VALID [2022-04-15 15:15:48,847 INFO L290 TraceCheckUtils]: 56: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-15 15:15:48,847 INFO L290 TraceCheckUtils]: 57: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-15 15:15:48,847 INFO L290 TraceCheckUtils]: 58: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-15 15:15:48,848 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {23039#true} {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #102#return; {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-15 15:15:48,848 INFO L272 TraceCheckUtils]: 60: Hoare triple {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23039#true} is VALID [2022-04-15 15:15:48,848 INFO L290 TraceCheckUtils]: 61: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-15 15:15:48,848 INFO L290 TraceCheckUtils]: 62: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-15 15:15:48,848 INFO L290 TraceCheckUtils]: 63: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-15 15:15:48,849 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {23039#true} {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #104#return; {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-15 15:15:48,849 INFO L272 TraceCheckUtils]: 65: Hoare triple {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23039#true} is VALID [2022-04-15 15:15:48,849 INFO L290 TraceCheckUtils]: 66: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-15 15:15:48,849 INFO L290 TraceCheckUtils]: 67: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-15 15:15:48,849 INFO L290 TraceCheckUtils]: 68: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-15 15:15:48,850 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {23039#true} {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #106#return; {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-15 15:15:48,850 INFO L272 TraceCheckUtils]: 70: Hoare triple {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {23039#true} is VALID [2022-04-15 15:15:48,850 INFO L290 TraceCheckUtils]: 71: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-15 15:15:48,850 INFO L290 TraceCheckUtils]: 72: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-15 15:15:48,850 INFO L290 TraceCheckUtils]: 73: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-15 15:15:48,851 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {23039#true} {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #108#return; {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-15 15:15:48,851 INFO L290 TraceCheckUtils]: 75: Hoare triple {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} assume !(~c~0 >= 2 * ~v~0); {23276#(and (<= main_~c~0 2) (not (<= (* main_~v~0 2) main_~c~0)) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-15 15:15:48,852 INFO L290 TraceCheckUtils]: 76: Hoare triple {23276#(and (<= main_~c~0 2) (not (<= (* main_~v~0 2) main_~c~0)) (<= (div (- main_~v~0) (- 2)) main_~b~0))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {23280#(and (< (* main_~c~0 2) 2) (< (div (+ (- 1) (* (- 1) main_~c~0)) (- 2)) (+ main_~b~0 1)))} is VALID [2022-04-15 15:15:48,853 INFO L290 TraceCheckUtils]: 77: Hoare triple {23280#(and (< (* main_~c~0 2) 2) (< (div (+ (- 1) (* (- 1) main_~c~0)) (- 2)) (+ main_~b~0 1)))} assume !false; {23280#(and (< (* main_~c~0 2) 2) (< (div (+ (- 1) (* (- 1) main_~c~0)) (- 2)) (+ main_~b~0 1)))} is VALID [2022-04-15 15:15:48,854 INFO L290 TraceCheckUtils]: 78: Hoare triple {23280#(and (< (* main_~c~0 2) 2) (< (div (+ (- 1) (* (- 1) main_~c~0)) (- 2)) (+ main_~b~0 1)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {23040#false} is VALID [2022-04-15 15:15:48,854 INFO L290 TraceCheckUtils]: 79: Hoare triple {23040#false} assume !false; {23040#false} is VALID [2022-04-15 15:15:48,855 INFO L272 TraceCheckUtils]: 80: Hoare triple {23040#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23040#false} is VALID [2022-04-15 15:15:48,855 INFO L290 TraceCheckUtils]: 81: Hoare triple {23040#false} ~cond := #in~cond; {23040#false} is VALID [2022-04-15 15:15:48,855 INFO L290 TraceCheckUtils]: 82: Hoare triple {23040#false} assume !(0 == ~cond); {23040#false} is VALID [2022-04-15 15:15:48,855 INFO L290 TraceCheckUtils]: 83: Hoare triple {23040#false} assume true; {23040#false} is VALID [2022-04-15 15:15:48,855 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {23040#false} {23040#false} #102#return; {23040#false} is VALID [2022-04-15 15:15:48,855 INFO L272 TraceCheckUtils]: 85: Hoare triple {23040#false} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23040#false} is VALID [2022-04-15 15:15:48,855 INFO L290 TraceCheckUtils]: 86: Hoare triple {23040#false} ~cond := #in~cond; {23040#false} is VALID [2022-04-15 15:15:48,855 INFO L290 TraceCheckUtils]: 87: Hoare triple {23040#false} assume !(0 == ~cond); {23040#false} is VALID [2022-04-15 15:15:48,855 INFO L290 TraceCheckUtils]: 88: Hoare triple {23040#false} assume true; {23040#false} is VALID [2022-04-15 15:15:48,855 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {23040#false} {23040#false} #104#return; {23040#false} is VALID [2022-04-15 15:15:48,855 INFO L272 TraceCheckUtils]: 90: Hoare triple {23040#false} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23040#false} is VALID [2022-04-15 15:15:48,855 INFO L290 TraceCheckUtils]: 91: Hoare triple {23040#false} ~cond := #in~cond; {23040#false} is VALID [2022-04-15 15:15:48,855 INFO L290 TraceCheckUtils]: 92: Hoare triple {23040#false} assume !(0 == ~cond); {23040#false} is VALID [2022-04-15 15:15:48,856 INFO L290 TraceCheckUtils]: 93: Hoare triple {23040#false} assume true; {23040#false} is VALID [2022-04-15 15:15:48,856 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {23040#false} {23040#false} #106#return; {23040#false} is VALID [2022-04-15 15:15:48,856 INFO L272 TraceCheckUtils]: 95: Hoare triple {23040#false} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {23040#false} is VALID [2022-04-15 15:15:48,856 INFO L290 TraceCheckUtils]: 96: Hoare triple {23040#false} ~cond := #in~cond; {23040#false} is VALID [2022-04-15 15:15:48,856 INFO L290 TraceCheckUtils]: 97: Hoare triple {23040#false} assume !(0 == ~cond); {23040#false} is VALID [2022-04-15 15:15:48,856 INFO L290 TraceCheckUtils]: 98: Hoare triple {23040#false} assume true; {23040#false} is VALID [2022-04-15 15:15:48,856 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {23040#false} {23040#false} #108#return; {23040#false} is VALID [2022-04-15 15:15:48,856 INFO L290 TraceCheckUtils]: 100: Hoare triple {23040#false} assume !(~c~0 >= 2 * ~v~0); {23040#false} is VALID [2022-04-15 15:15:48,856 INFO L290 TraceCheckUtils]: 101: Hoare triple {23040#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {23040#false} is VALID [2022-04-15 15:15:48,856 INFO L290 TraceCheckUtils]: 102: Hoare triple {23040#false} assume !false; {23040#false} is VALID [2022-04-15 15:15:48,856 INFO L290 TraceCheckUtils]: 103: Hoare triple {23040#false} assume !(~c~0 >= ~b~0); {23040#false} is VALID [2022-04-15 15:15:48,857 INFO L290 TraceCheckUtils]: 104: Hoare triple {23040#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {23040#false} is VALID [2022-04-15 15:15:48,857 INFO L290 TraceCheckUtils]: 105: Hoare triple {23040#false} assume !false; {23040#false} is VALID [2022-04-15 15:15:48,857 INFO L290 TraceCheckUtils]: 106: Hoare triple {23040#false} assume !(0 != ~b~0); {23040#false} is VALID [2022-04-15 15:15:48,857 INFO L272 TraceCheckUtils]: 107: Hoare triple {23040#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {23040#false} is VALID [2022-04-15 15:15:48,857 INFO L290 TraceCheckUtils]: 108: Hoare triple {23040#false} ~cond := #in~cond; {23040#false} is VALID [2022-04-15 15:15:48,857 INFO L290 TraceCheckUtils]: 109: Hoare triple {23040#false} assume 0 == ~cond; {23040#false} is VALID [2022-04-15 15:15:48,857 INFO L290 TraceCheckUtils]: 110: Hoare triple {23040#false} assume !false; {23040#false} is VALID [2022-04-15 15:15:48,858 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 165 proven. 15 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2022-04-15 15:15:48,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:15:49,651 INFO L290 TraceCheckUtils]: 110: Hoare triple {23040#false} assume !false; {23040#false} is VALID [2022-04-15 15:15:49,651 INFO L290 TraceCheckUtils]: 109: Hoare triple {23040#false} assume 0 == ~cond; {23040#false} is VALID [2022-04-15 15:15:49,651 INFO L290 TraceCheckUtils]: 108: Hoare triple {23040#false} ~cond := #in~cond; {23040#false} is VALID [2022-04-15 15:15:49,651 INFO L272 TraceCheckUtils]: 107: Hoare triple {23040#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {23040#false} is VALID [2022-04-15 15:15:49,651 INFO L290 TraceCheckUtils]: 106: Hoare triple {23040#false} assume !(0 != ~b~0); {23040#false} is VALID [2022-04-15 15:15:49,651 INFO L290 TraceCheckUtils]: 105: Hoare triple {23040#false} assume !false; {23040#false} is VALID [2022-04-15 15:15:49,651 INFO L290 TraceCheckUtils]: 104: Hoare triple {23040#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {23040#false} is VALID [2022-04-15 15:15:49,651 INFO L290 TraceCheckUtils]: 103: Hoare triple {23040#false} assume !(~c~0 >= ~b~0); {23040#false} is VALID [2022-04-15 15:15:49,651 INFO L290 TraceCheckUtils]: 102: Hoare triple {23040#false} assume !false; {23040#false} is VALID [2022-04-15 15:15:49,652 INFO L290 TraceCheckUtils]: 101: Hoare triple {23040#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {23040#false} is VALID [2022-04-15 15:15:49,652 INFO L290 TraceCheckUtils]: 100: Hoare triple {23040#false} assume !(~c~0 >= 2 * ~v~0); {23040#false} is VALID [2022-04-15 15:15:49,652 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {23039#true} {23040#false} #108#return; {23040#false} is VALID [2022-04-15 15:15:49,652 INFO L290 TraceCheckUtils]: 98: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-15 15:15:49,652 INFO L290 TraceCheckUtils]: 97: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-15 15:15:49,652 INFO L290 TraceCheckUtils]: 96: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-15 15:15:49,652 INFO L272 TraceCheckUtils]: 95: Hoare triple {23040#false} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {23039#true} is VALID [2022-04-15 15:15:49,652 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {23039#true} {23040#false} #106#return; {23040#false} is VALID [2022-04-15 15:15:49,652 INFO L290 TraceCheckUtils]: 93: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-15 15:15:49,652 INFO L290 TraceCheckUtils]: 92: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-15 15:15:49,652 INFO L290 TraceCheckUtils]: 91: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-15 15:15:49,652 INFO L272 TraceCheckUtils]: 90: Hoare triple {23040#false} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23039#true} is VALID [2022-04-15 15:15:49,652 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {23039#true} {23040#false} #104#return; {23040#false} is VALID [2022-04-15 15:15:49,652 INFO L290 TraceCheckUtils]: 88: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-15 15:15:49,652 INFO L290 TraceCheckUtils]: 87: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-15 15:15:49,652 INFO L290 TraceCheckUtils]: 86: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-15 15:15:49,652 INFO L272 TraceCheckUtils]: 85: Hoare triple {23040#false} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23039#true} is VALID [2022-04-15 15:15:49,652 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {23039#true} {23040#false} #102#return; {23040#false} is VALID [2022-04-15 15:15:49,652 INFO L290 TraceCheckUtils]: 83: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-15 15:15:49,653 INFO L290 TraceCheckUtils]: 82: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-15 15:15:49,653 INFO L290 TraceCheckUtils]: 81: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-15 15:15:49,653 INFO L272 TraceCheckUtils]: 80: Hoare triple {23040#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23039#true} is VALID [2022-04-15 15:15:49,653 INFO L290 TraceCheckUtils]: 79: Hoare triple {23040#false} assume !false; {23040#false} is VALID [2022-04-15 15:15:49,653 INFO L290 TraceCheckUtils]: 78: Hoare triple {23479#(not (<= main_~b~0 main_~c~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {23040#false} is VALID [2022-04-15 15:15:49,653 INFO L290 TraceCheckUtils]: 77: Hoare triple {23479#(not (<= main_~b~0 main_~c~0))} assume !false; {23479#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-15 15:15:49,654 INFO L290 TraceCheckUtils]: 76: Hoare triple {23486#(< main_~c~0 (+ main_~b~0 main_~v~0))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {23479#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-15 15:15:49,654 INFO L290 TraceCheckUtils]: 75: Hoare triple {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} assume !(~c~0 >= 2 * ~v~0); {23486#(< main_~c~0 (+ main_~b~0 main_~v~0))} is VALID [2022-04-15 15:15:49,655 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {23039#true} {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} #108#return; {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-15 15:15:49,655 INFO L290 TraceCheckUtils]: 73: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-15 15:15:49,655 INFO L290 TraceCheckUtils]: 72: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-15 15:15:49,655 INFO L290 TraceCheckUtils]: 71: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-15 15:15:49,655 INFO L272 TraceCheckUtils]: 70: Hoare triple {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {23039#true} is VALID [2022-04-15 15:15:49,656 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {23039#true} {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} #106#return; {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-15 15:15:49,656 INFO L290 TraceCheckUtils]: 68: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-15 15:15:49,656 INFO L290 TraceCheckUtils]: 67: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-15 15:15:49,656 INFO L290 TraceCheckUtils]: 66: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-15 15:15:49,656 INFO L272 TraceCheckUtils]: 65: Hoare triple {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23039#true} is VALID [2022-04-15 15:15:49,656 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {23039#true} {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} #104#return; {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-15 15:15:49,656 INFO L290 TraceCheckUtils]: 63: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-15 15:15:49,656 INFO L290 TraceCheckUtils]: 62: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-15 15:15:49,657 INFO L290 TraceCheckUtils]: 61: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-15 15:15:49,657 INFO L272 TraceCheckUtils]: 60: Hoare triple {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23039#true} is VALID [2022-04-15 15:15:49,657 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {23039#true} {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} #102#return; {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-15 15:15:49,657 INFO L290 TraceCheckUtils]: 58: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-15 15:15:49,657 INFO L290 TraceCheckUtils]: 57: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-15 15:15:49,657 INFO L290 TraceCheckUtils]: 56: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-15 15:15:49,657 INFO L272 TraceCheckUtils]: 55: Hoare triple {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23039#true} is VALID [2022-04-15 15:15:49,658 INFO L290 TraceCheckUtils]: 54: Hoare triple {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} assume !false; {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-15 15:15:49,659 INFO L290 TraceCheckUtils]: 53: Hoare triple {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-15 15:15:49,659 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {23039#true} {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #108#return; {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-15 15:15:49,659 INFO L290 TraceCheckUtils]: 51: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-15 15:15:49,659 INFO L290 TraceCheckUtils]: 50: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-15 15:15:49,659 INFO L290 TraceCheckUtils]: 49: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-15 15:15:49,659 INFO L272 TraceCheckUtils]: 48: Hoare triple {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {23039#true} is VALID [2022-04-15 15:15:49,660 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23039#true} {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #106#return; {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-15 15:15:49,660 INFO L290 TraceCheckUtils]: 46: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-15 15:15:49,660 INFO L290 TraceCheckUtils]: 45: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-15 15:15:49,660 INFO L290 TraceCheckUtils]: 44: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-15 15:15:49,660 INFO L272 TraceCheckUtils]: 43: Hoare triple {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23039#true} is VALID [2022-04-15 15:15:49,661 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {23039#true} {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #104#return; {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-15 15:15:49,661 INFO L290 TraceCheckUtils]: 41: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-15 15:15:49,661 INFO L290 TraceCheckUtils]: 40: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-15 15:15:49,661 INFO L290 TraceCheckUtils]: 39: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-15 15:15:49,661 INFO L272 TraceCheckUtils]: 38: Hoare triple {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23039#true} is VALID [2022-04-15 15:15:49,662 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {23039#true} {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #102#return; {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-15 15:15:49,662 INFO L290 TraceCheckUtils]: 36: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-15 15:15:49,662 INFO L290 TraceCheckUtils]: 35: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-15 15:15:49,662 INFO L290 TraceCheckUtils]: 34: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-15 15:15:49,662 INFO L272 TraceCheckUtils]: 33: Hoare triple {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23039#true} is VALID [2022-04-15 15:15:49,662 INFO L290 TraceCheckUtils]: 32: Hoare triple {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} assume !false; {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-15 15:15:49,663 INFO L290 TraceCheckUtils]: 31: Hoare triple {23624#(<= main_~c~0 (+ (div main_~c~0 2) (div (div main_~c~0 2) 2) 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-15 15:15:49,663 INFO L290 TraceCheckUtils]: 30: Hoare triple {23624#(<= main_~c~0 (+ (div main_~c~0 2) (div (div main_~c~0 2) 2) 1))} assume !false; {23624#(<= main_~c~0 (+ (div main_~c~0 2) (div (div main_~c~0 2) 2) 1))} is VALID [2022-04-15 15:15:49,664 INFO L290 TraceCheckUtils]: 29: Hoare triple {23128#(<= main_~a~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {23624#(<= main_~c~0 (+ (div main_~c~0 2) (div (div main_~c~0 2) 2) 1))} is VALID [2022-04-15 15:15:49,664 INFO L290 TraceCheckUtils]: 28: Hoare triple {23128#(<= main_~a~0 2)} assume !false; {23128#(<= main_~a~0 2)} is VALID [2022-04-15 15:15:49,665 INFO L290 TraceCheckUtils]: 27: Hoare triple {23637#(<= main_~x~0 2)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {23128#(<= main_~a~0 2)} is VALID [2022-04-15 15:15:49,665 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {23039#true} {23637#(<= main_~x~0 2)} #100#return; {23637#(<= main_~x~0 2)} is VALID [2022-04-15 15:15:49,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-15 15:15:49,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-15 15:15:49,665 INFO L290 TraceCheckUtils]: 23: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-15 15:15:49,665 INFO L272 TraceCheckUtils]: 22: Hoare triple {23637#(<= main_~x~0 2)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {23039#true} is VALID [2022-04-15 15:15:49,666 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {23039#true} {23637#(<= main_~x~0 2)} #98#return; {23637#(<= main_~x~0 2)} is VALID [2022-04-15 15:15:49,666 INFO L290 TraceCheckUtils]: 20: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-15 15:15:49,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-15 15:15:49,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-15 15:15:49,666 INFO L272 TraceCheckUtils]: 17: Hoare triple {23637#(<= main_~x~0 2)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {23039#true} is VALID [2022-04-15 15:15:49,666 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {23039#true} {23637#(<= main_~x~0 2)} #96#return; {23637#(<= main_~x~0 2)} is VALID [2022-04-15 15:15:49,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-15 15:15:49,666 INFO L290 TraceCheckUtils]: 14: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-15 15:15:49,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-15 15:15:49,666 INFO L272 TraceCheckUtils]: 12: Hoare triple {23637#(<= main_~x~0 2)} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {23039#true} is VALID [2022-04-15 15:15:49,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {23637#(<= main_~x~0 2)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {23637#(<= main_~x~0 2)} is VALID [2022-04-15 15:15:49,667 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23069#(not (= |assume_abort_if_not_#in~cond| 0))} {23039#true} #94#return; {23637#(<= main_~x~0 2)} is VALID [2022-04-15 15:15:49,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {23069#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {23069#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 15:15:49,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {23698#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {23069#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 15:15:49,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {23039#true} ~cond := #in~cond; {23698#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 15:15:49,668 INFO L272 TraceCheckUtils]: 6: Hoare triple {23039#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {23039#true} is VALID [2022-04-15 15:15:49,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {23039#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {23039#true} is VALID [2022-04-15 15:15:49,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {23039#true} call #t~ret6 := main(); {23039#true} is VALID [2022-04-15 15:15:49,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23039#true} {23039#true} #112#return; {23039#true} is VALID [2022-04-15 15:15:49,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-15 15:15:49,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {23039#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {23039#true} is VALID [2022-04-15 15:15:49,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {23039#true} call ULTIMATE.init(); {23039#true} is VALID [2022-04-15 15:15:49,669 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 43 proven. 17 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2022-04-15 15:15:49,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:15:49,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366053324] [2022-04-15 15:15:49,669 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:15:49,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828947207] [2022-04-15 15:15:49,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828947207] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:15:49,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:15:49,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2022-04-15 15:15:49,669 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:15:49,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1868846716] [2022-04-15 15:15:49,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1868846716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:15:49,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:15:49,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 15:15:49,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506567506] [2022-04-15 15:15:49,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:15:49,670 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 5 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 111 [2022-04-15 15:15:49,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:15:49,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 5 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-15 15:15:49,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:15:49,732 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 15:15:49,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:15:49,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 15:15:49,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-04-15 15:15:49,732 INFO L87 Difference]: Start difference. First operand 317 states and 445 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 5 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-15 15:15:51,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:51,856 INFO L93 Difference]: Finished difference Result 387 states and 528 transitions. [2022-04-15 15:15:51,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 15:15:51,856 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 5 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 111 [2022-04-15 15:15:51,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:15:51,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 5 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-15 15:15:51,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 108 transitions. [2022-04-15 15:15:51,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 5 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-15 15:15:51,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 108 transitions. [2022-04-15 15:15:51,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 108 transitions. [2022-04-15 15:15:51,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:15:51,956 INFO L225 Difference]: With dead ends: 387 [2022-04-15 15:15:51,956 INFO L226 Difference]: Without dead ends: 271 [2022-04-15 15:15:51,957 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2022-04-15 15:15:51,957 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 47 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 15:15:51,957 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 239 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 15:15:51,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-04-15 15:15:52,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 232. [2022-04-15 15:15:52,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:15:52,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 271 states. Second operand has 232 states, 133 states have (on average 1.150375939849624) internal successors, (153), 134 states have internal predecessors, (153), 79 states have call successors, (79), 20 states have call predecessors, (79), 19 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-15 15:15:52,981 INFO L74 IsIncluded]: Start isIncluded. First operand 271 states. Second operand has 232 states, 133 states have (on average 1.150375939849624) internal successors, (153), 134 states have internal predecessors, (153), 79 states have call successors, (79), 20 states have call predecessors, (79), 19 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-15 15:15:52,982 INFO L87 Difference]: Start difference. First operand 271 states. Second operand has 232 states, 133 states have (on average 1.150375939849624) internal successors, (153), 134 states have internal predecessors, (153), 79 states have call successors, (79), 20 states have call predecessors, (79), 19 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-15 15:15:52,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:52,988 INFO L93 Difference]: Finished difference Result 271 states and 367 transitions. [2022-04-15 15:15:52,988 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 367 transitions. [2022-04-15 15:15:52,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:15:52,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:15:52,990 INFO L74 IsIncluded]: Start isIncluded. First operand has 232 states, 133 states have (on average 1.150375939849624) internal successors, (153), 134 states have internal predecessors, (153), 79 states have call successors, (79), 20 states have call predecessors, (79), 19 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) Second operand 271 states. [2022-04-15 15:15:52,990 INFO L87 Difference]: Start difference. First operand has 232 states, 133 states have (on average 1.150375939849624) internal successors, (153), 134 states have internal predecessors, (153), 79 states have call successors, (79), 20 states have call predecessors, (79), 19 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) Second operand 271 states. [2022-04-15 15:15:52,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:52,996 INFO L93 Difference]: Finished difference Result 271 states and 367 transitions. [2022-04-15 15:15:52,997 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 367 transitions. [2022-04-15 15:15:52,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:15:52,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:15:52,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:15:52,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:15:52,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 133 states have (on average 1.150375939849624) internal successors, (153), 134 states have internal predecessors, (153), 79 states have call successors, (79), 20 states have call predecessors, (79), 19 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-15 15:15:53,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 309 transitions. [2022-04-15 15:15:53,004 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 309 transitions. Word has length 111 [2022-04-15 15:15:53,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:15:53,004 INFO L478 AbstractCegarLoop]: Abstraction has 232 states and 309 transitions. [2022-04-15 15:15:53,004 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 5 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-15 15:15:53,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 232 states and 309 transitions. [2022-04-15 15:15:53,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 309 edges. 309 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:15:53,747 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 309 transitions. [2022-04-15 15:15:53,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-15 15:15:53,747 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:15:53,747 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:15:53,764 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-15 15:15:53,948 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-15 15:15:53,948 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:15:53,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:15:53,948 INFO L85 PathProgramCache]: Analyzing trace with hash 890766036, now seen corresponding path program 9 times [2022-04-15 15:15:53,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:15:53,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [765975275] [2022-04-15 15:15:53,949 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:15:53,949 INFO L85 PathProgramCache]: Analyzing trace with hash 890766036, now seen corresponding path program 10 times [2022-04-15 15:15:53,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:15:53,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130135172] [2022-04-15 15:15:53,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:15:53,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:15:53,967 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:15:53,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [411356436] [2022-04-15 15:15:53,968 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:15:53,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:15:53,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:15:53,969 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:15:53,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 15:15:54,019 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:15:54,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:15:54,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 15:15:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:15:54,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:15:57,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {25518#true} call ULTIMATE.init(); {25518#true} is VALID [2022-04-15 15:15:57,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {25518#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {25518#true} is VALID [2022-04-15 15:15:57,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-15 15:15:57,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25518#true} {25518#true} #112#return; {25518#true} is VALID [2022-04-15 15:15:57,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {25518#true} call #t~ret6 := main(); {25518#true} is VALID [2022-04-15 15:15:57,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {25518#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {25518#true} is VALID [2022-04-15 15:15:57,441 INFO L272 TraceCheckUtils]: 6: Hoare triple {25518#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {25518#true} is VALID [2022-04-15 15:15:57,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-15 15:15:57,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-15 15:15:57,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-15 15:15:57,441 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25518#true} {25518#true} #94#return; {25518#true} is VALID [2022-04-15 15:15:57,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {25518#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {25518#true} is VALID [2022-04-15 15:15:57,441 INFO L272 TraceCheckUtils]: 12: Hoare triple {25518#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {25518#true} is VALID [2022-04-15 15:15:57,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {25518#true} ~cond := #in~cond; {25562#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 15:15:57,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {25562#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {25566#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 15:15:57,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {25566#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {25566#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 15:15:57,442 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {25566#(not (= |assume_abort_if_not_#in~cond| 0))} {25518#true} #96#return; {25573#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 15:15:57,442 INFO L272 TraceCheckUtils]: 17: Hoare triple {25573#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {25518#true} is VALID [2022-04-15 15:15:57,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-15 15:15:57,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-15 15:15:57,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-15 15:15:57,443 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {25518#true} {25573#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #98#return; {25573#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 15:15:57,443 INFO L272 TraceCheckUtils]: 22: Hoare triple {25573#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {25518#true} is VALID [2022-04-15 15:15:57,443 INFO L290 TraceCheckUtils]: 23: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-15 15:15:57,443 INFO L290 TraceCheckUtils]: 24: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-15 15:15:57,443 INFO L290 TraceCheckUtils]: 25: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-15 15:15:57,443 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {25518#true} {25573#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #100#return; {25573#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 15:15:57,444 INFO L290 TraceCheckUtils]: 27: Hoare triple {25573#(and (<= 0 main_~y~0) (<= main_~y~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {25607#(<= main_~b~0 2)} is VALID [2022-04-15 15:15:57,444 INFO L290 TraceCheckUtils]: 28: Hoare triple {25607#(<= main_~b~0 2)} assume !false; {25607#(<= main_~b~0 2)} is VALID [2022-04-15 15:15:57,444 INFO L290 TraceCheckUtils]: 29: Hoare triple {25607#(<= main_~b~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {25607#(<= main_~b~0 2)} is VALID [2022-04-15 15:15:57,445 INFO L290 TraceCheckUtils]: 30: Hoare triple {25607#(<= main_~b~0 2)} assume !false; {25607#(<= main_~b~0 2)} is VALID [2022-04-15 15:15:57,445 INFO L290 TraceCheckUtils]: 31: Hoare triple {25607#(<= main_~b~0 2)} assume !(~c~0 >= ~b~0); {25607#(<= main_~b~0 2)} is VALID [2022-04-15 15:15:57,445 INFO L290 TraceCheckUtils]: 32: Hoare triple {25607#(<= main_~b~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {25623#(<= main_~a~0 2)} is VALID [2022-04-15 15:15:57,445 INFO L290 TraceCheckUtils]: 33: Hoare triple {25623#(<= main_~a~0 2)} assume !false; {25623#(<= main_~a~0 2)} is VALID [2022-04-15 15:15:57,446 INFO L290 TraceCheckUtils]: 34: Hoare triple {25623#(<= main_~a~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {25630#(<= main_~c~0 2)} is VALID [2022-04-15 15:15:57,446 INFO L290 TraceCheckUtils]: 35: Hoare triple {25630#(<= main_~c~0 2)} assume !false; {25630#(<= main_~c~0 2)} is VALID [2022-04-15 15:15:57,446 INFO L290 TraceCheckUtils]: 36: Hoare triple {25630#(<= main_~c~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-15 15:15:57,447 INFO L290 TraceCheckUtils]: 37: Hoare triple {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} assume !false; {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-15 15:15:57,447 INFO L272 TraceCheckUtils]: 38: Hoare triple {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {25518#true} is VALID [2022-04-15 15:15:57,447 INFO L290 TraceCheckUtils]: 39: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-15 15:15:57,447 INFO L290 TraceCheckUtils]: 40: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-15 15:15:57,447 INFO L290 TraceCheckUtils]: 41: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-15 15:15:57,447 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {25518#true} {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} #102#return; {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-15 15:15:57,448 INFO L272 TraceCheckUtils]: 43: Hoare triple {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {25518#true} is VALID [2022-04-15 15:15:57,448 INFO L290 TraceCheckUtils]: 44: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-15 15:15:57,448 INFO L290 TraceCheckUtils]: 45: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-15 15:15:57,448 INFO L290 TraceCheckUtils]: 46: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-15 15:15:57,448 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {25518#true} {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} #104#return; {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-15 15:15:57,448 INFO L272 TraceCheckUtils]: 48: Hoare triple {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {25518#true} is VALID [2022-04-15 15:15:57,448 INFO L290 TraceCheckUtils]: 49: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-15 15:15:57,448 INFO L290 TraceCheckUtils]: 50: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-15 15:15:57,449 INFO L290 TraceCheckUtils]: 51: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-15 15:15:57,449 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {25518#true} {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} #106#return; {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-15 15:15:57,449 INFO L272 TraceCheckUtils]: 53: Hoare triple {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {25518#true} is VALID [2022-04-15 15:15:57,449 INFO L290 TraceCheckUtils]: 54: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-15 15:15:57,449 INFO L290 TraceCheckUtils]: 55: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-15 15:15:57,449 INFO L290 TraceCheckUtils]: 56: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-15 15:15:57,450 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {25518#true} {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} #108#return; {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-15 15:15:57,450 INFO L290 TraceCheckUtils]: 58: Hoare triple {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} is VALID [2022-04-15 15:15:57,451 INFO L290 TraceCheckUtils]: 59: Hoare triple {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} assume !false; {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} is VALID [2022-04-15 15:15:57,451 INFO L272 TraceCheckUtils]: 60: Hoare triple {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {25518#true} is VALID [2022-04-15 15:15:57,451 INFO L290 TraceCheckUtils]: 61: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-15 15:15:57,451 INFO L290 TraceCheckUtils]: 62: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-15 15:15:57,451 INFO L290 TraceCheckUtils]: 63: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-15 15:15:57,452 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {25518#true} {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} #102#return; {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} is VALID [2022-04-15 15:15:57,452 INFO L272 TraceCheckUtils]: 65: Hoare triple {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {25518#true} is VALID [2022-04-15 15:15:57,452 INFO L290 TraceCheckUtils]: 66: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-15 15:15:57,452 INFO L290 TraceCheckUtils]: 67: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-15 15:15:57,452 INFO L290 TraceCheckUtils]: 68: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-15 15:15:57,452 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {25518#true} {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} #104#return; {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} is VALID [2022-04-15 15:15:57,452 INFO L272 TraceCheckUtils]: 70: Hoare triple {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {25518#true} is VALID [2022-04-15 15:15:57,452 INFO L290 TraceCheckUtils]: 71: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-15 15:15:57,452 INFO L290 TraceCheckUtils]: 72: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-15 15:15:57,453 INFO L290 TraceCheckUtils]: 73: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-15 15:15:57,453 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {25518#true} {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} #106#return; {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} is VALID [2022-04-15 15:15:57,453 INFO L272 TraceCheckUtils]: 75: Hoare triple {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {25518#true} is VALID [2022-04-15 15:15:57,453 INFO L290 TraceCheckUtils]: 76: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-15 15:15:57,453 INFO L290 TraceCheckUtils]: 77: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-15 15:15:57,453 INFO L290 TraceCheckUtils]: 78: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-15 15:15:57,465 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {25518#true} {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} #108#return; {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} is VALID [2022-04-15 15:15:57,467 INFO L290 TraceCheckUtils]: 80: Hoare triple {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} is VALID [2022-04-15 15:15:57,467 INFO L290 TraceCheckUtils]: 81: Hoare triple {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} assume !false; {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} is VALID [2022-04-15 15:15:57,467 INFO L272 TraceCheckUtils]: 82: Hoare triple {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {25518#true} is VALID [2022-04-15 15:15:57,467 INFO L290 TraceCheckUtils]: 83: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-15 15:15:57,467 INFO L290 TraceCheckUtils]: 84: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-15 15:15:57,467 INFO L290 TraceCheckUtils]: 85: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-15 15:15:57,468 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {25518#true} {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} #102#return; {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} is VALID [2022-04-15 15:15:57,468 INFO L272 TraceCheckUtils]: 87: Hoare triple {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {25518#true} is VALID [2022-04-15 15:15:57,468 INFO L290 TraceCheckUtils]: 88: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-15 15:15:57,468 INFO L290 TraceCheckUtils]: 89: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-15 15:15:57,468 INFO L290 TraceCheckUtils]: 90: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-15 15:15:57,469 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {25518#true} {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} #104#return; {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} is VALID [2022-04-15 15:15:57,469 INFO L272 TraceCheckUtils]: 92: Hoare triple {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {25518#true} is VALID [2022-04-15 15:15:57,469 INFO L290 TraceCheckUtils]: 93: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-15 15:15:57,469 INFO L290 TraceCheckUtils]: 94: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-15 15:15:57,469 INFO L290 TraceCheckUtils]: 95: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-15 15:15:57,469 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {25518#true} {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} #106#return; {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} is VALID [2022-04-15 15:15:57,470 INFO L272 TraceCheckUtils]: 97: Hoare triple {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {25518#true} is VALID [2022-04-15 15:15:57,470 INFO L290 TraceCheckUtils]: 98: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-15 15:15:57,470 INFO L290 TraceCheckUtils]: 99: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-15 15:15:57,470 INFO L290 TraceCheckUtils]: 100: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-15 15:15:57,470 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {25518#true} {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} #108#return; {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} is VALID [2022-04-15 15:15:57,471 INFO L290 TraceCheckUtils]: 102: Hoare triple {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} assume !(~c~0 >= 2 * ~v~0); {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} is VALID [2022-04-15 15:15:57,471 INFO L290 TraceCheckUtils]: 103: Hoare triple {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {25841#(and (<= main_~b~0 0) (< 0 (+ (div main_~c~0 2) 1)))} is VALID [2022-04-15 15:15:57,472 INFO L290 TraceCheckUtils]: 104: Hoare triple {25841#(and (<= main_~b~0 0) (< 0 (+ (div main_~c~0 2) 1)))} assume !false; {25841#(and (<= main_~b~0 0) (< 0 (+ (div main_~c~0 2) 1)))} is VALID [2022-04-15 15:15:57,472 INFO L290 TraceCheckUtils]: 105: Hoare triple {25841#(and (<= main_~b~0 0) (< 0 (+ (div main_~c~0 2) 1)))} assume !(~c~0 >= ~b~0); {25519#false} is VALID [2022-04-15 15:15:57,473 INFO L290 TraceCheckUtils]: 106: Hoare triple {25519#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {25519#false} is VALID [2022-04-15 15:15:57,473 INFO L290 TraceCheckUtils]: 107: Hoare triple {25519#false} assume !false; {25519#false} is VALID [2022-04-15 15:15:57,473 INFO L290 TraceCheckUtils]: 108: Hoare triple {25519#false} assume !(0 != ~b~0); {25519#false} is VALID [2022-04-15 15:15:57,473 INFO L272 TraceCheckUtils]: 109: Hoare triple {25519#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {25519#false} is VALID [2022-04-15 15:15:57,473 INFO L290 TraceCheckUtils]: 110: Hoare triple {25519#false} ~cond := #in~cond; {25519#false} is VALID [2022-04-15 15:15:57,473 INFO L290 TraceCheckUtils]: 111: Hoare triple {25519#false} assume 0 == ~cond; {25519#false} is VALID [2022-04-15 15:15:57,473 INFO L290 TraceCheckUtils]: 112: Hoare triple {25519#false} assume !false; {25519#false} is VALID [2022-04-15 15:15:57,473 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 34 proven. 30 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2022-04-15 15:15:57,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:16:06,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:16:06,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130135172] [2022-04-15 15:16:06,070 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:16:06,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411356436] [2022-04-15 15:16:06,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411356436] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 15:16:06,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 15:16:06,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-15 15:16:06,070 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:16:06,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [765975275] [2022-04-15 15:16:06,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [765975275] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:16:06,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:16:06,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 15:16:06,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807742661] [2022-04-15 15:16:06,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:16:06,071 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 113 [2022-04-15 15:16:06,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:16:06,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-15 15:16:06,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:16:06,140 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 15:16:06,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:16:06,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 15:16:06,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2022-04-15 15:16:06,140 INFO L87 Difference]: Start difference. First operand 232 states and 309 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17)