/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 15:51:08,657 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 15:51:08,659 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 15:51:08,684 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 15:51:08,684 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 15:51:08,685 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 15:51:08,686 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 15:51:08,687 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 15:51:08,688 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 15:51:08,688 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 15:51:08,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 15:51:08,689 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 15:51:08,689 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 15:51:08,690 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 15:51:08,691 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 15:51:08,691 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 15:51:08,692 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 15:51:08,692 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 15:51:08,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 15:51:08,694 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 15:51:08,695 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 15:51:08,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 15:51:08,699 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 15:51:08,700 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 15:51:08,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 15:51:08,709 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 15:51:08,709 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 15:51:08,709 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 15:51:08,710 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 15:51:08,710 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 15:51:08,711 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 15:51:08,711 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 15:51:08,711 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 15:51:08,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 15:51:08,712 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 15:51:08,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 15:51:08,713 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 15:51:08,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 15:51:08,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 15:51:08,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 15:51:08,714 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 15:51:08,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 15:51:08,728 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-14 15:51:08,743 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 15:51:08,744 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 15:51:08,744 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 15:51:08,744 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 15:51:08,744 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 15:51:08,744 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 15:51:08,745 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 15:51:08,745 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 15:51:08,745 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 15:51:08,745 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 15:51:08,745 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 15:51:08,745 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 15:51:08,745 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 15:51:08,745 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 15:51:08,745 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 15:51:08,745 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 15:51:08,746 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 15:51:08,746 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 15:51:08,746 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 15:51:08,746 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 15:51:08,746 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 15:51:08,746 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 15:51:08,746 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 15:51:08,746 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 15:51:08,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 15:51:08,746 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 15:51:08,746 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 15:51:08,747 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 15:51:08,747 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 15:51:08,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 15:51:08,747 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 15:51:08,747 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 15:51:08,749 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 15:51:08,749 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-14 15:51:08,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 15:51:08,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 15:51:08,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 15:51:08,957 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 15:51:08,958 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 15:51:08,959 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound100.c [2022-04-14 15:51:09,010 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f32553ba7/d5be8efa389240b6ae1d31872b3c63e0/FLAGba2ac0339 [2022-04-14 15:51:09,369 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 15:51:09,369 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound100.c [2022-04-14 15:51:09,377 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f32553ba7/d5be8efa389240b6ae1d31872b3c63e0/FLAGba2ac0339 [2022-04-14 15:51:09,783 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f32553ba7/d5be8efa389240b6ae1d31872b3c63e0 [2022-04-14 15:51:09,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 15:51:09,786 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 15:51:09,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 15:51:09,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 15:51:09,792 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 15:51:09,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:51:09" (1/1) ... [2022-04-14 15:51:09,793 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36a8efdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:51:09, skipping insertion in model container [2022-04-14 15:51:09,793 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:51:09" (1/1) ... [2022-04-14 15:51:09,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 15:51:09,809 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 15:51:09,924 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound100.c[490,503] [2022-04-14 15:51:09,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 15:51:09,959 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 15:51:09,967 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound100.c[490,503] [2022-04-14 15:51:09,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 15:51:09,982 INFO L208 MainTranslator]: Completed translation [2022-04-14 15:51:09,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:51:09 WrapperNode [2022-04-14 15:51:09,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 15:51:09,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 15:51:09,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 15:51:09,984 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 15:51:09,990 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:51:09" (1/1) ... [2022-04-14 15:51:09,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:51:09" (1/1) ... [2022-04-14 15:51:09,995 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:51:09" (1/1) ... [2022-04-14 15:51:09,995 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:51:09" (1/1) ... [2022-04-14 15:51:10,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:51:09" (1/1) ... [2022-04-14 15:51:10,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:51:09" (1/1) ... [2022-04-14 15:51:10,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:51:09" (1/1) ... [2022-04-14 15:51:10,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 15:51:10,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 15:51:10,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 15:51:10,006 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 15:51:10,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:51:09" (1/1) ... [2022-04-14 15:51:10,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 15:51:10,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:51:10,031 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-14 15:51:10,033 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-14 15:51:10,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 15:51:10,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 15:51:10,055 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 15:51:10,055 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 15:51:10,055 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 15:51:10,055 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 15:51:10,056 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 15:51:10,056 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 15:51:10,056 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 15:51:10,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 15:51:10,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 15:51:10,056 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 15:51:10,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 15:51:10,056 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 15:51:10,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 15:51:10,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 15:51:10,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 15:51:10,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 15:51:10,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 15:51:10,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 15:51:10,112 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 15:51:10,113 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 15:51:10,286 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 15:51:10,293 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 15:51:10,293 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-14 15:51:10,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 03:51:10 BoogieIcfgContainer [2022-04-14 15:51:10,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 15:51:10,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 15:51:10,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 15:51:10,302 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 15:51:10,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 03:51:09" (1/3) ... [2022-04-14 15:51:10,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40e3ddda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:51:10, skipping insertion in model container [2022-04-14 15:51:10,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:51:09" (2/3) ... [2022-04-14 15:51:10,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40e3ddda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:51:10, skipping insertion in model container [2022-04-14 15:51:10,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 03:51:10" (3/3) ... [2022-04-14 15:51:10,304 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_unwindbound100.c [2022-04-14 15:51:10,308 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 15:51:10,308 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 15:51:10,338 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 15:51:10,343 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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-14 15:51:10,343 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 15:51:10,364 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-14 15:51:10,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-14 15:51:10,368 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:51:10,368 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:51:10,369 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:51:10,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:51:10,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1950618521, now seen corresponding path program 1 times [2022-04-14 15:51:10,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:51:10,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058432738] [2022-04-14 15:51:10,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:51:10,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:51:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:51:10,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:51:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:51:10,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {63#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-14 15:51:10,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-14 15:51:10,510 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-14 15:51:10,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 15:51:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:51:10,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-14 15:51:10,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-14 15:51:10,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-14 15:51:10,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-14 15:51:10,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-14 15:51:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:51:10,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-14 15:51:10,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-14 15:51:10,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-14 15:51:10,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-14 15:51:10,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-14 15:51:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:51:10,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-14 15:51:10,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-14 15:51:10,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-14 15:51:10,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-14 15:51:10,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-14 15:51:10,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:51:10,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-14 15:51:10,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-14 15:51:10,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-14 15:51:10,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #84#return; {43#false} is VALID [2022-04-14 15:51:10,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {63#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 15:51:10,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-14 15:51:10,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-14 15:51:10,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-14 15:51:10,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret8 := main(); {42#true} is VALID [2022-04-14 15:51:10,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {42#true} is VALID [2022-04-14 15:51:10,548 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {42#true} is VALID [2022-04-14 15:51:10,548 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-14 15:51:10,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-14 15:51:10,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-14 15:51:10,549 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-14 15:51:10,549 INFO L272 TraceCheckUtils]: 11: Hoare triple {43#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {42#true} is VALID [2022-04-14 15:51:10,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-14 15:51:10,550 INFO L290 TraceCheckUtils]: 13: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-14 15:51:10,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-14 15:51:10,550 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-14 15:51:10,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {43#false} is VALID [2022-04-14 15:51:10,551 INFO L272 TraceCheckUtils]: 17: Hoare triple {43#false} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {42#true} is VALID [2022-04-14 15:51:10,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-14 15:51:10,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-14 15:51:10,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-14 15:51:10,551 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-14 15:51:10,551 INFO L272 TraceCheckUtils]: 22: Hoare triple {43#false} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {42#true} is VALID [2022-04-14 15:51:10,552 INFO L290 TraceCheckUtils]: 23: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-14 15:51:10,552 INFO L290 TraceCheckUtils]: 24: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-14 15:51:10,552 INFO L290 TraceCheckUtils]: 25: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-14 15:51:10,552 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {43#false} {43#false} #84#return; {43#false} is VALID [2022-04-14 15:51:10,552 INFO L290 TraceCheckUtils]: 27: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-14 15:51:10,553 INFO L272 TraceCheckUtils]: 28: Hoare triple {43#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {43#false} is VALID [2022-04-14 15:51:10,553 INFO L290 TraceCheckUtils]: 29: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-14 15:51:10,553 INFO L290 TraceCheckUtils]: 30: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-14 15:51:10,553 INFO L290 TraceCheckUtils]: 31: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-14 15:51:10,553 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-14 15:51:10,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:51:10,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058432738] [2022-04-14 15:51:10,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058432738] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:51:10,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:51:10,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 15:51:10,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740621207] [2022-04-14 15:51:10,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:51:10,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-14 15:51:10,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:51:10,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 15:51:10,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:51:10,586 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 15:51:10,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:51:10,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 15:51:10,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 15:51:10,603 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 15:51:10,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:51:10,838 INFO L93 Difference]: Finished difference Result 72 states and 112 transitions. [2022-04-14 15:51:10,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 15:51:10,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-14 15:51:10,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:51:10,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 15:51:10,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-04-14 15:51:10,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 15:51:10,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-04-14 15:51:10,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 112 transitions. [2022-04-14 15:51:10,995 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-14 15:51:11,013 INFO L225 Difference]: With dead ends: 72 [2022-04-14 15:51:11,013 INFO L226 Difference]: Without dead ends: 35 [2022-04-14 15:51:11,017 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-14 15:51:11,022 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:51:11,023 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 49 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 15:51:11,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-14 15:51:11,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-14 15:51:11,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:51:11,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:51:11,058 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:51:11,059 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:51:11,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:51:11,065 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-14 15:51:11,066 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-14 15:51:11,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:51:11,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:51:11,068 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-14 15:51:11,068 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-14 15:51:11,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:51:11,073 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-14 15:51:11,073 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-14 15:51:11,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:51:11,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:51:11,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:51:11,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:51:11,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:51:11,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-04-14 15:51:11,078 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 32 [2022-04-14 15:51:11,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:51:11,078 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-04-14 15:51:11,079 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 15:51:11,079 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-14 15:51:11,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-14 15:51:11,080 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:51:11,080 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-14 15:51:11,080 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 15:51:11,080 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:51:11,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:51:11,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1734391985, now seen corresponding path program 1 times [2022-04-14 15:51:11,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:51:11,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740794553] [2022-04-14 15:51:11,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:51:11,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:51:11,098 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:51:11,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [420814989] [2022-04-14 15:51:11,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:51:11,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:51:11,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:51:11,101 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-14 15:51:11,109 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-14 15:51:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:51:11,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-14 15:51:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:51:11,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:51:11,419 INFO L272 TraceCheckUtils]: 0: Hoare triple {292#true} call ULTIMATE.init(); {292#true} is VALID [2022-04-14 15:51:11,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {292#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {300#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:11,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {300#(<= ~counter~0 0)} assume true; {300#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:11,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {300#(<= ~counter~0 0)} {292#true} #98#return; {300#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:11,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {300#(<= ~counter~0 0)} call #t~ret8 := main(); {300#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:11,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {300#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {300#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:11,422 INFO L272 TraceCheckUtils]: 6: Hoare triple {300#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {300#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:11,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {300#(<= ~counter~0 0)} ~cond := #in~cond; {300#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:11,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {300#(<= ~counter~0 0)} assume !(0 == ~cond); {300#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:11,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {300#(<= ~counter~0 0)} assume true; {300#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:11,427 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {300#(<= ~counter~0 0)} {300#(<= ~counter~0 0)} #78#return; {300#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:11,428 INFO L272 TraceCheckUtils]: 11: Hoare triple {300#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {300#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:11,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {300#(<= ~counter~0 0)} ~cond := #in~cond; {300#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:11,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {300#(<= ~counter~0 0)} assume !(0 == ~cond); {300#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:11,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {300#(<= ~counter~0 0)} assume true; {300#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:11,429 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {300#(<= ~counter~0 0)} {300#(<= ~counter~0 0)} #80#return; {300#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:11,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {300#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {300#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:11,430 INFO L272 TraceCheckUtils]: 17: Hoare triple {300#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {300#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:11,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {300#(<= ~counter~0 0)} ~cond := #in~cond; {300#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:11,431 INFO L290 TraceCheckUtils]: 19: Hoare triple {300#(<= ~counter~0 0)} assume !(0 == ~cond); {300#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:11,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {300#(<= ~counter~0 0)} assume true; {300#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:11,432 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {300#(<= ~counter~0 0)} {300#(<= ~counter~0 0)} #82#return; {300#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:11,432 INFO L272 TraceCheckUtils]: 22: Hoare triple {300#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {300#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:11,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {300#(<= ~counter~0 0)} ~cond := #in~cond; {300#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:11,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {300#(<= ~counter~0 0)} assume !(0 == ~cond); {300#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:11,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {300#(<= ~counter~0 0)} assume true; {300#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:11,434 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {300#(<= ~counter~0 0)} {300#(<= ~counter~0 0)} #84#return; {300#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:11,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {300#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {379#(<= |main_#t~post6| 0)} is VALID [2022-04-14 15:51:11,435 INFO L290 TraceCheckUtils]: 28: Hoare triple {379#(<= |main_#t~post6| 0)} assume !(#t~post6 < 100);havoc #t~post6; {293#false} is VALID [2022-04-14 15:51:11,436 INFO L272 TraceCheckUtils]: 29: Hoare triple {293#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {293#false} is VALID [2022-04-14 15:51:11,436 INFO L290 TraceCheckUtils]: 30: Hoare triple {293#false} ~cond := #in~cond; {293#false} is VALID [2022-04-14 15:51:11,436 INFO L290 TraceCheckUtils]: 31: Hoare triple {293#false} assume 0 == ~cond; {293#false} is VALID [2022-04-14 15:51:11,437 INFO L290 TraceCheckUtils]: 32: Hoare triple {293#false} assume !false; {293#false} is VALID [2022-04-14 15:51:11,438 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-14 15:51:11,438 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:51:11,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:51:11,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740794553] [2022-04-14 15:51:11,438 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:51:11,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420814989] [2022-04-14 15:51:11,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420814989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:51:11,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:51:11,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 15:51:11,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076610597] [2022-04-14 15:51:11,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:51:11,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-14 15:51:11,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:51:11,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 15:51:11,464 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-14 15:51:11,464 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 15:51:11,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:51:11,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 15:51:11,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 15:51:11,467 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 15:51:11,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:51:11,566 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-04-14 15:51:11,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 15:51:11,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-14 15:51:11,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:51:11,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 15:51:11,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-14 15:51:11,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 15:51:11,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-14 15:51:11,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2022-04-14 15:51:11,634 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-14 15:51:11,637 INFO L225 Difference]: With dead ends: 44 [2022-04-14 15:51:11,638 INFO L226 Difference]: Without dead ends: 36 [2022-04-14 15:51:11,638 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 15:51:11,640 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 15:51:11,641 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 15:51:11,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-14 15:51:11,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-14 15:51:11,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:51:11,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:51:11,659 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:51:11,660 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:51:11,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:51:11,673 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-14 15:51:11,673 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-14 15:51:11,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:51:11,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:51:11,674 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-14 15:51:11,674 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-14 15:51:11,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:51:11,676 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-14 15:51:11,676 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-14 15:51:11,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:51:11,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:51:11,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:51:11,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:51:11,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:51:11,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-04-14 15:51:11,693 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 33 [2022-04-14 15:51:11,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:51:11,693 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-04-14 15:51:11,693 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 15:51:11,693 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-14 15:51:11,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-14 15:51:11,694 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:51:11,694 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-14 15:51:11,715 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-14 15:51:11,897 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-14 15:51:11,897 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:51:11,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:51:11,898 INFO L85 PathProgramCache]: Analyzing trace with hash 2066454233, now seen corresponding path program 1 times [2022-04-14 15:51:11,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:51:11,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147735272] [2022-04-14 15:51:11,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:51:11,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:51:11,913 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:51:11,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [709511052] [2022-04-14 15:51:11,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:51:11,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:51:11,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:51:11,915 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-14 15:51:11,918 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-14 15:51:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:51:11,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 15:51:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:51:11,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:51:12,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {587#true} call ULTIMATE.init(); {587#true} is VALID [2022-04-14 15:51:12,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {587#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {587#true} is VALID [2022-04-14 15:51:12,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-14 15:51:12,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {587#true} {587#true} #98#return; {587#true} is VALID [2022-04-14 15:51:12,107 INFO L272 TraceCheckUtils]: 4: Hoare triple {587#true} call #t~ret8 := main(); {587#true} is VALID [2022-04-14 15:51:12,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {587#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {587#true} is VALID [2022-04-14 15:51:12,107 INFO L272 TraceCheckUtils]: 6: Hoare triple {587#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {587#true} is VALID [2022-04-14 15:51:12,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2022-04-14 15:51:12,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2022-04-14 15:51:12,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-14 15:51:12,107 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {587#true} {587#true} #78#return; {587#true} is VALID [2022-04-14 15:51:12,107 INFO L272 TraceCheckUtils]: 11: Hoare triple {587#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {587#true} is VALID [2022-04-14 15:51:12,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {587#true} ~cond := #in~cond; {628#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 15:51:12,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {628#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {632#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 15:51:12,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {632#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {632#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 15:51:12,111 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {632#(not (= |assume_abort_if_not_#in~cond| 0))} {587#true} #80#return; {639#(<= 1 main_~y~0)} is VALID [2022-04-14 15:51:12,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {639#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {643#(<= 1 main_~b~0)} is VALID [2022-04-14 15:51:12,112 INFO L272 TraceCheckUtils]: 17: Hoare triple {643#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {587#true} is VALID [2022-04-14 15:51:12,112 INFO L290 TraceCheckUtils]: 18: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2022-04-14 15:51:12,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2022-04-14 15:51:12,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-14 15:51:12,113 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {587#true} {643#(<= 1 main_~b~0)} #82#return; {643#(<= 1 main_~b~0)} is VALID [2022-04-14 15:51:12,113 INFO L272 TraceCheckUtils]: 22: Hoare triple {643#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {587#true} is VALID [2022-04-14 15:51:12,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2022-04-14 15:51:12,113 INFO L290 TraceCheckUtils]: 24: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2022-04-14 15:51:12,114 INFO L290 TraceCheckUtils]: 25: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-14 15:51:12,114 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {587#true} {643#(<= 1 main_~b~0)} #84#return; {643#(<= 1 main_~b~0)} is VALID [2022-04-14 15:51:12,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {643#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {643#(<= 1 main_~b~0)} is VALID [2022-04-14 15:51:12,115 INFO L290 TraceCheckUtils]: 28: Hoare triple {643#(<= 1 main_~b~0)} assume !!(#t~post6 < 100);havoc #t~post6; {643#(<= 1 main_~b~0)} is VALID [2022-04-14 15:51:12,115 INFO L290 TraceCheckUtils]: 29: Hoare triple {643#(<= 1 main_~b~0)} assume !(0 != ~b~0); {588#false} is VALID [2022-04-14 15:51:12,115 INFO L272 TraceCheckUtils]: 30: Hoare triple {588#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {588#false} is VALID [2022-04-14 15:51:12,115 INFO L290 TraceCheckUtils]: 31: Hoare triple {588#false} ~cond := #in~cond; {588#false} is VALID [2022-04-14 15:51:12,115 INFO L290 TraceCheckUtils]: 32: Hoare triple {588#false} assume 0 == ~cond; {588#false} is VALID [2022-04-14 15:51:12,116 INFO L290 TraceCheckUtils]: 33: Hoare triple {588#false} assume !false; {588#false} is VALID [2022-04-14 15:51:12,116 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-14 15:51:12,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:51:12,324 INFO L290 TraceCheckUtils]: 33: Hoare triple {588#false} assume !false; {588#false} is VALID [2022-04-14 15:51:12,325 INFO L290 TraceCheckUtils]: 32: Hoare triple {588#false} assume 0 == ~cond; {588#false} is VALID [2022-04-14 15:51:12,325 INFO L290 TraceCheckUtils]: 31: Hoare triple {588#false} ~cond := #in~cond; {588#false} is VALID [2022-04-14 15:51:12,325 INFO L272 TraceCheckUtils]: 30: Hoare triple {588#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {588#false} is VALID [2022-04-14 15:51:12,329 INFO L290 TraceCheckUtils]: 29: Hoare triple {643#(<= 1 main_~b~0)} assume !(0 != ~b~0); {588#false} is VALID [2022-04-14 15:51:12,335 INFO L290 TraceCheckUtils]: 28: Hoare triple {643#(<= 1 main_~b~0)} assume !!(#t~post6 < 100);havoc #t~post6; {643#(<= 1 main_~b~0)} is VALID [2022-04-14 15:51:12,336 INFO L290 TraceCheckUtils]: 27: Hoare triple {643#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {643#(<= 1 main_~b~0)} is VALID [2022-04-14 15:51:12,336 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {587#true} {643#(<= 1 main_~b~0)} #84#return; {643#(<= 1 main_~b~0)} is VALID [2022-04-14 15:51:12,336 INFO L290 TraceCheckUtils]: 25: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-14 15:51:12,336 INFO L290 TraceCheckUtils]: 24: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2022-04-14 15:51:12,337 INFO L290 TraceCheckUtils]: 23: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2022-04-14 15:51:12,337 INFO L272 TraceCheckUtils]: 22: Hoare triple {643#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {587#true} is VALID [2022-04-14 15:51:12,337 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {587#true} {643#(<= 1 main_~b~0)} #82#return; {643#(<= 1 main_~b~0)} is VALID [2022-04-14 15:51:12,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-14 15:51:12,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2022-04-14 15:51:12,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2022-04-14 15:51:12,337 INFO L272 TraceCheckUtils]: 17: Hoare triple {643#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {587#true} is VALID [2022-04-14 15:51:12,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {639#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {643#(<= 1 main_~b~0)} is VALID [2022-04-14 15:51:12,338 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {632#(not (= |assume_abort_if_not_#in~cond| 0))} {587#true} #80#return; {639#(<= 1 main_~y~0)} is VALID [2022-04-14 15:51:12,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {632#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {632#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 15:51:12,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {758#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {632#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 15:51:12,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {587#true} ~cond := #in~cond; {758#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-14 15:51:12,340 INFO L272 TraceCheckUtils]: 11: Hoare triple {587#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {587#true} is VALID [2022-04-14 15:51:12,340 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {587#true} {587#true} #78#return; {587#true} is VALID [2022-04-14 15:51:12,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-14 15:51:12,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2022-04-14 15:51:12,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2022-04-14 15:51:12,340 INFO L272 TraceCheckUtils]: 6: Hoare triple {587#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {587#true} is VALID [2022-04-14 15:51:12,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {587#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {587#true} is VALID [2022-04-14 15:51:12,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {587#true} call #t~ret8 := main(); {587#true} is VALID [2022-04-14 15:51:12,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {587#true} {587#true} #98#return; {587#true} is VALID [2022-04-14 15:51:12,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-14 15:51:12,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {587#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {587#true} is VALID [2022-04-14 15:51:12,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {587#true} call ULTIMATE.init(); {587#true} is VALID [2022-04-14 15:51:12,341 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-14 15:51:12,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:51:12,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147735272] [2022-04-14 15:51:12,341 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:51:12,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709511052] [2022-04-14 15:51:12,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709511052] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:51:12,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:51:12,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-14 15:51:12,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626224246] [2022-04-14 15:51:12,342 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:51:12,342 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-14 15:51:12,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:51:12,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 15:51:12,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:51:12,359 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-14 15:51:12,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:51:12,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-14 15:51:12,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-14 15:51:12,360 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 15:51:12,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:51:12,599 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2022-04-14 15:51:12,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 15:51:12,599 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-14 15:51:12,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:51:12,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 15:51:12,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-14 15:51:12,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 15:51:12,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-14 15:51:12,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2022-04-14 15:51:12,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:51:12,660 INFO L225 Difference]: With dead ends: 53 [2022-04-14 15:51:12,660 INFO L226 Difference]: Without dead ends: 45 [2022-04-14 15:51:12,661 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-14 15:51:12,661 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 30 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:51:12,662 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 135 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 15:51:12,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-14 15:51:12,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2022-04-14 15:51:12,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:51:12,677 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:51:12,677 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:51:12,678 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:51:12,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:51:12,680 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-14 15:51:12,680 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-14 15:51:12,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:51:12,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:51:12,680 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-14 15:51:12,681 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-14 15:51:12,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:51:12,682 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-14 15:51:12,682 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-14 15:51:12,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:51:12,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:51:12,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:51:12,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:51:12,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:51:12,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-04-14 15:51:12,685 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 34 [2022-04-14 15:51:12,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:51:12,685 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-04-14 15:51:12,685 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 15:51:12,685 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-04-14 15:51:12,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-14 15:51:12,685 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:51:12,686 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:51:12,705 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-14 15:51:12,899 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-14 15:51:12,900 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:51:12,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:51:12,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1678606280, now seen corresponding path program 1 times [2022-04-14 15:51:12,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:51:12,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220437321] [2022-04-14 15:51:12,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:51:12,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:51:12,917 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:51:12,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1366702684] [2022-04-14 15:51:12,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:51:12,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:51:12,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:51:12,919 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-14 15:51:12,920 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-14 15:51:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:51:12,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-14 15:51:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:51:12,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:51:13,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {1027#true} call ULTIMATE.init(); {1027#true} is VALID [2022-04-14 15:51:13,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {1027#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1027#true} is VALID [2022-04-14 15:51:13,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-14 15:51:13,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1027#true} {1027#true} #98#return; {1027#true} is VALID [2022-04-14 15:51:13,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {1027#true} call #t~ret8 := main(); {1027#true} is VALID [2022-04-14 15:51:13,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {1027#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1027#true} is VALID [2022-04-14 15:51:13,185 INFO L272 TraceCheckUtils]: 6: Hoare triple {1027#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1027#true} is VALID [2022-04-14 15:51:13,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-14 15:51:13,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-14 15:51:13,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-14 15:51:13,185 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1027#true} {1027#true} #78#return; {1027#true} is VALID [2022-04-14 15:51:13,185 INFO L272 TraceCheckUtils]: 11: Hoare triple {1027#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1027#true} is VALID [2022-04-14 15:51:13,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {1027#true} ~cond := #in~cond; {1068#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 15:51:13,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {1068#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1072#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 15:51:13,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {1072#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1072#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 15:51:13,186 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1072#(not (= |assume_abort_if_not_#in~cond| 0))} {1027#true} #80#return; {1079#(<= 1 main_~y~0)} is VALID [2022-04-14 15:51:13,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {1079#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1083#(<= 1 main_~b~0)} is VALID [2022-04-14 15:51:13,187 INFO L272 TraceCheckUtils]: 17: Hoare triple {1083#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1027#true} is VALID [2022-04-14 15:51:13,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-14 15:51:13,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-14 15:51:13,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-14 15:51:13,188 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1027#true} {1083#(<= 1 main_~b~0)} #82#return; {1083#(<= 1 main_~b~0)} is VALID [2022-04-14 15:51:13,188 INFO L272 TraceCheckUtils]: 22: Hoare triple {1083#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1027#true} is VALID [2022-04-14 15:51:13,188 INFO L290 TraceCheckUtils]: 23: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-14 15:51:13,188 INFO L290 TraceCheckUtils]: 24: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-14 15:51:13,188 INFO L290 TraceCheckUtils]: 25: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-14 15:51:13,189 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1027#true} {1083#(<= 1 main_~b~0)} #84#return; {1083#(<= 1 main_~b~0)} is VALID [2022-04-14 15:51:13,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {1083#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1083#(<= 1 main_~b~0)} is VALID [2022-04-14 15:51:13,190 INFO L290 TraceCheckUtils]: 28: Hoare triple {1083#(<= 1 main_~b~0)} assume !!(#t~post6 < 100);havoc #t~post6; {1083#(<= 1 main_~b~0)} is VALID [2022-04-14 15:51:13,190 INFO L290 TraceCheckUtils]: 29: Hoare triple {1083#(<= 1 main_~b~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1123#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-14 15:51:13,191 INFO L290 TraceCheckUtils]: 30: Hoare triple {1123#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1123#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-14 15:51:13,191 INFO L290 TraceCheckUtils]: 31: Hoare triple {1123#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} assume !!(#t~post7 < 100);havoc #t~post7; {1123#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-14 15:51:13,191 INFO L272 TraceCheckUtils]: 32: Hoare triple {1123#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {1133#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:51:13,192 INFO L290 TraceCheckUtils]: 33: Hoare triple {1133#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1137#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:51:13,192 INFO L290 TraceCheckUtils]: 34: Hoare triple {1137#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1028#false} is VALID [2022-04-14 15:51:13,195 INFO L290 TraceCheckUtils]: 35: Hoare triple {1028#false} assume !false; {1028#false} is VALID [2022-04-14 15:51:13,196 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-14 15:51:13,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:51:13,351 INFO L290 TraceCheckUtils]: 35: Hoare triple {1028#false} assume !false; {1028#false} is VALID [2022-04-14 15:51:13,352 INFO L290 TraceCheckUtils]: 34: Hoare triple {1137#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1028#false} is VALID [2022-04-14 15:51:13,352 INFO L290 TraceCheckUtils]: 33: Hoare triple {1133#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1137#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:51:13,353 INFO L272 TraceCheckUtils]: 32: Hoare triple {1153#(= 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)); {1133#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:51:13,353 INFO L290 TraceCheckUtils]: 31: Hoare triple {1153#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {1153#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-14 15:51:13,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {1153#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1153#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-14 15:51:13,354 INFO L290 TraceCheckUtils]: 29: Hoare triple {1027#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1153#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-14 15:51:13,354 INFO L290 TraceCheckUtils]: 28: Hoare triple {1027#true} assume !!(#t~post6 < 100);havoc #t~post6; {1027#true} is VALID [2022-04-14 15:51:13,354 INFO L290 TraceCheckUtils]: 27: Hoare triple {1027#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1027#true} is VALID [2022-04-14 15:51:13,354 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1027#true} {1027#true} #84#return; {1027#true} is VALID [2022-04-14 15:51:13,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-14 15:51:13,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-14 15:51:13,354 INFO L290 TraceCheckUtils]: 23: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-14 15:51:13,354 INFO L272 TraceCheckUtils]: 22: Hoare triple {1027#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1027#true} is VALID [2022-04-14 15:51:13,354 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1027#true} {1027#true} #82#return; {1027#true} is VALID [2022-04-14 15:51:13,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-14 15:51:13,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-14 15:51:13,355 INFO L290 TraceCheckUtils]: 18: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-14 15:51:13,355 INFO L272 TraceCheckUtils]: 17: Hoare triple {1027#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1027#true} is VALID [2022-04-14 15:51:13,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {1027#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1027#true} is VALID [2022-04-14 15:51:13,355 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1027#true} {1027#true} #80#return; {1027#true} is VALID [2022-04-14 15:51:13,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-14 15:51:13,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-14 15:51:13,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-14 15:51:13,357 INFO L272 TraceCheckUtils]: 11: Hoare triple {1027#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1027#true} is VALID [2022-04-14 15:51:13,357 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1027#true} {1027#true} #78#return; {1027#true} is VALID [2022-04-14 15:51:13,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-14 15:51:13,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-14 15:51:13,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-14 15:51:13,357 INFO L272 TraceCheckUtils]: 6: Hoare triple {1027#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1027#true} is VALID [2022-04-14 15:51:13,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {1027#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1027#true} is VALID [2022-04-14 15:51:13,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {1027#true} call #t~ret8 := main(); {1027#true} is VALID [2022-04-14 15:51:13,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1027#true} {1027#true} #98#return; {1027#true} is VALID [2022-04-14 15:51:13,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-14 15:51:13,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {1027#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1027#true} is VALID [2022-04-14 15:51:13,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {1027#true} call ULTIMATE.init(); {1027#true} is VALID [2022-04-14 15:51:13,358 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-14 15:51:13,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:51:13,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220437321] [2022-04-14 15:51:13,359 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:51:13,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366702684] [2022-04-14 15:51:13,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366702684] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 15:51:13,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 15:51:13,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-14 15:51:13,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816276462] [2022-04-14 15:51:13,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:51:13,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-04-14 15:51:13,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:51:13,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 15:51:13,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:51:13,377 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:51:13,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:51:13,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:51:13,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-14 15:51:13,379 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 15:51:13,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:51:13,613 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-14 15:51:13,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:51:13,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-04-14 15:51:13,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:51:13,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 15:51:13,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-14 15:51:13,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 15:51:13,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-14 15:51:13,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-14 15:51:13,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:51:13,651 INFO L225 Difference]: With dead ends: 43 [2022-04-14 15:51:13,651 INFO L226 Difference]: Without dead ends: 41 [2022-04-14 15:51:13,652 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-14 15:51:13,652 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:51:13,653 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 131 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 15:51:13,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-14 15:51:13,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-14 15:51:13,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:51:13,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:51:13,669 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:51:13,669 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:51:13,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:51:13,671 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-14 15:51:13,671 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-14 15:51:13,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:51:13,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:51:13,671 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 41 states. [2022-04-14 15:51:13,671 INFO L87 Difference]: Start difference. First operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 41 states. [2022-04-14 15:51:13,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:51:13,673 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-14 15:51:13,673 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-14 15:51:13,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:51:13,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:51:13,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:51:13,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:51:13,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:51:13,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2022-04-14 15:51:13,675 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 36 [2022-04-14 15:51:13,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:51:13,675 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-04-14 15:51:13,675 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 15:51:13,675 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-14 15:51:13,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-14 15:51:13,675 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:51:13,676 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-14 15:51:13,694 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-14 15:51:13,891 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-14 15:51:13,892 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:51:13,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:51:13,892 INFO L85 PathProgramCache]: Analyzing trace with hash -2124209112, now seen corresponding path program 1 times [2022-04-14 15:51:13,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:51:13,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33755812] [2022-04-14 15:51:13,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:51:13,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:51:13,935 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:51:13,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [879995394] [2022-04-14 15:51:13,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:51:13,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:51:13,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:51:13,939 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-14 15:51:13,943 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-14 15:51:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:51:13,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 15:51:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:51:14,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:51:14,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {1460#true} call ULTIMATE.init(); {1460#true} is VALID [2022-04-14 15:51:14,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {1460#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1468#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:14,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {1468#(<= ~counter~0 0)} assume true; {1468#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:14,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1468#(<= ~counter~0 0)} {1460#true} #98#return; {1468#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:14,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {1468#(<= ~counter~0 0)} call #t~ret8 := main(); {1468#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:14,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {1468#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1468#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:14,151 INFO L272 TraceCheckUtils]: 6: Hoare triple {1468#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1468#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:14,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {1468#(<= ~counter~0 0)} ~cond := #in~cond; {1468#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:14,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {1468#(<= ~counter~0 0)} assume !(0 == ~cond); {1468#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:14,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {1468#(<= ~counter~0 0)} assume true; {1468#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:14,152 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1468#(<= ~counter~0 0)} {1468#(<= ~counter~0 0)} #78#return; {1468#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:14,152 INFO L272 TraceCheckUtils]: 11: Hoare triple {1468#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1468#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:14,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {1468#(<= ~counter~0 0)} ~cond := #in~cond; {1468#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:14,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {1468#(<= ~counter~0 0)} assume !(0 == ~cond); {1468#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:14,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {1468#(<= ~counter~0 0)} assume true; {1468#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:14,154 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1468#(<= ~counter~0 0)} {1468#(<= ~counter~0 0)} #80#return; {1468#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:14,154 INFO L290 TraceCheckUtils]: 16: Hoare triple {1468#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1468#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:14,154 INFO L272 TraceCheckUtils]: 17: Hoare triple {1468#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1468#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:14,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {1468#(<= ~counter~0 0)} ~cond := #in~cond; {1468#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:14,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {1468#(<= ~counter~0 0)} assume !(0 == ~cond); {1468#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:14,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {1468#(<= ~counter~0 0)} assume true; {1468#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:14,155 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1468#(<= ~counter~0 0)} {1468#(<= ~counter~0 0)} #82#return; {1468#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:14,156 INFO L272 TraceCheckUtils]: 22: Hoare triple {1468#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1468#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:14,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {1468#(<= ~counter~0 0)} ~cond := #in~cond; {1468#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:14,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {1468#(<= ~counter~0 0)} assume !(0 == ~cond); {1468#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:14,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {1468#(<= ~counter~0 0)} assume true; {1468#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:14,158 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1468#(<= ~counter~0 0)} {1468#(<= ~counter~0 0)} #84#return; {1468#(<= ~counter~0 0)} is VALID [2022-04-14 15:51:14,160 INFO L290 TraceCheckUtils]: 27: Hoare triple {1468#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1547#(<= ~counter~0 1)} is VALID [2022-04-14 15:51:14,160 INFO L290 TraceCheckUtils]: 28: Hoare triple {1547#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {1547#(<= ~counter~0 1)} is VALID [2022-04-14 15:51:14,161 INFO L290 TraceCheckUtils]: 29: Hoare triple {1547#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1547#(<= ~counter~0 1)} is VALID [2022-04-14 15:51:14,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {1547#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1557#(<= |main_#t~post7| 1)} is VALID [2022-04-14 15:51:14,167 INFO L290 TraceCheckUtils]: 31: Hoare triple {1557#(<= |main_#t~post7| 1)} assume !(#t~post7 < 100);havoc #t~post7; {1461#false} is VALID [2022-04-14 15:51:14,167 INFO L290 TraceCheckUtils]: 32: Hoare triple {1461#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; {1461#false} is VALID [2022-04-14 15:51:14,168 INFO L290 TraceCheckUtils]: 33: Hoare triple {1461#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1461#false} is VALID [2022-04-14 15:51:14,168 INFO L290 TraceCheckUtils]: 34: Hoare triple {1461#false} assume !(#t~post6 < 100);havoc #t~post6; {1461#false} is VALID [2022-04-14 15:51:14,168 INFO L272 TraceCheckUtils]: 35: Hoare triple {1461#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {1461#false} is VALID [2022-04-14 15:51:14,168 INFO L290 TraceCheckUtils]: 36: Hoare triple {1461#false} ~cond := #in~cond; {1461#false} is VALID [2022-04-14 15:51:14,168 INFO L290 TraceCheckUtils]: 37: Hoare triple {1461#false} assume 0 == ~cond; {1461#false} is VALID [2022-04-14 15:51:14,168 INFO L290 TraceCheckUtils]: 38: Hoare triple {1461#false} assume !false; {1461#false} is VALID [2022-04-14 15:51:14,168 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-14 15:51:14,168 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:51:14,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:51:14,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33755812] [2022-04-14 15:51:14,168 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:51:14,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879995394] [2022-04-14 15:51:14,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879995394] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:51:14,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:51:14,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:51:14,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144955271] [2022-04-14 15:51:14,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:51:14,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-14 15:51:14,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:51:14,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 15:51:14,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:51:14,192 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:51:14,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:51:14,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:51:14,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:51:14,193 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 15:51:14,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:51:14,294 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-04-14 15:51:14,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:51:14,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-14 15:51:14,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:51:14,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 15:51:14,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-14 15:51:14,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 15:51:14,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-14 15:51:14,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 78 transitions. [2022-04-14 15:51:14,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:51:14,344 INFO L225 Difference]: With dead ends: 66 [2022-04-14 15:51:14,344 INFO L226 Difference]: Without dead ends: 43 [2022-04-14 15:51:14,344 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:51:14,346 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 15:51:14,346 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 110 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 15:51:14,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-14 15:51:14,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-14 15:51:14,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:51:14,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:51:14,366 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:51:14,366 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:51:14,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:51:14,369 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-14 15:51:14,369 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-04-14 15:51:14,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:51:14,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:51:14,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-14 15:51:14,369 INFO L87 Difference]: Start difference. First operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-14 15:51:14,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:51:14,371 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-14 15:51:14,371 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-04-14 15:51:14,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:51:14,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:51:14,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:51:14,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:51:14,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:51:14,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2022-04-14 15:51:14,373 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 39 [2022-04-14 15:51:14,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:51:14,373 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2022-04-14 15:51:14,374 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 15:51:14,374 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-04-14 15:51:14,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-14 15:51:14,375 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:51:14,375 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:51:14,409 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-14 15:51:14,583 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-14 15:51:14,583 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:51:14,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:51:14,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1052701339, now seen corresponding path program 1 times [2022-04-14 15:51:14,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:51:14,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62823982] [2022-04-14 15:51:14,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:51:14,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:51:14,596 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:51:14,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1517764327] [2022-04-14 15:51:14,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:51:14,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:51:14,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:51:14,597 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-14 15:51:14,620 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-14 15:51:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:51:14,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-14 15:51:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:51:14,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:51:14,898 INFO L272 TraceCheckUtils]: 0: Hoare triple {1828#true} call ULTIMATE.init(); {1828#true} is VALID [2022-04-14 15:51:14,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {1828#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1828#true} is VALID [2022-04-14 15:51:14,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-14 15:51:14,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1828#true} {1828#true} #98#return; {1828#true} is VALID [2022-04-14 15:51:14,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {1828#true} call #t~ret8 := main(); {1828#true} is VALID [2022-04-14 15:51:14,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {1828#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1828#true} is VALID [2022-04-14 15:51:14,899 INFO L272 TraceCheckUtils]: 6: Hoare triple {1828#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1828#true} is VALID [2022-04-14 15:51:14,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-14 15:51:14,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-14 15:51:14,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-14 15:51:14,899 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1828#true} {1828#true} #78#return; {1828#true} is VALID [2022-04-14 15:51:14,899 INFO L272 TraceCheckUtils]: 11: Hoare triple {1828#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1828#true} is VALID [2022-04-14 15:51:14,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {1828#true} ~cond := #in~cond; {1869#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 15:51:14,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {1869#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1873#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 15:51:14,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {1873#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1873#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 15:51:14,902 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1873#(not (= |assume_abort_if_not_#in~cond| 0))} {1828#true} #80#return; {1880#(<= 1 main_~y~0)} is VALID [2022-04-14 15:51:14,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {1880#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:51:14,903 INFO L272 TraceCheckUtils]: 17: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1828#true} is VALID [2022-04-14 15:51:14,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-14 15:51:14,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-14 15:51:14,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-14 15:51:14,903 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1828#true} {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:51:14,903 INFO L272 TraceCheckUtils]: 22: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1828#true} is VALID [2022-04-14 15:51:14,903 INFO L290 TraceCheckUtils]: 23: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-14 15:51:14,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-14 15:51:14,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-14 15:51:14,904 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1828#true} {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:51:14,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:51:14,905 INFO L290 TraceCheckUtils]: 28: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:51:14,905 INFO L290 TraceCheckUtils]: 29: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:51:14,906 INFO L290 TraceCheckUtils]: 30: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:51:14,906 INFO L290 TraceCheckUtils]: 31: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:51:14,906 INFO L272 TraceCheckUtils]: 32: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {1828#true} is VALID [2022-04-14 15:51:14,906 INFO L290 TraceCheckUtils]: 33: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-14 15:51:14,906 INFO L290 TraceCheckUtils]: 34: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-14 15:51:14,906 INFO L290 TraceCheckUtils]: 35: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-14 15:51:14,907 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1828#true} {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:51:14,908 INFO L272 TraceCheckUtils]: 37: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1948#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:51:14,908 INFO L290 TraceCheckUtils]: 38: Hoare triple {1948#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1952#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:51:14,908 INFO L290 TraceCheckUtils]: 39: Hoare triple {1952#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1829#false} is VALID [2022-04-14 15:51:14,908 INFO L290 TraceCheckUtils]: 40: Hoare triple {1829#false} assume !false; {1829#false} is VALID [2022-04-14 15:51:14,909 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-14 15:51:14,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:51:15,107 INFO L290 TraceCheckUtils]: 40: Hoare triple {1829#false} assume !false; {1829#false} is VALID [2022-04-14 15:51:15,107 INFO L290 TraceCheckUtils]: 39: Hoare triple {1952#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1829#false} is VALID [2022-04-14 15:51:15,107 INFO L290 TraceCheckUtils]: 38: Hoare triple {1948#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1952#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:51:15,110 INFO L272 TraceCheckUtils]: 37: Hoare triple {1968#(= 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)); {1948#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:51:15,110 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1828#true} {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #86#return; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 15:51:15,110 INFO L290 TraceCheckUtils]: 35: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-14 15:51:15,110 INFO L290 TraceCheckUtils]: 34: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-14 15:51:15,110 INFO L290 TraceCheckUtils]: 33: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-14 15:51:15,110 INFO L272 TraceCheckUtils]: 32: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {1828#true} is VALID [2022-04-14 15:51:15,111 INFO L290 TraceCheckUtils]: 31: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 15:51:15,112 INFO L290 TraceCheckUtils]: 30: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 15:51:15,112 INFO L290 TraceCheckUtils]: 29: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 15:51:15,112 INFO L290 TraceCheckUtils]: 28: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 100);havoc #t~post6; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 15:51:15,112 INFO L290 TraceCheckUtils]: 27: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 15:51:15,113 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1828#true} {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #84#return; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 15:51:15,113 INFO L290 TraceCheckUtils]: 25: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-14 15:51:15,113 INFO L290 TraceCheckUtils]: 24: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-14 15:51:15,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-14 15:51:15,113 INFO L272 TraceCheckUtils]: 22: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1828#true} is VALID [2022-04-14 15:51:15,113 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1828#true} {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #82#return; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 15:51:15,114 INFO L290 TraceCheckUtils]: 20: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-14 15:51:15,114 INFO L290 TraceCheckUtils]: 19: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-14 15:51:15,114 INFO L290 TraceCheckUtils]: 18: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-14 15:51:15,114 INFO L272 TraceCheckUtils]: 17: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1828#true} is VALID [2022-04-14 15:51:15,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {1828#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 15:51:15,114 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1828#true} {1828#true} #80#return; {1828#true} is VALID [2022-04-14 15:51:15,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-14 15:51:15,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-14 15:51:15,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-14 15:51:15,114 INFO L272 TraceCheckUtils]: 11: Hoare triple {1828#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1828#true} is VALID [2022-04-14 15:51:15,114 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1828#true} {1828#true} #78#return; {1828#true} is VALID [2022-04-14 15:51:15,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-14 15:51:15,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-14 15:51:15,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-14 15:51:15,115 INFO L272 TraceCheckUtils]: 6: Hoare triple {1828#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1828#true} is VALID [2022-04-14 15:51:15,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {1828#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1828#true} is VALID [2022-04-14 15:51:15,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {1828#true} call #t~ret8 := main(); {1828#true} is VALID [2022-04-14 15:51:15,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1828#true} {1828#true} #98#return; {1828#true} is VALID [2022-04-14 15:51:15,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-14 15:51:15,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {1828#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1828#true} is VALID [2022-04-14 15:51:15,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {1828#true} call ULTIMATE.init(); {1828#true} is VALID [2022-04-14 15:51:15,115 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-14 15:51:15,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:51:15,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62823982] [2022-04-14 15:51:15,116 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:51:15,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517764327] [2022-04-14 15:51:15,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517764327] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 15:51:15,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 15:51:15,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-14 15:51:15,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195004433] [2022-04-14 15:51:15,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:51:15,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2022-04-14 15:51:15,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:51:15,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 15:51:15,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:51:15,134 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:51:15,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:51:15,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:51:15,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-14 15:51:15,135 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 15:51:15,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:51:15,394 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-04-14 15:51:15,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:51:15,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2022-04-14 15:51:15,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:51:15,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 15:51:15,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-14 15:51:15,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 15:51:15,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-14 15:51:15,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-14 15:51:15,459 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-14 15:51:15,461 INFO L225 Difference]: With dead ends: 57 [2022-04-14 15:51:15,461 INFO L226 Difference]: Without dead ends: 55 [2022-04-14 15:51:15,461 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-14 15:51:15,463 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:51:15,463 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 157 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 15:51:15,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-14 15:51:15,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-04-14 15:51:15,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:51:15,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 15:51:15,505 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 15:51:15,505 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 15:51:15,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:51:15,507 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-14 15:51:15,507 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-14 15:51:15,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:51:15,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:51:15,508 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-14 15:51:15,508 INFO L87 Difference]: Start difference. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-14 15:51:15,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:51:15,510 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-14 15:51:15,510 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-14 15:51:15,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:51:15,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:51:15,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:51:15,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:51:15,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 15:51:15,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-04-14 15:51:15,512 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 41 [2022-04-14 15:51:15,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:51:15,512 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-04-14 15:51:15,512 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 15:51:15,512 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-04-14 15:51:15,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-14 15:51:15,512 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:51:15,513 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:51:15,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-14 15:51:15,737 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-14 15:51:15,738 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:51:15,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:51:15,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1531994984, now seen corresponding path program 1 times [2022-04-14 15:51:15,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:51:15,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838666512] [2022-04-14 15:51:15,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:51:15,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:51:15,749 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:51:15,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [649089388] [2022-04-14 15:51:15,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:51:15,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:51:15,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:51:15,758 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-14 15:51:15,759 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-14 15:51:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:51:15,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-14 15:51:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:51:15,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:51:16,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {2359#true} call ULTIMATE.init(); {2359#true} is VALID [2022-04-14 15:51:16,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {2359#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2359#true} is VALID [2022-04-14 15:51:16,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-14 15:51:16,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2359#true} {2359#true} #98#return; {2359#true} is VALID [2022-04-14 15:51:16,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {2359#true} call #t~ret8 := main(); {2359#true} is VALID [2022-04-14 15:51:16,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {2359#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2359#true} is VALID [2022-04-14 15:51:16,042 INFO L272 TraceCheckUtils]: 6: Hoare triple {2359#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2359#true} is VALID [2022-04-14 15:51:16,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {2359#true} ~cond := #in~cond; {2385#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 15:51:16,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {2385#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2389#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 15:51:16,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {2389#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2389#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 15:51:16,043 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2389#(not (= |assume_abort_if_not_#in~cond| 0))} {2359#true} #78#return; {2396#(<= 1 main_~x~0)} is VALID [2022-04-14 15:51:16,043 INFO L272 TraceCheckUtils]: 11: Hoare triple {2396#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2359#true} is VALID [2022-04-14 15:51:16,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-14 15:51:16,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-14 15:51:16,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-14 15:51:16,043 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2359#true} {2396#(<= 1 main_~x~0)} #80#return; {2396#(<= 1 main_~x~0)} is VALID [2022-04-14 15:51:16,044 INFO L290 TraceCheckUtils]: 16: Hoare triple {2396#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 15:51:16,044 INFO L272 TraceCheckUtils]: 17: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2359#true} is VALID [2022-04-14 15:51:16,044 INFO L290 TraceCheckUtils]: 18: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-14 15:51:16,044 INFO L290 TraceCheckUtils]: 19: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-14 15:51:16,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-14 15:51:16,045 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2359#true} {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #82#return; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 15:51:16,045 INFO L272 TraceCheckUtils]: 22: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2359#true} is VALID [2022-04-14 15:51:16,045 INFO L290 TraceCheckUtils]: 23: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-14 15:51:16,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-14 15:51:16,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-14 15:51:16,045 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2359#true} {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #84#return; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 15:51:16,046 INFO L290 TraceCheckUtils]: 27: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 15:51:16,046 INFO L290 TraceCheckUtils]: 28: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post6 < 100);havoc #t~post6; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 15:51:16,046 INFO L290 TraceCheckUtils]: 29: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 15:51:16,047 INFO L290 TraceCheckUtils]: 30: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 15:51:16,047 INFO L290 TraceCheckUtils]: 31: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 100);havoc #t~post7; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 15:51:16,050 INFO L272 TraceCheckUtils]: 32: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2359#true} is VALID [2022-04-14 15:51:16,052 INFO L290 TraceCheckUtils]: 33: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-14 15:51:16,053 INFO L290 TraceCheckUtils]: 34: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-14 15:51:16,053 INFO L290 TraceCheckUtils]: 35: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-14 15:51:16,054 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2359#true} {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #86#return; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 15:51:16,054 INFO L272 TraceCheckUtils]: 37: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2359#true} is VALID [2022-04-14 15:51:16,054 INFO L290 TraceCheckUtils]: 38: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-14 15:51:16,054 INFO L290 TraceCheckUtils]: 39: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-14 15:51:16,054 INFO L290 TraceCheckUtils]: 40: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-14 15:51:16,055 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2359#true} {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #88#return; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 15:51:16,055 INFO L272 TraceCheckUtils]: 42: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:51:16,056 INFO L290 TraceCheckUtils]: 43: Hoare triple {2494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:51:16,056 INFO L290 TraceCheckUtils]: 44: Hoare triple {2498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2360#false} is VALID [2022-04-14 15:51:16,056 INFO L290 TraceCheckUtils]: 45: Hoare triple {2360#false} assume !false; {2360#false} is VALID [2022-04-14 15:51:16,056 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-14 15:51:16,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:51:16,250 INFO L290 TraceCheckUtils]: 45: Hoare triple {2360#false} assume !false; {2360#false} is VALID [2022-04-14 15:51:16,250 INFO L290 TraceCheckUtils]: 44: Hoare triple {2498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2360#false} is VALID [2022-04-14 15:51:16,251 INFO L290 TraceCheckUtils]: 43: Hoare triple {2494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:51:16,251 INFO L272 TraceCheckUtils]: 42: Hoare triple {2514#(= 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)); {2494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:51:16,252 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2359#true} {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #88#return; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 15:51:16,252 INFO L290 TraceCheckUtils]: 40: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-14 15:51:16,252 INFO L290 TraceCheckUtils]: 39: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-14 15:51:16,252 INFO L290 TraceCheckUtils]: 38: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-14 15:51:16,252 INFO L272 TraceCheckUtils]: 37: Hoare triple {2514#(= 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)); {2359#true} is VALID [2022-04-14 15:51:16,258 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2359#true} {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #86#return; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 15:51:16,258 INFO L290 TraceCheckUtils]: 35: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-14 15:51:16,258 INFO L290 TraceCheckUtils]: 34: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-14 15:51:16,258 INFO L290 TraceCheckUtils]: 33: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-14 15:51:16,258 INFO L272 TraceCheckUtils]: 32: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2359#true} is VALID [2022-04-14 15:51:16,259 INFO L290 TraceCheckUtils]: 31: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 15:51:16,259 INFO L290 TraceCheckUtils]: 30: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 15:51:16,259 INFO L290 TraceCheckUtils]: 29: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 15:51:16,260 INFO L290 TraceCheckUtils]: 28: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 100);havoc #t~post6; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 15:51:16,260 INFO L290 TraceCheckUtils]: 27: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 15:51:16,261 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2359#true} {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #84#return; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 15:51:16,261 INFO L290 TraceCheckUtils]: 25: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-14 15:51:16,261 INFO L290 TraceCheckUtils]: 24: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-14 15:51:16,261 INFO L290 TraceCheckUtils]: 23: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-14 15:51:16,261 INFO L272 TraceCheckUtils]: 22: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2359#true} is VALID [2022-04-14 15:51:16,261 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2359#true} {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #82#return; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 15:51:16,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-14 15:51:16,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-14 15:51:16,262 INFO L290 TraceCheckUtils]: 18: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-14 15:51:16,262 INFO L272 TraceCheckUtils]: 17: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2359#true} is VALID [2022-04-14 15:51:16,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {2359#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 15:51:16,262 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2359#true} {2359#true} #80#return; {2359#true} is VALID [2022-04-14 15:51:16,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-14 15:51:16,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-14 15:51:16,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-14 15:51:16,262 INFO L272 TraceCheckUtils]: 11: Hoare triple {2359#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2359#true} is VALID [2022-04-14 15:51:16,262 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2359#true} {2359#true} #78#return; {2359#true} is VALID [2022-04-14 15:51:16,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-14 15:51:16,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-14 15:51:16,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-14 15:51:16,263 INFO L272 TraceCheckUtils]: 6: Hoare triple {2359#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2359#true} is VALID [2022-04-14 15:51:16,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {2359#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2359#true} is VALID [2022-04-14 15:51:16,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {2359#true} call #t~ret8 := main(); {2359#true} is VALID [2022-04-14 15:51:16,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2359#true} {2359#true} #98#return; {2359#true} is VALID [2022-04-14 15:51:16,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-14 15:51:16,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {2359#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2359#true} is VALID [2022-04-14 15:51:16,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {2359#true} call ULTIMATE.init(); {2359#true} is VALID [2022-04-14 15:51:16,263 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-14 15:51:16,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:51:16,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838666512] [2022-04-14 15:51:16,264 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:51:16,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649089388] [2022-04-14 15:51:16,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649089388] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 15:51:16,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 15:51:16,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-14 15:51:16,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596613777] [2022-04-14 15:51:16,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:51:16,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2022-04-14 15:51:16,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:51:16,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 15:51:16,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:51:16,296 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:51:16,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:51:16,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:51:16,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-14 15:51:16,297 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 15:51:16,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:51:16,622 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2022-04-14 15:51:16,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:51:16,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2022-04-14 15:51:16,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:51:16,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 15:51:16,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-14 15:51:16,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 15:51:16,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-14 15:51:16,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-14 15:51:16,679 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-14 15:51:16,682 INFO L225 Difference]: With dead ends: 61 [2022-04-14 15:51:16,682 INFO L226 Difference]: Without dead ends: 59 [2022-04-14 15:51:16,682 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-14 15:51:16,682 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:51:16,683 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 148 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 15:51:16,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-14 15:51:16,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-14 15:51:16,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:51:16,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 15:51:16,708 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 15:51:16,708 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 15:51:16,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:51:16,710 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-14 15:51:16,710 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-14 15:51:16,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:51:16,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:51:16,711 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 59 states. [2022-04-14 15:51:16,711 INFO L87 Difference]: Start difference. First operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 59 states. [2022-04-14 15:51:16,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:51:16,712 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-14 15:51:16,712 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-14 15:51:16,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:51:16,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:51:16,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:51:16,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:51:16,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 15:51:16,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2022-04-14 15:51:16,714 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 46 [2022-04-14 15:51:16,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:51:16,714 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2022-04-14 15:51:16,715 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 15:51:16,715 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2022-04-14 15:51:16,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-14 15:51:16,715 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:51:16,715 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:51:16,734 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-14 15:51:16,934 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-14 15:51:16,934 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:51:16,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:51:16,935 INFO L85 PathProgramCache]: Analyzing trace with hash -300711301, now seen corresponding path program 1 times [2022-04-14 15:51:16,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:51:16,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536632184] [2022-04-14 15:51:16,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:51:16,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:51:16,947 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:51:16,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [943401665] [2022-04-14 15:51:16,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:51:16,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:51:16,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:51:16,949 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-14 15:51:16,950 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-14 15:51:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:51:16,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-14 15:51:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:51:17,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:51:17,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {2938#true} call ULTIMATE.init(); {2938#true} is VALID [2022-04-14 15:51:17,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {2938#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2938#true} is VALID [2022-04-14 15:51:17,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-04-14 15:51:17,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2938#true} {2938#true} #98#return; {2938#true} is VALID [2022-04-14 15:51:17,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {2938#true} call #t~ret8 := main(); {2938#true} is VALID [2022-04-14 15:51:17,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {2938#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2938#true} is VALID [2022-04-14 15:51:17,373 INFO L272 TraceCheckUtils]: 6: Hoare triple {2938#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2938#true} is VALID [2022-04-14 15:51:17,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {2938#true} ~cond := #in~cond; {2938#true} is VALID [2022-04-14 15:51:17,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {2938#true} assume !(0 == ~cond); {2938#true} is VALID [2022-04-14 15:51:17,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-04-14 15:51:17,374 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2938#true} {2938#true} #78#return; {2938#true} is VALID [2022-04-14 15:51:17,374 INFO L272 TraceCheckUtils]: 11: Hoare triple {2938#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2938#true} is VALID [2022-04-14 15:51:17,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {2938#true} ~cond := #in~cond; {2979#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 15:51:17,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {2979#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2983#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 15:51:17,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {2983#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2983#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 15:51:17,375 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2983#(not (= |assume_abort_if_not_#in~cond| 0))} {2938#true} #80#return; {2990#(<= 1 main_~y~0)} is VALID [2022-04-14 15:51:17,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {2990#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-14 15:51:17,376 INFO L272 TraceCheckUtils]: 17: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2938#true} is VALID [2022-04-14 15:51:17,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {2938#true} ~cond := #in~cond; {2938#true} is VALID [2022-04-14 15:51:17,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {2938#true} assume !(0 == ~cond); {2938#true} is VALID [2022-04-14 15:51:17,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-04-14 15:51:17,376 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2938#true} {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #82#return; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-14 15:51:17,376 INFO L272 TraceCheckUtils]: 22: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2938#true} is VALID [2022-04-14 15:51:17,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {2938#true} ~cond := #in~cond; {2938#true} is VALID [2022-04-14 15:51:17,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {2938#true} assume !(0 == ~cond); {2938#true} is VALID [2022-04-14 15:51:17,377 INFO L290 TraceCheckUtils]: 25: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-04-14 15:51:17,377 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2938#true} {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #84#return; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-14 15:51:17,377 INFO L290 TraceCheckUtils]: 27: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-14 15:51:17,378 INFO L290 TraceCheckUtils]: 28: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post6 < 100);havoc #t~post6; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-14 15:51:17,378 INFO L290 TraceCheckUtils]: 29: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-14 15:51:17,379 INFO L290 TraceCheckUtils]: 30: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-14 15:51:17,379 INFO L290 TraceCheckUtils]: 31: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post7 < 100);havoc #t~post7; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-14 15:51:17,379 INFO L272 TraceCheckUtils]: 32: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2938#true} is VALID [2022-04-14 15:51:17,379 INFO L290 TraceCheckUtils]: 33: Hoare triple {2938#true} ~cond := #in~cond; {2938#true} is VALID [2022-04-14 15:51:17,379 INFO L290 TraceCheckUtils]: 34: Hoare triple {2938#true} assume !(0 == ~cond); {2938#true} is VALID [2022-04-14 15:51:17,379 INFO L290 TraceCheckUtils]: 35: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-04-14 15:51:17,380 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2938#true} {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #86#return; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-14 15:51:17,380 INFO L272 TraceCheckUtils]: 37: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2938#true} is VALID [2022-04-14 15:51:17,382 INFO L290 TraceCheckUtils]: 38: Hoare triple {2938#true} ~cond := #in~cond; {3061#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:51:17,383 INFO L290 TraceCheckUtils]: 39: Hoare triple {3061#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:51:17,383 INFO L290 TraceCheckUtils]: 40: Hoare triple {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:51:17,384 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #88#return; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-14 15:51:17,384 INFO L272 TraceCheckUtils]: 42: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2938#true} is VALID [2022-04-14 15:51:17,384 INFO L290 TraceCheckUtils]: 43: Hoare triple {2938#true} ~cond := #in~cond; {3061#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:51:17,384 INFO L290 TraceCheckUtils]: 44: Hoare triple {3061#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:51:17,385 INFO L290 TraceCheckUtils]: 45: Hoare triple {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:51:17,385 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #90#return; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-14 15:51:17,386 INFO L272 TraceCheckUtils]: 47: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {3090#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:51:17,387 INFO L290 TraceCheckUtils]: 48: Hoare triple {3090#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3094#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:51:17,387 INFO L290 TraceCheckUtils]: 49: Hoare triple {3094#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2939#false} is VALID [2022-04-14 15:51:17,387 INFO L290 TraceCheckUtils]: 50: Hoare triple {2939#false} assume !false; {2939#false} is VALID [2022-04-14 15:51:17,387 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-14 15:51:17,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:51:58,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:51:58,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536632184] [2022-04-14 15:51:58,189 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:51:58,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943401665] [2022-04-14 15:51:58,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943401665] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:51:58,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 15:51:58,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-14 15:51:58,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925637804] [2022-04-14 15:51:58,190 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 15:51:58,190 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-14 15:51:58,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:51:58,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-14 15:51:58,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:51:58,221 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 15:51:58,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:51:58,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 15:51:58,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-04-14 15:51:58,222 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-14 15:51:59,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:51:59,953 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-14 15:51:59,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-14 15:51:59,953 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-14 15:51:59,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:51:59,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-14 15:51:59,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-14 15:51:59,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-14 15:51:59,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-14 15:51:59,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 67 transitions. [2022-04-14 15:52:00,015 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-14 15:52:00,017 INFO L225 Difference]: With dead ends: 65 [2022-04-14 15:52:00,017 INFO L226 Difference]: Without dead ends: 63 [2022-04-14 15:52:00,017 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-04-14 15:52:00,018 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 32 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-14 15:52:00,018 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 153 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-14 15:52:00,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-14 15:52:00,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-14 15:52:00,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:52:00,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 15:52:00,047 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 15:52:00,048 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 15:52:00,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:52:00,049 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2022-04-14 15:52:00,049 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-14 15:52:00,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:52:00,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:52:00,050 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 63 states. [2022-04-14 15:52:00,050 INFO L87 Difference]: Start difference. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 63 states. [2022-04-14 15:52:00,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:52:00,051 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2022-04-14 15:52:00,051 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-14 15:52:00,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:52:00,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:52:00,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:52:00,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:52:00,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 15:52:00,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2022-04-14 15:52:00,053 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 51 [2022-04-14 15:52:00,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:52:00,053 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2022-04-14 15:52:00,054 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-14 15:52:00,054 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2022-04-14 15:52:00,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-14 15:52:00,054 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:52:00,054 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:52:00,075 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-14 15:52:00,271 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-14 15:52:00,272 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:52:00,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:52:00,272 INFO L85 PathProgramCache]: Analyzing trace with hash 35160305, now seen corresponding path program 1 times [2022-04-14 15:52:00,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:52:00,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230512135] [2022-04-14 15:52:00,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:52:00,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:52:00,282 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:52:00,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [779686756] [2022-04-14 15:52:00,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:52:00,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:52:00,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:52:00,283 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-14 15:52:00,284 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-14 15:52:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:52:00,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 15:52:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:52:00,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:52:00,621 INFO L272 TraceCheckUtils]: 0: Hoare triple {3434#true} call ULTIMATE.init(); {3434#true} is VALID [2022-04-14 15:52:00,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {3434#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3442#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:00,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {3442#(<= ~counter~0 0)} assume true; {3442#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:00,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3442#(<= ~counter~0 0)} {3434#true} #98#return; {3442#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:00,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {3442#(<= ~counter~0 0)} call #t~ret8 := main(); {3442#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:00,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {3442#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3442#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:00,637 INFO L272 TraceCheckUtils]: 6: Hoare triple {3442#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3442#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:00,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {3442#(<= ~counter~0 0)} ~cond := #in~cond; {3442#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:00,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {3442#(<= ~counter~0 0)} assume !(0 == ~cond); {3442#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:00,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {3442#(<= ~counter~0 0)} assume true; {3442#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:00,638 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3442#(<= ~counter~0 0)} {3442#(<= ~counter~0 0)} #78#return; {3442#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:00,638 INFO L272 TraceCheckUtils]: 11: Hoare triple {3442#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3442#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:00,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {3442#(<= ~counter~0 0)} ~cond := #in~cond; {3442#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:00,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {3442#(<= ~counter~0 0)} assume !(0 == ~cond); {3442#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:00,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {3442#(<= ~counter~0 0)} assume true; {3442#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:00,640 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3442#(<= ~counter~0 0)} {3442#(<= ~counter~0 0)} #80#return; {3442#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:00,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {3442#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {3442#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:00,642 INFO L272 TraceCheckUtils]: 17: Hoare triple {3442#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {3442#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:00,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {3442#(<= ~counter~0 0)} ~cond := #in~cond; {3442#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:00,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {3442#(<= ~counter~0 0)} assume !(0 == ~cond); {3442#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:00,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {3442#(<= ~counter~0 0)} assume true; {3442#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:00,648 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3442#(<= ~counter~0 0)} {3442#(<= ~counter~0 0)} #82#return; {3442#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:00,648 INFO L272 TraceCheckUtils]: 22: Hoare triple {3442#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {3442#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:00,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {3442#(<= ~counter~0 0)} ~cond := #in~cond; {3442#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:00,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {3442#(<= ~counter~0 0)} assume !(0 == ~cond); {3442#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:00,649 INFO L290 TraceCheckUtils]: 25: Hoare triple {3442#(<= ~counter~0 0)} assume true; {3442#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:00,650 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3442#(<= ~counter~0 0)} {3442#(<= ~counter~0 0)} #84#return; {3442#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:00,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {3442#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3521#(<= ~counter~0 1)} is VALID [2022-04-14 15:52:00,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {3521#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {3521#(<= ~counter~0 1)} is VALID [2022-04-14 15:52:00,651 INFO L290 TraceCheckUtils]: 29: Hoare triple {3521#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3521#(<= ~counter~0 1)} is VALID [2022-04-14 15:52:00,651 INFO L290 TraceCheckUtils]: 30: Hoare triple {3521#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3531#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:00,651 INFO L290 TraceCheckUtils]: 31: Hoare triple {3531#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {3531#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:00,652 INFO L272 TraceCheckUtils]: 32: Hoare triple {3531#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3531#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:00,652 INFO L290 TraceCheckUtils]: 33: Hoare triple {3531#(<= ~counter~0 2)} ~cond := #in~cond; {3531#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:00,652 INFO L290 TraceCheckUtils]: 34: Hoare triple {3531#(<= ~counter~0 2)} assume !(0 == ~cond); {3531#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:00,653 INFO L290 TraceCheckUtils]: 35: Hoare triple {3531#(<= ~counter~0 2)} assume true; {3531#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:00,653 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3531#(<= ~counter~0 2)} {3531#(<= ~counter~0 2)} #86#return; {3531#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:00,654 INFO L272 TraceCheckUtils]: 37: Hoare triple {3531#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3531#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:00,654 INFO L290 TraceCheckUtils]: 38: Hoare triple {3531#(<= ~counter~0 2)} ~cond := #in~cond; {3531#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:00,654 INFO L290 TraceCheckUtils]: 39: Hoare triple {3531#(<= ~counter~0 2)} assume !(0 == ~cond); {3531#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:00,654 INFO L290 TraceCheckUtils]: 40: Hoare triple {3531#(<= ~counter~0 2)} assume true; {3531#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:00,655 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3531#(<= ~counter~0 2)} {3531#(<= ~counter~0 2)} #88#return; {3531#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:00,656 INFO L272 TraceCheckUtils]: 42: Hoare triple {3531#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3531#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:00,656 INFO L290 TraceCheckUtils]: 43: Hoare triple {3531#(<= ~counter~0 2)} ~cond := #in~cond; {3531#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:00,656 INFO L290 TraceCheckUtils]: 44: Hoare triple {3531#(<= ~counter~0 2)} assume !(0 == ~cond); {3531#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:00,656 INFO L290 TraceCheckUtils]: 45: Hoare triple {3531#(<= ~counter~0 2)} assume true; {3531#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:00,657 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3531#(<= ~counter~0 2)} {3531#(<= ~counter~0 2)} #90#return; {3531#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:00,658 INFO L272 TraceCheckUtils]: 47: Hoare triple {3531#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {3531#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:00,658 INFO L290 TraceCheckUtils]: 48: Hoare triple {3531#(<= ~counter~0 2)} ~cond := #in~cond; {3531#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:00,658 INFO L290 TraceCheckUtils]: 49: Hoare triple {3531#(<= ~counter~0 2)} assume !(0 == ~cond); {3531#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:00,658 INFO L290 TraceCheckUtils]: 50: Hoare triple {3531#(<= ~counter~0 2)} assume true; {3531#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:00,659 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3531#(<= ~counter~0 2)} {3531#(<= ~counter~0 2)} #92#return; {3531#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:00,659 INFO L290 TraceCheckUtils]: 52: Hoare triple {3531#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {3531#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:00,660 INFO L290 TraceCheckUtils]: 53: Hoare triple {3531#(<= ~counter~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {3531#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:00,660 INFO L290 TraceCheckUtils]: 54: Hoare triple {3531#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3604#(<= |main_#t~post6| 2)} is VALID [2022-04-14 15:52:00,660 INFO L290 TraceCheckUtils]: 55: Hoare triple {3604#(<= |main_#t~post6| 2)} assume !(#t~post6 < 100);havoc #t~post6; {3435#false} is VALID [2022-04-14 15:52:00,660 INFO L272 TraceCheckUtils]: 56: Hoare triple {3435#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {3435#false} is VALID [2022-04-14 15:52:00,661 INFO L290 TraceCheckUtils]: 57: Hoare triple {3435#false} ~cond := #in~cond; {3435#false} is VALID [2022-04-14 15:52:00,661 INFO L290 TraceCheckUtils]: 58: Hoare triple {3435#false} assume 0 == ~cond; {3435#false} is VALID [2022-04-14 15:52:00,661 INFO L290 TraceCheckUtils]: 59: Hoare triple {3435#false} assume !false; {3435#false} is VALID [2022-04-14 15:52:00,661 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-14 15:52:00,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:52:00,918 INFO L290 TraceCheckUtils]: 59: Hoare triple {3435#false} assume !false; {3435#false} is VALID [2022-04-14 15:52:00,919 INFO L290 TraceCheckUtils]: 58: Hoare triple {3435#false} assume 0 == ~cond; {3435#false} is VALID [2022-04-14 15:52:00,919 INFO L290 TraceCheckUtils]: 57: Hoare triple {3435#false} ~cond := #in~cond; {3435#false} is VALID [2022-04-14 15:52:00,919 INFO L272 TraceCheckUtils]: 56: Hoare triple {3435#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {3435#false} is VALID [2022-04-14 15:52:00,919 INFO L290 TraceCheckUtils]: 55: Hoare triple {3632#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {3435#false} is VALID [2022-04-14 15:52:00,919 INFO L290 TraceCheckUtils]: 54: Hoare triple {3636#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3632#(< |main_#t~post6| 100)} is VALID [2022-04-14 15:52:00,920 INFO L290 TraceCheckUtils]: 53: Hoare triple {3636#(< ~counter~0 100)} ~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; {3636#(< ~counter~0 100)} is VALID [2022-04-14 15:52:00,920 INFO L290 TraceCheckUtils]: 52: Hoare triple {3636#(< ~counter~0 100)} assume !(~c~0 >= ~b~0); {3636#(< ~counter~0 100)} is VALID [2022-04-14 15:52:00,921 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3434#true} {3636#(< ~counter~0 100)} #92#return; {3636#(< ~counter~0 100)} is VALID [2022-04-14 15:52:00,921 INFO L290 TraceCheckUtils]: 50: Hoare triple {3434#true} assume true; {3434#true} is VALID [2022-04-14 15:52:00,921 INFO L290 TraceCheckUtils]: 49: Hoare triple {3434#true} assume !(0 == ~cond); {3434#true} is VALID [2022-04-14 15:52:00,921 INFO L290 TraceCheckUtils]: 48: Hoare triple {3434#true} ~cond := #in~cond; {3434#true} is VALID [2022-04-14 15:52:00,921 INFO L272 TraceCheckUtils]: 47: Hoare triple {3636#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {3434#true} is VALID [2022-04-14 15:52:00,921 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3434#true} {3636#(< ~counter~0 100)} #90#return; {3636#(< ~counter~0 100)} is VALID [2022-04-14 15:52:00,922 INFO L290 TraceCheckUtils]: 45: Hoare triple {3434#true} assume true; {3434#true} is VALID [2022-04-14 15:52:00,922 INFO L290 TraceCheckUtils]: 44: Hoare triple {3434#true} assume !(0 == ~cond); {3434#true} is VALID [2022-04-14 15:52:00,922 INFO L290 TraceCheckUtils]: 43: Hoare triple {3434#true} ~cond := #in~cond; {3434#true} is VALID [2022-04-14 15:52:00,922 INFO L272 TraceCheckUtils]: 42: Hoare triple {3636#(< ~counter~0 100)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3434#true} is VALID [2022-04-14 15:52:00,922 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3434#true} {3636#(< ~counter~0 100)} #88#return; {3636#(< ~counter~0 100)} is VALID [2022-04-14 15:52:00,922 INFO L290 TraceCheckUtils]: 40: Hoare triple {3434#true} assume true; {3434#true} is VALID [2022-04-14 15:52:00,922 INFO L290 TraceCheckUtils]: 39: Hoare triple {3434#true} assume !(0 == ~cond); {3434#true} is VALID [2022-04-14 15:52:00,922 INFO L290 TraceCheckUtils]: 38: Hoare triple {3434#true} ~cond := #in~cond; {3434#true} is VALID [2022-04-14 15:52:00,923 INFO L272 TraceCheckUtils]: 37: Hoare triple {3636#(< ~counter~0 100)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3434#true} is VALID [2022-04-14 15:52:00,923 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3434#true} {3636#(< ~counter~0 100)} #86#return; {3636#(< ~counter~0 100)} is VALID [2022-04-14 15:52:00,923 INFO L290 TraceCheckUtils]: 35: Hoare triple {3434#true} assume true; {3434#true} is VALID [2022-04-14 15:52:00,923 INFO L290 TraceCheckUtils]: 34: Hoare triple {3434#true} assume !(0 == ~cond); {3434#true} is VALID [2022-04-14 15:52:00,923 INFO L290 TraceCheckUtils]: 33: Hoare triple {3434#true} ~cond := #in~cond; {3434#true} is VALID [2022-04-14 15:52:00,923 INFO L272 TraceCheckUtils]: 32: Hoare triple {3636#(< ~counter~0 100)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3434#true} is VALID [2022-04-14 15:52:00,924 INFO L290 TraceCheckUtils]: 31: Hoare triple {3636#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {3636#(< ~counter~0 100)} is VALID [2022-04-14 15:52:00,924 INFO L290 TraceCheckUtils]: 30: Hoare triple {3709#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3636#(< ~counter~0 100)} is VALID [2022-04-14 15:52:00,924 INFO L290 TraceCheckUtils]: 29: Hoare triple {3709#(< ~counter~0 99)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3709#(< ~counter~0 99)} is VALID [2022-04-14 15:52:00,926 INFO L290 TraceCheckUtils]: 28: Hoare triple {3709#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {3709#(< ~counter~0 99)} is VALID [2022-04-14 15:52:00,926 INFO L290 TraceCheckUtils]: 27: Hoare triple {3719#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3709#(< ~counter~0 99)} is VALID [2022-04-14 15:52:00,926 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3434#true} {3719#(< ~counter~0 98)} #84#return; {3719#(< ~counter~0 98)} is VALID [2022-04-14 15:52:00,926 INFO L290 TraceCheckUtils]: 25: Hoare triple {3434#true} assume true; {3434#true} is VALID [2022-04-14 15:52:00,927 INFO L290 TraceCheckUtils]: 24: Hoare triple {3434#true} assume !(0 == ~cond); {3434#true} is VALID [2022-04-14 15:52:00,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {3434#true} ~cond := #in~cond; {3434#true} is VALID [2022-04-14 15:52:00,927 INFO L272 TraceCheckUtils]: 22: Hoare triple {3719#(< ~counter~0 98)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {3434#true} is VALID [2022-04-14 15:52:00,927 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3434#true} {3719#(< ~counter~0 98)} #82#return; {3719#(< ~counter~0 98)} is VALID [2022-04-14 15:52:00,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {3434#true} assume true; {3434#true} is VALID [2022-04-14 15:52:00,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {3434#true} assume !(0 == ~cond); {3434#true} is VALID [2022-04-14 15:52:00,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {3434#true} ~cond := #in~cond; {3434#true} is VALID [2022-04-14 15:52:00,927 INFO L272 TraceCheckUtils]: 17: Hoare triple {3719#(< ~counter~0 98)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {3434#true} is VALID [2022-04-14 15:52:00,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {3719#(< ~counter~0 98)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {3719#(< ~counter~0 98)} is VALID [2022-04-14 15:52:00,928 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3434#true} {3719#(< ~counter~0 98)} #80#return; {3719#(< ~counter~0 98)} is VALID [2022-04-14 15:52:00,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {3434#true} assume true; {3434#true} is VALID [2022-04-14 15:52:00,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {3434#true} assume !(0 == ~cond); {3434#true} is VALID [2022-04-14 15:52:00,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {3434#true} ~cond := #in~cond; {3434#true} is VALID [2022-04-14 15:52:00,928 INFO L272 TraceCheckUtils]: 11: Hoare triple {3719#(< ~counter~0 98)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3434#true} is VALID [2022-04-14 15:52:00,929 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3434#true} {3719#(< ~counter~0 98)} #78#return; {3719#(< ~counter~0 98)} is VALID [2022-04-14 15:52:00,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {3434#true} assume true; {3434#true} is VALID [2022-04-14 15:52:00,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {3434#true} assume !(0 == ~cond); {3434#true} is VALID [2022-04-14 15:52:00,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {3434#true} ~cond := #in~cond; {3434#true} is VALID [2022-04-14 15:52:00,929 INFO L272 TraceCheckUtils]: 6: Hoare triple {3719#(< ~counter~0 98)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3434#true} is VALID [2022-04-14 15:52:00,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {3719#(< ~counter~0 98)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3719#(< ~counter~0 98)} is VALID [2022-04-14 15:52:00,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {3719#(< ~counter~0 98)} call #t~ret8 := main(); {3719#(< ~counter~0 98)} is VALID [2022-04-14 15:52:00,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3719#(< ~counter~0 98)} {3434#true} #98#return; {3719#(< ~counter~0 98)} is VALID [2022-04-14 15:52:00,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {3719#(< ~counter~0 98)} assume true; {3719#(< ~counter~0 98)} is VALID [2022-04-14 15:52:00,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {3434#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3719#(< ~counter~0 98)} is VALID [2022-04-14 15:52:00,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {3434#true} call ULTIMATE.init(); {3434#true} is VALID [2022-04-14 15:52:00,931 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-14 15:52:00,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:52:00,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230512135] [2022-04-14 15:52:00,931 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:52:00,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779686756] [2022-04-14 15:52:00,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779686756] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:52:00,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:52:00,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-14 15:52:00,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555772575] [2022-04-14 15:52:00,932 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:52:00,933 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 60 [2022-04-14 15:52:00,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:52:00,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-14 15:52:00,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:52:00,994 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 15:52:00,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:52:00,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 15:52:00,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-14 15:52:00,995 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-14 15:52:01,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:52:01,439 INFO L93 Difference]: Finished difference Result 215 states and 254 transitions. [2022-04-14 15:52:01,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-14 15:52:01,439 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 60 [2022-04-14 15:52:01,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:52:01,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-14 15:52:01,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 157 transitions. [2022-04-14 15:52:01,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-14 15:52:01,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 157 transitions. [2022-04-14 15:52:01,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 157 transitions. [2022-04-14 15:52:01,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:52:01,553 INFO L225 Difference]: With dead ends: 215 [2022-04-14 15:52:01,554 INFO L226 Difference]: Without dead ends: 207 [2022-04-14 15:52:01,554 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-04-14 15:52:01,554 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 81 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:52:01,555 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 209 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 15:52:01,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-04-14 15:52:01,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 199. [2022-04-14 15:52:01,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:52:01,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand has 199 states, 126 states have (on average 1.1904761904761905) internal successors, (150), 130 states have internal predecessors, (150), 46 states have call successors, (46), 27 states have call predecessors, (46), 26 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-14 15:52:01,645 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand has 199 states, 126 states have (on average 1.1904761904761905) internal successors, (150), 130 states have internal predecessors, (150), 46 states have call successors, (46), 27 states have call predecessors, (46), 26 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-14 15:52:01,645 INFO L87 Difference]: Start difference. First operand 207 states. Second operand has 199 states, 126 states have (on average 1.1904761904761905) internal successors, (150), 130 states have internal predecessors, (150), 46 states have call successors, (46), 27 states have call predecessors, (46), 26 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-14 15:52:01,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:52:01,649 INFO L93 Difference]: Finished difference Result 207 states and 242 transitions. [2022-04-14 15:52:01,649 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 242 transitions. [2022-04-14 15:52:01,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:52:01,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:52:01,650 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 126 states have (on average 1.1904761904761905) internal successors, (150), 130 states have internal predecessors, (150), 46 states have call successors, (46), 27 states have call predecessors, (46), 26 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand 207 states. [2022-04-14 15:52:01,651 INFO L87 Difference]: Start difference. First operand has 199 states, 126 states have (on average 1.1904761904761905) internal successors, (150), 130 states have internal predecessors, (150), 46 states have call successors, (46), 27 states have call predecessors, (46), 26 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand 207 states. [2022-04-14 15:52:01,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:52:01,655 INFO L93 Difference]: Finished difference Result 207 states and 242 transitions. [2022-04-14 15:52:01,655 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 242 transitions. [2022-04-14 15:52:01,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:52:01,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:52:01,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:52:01,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:52:01,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 126 states have (on average 1.1904761904761905) internal successors, (150), 130 states have internal predecessors, (150), 46 states have call successors, (46), 27 states have call predecessors, (46), 26 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-14 15:52:01,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 237 transitions. [2022-04-14 15:52:01,661 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 237 transitions. Word has length 60 [2022-04-14 15:52:01,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:52:01,661 INFO L478 AbstractCegarLoop]: Abstraction has 199 states and 237 transitions. [2022-04-14 15:52:01,661 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-14 15:52:01,661 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 237 transitions. [2022-04-14 15:52:01,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-14 15:52:01,662 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:52:01,662 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:52:01,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-14 15:52:01,875 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-14 15:52:01,875 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:52:01,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:52:01,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1088000375, now seen corresponding path program 1 times [2022-04-14 15:52:01,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:52:01,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165064826] [2022-04-14 15:52:01,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:52:01,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:52:01,888 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:52:01,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [580757971] [2022-04-14 15:52:01,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:52:01,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:52:01,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:52:01,896 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-14 15:52:01,904 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-14 15:52:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:52:01,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 15:52:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:52:01,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:52:02,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {4818#true} call ULTIMATE.init(); {4818#true} is VALID [2022-04-14 15:52:02,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {4818#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4818#true} is VALID [2022-04-14 15:52:02,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-14 15:52:02,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4818#true} {4818#true} #98#return; {4818#true} is VALID [2022-04-14 15:52:02,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {4818#true} call #t~ret8 := main(); {4818#true} is VALID [2022-04-14 15:52:02,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {4818#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4818#true} is VALID [2022-04-14 15:52:02,118 INFO L272 TraceCheckUtils]: 6: Hoare triple {4818#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4818#true} is VALID [2022-04-14 15:52:02,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {4818#true} ~cond := #in~cond; {4844#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 15:52:02,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {4844#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4848#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 15:52:02,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {4848#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4848#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 15:52:02,120 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4848#(not (= |assume_abort_if_not_#in~cond| 0))} {4818#true} #78#return; {4855#(<= 1 main_~x~0)} is VALID [2022-04-14 15:52:02,120 INFO L272 TraceCheckUtils]: 11: Hoare triple {4855#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4818#true} is VALID [2022-04-14 15:52:02,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-14 15:52:02,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-14 15:52:02,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-14 15:52:02,120 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4818#true} {4855#(<= 1 main_~x~0)} #80#return; {4855#(<= 1 main_~x~0)} is VALID [2022-04-14 15:52:02,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {4855#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {4874#(<= 1 main_~a~0)} is VALID [2022-04-14 15:52:02,121 INFO L272 TraceCheckUtils]: 17: Hoare triple {4874#(<= 1 main_~a~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {4818#true} is VALID [2022-04-14 15:52:02,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-14 15:52:02,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-14 15:52:02,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-14 15:52:02,121 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4818#true} {4874#(<= 1 main_~a~0)} #82#return; {4874#(<= 1 main_~a~0)} is VALID [2022-04-14 15:52:02,121 INFO L272 TraceCheckUtils]: 22: Hoare triple {4874#(<= 1 main_~a~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {4818#true} is VALID [2022-04-14 15:52:02,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-14 15:52:02,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-14 15:52:02,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-14 15:52:02,122 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4818#true} {4874#(<= 1 main_~a~0)} #84#return; {4874#(<= 1 main_~a~0)} is VALID [2022-04-14 15:52:02,122 INFO L290 TraceCheckUtils]: 27: Hoare triple {4874#(<= 1 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4874#(<= 1 main_~a~0)} is VALID [2022-04-14 15:52:02,122 INFO L290 TraceCheckUtils]: 28: Hoare triple {4874#(<= 1 main_~a~0)} assume !!(#t~post6 < 100);havoc #t~post6; {4874#(<= 1 main_~a~0)} is VALID [2022-04-14 15:52:02,122 INFO L290 TraceCheckUtils]: 29: Hoare triple {4874#(<= 1 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {4914#(<= 1 main_~c~0)} is VALID [2022-04-14 15:52:02,122 INFO L290 TraceCheckUtils]: 30: Hoare triple {4914#(<= 1 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4914#(<= 1 main_~c~0)} is VALID [2022-04-14 15:52:02,123 INFO L290 TraceCheckUtils]: 31: Hoare triple {4914#(<= 1 main_~c~0)} assume !!(#t~post7 < 100);havoc #t~post7; {4914#(<= 1 main_~c~0)} is VALID [2022-04-14 15:52:02,123 INFO L272 TraceCheckUtils]: 32: Hoare triple {4914#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4818#true} is VALID [2022-04-14 15:52:02,123 INFO L290 TraceCheckUtils]: 33: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-14 15:52:02,123 INFO L290 TraceCheckUtils]: 34: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-14 15:52:02,123 INFO L290 TraceCheckUtils]: 35: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-14 15:52:02,123 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4818#true} {4914#(<= 1 main_~c~0)} #86#return; {4914#(<= 1 main_~c~0)} is VALID [2022-04-14 15:52:02,123 INFO L272 TraceCheckUtils]: 37: Hoare triple {4914#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4818#true} is VALID [2022-04-14 15:52:02,123 INFO L290 TraceCheckUtils]: 38: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-14 15:52:02,123 INFO L290 TraceCheckUtils]: 39: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-14 15:52:02,124 INFO L290 TraceCheckUtils]: 40: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-14 15:52:02,124 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4818#true} {4914#(<= 1 main_~c~0)} #88#return; {4914#(<= 1 main_~c~0)} is VALID [2022-04-14 15:52:02,124 INFO L272 TraceCheckUtils]: 42: Hoare triple {4914#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4818#true} is VALID [2022-04-14 15:52:02,124 INFO L290 TraceCheckUtils]: 43: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-14 15:52:02,124 INFO L290 TraceCheckUtils]: 44: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-14 15:52:02,124 INFO L290 TraceCheckUtils]: 45: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-14 15:52:02,125 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4818#true} {4914#(<= 1 main_~c~0)} #90#return; {4914#(<= 1 main_~c~0)} is VALID [2022-04-14 15:52:02,125 INFO L272 TraceCheckUtils]: 47: Hoare triple {4914#(<= 1 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {4818#true} is VALID [2022-04-14 15:52:02,125 INFO L290 TraceCheckUtils]: 48: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-14 15:52:02,125 INFO L290 TraceCheckUtils]: 49: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-14 15:52:02,125 INFO L290 TraceCheckUtils]: 50: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-14 15:52:02,125 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4818#true} {4914#(<= 1 main_~c~0)} #92#return; {4914#(<= 1 main_~c~0)} is VALID [2022-04-14 15:52:02,126 INFO L290 TraceCheckUtils]: 52: Hoare triple {4914#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {4914#(<= 1 main_~c~0)} is VALID [2022-04-14 15:52:02,126 INFO L290 TraceCheckUtils]: 53: Hoare triple {4914#(<= 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; {4987#(<= 1 main_~b~0)} is VALID [2022-04-14 15:52:02,126 INFO L290 TraceCheckUtils]: 54: Hoare triple {4987#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4987#(<= 1 main_~b~0)} is VALID [2022-04-14 15:52:02,127 INFO L290 TraceCheckUtils]: 55: Hoare triple {4987#(<= 1 main_~b~0)} assume !!(#t~post6 < 100);havoc #t~post6; {4987#(<= 1 main_~b~0)} is VALID [2022-04-14 15:52:02,127 INFO L290 TraceCheckUtils]: 56: Hoare triple {4987#(<= 1 main_~b~0)} assume !(0 != ~b~0); {4819#false} is VALID [2022-04-14 15:52:02,127 INFO L272 TraceCheckUtils]: 57: Hoare triple {4819#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {4819#false} is VALID [2022-04-14 15:52:02,127 INFO L290 TraceCheckUtils]: 58: Hoare triple {4819#false} ~cond := #in~cond; {4819#false} is VALID [2022-04-14 15:52:02,127 INFO L290 TraceCheckUtils]: 59: Hoare triple {4819#false} assume 0 == ~cond; {4819#false} is VALID [2022-04-14 15:52:02,127 INFO L290 TraceCheckUtils]: 60: Hoare triple {4819#false} assume !false; {4819#false} is VALID [2022-04-14 15:52:02,127 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-14 15:52:02,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:52:02,390 INFO L290 TraceCheckUtils]: 60: Hoare triple {4819#false} assume !false; {4819#false} is VALID [2022-04-14 15:52:02,390 INFO L290 TraceCheckUtils]: 59: Hoare triple {4819#false} assume 0 == ~cond; {4819#false} is VALID [2022-04-14 15:52:02,390 INFO L290 TraceCheckUtils]: 58: Hoare triple {4819#false} ~cond := #in~cond; {4819#false} is VALID [2022-04-14 15:52:02,390 INFO L272 TraceCheckUtils]: 57: Hoare triple {4819#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {4819#false} is VALID [2022-04-14 15:52:02,390 INFO L290 TraceCheckUtils]: 56: Hoare triple {4987#(<= 1 main_~b~0)} assume !(0 != ~b~0); {4819#false} is VALID [2022-04-14 15:52:02,391 INFO L290 TraceCheckUtils]: 55: Hoare triple {4987#(<= 1 main_~b~0)} assume !!(#t~post6 < 100);havoc #t~post6; {4987#(<= 1 main_~b~0)} is VALID [2022-04-14 15:52:02,391 INFO L290 TraceCheckUtils]: 54: Hoare triple {4987#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4987#(<= 1 main_~b~0)} is VALID [2022-04-14 15:52:02,391 INFO L290 TraceCheckUtils]: 53: Hoare triple {4914#(<= 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; {4987#(<= 1 main_~b~0)} is VALID [2022-04-14 15:52:02,391 INFO L290 TraceCheckUtils]: 52: Hoare triple {4914#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {4914#(<= 1 main_~c~0)} is VALID [2022-04-14 15:52:02,392 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4818#true} {4914#(<= 1 main_~c~0)} #92#return; {4914#(<= 1 main_~c~0)} is VALID [2022-04-14 15:52:02,392 INFO L290 TraceCheckUtils]: 50: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-14 15:52:02,392 INFO L290 TraceCheckUtils]: 49: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-14 15:52:02,392 INFO L290 TraceCheckUtils]: 48: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-14 15:52:02,392 INFO L272 TraceCheckUtils]: 47: Hoare triple {4914#(<= 1 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {4818#true} is VALID [2022-04-14 15:52:02,393 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4818#true} {4914#(<= 1 main_~c~0)} #90#return; {4914#(<= 1 main_~c~0)} is VALID [2022-04-14 15:52:02,393 INFO L290 TraceCheckUtils]: 45: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-14 15:52:02,393 INFO L290 TraceCheckUtils]: 44: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-14 15:52:02,393 INFO L290 TraceCheckUtils]: 43: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-14 15:52:02,393 INFO L272 TraceCheckUtils]: 42: Hoare triple {4914#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4818#true} is VALID [2022-04-14 15:52:02,393 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4818#true} {4914#(<= 1 main_~c~0)} #88#return; {4914#(<= 1 main_~c~0)} is VALID [2022-04-14 15:52:02,393 INFO L290 TraceCheckUtils]: 40: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-14 15:52:02,394 INFO L290 TraceCheckUtils]: 39: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-14 15:52:02,394 INFO L290 TraceCheckUtils]: 38: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-14 15:52:02,394 INFO L272 TraceCheckUtils]: 37: Hoare triple {4914#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4818#true} is VALID [2022-04-14 15:52:02,394 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4818#true} {4914#(<= 1 main_~c~0)} #86#return; {4914#(<= 1 main_~c~0)} is VALID [2022-04-14 15:52:02,394 INFO L290 TraceCheckUtils]: 35: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-14 15:52:02,394 INFO L290 TraceCheckUtils]: 34: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-14 15:52:02,394 INFO L290 TraceCheckUtils]: 33: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-14 15:52:02,394 INFO L272 TraceCheckUtils]: 32: Hoare triple {4914#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4818#true} is VALID [2022-04-14 15:52:02,394 INFO L290 TraceCheckUtils]: 31: Hoare triple {4914#(<= 1 main_~c~0)} assume !!(#t~post7 < 100);havoc #t~post7; {4914#(<= 1 main_~c~0)} is VALID [2022-04-14 15:52:02,395 INFO L290 TraceCheckUtils]: 30: Hoare triple {4914#(<= 1 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4914#(<= 1 main_~c~0)} is VALID [2022-04-14 15:52:02,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {4874#(<= 1 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {4914#(<= 1 main_~c~0)} is VALID [2022-04-14 15:52:02,395 INFO L290 TraceCheckUtils]: 28: Hoare triple {4874#(<= 1 main_~a~0)} assume !!(#t~post6 < 100);havoc #t~post6; {4874#(<= 1 main_~a~0)} is VALID [2022-04-14 15:52:02,396 INFO L290 TraceCheckUtils]: 27: Hoare triple {4874#(<= 1 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4874#(<= 1 main_~a~0)} is VALID [2022-04-14 15:52:02,396 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4818#true} {4874#(<= 1 main_~a~0)} #84#return; {4874#(<= 1 main_~a~0)} is VALID [2022-04-14 15:52:02,396 INFO L290 TraceCheckUtils]: 25: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-14 15:52:02,396 INFO L290 TraceCheckUtils]: 24: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-14 15:52:02,396 INFO L290 TraceCheckUtils]: 23: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-14 15:52:02,396 INFO L272 TraceCheckUtils]: 22: Hoare triple {4874#(<= 1 main_~a~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {4818#true} is VALID [2022-04-14 15:52:02,396 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4818#true} {4874#(<= 1 main_~a~0)} #82#return; {4874#(<= 1 main_~a~0)} is VALID [2022-04-14 15:52:02,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-14 15:52:02,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-14 15:52:02,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-14 15:52:02,397 INFO L272 TraceCheckUtils]: 17: Hoare triple {4874#(<= 1 main_~a~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {4818#true} is VALID [2022-04-14 15:52:02,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {4855#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {4874#(<= 1 main_~a~0)} is VALID [2022-04-14 15:52:02,397 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4818#true} {4855#(<= 1 main_~x~0)} #80#return; {4855#(<= 1 main_~x~0)} is VALID [2022-04-14 15:52:02,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-14 15:52:02,398 INFO L290 TraceCheckUtils]: 13: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-14 15:52:02,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-14 15:52:02,398 INFO L272 TraceCheckUtils]: 11: Hoare triple {4855#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4818#true} is VALID [2022-04-14 15:52:02,398 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4848#(not (= |assume_abort_if_not_#in~cond| 0))} {4818#true} #78#return; {4855#(<= 1 main_~x~0)} is VALID [2022-04-14 15:52:02,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {4848#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4848#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 15:52:02,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {5168#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {4848#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 15:52:02,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {4818#true} ~cond := #in~cond; {5168#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-14 15:52:02,399 INFO L272 TraceCheckUtils]: 6: Hoare triple {4818#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4818#true} is VALID [2022-04-14 15:52:02,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {4818#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4818#true} is VALID [2022-04-14 15:52:02,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {4818#true} call #t~ret8 := main(); {4818#true} is VALID [2022-04-14 15:52:02,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4818#true} {4818#true} #98#return; {4818#true} is VALID [2022-04-14 15:52:02,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-14 15:52:02,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {4818#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4818#true} is VALID [2022-04-14 15:52:02,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {4818#true} call ULTIMATE.init(); {4818#true} is VALID [2022-04-14 15:52:02,400 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-14 15:52:02,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:52:02,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165064826] [2022-04-14 15:52:02,400 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:52:02,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580757971] [2022-04-14 15:52:02,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580757971] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:52:02,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:52:02,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-14 15:52:02,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791796029] [2022-04-14 15:52:02,400 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:52:02,401 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 61 [2022-04-14 15:52:02,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:52:02,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-14 15:52:02,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:52:02,430 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-14 15:52:02,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:52:02,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-14 15:52:02,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-14 15:52:02,430 INFO L87 Difference]: Start difference. First operand 199 states and 237 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-14 15:52:03,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:52:03,203 INFO L93 Difference]: Finished difference Result 283 states and 368 transitions. [2022-04-14 15:52:03,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-14 15:52:03,203 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 61 [2022-04-14 15:52:03,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:52:03,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-14 15:52:03,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2022-04-14 15:52:03,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-14 15:52:03,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2022-04-14 15:52:03,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 147 transitions. [2022-04-14 15:52:03,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:52:03,323 INFO L225 Difference]: With dead ends: 283 [2022-04-14 15:52:03,323 INFO L226 Difference]: Without dead ends: 263 [2022-04-14 15:52:03,326 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-04-14 15:52:03,327 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 64 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-14 15:52:03,328 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 262 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-14 15:52:03,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-04-14 15:52:03,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 239. [2022-04-14 15:52:03,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:52:03,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 263 states. Second operand has 239 states, 153 states have (on average 1.2222222222222223) internal successors, (187), 156 states have internal predecessors, (187), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-04-14 15:52:03,499 INFO L74 IsIncluded]: Start isIncluded. First operand 263 states. Second operand has 239 states, 153 states have (on average 1.2222222222222223) internal successors, (187), 156 states have internal predecessors, (187), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-04-14 15:52:03,499 INFO L87 Difference]: Start difference. First operand 263 states. Second operand has 239 states, 153 states have (on average 1.2222222222222223) internal successors, (187), 156 states have internal predecessors, (187), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-04-14 15:52:03,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:52:03,506 INFO L93 Difference]: Finished difference Result 263 states and 342 transitions. [2022-04-14 15:52:03,506 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 342 transitions. [2022-04-14 15:52:03,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:52:03,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:52:03,508 INFO L74 IsIncluded]: Start isIncluded. First operand has 239 states, 153 states have (on average 1.2222222222222223) internal successors, (187), 156 states have internal predecessors, (187), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand 263 states. [2022-04-14 15:52:03,508 INFO L87 Difference]: Start difference. First operand has 239 states, 153 states have (on average 1.2222222222222223) internal successors, (187), 156 states have internal predecessors, (187), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand 263 states. [2022-04-14 15:52:03,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:52:03,517 INFO L93 Difference]: Finished difference Result 263 states and 342 transitions. [2022-04-14 15:52:03,517 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 342 transitions. [2022-04-14 15:52:03,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:52:03,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:52:03,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:52:03,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:52:03,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 153 states have (on average 1.2222222222222223) internal successors, (187), 156 states have internal predecessors, (187), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-04-14 15:52:03,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 303 transitions. [2022-04-14 15:52:03,523 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 303 transitions. Word has length 61 [2022-04-14 15:52:03,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:52:03,523 INFO L478 AbstractCegarLoop]: Abstraction has 239 states and 303 transitions. [2022-04-14 15:52:03,524 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-14 15:52:03,524 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 303 transitions. [2022-04-14 15:52:03,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-14 15:52:03,524 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:52:03,525 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:52:03,541 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-14 15:52:03,740 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-14 15:52:03,740 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:52:03,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:52:03,741 INFO L85 PathProgramCache]: Analyzing trace with hash 428029148, now seen corresponding path program 1 times [2022-04-14 15:52:03,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:52:03,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579910574] [2022-04-14 15:52:03,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:52:03,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:52:03,753 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:52:03,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [184385622] [2022-04-14 15:52:03,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:52:03,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:52:03,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:52:03,757 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-14 15:52:03,758 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-14 15:52:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:52:03,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 15:52:03,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:52:03,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:52:04,030 INFO L272 TraceCheckUtils]: 0: Hoare triple {6497#true} call ULTIMATE.init(); {6497#true} is VALID [2022-04-14 15:52:04,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {6497#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6505#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:04,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {6505#(<= ~counter~0 0)} assume true; {6505#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:04,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6505#(<= ~counter~0 0)} {6497#true} #98#return; {6505#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:04,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {6505#(<= ~counter~0 0)} call #t~ret8 := main(); {6505#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:04,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {6505#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6505#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:04,033 INFO L272 TraceCheckUtils]: 6: Hoare triple {6505#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6505#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:04,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {6505#(<= ~counter~0 0)} ~cond := #in~cond; {6505#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:04,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {6505#(<= ~counter~0 0)} assume !(0 == ~cond); {6505#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:04,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {6505#(<= ~counter~0 0)} assume true; {6505#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:04,034 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6505#(<= ~counter~0 0)} {6505#(<= ~counter~0 0)} #78#return; {6505#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:04,034 INFO L272 TraceCheckUtils]: 11: Hoare triple {6505#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6505#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:04,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {6505#(<= ~counter~0 0)} ~cond := #in~cond; {6505#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:04,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {6505#(<= ~counter~0 0)} assume !(0 == ~cond); {6505#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:04,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {6505#(<= ~counter~0 0)} assume true; {6505#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:04,035 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6505#(<= ~counter~0 0)} {6505#(<= ~counter~0 0)} #80#return; {6505#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:04,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {6505#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {6505#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:04,035 INFO L272 TraceCheckUtils]: 17: Hoare triple {6505#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {6505#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:04,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {6505#(<= ~counter~0 0)} ~cond := #in~cond; {6505#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:04,036 INFO L290 TraceCheckUtils]: 19: Hoare triple {6505#(<= ~counter~0 0)} assume !(0 == ~cond); {6505#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:04,036 INFO L290 TraceCheckUtils]: 20: Hoare triple {6505#(<= ~counter~0 0)} assume true; {6505#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:04,036 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6505#(<= ~counter~0 0)} {6505#(<= ~counter~0 0)} #82#return; {6505#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:04,037 INFO L272 TraceCheckUtils]: 22: Hoare triple {6505#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {6505#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:04,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {6505#(<= ~counter~0 0)} ~cond := #in~cond; {6505#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:04,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {6505#(<= ~counter~0 0)} assume !(0 == ~cond); {6505#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:04,037 INFO L290 TraceCheckUtils]: 25: Hoare triple {6505#(<= ~counter~0 0)} assume true; {6505#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:04,038 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6505#(<= ~counter~0 0)} {6505#(<= ~counter~0 0)} #84#return; {6505#(<= ~counter~0 0)} is VALID [2022-04-14 15:52:04,038 INFO L290 TraceCheckUtils]: 27: Hoare triple {6505#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6584#(<= ~counter~0 1)} is VALID [2022-04-14 15:52:04,039 INFO L290 TraceCheckUtils]: 28: Hoare triple {6584#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {6584#(<= ~counter~0 1)} is VALID [2022-04-14 15:52:04,039 INFO L290 TraceCheckUtils]: 29: Hoare triple {6584#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {6584#(<= ~counter~0 1)} is VALID [2022-04-14 15:52:04,039 INFO L290 TraceCheckUtils]: 30: Hoare triple {6584#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6594#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:04,039 INFO L290 TraceCheckUtils]: 31: Hoare triple {6594#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {6594#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:04,040 INFO L272 TraceCheckUtils]: 32: Hoare triple {6594#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {6594#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:04,040 INFO L290 TraceCheckUtils]: 33: Hoare triple {6594#(<= ~counter~0 2)} ~cond := #in~cond; {6594#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:04,040 INFO L290 TraceCheckUtils]: 34: Hoare triple {6594#(<= ~counter~0 2)} assume !(0 == ~cond); {6594#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:04,040 INFO L290 TraceCheckUtils]: 35: Hoare triple {6594#(<= ~counter~0 2)} assume true; {6594#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:04,041 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6594#(<= ~counter~0 2)} {6594#(<= ~counter~0 2)} #86#return; {6594#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:04,041 INFO L272 TraceCheckUtils]: 37: Hoare triple {6594#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6594#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:04,042 INFO L290 TraceCheckUtils]: 38: Hoare triple {6594#(<= ~counter~0 2)} ~cond := #in~cond; {6594#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:04,042 INFO L290 TraceCheckUtils]: 39: Hoare triple {6594#(<= ~counter~0 2)} assume !(0 == ~cond); {6594#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:04,042 INFO L290 TraceCheckUtils]: 40: Hoare triple {6594#(<= ~counter~0 2)} assume true; {6594#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:04,043 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6594#(<= ~counter~0 2)} {6594#(<= ~counter~0 2)} #88#return; {6594#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:04,043 INFO L272 TraceCheckUtils]: 42: Hoare triple {6594#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6594#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:04,043 INFO L290 TraceCheckUtils]: 43: Hoare triple {6594#(<= ~counter~0 2)} ~cond := #in~cond; {6594#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:04,043 INFO L290 TraceCheckUtils]: 44: Hoare triple {6594#(<= ~counter~0 2)} assume !(0 == ~cond); {6594#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:04,044 INFO L290 TraceCheckUtils]: 45: Hoare triple {6594#(<= ~counter~0 2)} assume true; {6594#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:04,044 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6594#(<= ~counter~0 2)} {6594#(<= ~counter~0 2)} #90#return; {6594#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:04,045 INFO L272 TraceCheckUtils]: 47: Hoare triple {6594#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {6594#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:04,045 INFO L290 TraceCheckUtils]: 48: Hoare triple {6594#(<= ~counter~0 2)} ~cond := #in~cond; {6594#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:04,058 INFO L290 TraceCheckUtils]: 49: Hoare triple {6594#(<= ~counter~0 2)} assume !(0 == ~cond); {6594#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:04,059 INFO L290 TraceCheckUtils]: 50: Hoare triple {6594#(<= ~counter~0 2)} assume true; {6594#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:04,059 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {6594#(<= ~counter~0 2)} {6594#(<= ~counter~0 2)} #92#return; {6594#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:04,060 INFO L290 TraceCheckUtils]: 52: Hoare triple {6594#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {6594#(<= ~counter~0 2)} is VALID [2022-04-14 15:52:04,060 INFO L290 TraceCheckUtils]: 53: Hoare triple {6594#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6664#(<= |main_#t~post7| 2)} is VALID [2022-04-14 15:52:04,060 INFO L290 TraceCheckUtils]: 54: Hoare triple {6664#(<= |main_#t~post7| 2)} assume !(#t~post7 < 100);havoc #t~post7; {6498#false} is VALID [2022-04-14 15:52:04,060 INFO L290 TraceCheckUtils]: 55: Hoare triple {6498#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; {6498#false} is VALID [2022-04-14 15:52:04,060 INFO L290 TraceCheckUtils]: 56: Hoare triple {6498#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6498#false} is VALID [2022-04-14 15:52:04,060 INFO L290 TraceCheckUtils]: 57: Hoare triple {6498#false} assume !!(#t~post6 < 100);havoc #t~post6; {6498#false} is VALID [2022-04-14 15:52:04,060 INFO L290 TraceCheckUtils]: 58: Hoare triple {6498#false} assume !(0 != ~b~0); {6498#false} is VALID [2022-04-14 15:52:04,061 INFO L272 TraceCheckUtils]: 59: Hoare triple {6498#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {6498#false} is VALID [2022-04-14 15:52:04,061 INFO L290 TraceCheckUtils]: 60: Hoare triple {6498#false} ~cond := #in~cond; {6498#false} is VALID [2022-04-14 15:52:04,061 INFO L290 TraceCheckUtils]: 61: Hoare triple {6498#false} assume 0 == ~cond; {6498#false} is VALID [2022-04-14 15:52:04,061 INFO L290 TraceCheckUtils]: 62: Hoare triple {6498#false} assume !false; {6498#false} is VALID [2022-04-14 15:52:04,061 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-14 15:52:04,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:52:04,292 INFO L290 TraceCheckUtils]: 62: Hoare triple {6498#false} assume !false; {6498#false} is VALID [2022-04-14 15:52:04,292 INFO L290 TraceCheckUtils]: 61: Hoare triple {6498#false} assume 0 == ~cond; {6498#false} is VALID [2022-04-14 15:52:04,292 INFO L290 TraceCheckUtils]: 60: Hoare triple {6498#false} ~cond := #in~cond; {6498#false} is VALID [2022-04-14 15:52:04,292 INFO L272 TraceCheckUtils]: 59: Hoare triple {6498#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {6498#false} is VALID [2022-04-14 15:52:04,293 INFO L290 TraceCheckUtils]: 58: Hoare triple {6498#false} assume !(0 != ~b~0); {6498#false} is VALID [2022-04-14 15:52:04,293 INFO L290 TraceCheckUtils]: 57: Hoare triple {6498#false} assume !!(#t~post6 < 100);havoc #t~post6; {6498#false} is VALID [2022-04-14 15:52:04,293 INFO L290 TraceCheckUtils]: 56: Hoare triple {6498#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6498#false} is VALID [2022-04-14 15:52:04,293 INFO L290 TraceCheckUtils]: 55: Hoare triple {6498#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; {6498#false} is VALID [2022-04-14 15:52:04,293 INFO L290 TraceCheckUtils]: 54: Hoare triple {6716#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {6498#false} is VALID [2022-04-14 15:52:04,293 INFO L290 TraceCheckUtils]: 53: Hoare triple {6720#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6716#(< |main_#t~post7| 100)} is VALID [2022-04-14 15:52:04,293 INFO L290 TraceCheckUtils]: 52: Hoare triple {6720#(< ~counter~0 100)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {6720#(< ~counter~0 100)} is VALID [2022-04-14 15:52:04,294 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {6497#true} {6720#(< ~counter~0 100)} #92#return; {6720#(< ~counter~0 100)} is VALID [2022-04-14 15:52:04,294 INFO L290 TraceCheckUtils]: 50: Hoare triple {6497#true} assume true; {6497#true} is VALID [2022-04-14 15:52:04,294 INFO L290 TraceCheckUtils]: 49: Hoare triple {6497#true} assume !(0 == ~cond); {6497#true} is VALID [2022-04-14 15:52:04,294 INFO L290 TraceCheckUtils]: 48: Hoare triple {6497#true} ~cond := #in~cond; {6497#true} is VALID [2022-04-14 15:52:04,294 INFO L272 TraceCheckUtils]: 47: Hoare triple {6720#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {6497#true} is VALID [2022-04-14 15:52:04,295 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6497#true} {6720#(< ~counter~0 100)} #90#return; {6720#(< ~counter~0 100)} is VALID [2022-04-14 15:52:04,295 INFO L290 TraceCheckUtils]: 45: Hoare triple {6497#true} assume true; {6497#true} is VALID [2022-04-14 15:52:04,295 INFO L290 TraceCheckUtils]: 44: Hoare triple {6497#true} assume !(0 == ~cond); {6497#true} is VALID [2022-04-14 15:52:04,295 INFO L290 TraceCheckUtils]: 43: Hoare triple {6497#true} ~cond := #in~cond; {6497#true} is VALID [2022-04-14 15:52:04,295 INFO L272 TraceCheckUtils]: 42: Hoare triple {6720#(< ~counter~0 100)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6497#true} is VALID [2022-04-14 15:52:04,295 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6497#true} {6720#(< ~counter~0 100)} #88#return; {6720#(< ~counter~0 100)} is VALID [2022-04-14 15:52:04,296 INFO L290 TraceCheckUtils]: 40: Hoare triple {6497#true} assume true; {6497#true} is VALID [2022-04-14 15:52:04,296 INFO L290 TraceCheckUtils]: 39: Hoare triple {6497#true} assume !(0 == ~cond); {6497#true} is VALID [2022-04-14 15:52:04,296 INFO L290 TraceCheckUtils]: 38: Hoare triple {6497#true} ~cond := #in~cond; {6497#true} is VALID [2022-04-14 15:52:04,296 INFO L272 TraceCheckUtils]: 37: Hoare triple {6720#(< ~counter~0 100)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6497#true} is VALID [2022-04-14 15:52:04,296 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6497#true} {6720#(< ~counter~0 100)} #86#return; {6720#(< ~counter~0 100)} is VALID [2022-04-14 15:52:04,296 INFO L290 TraceCheckUtils]: 35: Hoare triple {6497#true} assume true; {6497#true} is VALID [2022-04-14 15:52:04,296 INFO L290 TraceCheckUtils]: 34: Hoare triple {6497#true} assume !(0 == ~cond); {6497#true} is VALID [2022-04-14 15:52:04,296 INFO L290 TraceCheckUtils]: 33: Hoare triple {6497#true} ~cond := #in~cond; {6497#true} is VALID [2022-04-14 15:52:04,296 INFO L272 TraceCheckUtils]: 32: Hoare triple {6720#(< ~counter~0 100)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {6497#true} is VALID [2022-04-14 15:52:04,297 INFO L290 TraceCheckUtils]: 31: Hoare triple {6720#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {6720#(< ~counter~0 100)} is VALID [2022-04-14 15:52:04,297 INFO L290 TraceCheckUtils]: 30: Hoare triple {6790#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6720#(< ~counter~0 100)} is VALID [2022-04-14 15:52:04,297 INFO L290 TraceCheckUtils]: 29: Hoare triple {6790#(< ~counter~0 99)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {6790#(< ~counter~0 99)} is VALID [2022-04-14 15:52:04,298 INFO L290 TraceCheckUtils]: 28: Hoare triple {6790#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {6790#(< ~counter~0 99)} is VALID [2022-04-14 15:52:04,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {6800#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6790#(< ~counter~0 99)} is VALID [2022-04-14 15:52:04,298 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6497#true} {6800#(< ~counter~0 98)} #84#return; {6800#(< ~counter~0 98)} is VALID [2022-04-14 15:52:04,298 INFO L290 TraceCheckUtils]: 25: Hoare triple {6497#true} assume true; {6497#true} is VALID [2022-04-14 15:52:04,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {6497#true} assume !(0 == ~cond); {6497#true} is VALID [2022-04-14 15:52:04,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {6497#true} ~cond := #in~cond; {6497#true} is VALID [2022-04-14 15:52:04,299 INFO L272 TraceCheckUtils]: 22: Hoare triple {6800#(< ~counter~0 98)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {6497#true} is VALID [2022-04-14 15:52:04,299 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6497#true} {6800#(< ~counter~0 98)} #82#return; {6800#(< ~counter~0 98)} is VALID [2022-04-14 15:52:04,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {6497#true} assume true; {6497#true} is VALID [2022-04-14 15:52:04,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {6497#true} assume !(0 == ~cond); {6497#true} is VALID [2022-04-14 15:52:04,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {6497#true} ~cond := #in~cond; {6497#true} is VALID [2022-04-14 15:52:04,299 INFO L272 TraceCheckUtils]: 17: Hoare triple {6800#(< ~counter~0 98)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {6497#true} is VALID [2022-04-14 15:52:04,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {6800#(< ~counter~0 98)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {6800#(< ~counter~0 98)} is VALID [2022-04-14 15:52:04,300 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6497#true} {6800#(< ~counter~0 98)} #80#return; {6800#(< ~counter~0 98)} is VALID [2022-04-14 15:52:04,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {6497#true} assume true; {6497#true} is VALID [2022-04-14 15:52:04,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {6497#true} assume !(0 == ~cond); {6497#true} is VALID [2022-04-14 15:52:04,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {6497#true} ~cond := #in~cond; {6497#true} is VALID [2022-04-14 15:52:04,300 INFO L272 TraceCheckUtils]: 11: Hoare triple {6800#(< ~counter~0 98)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6497#true} is VALID [2022-04-14 15:52:04,300 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6497#true} {6800#(< ~counter~0 98)} #78#return; {6800#(< ~counter~0 98)} is VALID [2022-04-14 15:52:04,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {6497#true} assume true; {6497#true} is VALID [2022-04-14 15:52:04,300 INFO L290 TraceCheckUtils]: 8: Hoare triple {6497#true} assume !(0 == ~cond); {6497#true} is VALID [2022-04-14 15:52:04,300 INFO L290 TraceCheckUtils]: 7: Hoare triple {6497#true} ~cond := #in~cond; {6497#true} is VALID [2022-04-14 15:52:04,301 INFO L272 TraceCheckUtils]: 6: Hoare triple {6800#(< ~counter~0 98)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6497#true} is VALID [2022-04-14 15:52:04,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {6800#(< ~counter~0 98)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6800#(< ~counter~0 98)} is VALID [2022-04-14 15:52:04,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {6800#(< ~counter~0 98)} call #t~ret8 := main(); {6800#(< ~counter~0 98)} is VALID [2022-04-14 15:52:04,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6800#(< ~counter~0 98)} {6497#true} #98#return; {6800#(< ~counter~0 98)} is VALID [2022-04-14 15:52:04,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {6800#(< ~counter~0 98)} assume true; {6800#(< ~counter~0 98)} is VALID [2022-04-14 15:52:04,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {6497#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6800#(< ~counter~0 98)} is VALID [2022-04-14 15:52:04,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {6497#true} call ULTIMATE.init(); {6497#true} is VALID [2022-04-14 15:52:04,303 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-14 15:52:04,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:52:04,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579910574] [2022-04-14 15:52:04,303 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:52:04,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184385622] [2022-04-14 15:52:04,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184385622] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:52:04,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:52:04,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-14 15:52:04,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950140848] [2022-04-14 15:52:04,304 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:52:04,304 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 63 [2022-04-14 15:52:04,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:52:04,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-14 15:52:04,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:52:04,357 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 15:52:04,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:52:04,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 15:52:04,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-14 15:52:04,358 INFO L87 Difference]: Start difference. First operand 239 states and 303 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-14 15:52:04,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:52:04,989 INFO L93 Difference]: Finished difference Result 348 states and 452 transitions. [2022-04-14 15:52:04,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-14 15:52:04,990 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 63 [2022-04-14 15:52:04,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:52:04,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-14 15:52:04,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 167 transitions. [2022-04-14 15:52:04,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-14 15:52:04,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 167 transitions. [2022-04-14 15:52:04,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 167 transitions. [2022-04-14 15:52:05,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:52:05,114 INFO L225 Difference]: With dead ends: 348 [2022-04-14 15:52:05,114 INFO L226 Difference]: Without dead ends: 252 [2022-04-14 15:52:05,115 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-14 15:52:05,116 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 85 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:52:05,116 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 266 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 15:52:05,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-04-14 15:52:05,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 248. [2022-04-14 15:52:05,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:52:05,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 252 states. Second operand has 248 states, 162 states have (on average 1.1728395061728396) internal successors, (190), 165 states have internal predecessors, (190), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-04-14 15:52:05,290 INFO L74 IsIncluded]: Start isIncluded. First operand 252 states. Second operand has 248 states, 162 states have (on average 1.1728395061728396) internal successors, (190), 165 states have internal predecessors, (190), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-04-14 15:52:05,291 INFO L87 Difference]: Start difference. First operand 252 states. Second operand has 248 states, 162 states have (on average 1.1728395061728396) internal successors, (190), 165 states have internal predecessors, (190), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-04-14 15:52:05,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:52:05,296 INFO L93 Difference]: Finished difference Result 252 states and 308 transitions. [2022-04-14 15:52:05,296 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 308 transitions. [2022-04-14 15:52:05,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:52:05,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:52:05,297 INFO L74 IsIncluded]: Start isIncluded. First operand has 248 states, 162 states have (on average 1.1728395061728396) internal successors, (190), 165 states have internal predecessors, (190), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand 252 states. [2022-04-14 15:52:05,298 INFO L87 Difference]: Start difference. First operand has 248 states, 162 states have (on average 1.1728395061728396) internal successors, (190), 165 states have internal predecessors, (190), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand 252 states. [2022-04-14 15:52:05,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:52:05,305 INFO L93 Difference]: Finished difference Result 252 states and 308 transitions. [2022-04-14 15:52:05,305 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 308 transitions. [2022-04-14 15:52:05,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:52:05,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:52:05,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:52:05,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:52:05,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 162 states have (on average 1.1728395061728396) internal successors, (190), 165 states have internal predecessors, (190), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-04-14 15:52:05,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 306 transitions. [2022-04-14 15:52:05,311 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 306 transitions. Word has length 63 [2022-04-14 15:52:05,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:52:05,311 INFO L478 AbstractCegarLoop]: Abstraction has 248 states and 306 transitions. [2022-04-14 15:52:05,312 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-14 15:52:05,312 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 306 transitions. [2022-04-14 15:52:05,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-14 15:52:05,312 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:52:05,312 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:52:05,329 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-14 15:52:05,527 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-14 15:52:05,527 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:52:05,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:52:05,528 INFO L85 PathProgramCache]: Analyzing trace with hash 792554045, now seen corresponding path program 1 times [2022-04-14 15:52:05,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:52:05,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614416146] [2022-04-14 15:52:05,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:52:05,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:52:05,549 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:52:05,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1308865389] [2022-04-14 15:52:05,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:52:05,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:52:05,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:52:05,550 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-14 15:52:05,551 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-14 15:52:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:52:05,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-14 15:52:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:52:05,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:52:05,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {8263#true} call ULTIMATE.init(); {8263#true} is VALID [2022-04-14 15:52:05,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {8263#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8263#true} is VALID [2022-04-14 15:52:05,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-14 15:52:05,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8263#true} {8263#true} #98#return; {8263#true} is VALID [2022-04-14 15:52:05,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {8263#true} call #t~ret8 := main(); {8263#true} is VALID [2022-04-14 15:52:05,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {8263#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8263#true} is VALID [2022-04-14 15:52:05,975 INFO L272 TraceCheckUtils]: 6: Hoare triple {8263#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8263#true} is VALID [2022-04-14 15:52:05,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-14 15:52:05,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-14 15:52:05,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-14 15:52:05,975 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8263#true} {8263#true} #78#return; {8263#true} is VALID [2022-04-14 15:52:05,975 INFO L272 TraceCheckUtils]: 11: Hoare triple {8263#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8263#true} is VALID [2022-04-14 15:52:05,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-14 15:52:05,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-14 15:52:05,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-14 15:52:05,975 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8263#true} {8263#true} #80#return; {8263#true} is VALID [2022-04-14 15:52:05,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {8263#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 15:52:05,978 INFO L272 TraceCheckUtils]: 17: Hoare triple {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {8263#true} is VALID [2022-04-14 15:52:05,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-14 15:52:05,979 INFO L290 TraceCheckUtils]: 19: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-14 15:52:05,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-14 15:52:05,979 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8263#true} {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #82#return; {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 15:52:05,979 INFO L272 TraceCheckUtils]: 22: Hoare triple {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {8263#true} is VALID [2022-04-14 15:52:05,979 INFO L290 TraceCheckUtils]: 23: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-14 15:52:05,979 INFO L290 TraceCheckUtils]: 24: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-14 15:52:05,979 INFO L290 TraceCheckUtils]: 25: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-14 15:52:05,980 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8263#true} {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #84#return; {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 15:52:05,980 INFO L290 TraceCheckUtils]: 27: Hoare triple {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 15:52:05,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 100);havoc #t~post6; {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 15:52:05,981 INFO L290 TraceCheckUtils]: 29: Hoare triple {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 15:52:05,981 INFO L290 TraceCheckUtils]: 30: Hoare triple {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 15:52:05,982 INFO L290 TraceCheckUtils]: 31: Hoare triple {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !!(#t~post7 < 100);havoc #t~post7; {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 15:52:05,982 INFO L272 TraceCheckUtils]: 32: Hoare triple {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8263#true} is VALID [2022-04-14 15:52:05,982 INFO L290 TraceCheckUtils]: 33: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-14 15:52:05,982 INFO L290 TraceCheckUtils]: 34: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-14 15:52:05,982 INFO L290 TraceCheckUtils]: 35: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-14 15:52:05,982 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8263#true} {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #86#return; {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 15:52:05,982 INFO L272 TraceCheckUtils]: 37: Hoare triple {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8263#true} is VALID [2022-04-14 15:52:05,982 INFO L290 TraceCheckUtils]: 38: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-14 15:52:05,982 INFO L290 TraceCheckUtils]: 39: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-14 15:52:05,982 INFO L290 TraceCheckUtils]: 40: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-14 15:52:05,983 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8263#true} {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #88#return; {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 15:52:05,983 INFO L272 TraceCheckUtils]: 42: Hoare triple {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8263#true} is VALID [2022-04-14 15:52:05,983 INFO L290 TraceCheckUtils]: 43: Hoare triple {8263#true} ~cond := #in~cond; {8399#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:52:05,984 INFO L290 TraceCheckUtils]: 44: Hoare triple {8399#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8403#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:52:05,984 INFO L290 TraceCheckUtils]: 45: Hoare triple {8403#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8403#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:52:05,984 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8403#(not (= |__VERIFIER_assert_#in~cond| 0))} {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #90#return; {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 15:52:05,984 INFO L272 TraceCheckUtils]: 47: Hoare triple {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {8263#true} is VALID [2022-04-14 15:52:05,984 INFO L290 TraceCheckUtils]: 48: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-14 15:52:05,984 INFO L290 TraceCheckUtils]: 49: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-14 15:52:05,985 INFO L290 TraceCheckUtils]: 50: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-14 15:52:05,985 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8263#true} {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #92#return; {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 15:52:05,985 INFO L290 TraceCheckUtils]: 52: Hoare triple {8356#(and (= 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); {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 15:52:05,986 INFO L290 TraceCheckUtils]: 53: Hoare triple {8356#(and (= 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; {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-14 15:52:05,988 INFO L290 TraceCheckUtils]: 54: Hoare triple {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-14 15:52:05,988 INFO L290 TraceCheckUtils]: 55: Hoare triple {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(#t~post6 < 100);havoc #t~post6; {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-14 15:52:05,988 INFO L290 TraceCheckUtils]: 56: Hoare triple {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-14 15:52:05,989 INFO L290 TraceCheckUtils]: 57: Hoare triple {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-14 15:52:05,989 INFO L290 TraceCheckUtils]: 58: Hoare triple {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(#t~post7 < 100);havoc #t~post7; {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-14 15:52:05,989 INFO L272 TraceCheckUtils]: 59: Hoare triple {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8263#true} is VALID [2022-04-14 15:52:05,989 INFO L290 TraceCheckUtils]: 60: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-14 15:52:05,989 INFO L290 TraceCheckUtils]: 61: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-14 15:52:05,989 INFO L290 TraceCheckUtils]: 62: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-14 15:52:05,990 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {8263#true} {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #86#return; {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-14 15:52:05,990 INFO L272 TraceCheckUtils]: 64: Hoare triple {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8465#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:52:05,991 INFO L290 TraceCheckUtils]: 65: Hoare triple {8465#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8469#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:52:05,991 INFO L290 TraceCheckUtils]: 66: Hoare triple {8469#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8264#false} is VALID [2022-04-14 15:52:05,991 INFO L290 TraceCheckUtils]: 67: Hoare triple {8264#false} assume !false; {8264#false} is VALID [2022-04-14 15:52:05,991 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-14 15:52:05,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:52:20,897 INFO L290 TraceCheckUtils]: 67: Hoare triple {8264#false} assume !false; {8264#false} is VALID [2022-04-14 15:52:20,897 INFO L290 TraceCheckUtils]: 66: Hoare triple {8469#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8264#false} is VALID [2022-04-14 15:52:20,898 INFO L290 TraceCheckUtils]: 65: Hoare triple {8465#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8469#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:52:20,898 INFO L272 TraceCheckUtils]: 64: Hoare triple {8485#(= 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)); {8465#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:52:20,899 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {8263#true} {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #86#return; {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 15:52:20,899 INFO L290 TraceCheckUtils]: 62: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-14 15:52:20,899 INFO L290 TraceCheckUtils]: 61: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-14 15:52:20,899 INFO L290 TraceCheckUtils]: 60: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-14 15:52:20,899 INFO L272 TraceCheckUtils]: 59: Hoare triple {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8263#true} is VALID [2022-04-14 15:52:20,900 INFO L290 TraceCheckUtils]: 58: Hoare triple {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 15:52:20,900 INFO L290 TraceCheckUtils]: 57: Hoare triple {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 15:52:20,900 INFO L290 TraceCheckUtils]: 56: Hoare triple {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 15:52:20,900 INFO L290 TraceCheckUtils]: 55: Hoare triple {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 100);havoc #t~post6; {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 15:52:20,901 INFO L290 TraceCheckUtils]: 54: Hoare triple {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 15:52:20,901 INFO L290 TraceCheckUtils]: 53: Hoare triple {8519#(= 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; {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 15:52:20,902 INFO L290 TraceCheckUtils]: 52: Hoare triple {8519#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {8519#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 15:52:20,902 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8263#true} {8519#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #92#return; {8519#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 15:52:20,902 INFO L290 TraceCheckUtils]: 50: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-14 15:52:20,902 INFO L290 TraceCheckUtils]: 49: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-14 15:52:20,902 INFO L290 TraceCheckUtils]: 48: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-14 15:52:20,902 INFO L272 TraceCheckUtils]: 47: Hoare triple {8519#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {8263#true} is VALID [2022-04-14 15:52:20,903 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8403#(not (= |__VERIFIER_assert_#in~cond| 0))} {8263#true} #90#return; {8519#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 15:52:20,903 INFO L290 TraceCheckUtils]: 45: Hoare triple {8403#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8403#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:52:20,903 INFO L290 TraceCheckUtils]: 44: Hoare triple {8550#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {8403#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:52:20,904 INFO L290 TraceCheckUtils]: 43: Hoare triple {8263#true} ~cond := #in~cond; {8550#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:52:20,904 INFO L272 TraceCheckUtils]: 42: Hoare triple {8263#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8263#true} is VALID [2022-04-14 15:52:20,904 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8263#true} {8263#true} #88#return; {8263#true} is VALID [2022-04-14 15:52:20,904 INFO L290 TraceCheckUtils]: 40: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-14 15:52:20,904 INFO L290 TraceCheckUtils]: 39: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-14 15:52:20,904 INFO L290 TraceCheckUtils]: 38: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-14 15:52:20,904 INFO L272 TraceCheckUtils]: 37: Hoare triple {8263#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8263#true} is VALID [2022-04-14 15:52:20,904 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8263#true} {8263#true} #86#return; {8263#true} is VALID [2022-04-14 15:52:20,904 INFO L290 TraceCheckUtils]: 35: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-14 15:52:20,904 INFO L290 TraceCheckUtils]: 34: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-14 15:52:20,904 INFO L290 TraceCheckUtils]: 33: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-14 15:52:20,904 INFO L272 TraceCheckUtils]: 32: Hoare triple {8263#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8263#true} is VALID [2022-04-14 15:52:20,904 INFO L290 TraceCheckUtils]: 31: Hoare triple {8263#true} assume !!(#t~post7 < 100);havoc #t~post7; {8263#true} is VALID [2022-04-14 15:52:20,904 INFO L290 TraceCheckUtils]: 30: Hoare triple {8263#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8263#true} is VALID [2022-04-14 15:52:20,904 INFO L290 TraceCheckUtils]: 29: Hoare triple {8263#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8263#true} is VALID [2022-04-14 15:52:20,904 INFO L290 TraceCheckUtils]: 28: Hoare triple {8263#true} assume !!(#t~post6 < 100);havoc #t~post6; {8263#true} is VALID [2022-04-14 15:52:20,904 INFO L290 TraceCheckUtils]: 27: Hoare triple {8263#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8263#true} is VALID [2022-04-14 15:52:20,905 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8263#true} {8263#true} #84#return; {8263#true} is VALID [2022-04-14 15:52:20,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-14 15:52:20,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-14 15:52:20,905 INFO L290 TraceCheckUtils]: 23: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-14 15:52:20,905 INFO L272 TraceCheckUtils]: 22: Hoare triple {8263#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {8263#true} is VALID [2022-04-14 15:52:20,905 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8263#true} {8263#true} #82#return; {8263#true} is VALID [2022-04-14 15:52:20,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-14 15:52:20,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-14 15:52:20,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-14 15:52:20,905 INFO L272 TraceCheckUtils]: 17: Hoare triple {8263#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {8263#true} is VALID [2022-04-14 15:52:20,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {8263#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {8263#true} is VALID [2022-04-14 15:52:20,905 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8263#true} {8263#true} #80#return; {8263#true} is VALID [2022-04-14 15:52:20,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-14 15:52:20,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-14 15:52:20,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-14 15:52:20,905 INFO L272 TraceCheckUtils]: 11: Hoare triple {8263#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8263#true} is VALID [2022-04-14 15:52:20,905 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8263#true} {8263#true} #78#return; {8263#true} is VALID [2022-04-14 15:52:20,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-14 15:52:20,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-14 15:52:20,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-14 15:52:20,906 INFO L272 TraceCheckUtils]: 6: Hoare triple {8263#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8263#true} is VALID [2022-04-14 15:52:20,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {8263#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8263#true} is VALID [2022-04-14 15:52:20,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {8263#true} call #t~ret8 := main(); {8263#true} is VALID [2022-04-14 15:52:20,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8263#true} {8263#true} #98#return; {8263#true} is VALID [2022-04-14 15:52:20,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-14 15:52:20,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {8263#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8263#true} is VALID [2022-04-14 15:52:20,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {8263#true} call ULTIMATE.init(); {8263#true} is VALID [2022-04-14 15:52:20,906 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-14 15:52:20,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:52:20,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614416146] [2022-04-14 15:52:20,906 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:52:20,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308865389] [2022-04-14 15:52:20,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308865389] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:52:20,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:52:20,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-04-14 15:52:20,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106514518] [2022-04-14 15:52:20,907 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:52:20,907 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 68 [2022-04-14 15:52:20,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:52:20,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-14 15:52:20,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:52:20,962 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-14 15:52:20,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:52:20,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-14 15:52:20,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-14 15:52:20,962 INFO L87 Difference]: Start difference. First operand 248 states and 306 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-14 15:52:22,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:52:22,451 INFO L93 Difference]: Finished difference Result 334 states and 433 transitions. [2022-04-14 15:52:22,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-14 15:52:22,451 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 68 [2022-04-14 15:52:22,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:52:22,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-14 15:52:22,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 138 transitions. [2022-04-14 15:52:22,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-14 15:52:22,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 138 transitions. [2022-04-14 15:52:22,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 138 transitions. [2022-04-14 15:52:22,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:52:22,589 INFO L225 Difference]: With dead ends: 334 [2022-04-14 15:52:22,589 INFO L226 Difference]: Without dead ends: 328 [2022-04-14 15:52:22,590 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-04-14 15:52:22,590 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 46 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-14 15:52:22,590 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 295 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-14 15:52:22,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-04-14 15:52:22,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 295. [2022-04-14 15:52:22,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:52:22,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 328 states. Second operand has 295 states, 195 states have (on average 1.1948717948717948) internal successors, (233), 204 states have internal predecessors, (233), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 61 states have call predecessors, (66), 66 states have call successors, (66) [2022-04-14 15:52:22,801 INFO L74 IsIncluded]: Start isIncluded. First operand 328 states. Second operand has 295 states, 195 states have (on average 1.1948717948717948) internal successors, (233), 204 states have internal predecessors, (233), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 61 states have call predecessors, (66), 66 states have call successors, (66) [2022-04-14 15:52:22,801 INFO L87 Difference]: Start difference. First operand 328 states. Second operand has 295 states, 195 states have (on average 1.1948717948717948) internal successors, (233), 204 states have internal predecessors, (233), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 61 states have call predecessors, (66), 66 states have call successors, (66) [2022-04-14 15:52:22,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:52:22,808 INFO L93 Difference]: Finished difference Result 328 states and 421 transitions. [2022-04-14 15:52:22,808 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 421 transitions. [2022-04-14 15:52:22,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:52:22,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:52:22,810 INFO L74 IsIncluded]: Start isIncluded. First operand has 295 states, 195 states have (on average 1.1948717948717948) internal successors, (233), 204 states have internal predecessors, (233), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 61 states have call predecessors, (66), 66 states have call successors, (66) Second operand 328 states. [2022-04-14 15:52:22,810 INFO L87 Difference]: Start difference. First operand has 295 states, 195 states have (on average 1.1948717948717948) internal successors, (233), 204 states have internal predecessors, (233), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 61 states have call predecessors, (66), 66 states have call successors, (66) Second operand 328 states. [2022-04-14 15:52:22,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:52:22,817 INFO L93 Difference]: Finished difference Result 328 states and 421 transitions. [2022-04-14 15:52:22,817 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 421 transitions. [2022-04-14 15:52:22,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:52:22,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:52:22,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:52:22,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:52:22,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 195 states have (on average 1.1948717948717948) internal successors, (233), 204 states have internal predecessors, (233), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 61 states have call predecessors, (66), 66 states have call successors, (66) [2022-04-14 15:52:22,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 370 transitions. [2022-04-14 15:52:22,825 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 370 transitions. Word has length 68 [2022-04-14 15:52:22,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:52:22,825 INFO L478 AbstractCegarLoop]: Abstraction has 295 states and 370 transitions. [2022-04-14 15:52:22,825 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-14 15:52:22,826 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 370 transitions. [2022-04-14 15:52:22,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-14 15:52:22,826 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:52:22,826 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:52:22,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-14 15:52:23,039 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-14 15:52:23,039 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:52:23,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:52:23,040 INFO L85 PathProgramCache]: Analyzing trace with hash 783638790, now seen corresponding path program 2 times [2022-04-14 15:52:23,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:52:23,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869323653] [2022-04-14 15:52:23,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:52:23,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:52:23,049 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:52:23,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [716787033] [2022-04-14 15:52:23,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 15:52:23,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:52:23,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:52:23,051 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-14 15:52:23,059 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-14 15:52:23,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 15:52:23,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:52:23,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-14 15:52:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:52:23,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:52:23,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {10276#true} call ULTIMATE.init(); {10276#true} is VALID [2022-04-14 15:52:23,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {10276#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10276#true} is VALID [2022-04-14 15:52:23,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-14 15:52:23,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10276#true} {10276#true} #98#return; {10276#true} is VALID [2022-04-14 15:52:23,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {10276#true} call #t~ret8 := main(); {10276#true} is VALID [2022-04-14 15:52:23,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {10276#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10276#true} is VALID [2022-04-14 15:52:23,591 INFO L272 TraceCheckUtils]: 6: Hoare triple {10276#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10276#true} is VALID [2022-04-14 15:52:23,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-14 15:52:23,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-14 15:52:23,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-14 15:52:23,591 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10276#true} {10276#true} #78#return; {10276#true} is VALID [2022-04-14 15:52:23,591 INFO L272 TraceCheckUtils]: 11: Hoare triple {10276#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10276#true} is VALID [2022-04-14 15:52:23,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-14 15:52:23,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-14 15:52:23,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-14 15:52:23,591 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10276#true} {10276#true} #80#return; {10276#true} is VALID [2022-04-14 15:52:23,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {10276#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {10329#(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-14 15:52:23,592 INFO L272 TraceCheckUtils]: 17: Hoare triple {10329#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {10276#true} is VALID [2022-04-14 15:52:23,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-14 15:52:23,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-14 15:52:23,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-14 15:52:23,593 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10276#true} {10329#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {10329#(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-14 15:52:23,593 INFO L272 TraceCheckUtils]: 22: Hoare triple {10329#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {10276#true} is VALID [2022-04-14 15:52:23,593 INFO L290 TraceCheckUtils]: 23: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-14 15:52:23,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-14 15:52:23,593 INFO L290 TraceCheckUtils]: 25: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-14 15:52:23,593 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10276#true} {10329#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {10329#(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-14 15:52:23,594 INFO L290 TraceCheckUtils]: 27: Hoare triple {10329#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10329#(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-14 15:52:23,594 INFO L290 TraceCheckUtils]: 28: Hoare triple {10329#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {10329#(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-14 15:52:23,595 INFO L290 TraceCheckUtils]: 29: Hoare triple {10329#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {10369#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:52:23,595 INFO L290 TraceCheckUtils]: 30: Hoare triple {10369#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10369#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:52:23,595 INFO L290 TraceCheckUtils]: 31: Hoare triple {10369#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {10369#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:52:23,595 INFO L272 TraceCheckUtils]: 32: Hoare triple {10369#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10276#true} is VALID [2022-04-14 15:52:23,596 INFO L290 TraceCheckUtils]: 33: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-14 15:52:23,596 INFO L290 TraceCheckUtils]: 34: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-14 15:52:23,596 INFO L290 TraceCheckUtils]: 35: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-14 15:52:23,596 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10276#true} {10369#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #86#return; {10369#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:52:23,596 INFO L272 TraceCheckUtils]: 37: Hoare triple {10369#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10276#true} is VALID [2022-04-14 15:52:23,596 INFO L290 TraceCheckUtils]: 38: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-14 15:52:23,596 INFO L290 TraceCheckUtils]: 39: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-14 15:52:23,620 INFO L290 TraceCheckUtils]: 40: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-14 15:52:23,630 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10276#true} {10369#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #88#return; {10369#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:52:23,630 INFO L272 TraceCheckUtils]: 42: Hoare triple {10369#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10276#true} is VALID [2022-04-14 15:52:23,630 INFO L290 TraceCheckUtils]: 43: Hoare triple {10276#true} ~cond := #in~cond; {10412#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:52:23,631 INFO L290 TraceCheckUtils]: 44: Hoare triple {10412#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10416#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:52:23,631 INFO L290 TraceCheckUtils]: 45: Hoare triple {10416#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10416#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:52:23,632 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10416#(not (= |__VERIFIER_assert_#in~cond| 0))} {10369#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #90#return; {10423#(and (= main_~r~0 0) (= 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-14 15:52:23,632 INFO L272 TraceCheckUtils]: 47: Hoare triple {10423#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {10276#true} is VALID [2022-04-14 15:52:23,632 INFO L290 TraceCheckUtils]: 48: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-14 15:52:23,632 INFO L290 TraceCheckUtils]: 49: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-14 15:52:23,632 INFO L290 TraceCheckUtils]: 50: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-14 15:52:23,632 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {10276#true} {10423#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #92#return; {10423#(and (= main_~r~0 0) (= 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-14 15:52:23,633 INFO L290 TraceCheckUtils]: 52: Hoare triple {10423#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {10423#(and (= main_~r~0 0) (= 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-14 15:52:23,633 INFO L290 TraceCheckUtils]: 53: Hoare triple {10423#(and (= main_~r~0 0) (= 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; {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 15:52:23,634 INFO L290 TraceCheckUtils]: 54: Hoare triple {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 15:52:23,634 INFO L290 TraceCheckUtils]: 55: Hoare triple {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 15:52:23,634 INFO L290 TraceCheckUtils]: 56: Hoare triple {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 15:52:23,635 INFO L290 TraceCheckUtils]: 57: Hoare triple {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 15:52:23,635 INFO L290 TraceCheckUtils]: 58: Hoare triple {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 15:52:23,635 INFO L272 TraceCheckUtils]: 59: Hoare triple {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10276#true} is VALID [2022-04-14 15:52:23,635 INFO L290 TraceCheckUtils]: 60: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-14 15:52:23,635 INFO L290 TraceCheckUtils]: 61: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-14 15:52:23,635 INFO L290 TraceCheckUtils]: 62: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-14 15:52:23,636 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {10276#true} {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #86#return; {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 15:52:23,636 INFO L272 TraceCheckUtils]: 64: Hoare triple {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10276#true} is VALID [2022-04-14 15:52:23,636 INFO L290 TraceCheckUtils]: 65: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-14 15:52:23,636 INFO L290 TraceCheckUtils]: 66: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-14 15:52:23,636 INFO L290 TraceCheckUtils]: 67: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-14 15:52:23,636 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10276#true} {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #88#return; {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 15:52:23,637 INFO L272 TraceCheckUtils]: 69: Hoare triple {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:52:23,637 INFO L290 TraceCheckUtils]: 70: Hoare triple {10494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:52:23,637 INFO L290 TraceCheckUtils]: 71: Hoare triple {10498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10277#false} is VALID [2022-04-14 15:52:23,637 INFO L290 TraceCheckUtils]: 72: Hoare triple {10277#false} assume !false; {10277#false} is VALID [2022-04-14 15:52:23,638 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-14 15:52:23,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:52:39,207 INFO L290 TraceCheckUtils]: 72: Hoare triple {10277#false} assume !false; {10277#false} is VALID [2022-04-14 15:52:39,207 INFO L290 TraceCheckUtils]: 71: Hoare triple {10498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10277#false} is VALID [2022-04-14 15:52:39,208 INFO L290 TraceCheckUtils]: 70: Hoare triple {10494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:52:39,208 INFO L272 TraceCheckUtils]: 69: Hoare triple {10514#(= 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)); {10494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:52:39,209 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10276#true} {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #88#return; {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 15:52:39,209 INFO L290 TraceCheckUtils]: 67: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-14 15:52:39,209 INFO L290 TraceCheckUtils]: 66: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-14 15:52:39,209 INFO L290 TraceCheckUtils]: 65: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-14 15:52:39,209 INFO L272 TraceCheckUtils]: 64: Hoare triple {10514#(= 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)); {10276#true} is VALID [2022-04-14 15:52:39,210 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {10276#true} {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #86#return; {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 15:52:39,210 INFO L290 TraceCheckUtils]: 62: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-14 15:52:39,210 INFO L290 TraceCheckUtils]: 61: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-14 15:52:39,210 INFO L290 TraceCheckUtils]: 60: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-14 15:52:39,210 INFO L272 TraceCheckUtils]: 59: Hoare triple {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10276#true} is VALID [2022-04-14 15:52:39,210 INFO L290 TraceCheckUtils]: 58: Hoare triple {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 15:52:39,210 INFO L290 TraceCheckUtils]: 57: Hoare triple {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 15:52:39,211 INFO L290 TraceCheckUtils]: 56: Hoare triple {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 15:52:39,211 INFO L290 TraceCheckUtils]: 55: Hoare triple {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 100);havoc #t~post6; {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 15:52:39,211 INFO L290 TraceCheckUtils]: 54: Hoare triple {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 15:52:39,863 INFO L290 TraceCheckUtils]: 53: Hoare triple {10563#(= (+ (* (+ (* (* 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; {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 15:52:39,864 INFO L290 TraceCheckUtils]: 52: Hoare triple {10563#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} assume !(~c~0 >= ~b~0); {10563#(= (+ (* (+ (* (* 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-14 15:52:39,865 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {10276#true} {10563#(= (+ (* (+ (* (* 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)} #92#return; {10563#(= (+ (* (+ (* (* 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-14 15:52:39,865 INFO L290 TraceCheckUtils]: 50: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-14 15:52:39,865 INFO L290 TraceCheckUtils]: 49: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-14 15:52:39,865 INFO L290 TraceCheckUtils]: 48: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-14 15:52:39,865 INFO L272 TraceCheckUtils]: 47: Hoare triple {10563#(= (+ (* (+ (* (* 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)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {10276#true} is VALID [2022-04-14 15:52:39,866 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10416#(not (= |__VERIFIER_assert_#in~cond| 0))} {10585#(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) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #90#return; {10563#(= (+ (* (+ (* (* 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-14 15:52:39,866 INFO L290 TraceCheckUtils]: 45: Hoare triple {10416#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10416#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:52:39,866 INFO L290 TraceCheckUtils]: 44: Hoare triple {10595#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {10416#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:52:39,867 INFO L290 TraceCheckUtils]: 43: Hoare triple {10276#true} ~cond := #in~cond; {10595#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:52:39,867 INFO L272 TraceCheckUtils]: 42: Hoare triple {10585#(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) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10276#true} is VALID [2022-04-14 15:52:39,867 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10276#true} {10585#(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) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #88#return; {10585#(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) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 15:52:39,867 INFO L290 TraceCheckUtils]: 40: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-14 15:52:39,867 INFO L290 TraceCheckUtils]: 39: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-14 15:52:39,867 INFO L290 TraceCheckUtils]: 38: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-14 15:52:39,867 INFO L272 TraceCheckUtils]: 37: Hoare triple {10585#(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) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10276#true} is VALID [2022-04-14 15:52:39,877 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10276#true} {10585#(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) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #86#return; {10585#(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) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 15:52:39,878 INFO L290 TraceCheckUtils]: 35: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-14 15:52:39,878 INFO L290 TraceCheckUtils]: 34: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-14 15:52:39,878 INFO L290 TraceCheckUtils]: 33: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-14 15:52:39,878 INFO L272 TraceCheckUtils]: 32: Hoare triple {10585#(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) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10276#true} is VALID [2022-04-14 15:52:39,878 INFO L290 TraceCheckUtils]: 31: Hoare triple {10585#(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) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !!(#t~post7 < 100);havoc #t~post7; {10585#(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) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 15:52:39,879 INFO L290 TraceCheckUtils]: 30: Hoare triple {10585#(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) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10585#(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) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 15:52:39,879 INFO L290 TraceCheckUtils]: 29: Hoare triple {10638#(or (= 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)))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {10585#(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) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 15:52:39,880 INFO L290 TraceCheckUtils]: 28: Hoare triple {10638#(or (= 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)))))} assume !!(#t~post6 < 100);havoc #t~post6; {10638#(or (= 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)))))} is VALID [2022-04-14 15:52:39,880 INFO L290 TraceCheckUtils]: 27: Hoare triple {10638#(or (= 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)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10638#(or (= 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)))))} is VALID [2022-04-14 15:52:39,881 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10276#true} {10638#(or (= 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)))))} #84#return; {10638#(or (= 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)))))} is VALID [2022-04-14 15:52:39,881 INFO L290 TraceCheckUtils]: 25: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-14 15:52:39,881 INFO L290 TraceCheckUtils]: 24: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-14 15:52:39,881 INFO L290 TraceCheckUtils]: 23: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-14 15:52:39,881 INFO L272 TraceCheckUtils]: 22: Hoare triple {10638#(or (= 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)))))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {10276#true} is VALID [2022-04-14 15:52:39,881 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10276#true} {10638#(or (= 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)))))} #82#return; {10638#(or (= 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)))))} is VALID [2022-04-14 15:52:39,881 INFO L290 TraceCheckUtils]: 20: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-14 15:52:39,881 INFO L290 TraceCheckUtils]: 19: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-14 15:52:39,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-14 15:52:39,881 INFO L272 TraceCheckUtils]: 17: Hoare triple {10638#(or (= 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)))))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {10276#true} is VALID [2022-04-14 15:52:39,882 INFO L290 TraceCheckUtils]: 16: Hoare triple {10276#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {10638#(or (= 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)))))} is VALID [2022-04-14 15:52:39,882 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10276#true} {10276#true} #80#return; {10276#true} is VALID [2022-04-14 15:52:39,882 INFO L290 TraceCheckUtils]: 14: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-14 15:52:39,882 INFO L290 TraceCheckUtils]: 13: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-14 15:52:39,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-14 15:52:39,882 INFO L272 TraceCheckUtils]: 11: Hoare triple {10276#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10276#true} is VALID [2022-04-14 15:52:39,882 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10276#true} {10276#true} #78#return; {10276#true} is VALID [2022-04-14 15:52:39,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-14 15:52:39,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-14 15:52:39,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-14 15:52:39,882 INFO L272 TraceCheckUtils]: 6: Hoare triple {10276#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10276#true} is VALID [2022-04-14 15:52:39,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {10276#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10276#true} is VALID [2022-04-14 15:52:39,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {10276#true} call #t~ret8 := main(); {10276#true} is VALID [2022-04-14 15:52:39,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10276#true} {10276#true} #98#return; {10276#true} is VALID [2022-04-14 15:52:39,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-14 15:52:39,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {10276#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10276#true} is VALID [2022-04-14 15:52:39,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {10276#true} call ULTIMATE.init(); {10276#true} is VALID [2022-04-14 15:52:39,883 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-14 15:52:39,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:52:39,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869323653] [2022-04-14 15:52:39,883 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:52:39,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716787033] [2022-04-14 15:52:39,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716787033] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:52:39,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:52:39,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-04-14 15:52:39,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906201367] [2022-04-14 15:52:39,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:52:39,884 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) Word has length 73 [2022-04-14 15:52:39,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:52:39,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-14 15:52:40,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:52:40,177 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-14 15:52:40,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:52:40,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-14 15:52:40,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-04-14 15:52:40,178 INFO L87 Difference]: Start difference. First operand 295 states and 370 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-14 15:52:45,567 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:52:45,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:52:45,788 INFO L93 Difference]: Finished difference Result 319 states and 399 transitions. [2022-04-14 15:52:45,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-14 15:52:45,788 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) Word has length 73 [2022-04-14 15:52:45,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:52:45,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-14 15:52:45,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2022-04-14 15:52:45,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-14 15:52:45,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2022-04-14 15:52:45,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 97 transitions. [2022-04-14 15:52:46,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:52:46,556 INFO L225 Difference]: With dead ends: 319 [2022-04-14 15:52:46,556 INFO L226 Difference]: Without dead ends: 316 [2022-04-14 15:52:46,557 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2022-04-14 15:52:46,561 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 52 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:52:46,562 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 320 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-14 15:52:46,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-04-14 15:52:46,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 305. [2022-04-14 15:52:46,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:52:46,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 316 states. Second operand has 305 states, 204 states have (on average 1.1862745098039216) internal successors, (242), 212 states have internal predecessors, (242), 69 states have call successors, (69), 32 states have call predecessors, (69), 31 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) [2022-04-14 15:52:46,779 INFO L74 IsIncluded]: Start isIncluded. First operand 316 states. Second operand has 305 states, 204 states have (on average 1.1862745098039216) internal successors, (242), 212 states have internal predecessors, (242), 69 states have call successors, (69), 32 states have call predecessors, (69), 31 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) [2022-04-14 15:52:46,780 INFO L87 Difference]: Start difference. First operand 316 states. Second operand has 305 states, 204 states have (on average 1.1862745098039216) internal successors, (242), 212 states have internal predecessors, (242), 69 states have call successors, (69), 32 states have call predecessors, (69), 31 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) [2022-04-14 15:52:46,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:52:46,791 INFO L93 Difference]: Finished difference Result 316 states and 393 transitions. [2022-04-14 15:52:46,791 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 393 transitions. [2022-04-14 15:52:46,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:52:46,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:52:46,792 INFO L74 IsIncluded]: Start isIncluded. First operand has 305 states, 204 states have (on average 1.1862745098039216) internal successors, (242), 212 states have internal predecessors, (242), 69 states have call successors, (69), 32 states have call predecessors, (69), 31 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) Second operand 316 states. [2022-04-14 15:52:46,792 INFO L87 Difference]: Start difference. First operand has 305 states, 204 states have (on average 1.1862745098039216) internal successors, (242), 212 states have internal predecessors, (242), 69 states have call successors, (69), 32 states have call predecessors, (69), 31 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) Second operand 316 states. [2022-04-14 15:52:46,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:52:46,799 INFO L93 Difference]: Finished difference Result 316 states and 393 transitions. [2022-04-14 15:52:46,799 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 393 transitions. [2022-04-14 15:52:46,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:52:46,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:52:46,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:52:46,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:52:46,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 204 states have (on average 1.1862745098039216) internal successors, (242), 212 states have internal predecessors, (242), 69 states have call successors, (69), 32 states have call predecessors, (69), 31 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) [2022-04-14 15:52:46,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 376 transitions. [2022-04-14 15:52:46,807 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 376 transitions. Word has length 73 [2022-04-14 15:52:46,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:52:46,807 INFO L478 AbstractCegarLoop]: Abstraction has 305 states and 376 transitions. [2022-04-14 15:52:46,808 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-14 15:52:46,808 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 376 transitions. [2022-04-14 15:52:46,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-14 15:52:46,809 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:52:46,809 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:52:46,827 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-14 15:52:47,025 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-14 15:52:47,026 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:52:47,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:52:47,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1625446301, now seen corresponding path program 3 times [2022-04-14 15:52:47,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:52:47,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601468400] [2022-04-14 15:52:47,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:52:47,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:52:47,037 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:52:47,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [21126117] [2022-04-14 15:52:47,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 15:52:47,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:52:47,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:52:47,038 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-14 15:52:47,039 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-14 15:52:47,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-14 15:52:47,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:52:47,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-14 15:52:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:52:47,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:52:47,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {12281#true} call ULTIMATE.init(); {12281#true} is VALID [2022-04-14 15:52:47,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {12281#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12281#true} is VALID [2022-04-14 15:52:47,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {12281#true} assume true; {12281#true} is VALID [2022-04-14 15:52:47,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12281#true} {12281#true} #98#return; {12281#true} is VALID [2022-04-14 15:52:47,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {12281#true} call #t~ret8 := main(); {12281#true} is VALID [2022-04-14 15:52:47,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {12281#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {12281#true} is VALID [2022-04-14 15:52:47,691 INFO L272 TraceCheckUtils]: 6: Hoare triple {12281#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {12281#true} is VALID [2022-04-14 15:52:47,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {12281#true} ~cond := #in~cond; {12281#true} is VALID [2022-04-14 15:52:47,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {12281#true} assume !(0 == ~cond); {12281#true} is VALID [2022-04-14 15:52:47,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {12281#true} assume true; {12281#true} is VALID [2022-04-14 15:52:47,691 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12281#true} {12281#true} #78#return; {12281#true} is VALID [2022-04-14 15:52:47,691 INFO L272 TraceCheckUtils]: 11: Hoare triple {12281#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12281#true} is VALID [2022-04-14 15:52:47,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {12281#true} ~cond := #in~cond; {12281#true} is VALID [2022-04-14 15:52:47,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {12281#true} assume !(0 == ~cond); {12281#true} is VALID [2022-04-14 15:52:47,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {12281#true} assume true; {12281#true} is VALID [2022-04-14 15:52:47,691 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12281#true} {12281#true} #80#return; {12281#true} is VALID [2022-04-14 15:52:47,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {12281#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {12334#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:52:47,692 INFO L272 TraceCheckUtils]: 17: Hoare triple {12334#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {12281#true} is VALID [2022-04-14 15:52:47,692 INFO L290 TraceCheckUtils]: 18: Hoare triple {12281#true} ~cond := #in~cond; {12281#true} is VALID [2022-04-14 15:52:47,692 INFO L290 TraceCheckUtils]: 19: Hoare triple {12281#true} assume !(0 == ~cond); {12281#true} is VALID [2022-04-14 15:52:47,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {12281#true} assume true; {12281#true} is VALID [2022-04-14 15:52:47,693 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {12281#true} {12334#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {12334#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:52:47,693 INFO L272 TraceCheckUtils]: 22: Hoare triple {12334#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {12281#true} is VALID [2022-04-14 15:52:47,693 INFO L290 TraceCheckUtils]: 23: Hoare triple {12281#true} ~cond := #in~cond; {12281#true} is VALID [2022-04-14 15:52:47,693 INFO L290 TraceCheckUtils]: 24: Hoare triple {12281#true} assume !(0 == ~cond); {12281#true} is VALID [2022-04-14 15:52:47,693 INFO L290 TraceCheckUtils]: 25: Hoare triple {12281#true} assume true; {12281#true} is VALID [2022-04-14 15:52:47,693 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12281#true} {12334#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {12334#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:52:47,694 INFO L290 TraceCheckUtils]: 27: Hoare triple {12334#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12334#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:52:47,694 INFO L290 TraceCheckUtils]: 28: Hoare triple {12334#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {12334#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:52:47,695 INFO L290 TraceCheckUtils]: 29: Hoare triple {12334#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:52:47,695 INFO L290 TraceCheckUtils]: 30: Hoare triple {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:52:47,695 INFO L290 TraceCheckUtils]: 31: Hoare triple {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:52:47,695 INFO L272 TraceCheckUtils]: 32: Hoare triple {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~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)); {12281#true} is VALID [2022-04-14 15:52:47,696 INFO L290 TraceCheckUtils]: 33: Hoare triple {12281#true} ~cond := #in~cond; {12281#true} is VALID [2022-04-14 15:52:47,696 INFO L290 TraceCheckUtils]: 34: Hoare triple {12281#true} assume !(0 == ~cond); {12281#true} is VALID [2022-04-14 15:52:47,696 INFO L290 TraceCheckUtils]: 35: Hoare triple {12281#true} assume true; {12281#true} is VALID [2022-04-14 15:52:47,696 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12281#true} {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #86#return; {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:52:47,696 INFO L272 TraceCheckUtils]: 37: Hoare triple {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12281#true} is VALID [2022-04-14 15:52:47,696 INFO L290 TraceCheckUtils]: 38: Hoare triple {12281#true} ~cond := #in~cond; {12281#true} is VALID [2022-04-14 15:52:47,696 INFO L290 TraceCheckUtils]: 39: Hoare triple {12281#true} assume !(0 == ~cond); {12281#true} is VALID [2022-04-14 15:52:47,696 INFO L290 TraceCheckUtils]: 40: Hoare triple {12281#true} assume true; {12281#true} is VALID [2022-04-14 15:52:47,697 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12281#true} {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #88#return; {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:52:47,697 INFO L272 TraceCheckUtils]: 42: Hoare triple {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~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)); {12281#true} is VALID [2022-04-14 15:52:47,697 INFO L290 TraceCheckUtils]: 43: Hoare triple {12281#true} ~cond := #in~cond; {12281#true} is VALID [2022-04-14 15:52:47,697 INFO L290 TraceCheckUtils]: 44: Hoare triple {12281#true} assume !(0 == ~cond); {12281#true} is VALID [2022-04-14 15:52:47,697 INFO L290 TraceCheckUtils]: 45: Hoare triple {12281#true} assume true; {12281#true} is VALID [2022-04-14 15:52:47,698 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {12281#true} {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #90#return; {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:52:47,698 INFO L272 TraceCheckUtils]: 47: Hoare triple {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {12281#true} is VALID [2022-04-14 15:52:47,698 INFO L290 TraceCheckUtils]: 48: Hoare triple {12281#true} ~cond := #in~cond; {12281#true} is VALID [2022-04-14 15:52:47,698 INFO L290 TraceCheckUtils]: 49: Hoare triple {12281#true} assume !(0 == ~cond); {12281#true} is VALID [2022-04-14 15:52:47,698 INFO L290 TraceCheckUtils]: 50: Hoare triple {12281#true} assume true; {12281#true} is VALID [2022-04-14 15:52:47,699 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {12281#true} {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #92#return; {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:52:47,699 INFO L290 TraceCheckUtils]: 52: Hoare triple {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:52:47,700 INFO L290 TraceCheckUtils]: 53: Hoare triple {12374#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~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; {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:52:47,700 INFO L290 TraceCheckUtils]: 54: Hoare triple {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:52:47,700 INFO L290 TraceCheckUtils]: 55: Hoare triple {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post6 < 100);havoc #t~post6; {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:52:47,701 INFO L290 TraceCheckUtils]: 56: Hoare triple {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:52:47,701 INFO L290 TraceCheckUtils]: 57: Hoare triple {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:52:47,701 INFO L290 TraceCheckUtils]: 58: Hoare triple {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:52:47,702 INFO L272 TraceCheckUtils]: 59: Hoare triple {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {12281#true} is VALID [2022-04-14 15:52:47,702 INFO L290 TraceCheckUtils]: 60: Hoare triple {12281#true} ~cond := #in~cond; {12281#true} is VALID [2022-04-14 15:52:47,702 INFO L290 TraceCheckUtils]: 61: Hoare triple {12281#true} assume !(0 == ~cond); {12281#true} is VALID [2022-04-14 15:52:47,702 INFO L290 TraceCheckUtils]: 62: Hoare triple {12281#true} assume true; {12281#true} is VALID [2022-04-14 15:52:47,702 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {12281#true} {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:52:47,702 INFO L272 TraceCheckUtils]: 64: Hoare triple {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12281#true} is VALID [2022-04-14 15:52:47,702 INFO L290 TraceCheckUtils]: 65: Hoare triple {12281#true} ~cond := #in~cond; {12281#true} is VALID [2022-04-14 15:52:47,702 INFO L290 TraceCheckUtils]: 66: Hoare triple {12281#true} assume !(0 == ~cond); {12281#true} is VALID [2022-04-14 15:52:47,703 INFO L290 TraceCheckUtils]: 67: Hoare triple {12281#true} assume true; {12281#true} is VALID [2022-04-14 15:52:47,703 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {12281#true} {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:52:47,703 INFO L272 TraceCheckUtils]: 69: Hoare triple {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12281#true} is VALID [2022-04-14 15:52:47,703 INFO L290 TraceCheckUtils]: 70: Hoare triple {12281#true} ~cond := #in~cond; {12499#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:52:47,704 INFO L290 TraceCheckUtils]: 71: Hoare triple {12499#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {12503#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:52:47,704 INFO L290 TraceCheckUtils]: 72: Hoare triple {12503#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12503#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:52:47,704 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {12503#(not (= |__VERIFIER_assert_#in~cond| 0))} {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:52:47,705 INFO L272 TraceCheckUtils]: 74: Hoare triple {12447#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {12513#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:52:47,705 INFO L290 TraceCheckUtils]: 75: Hoare triple {12513#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12517#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:52:47,706 INFO L290 TraceCheckUtils]: 76: Hoare triple {12517#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12282#false} is VALID [2022-04-14 15:52:47,706 INFO L290 TraceCheckUtils]: 77: Hoare triple {12282#false} assume !false; {12282#false} is VALID [2022-04-14 15:52:47,706 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 31 proven. 10 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-04-14 15:52:47,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:53:32,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:53:32,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601468400] [2022-04-14 15:53:32,616 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:53:32,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21126117] [2022-04-14 15:53:32,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21126117] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:53:32,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 15:53:32,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-14 15:53:32,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214916002] [2022-04-14 15:53:32,617 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 15:53:32,617 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 78 [2022-04-14 15:53:32,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:53:32,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-14 15:53:32,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:53:32,664 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-14 15:53:32,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:53:32,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-14 15:53:32,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-14 15:53:32,665 INFO L87 Difference]: Start difference. First operand 305 states and 376 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-14 15:53:33,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:53:33,796 INFO L93 Difference]: Finished difference Result 337 states and 411 transitions. [2022-04-14 15:53:33,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-14 15:53:33,796 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 78 [2022-04-14 15:53:33,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:53:33,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-14 15:53:33,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-14 15:53:33,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-14 15:53:33,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-14 15:53:33,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-14 15:53:33,884 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-14 15:53:33,890 INFO L225 Difference]: With dead ends: 337 [2022-04-14 15:53:33,890 INFO L226 Difference]: Without dead ends: 333 [2022-04-14 15:53:33,890 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-04-14 15:53:33,891 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 23 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-14 15:53:33,891 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 233 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-14 15:53:33,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-04-14 15:53:34,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 330. [2022-04-14 15:53:34,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:53:34,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 333 states. Second operand has 330 states, 221 states have (on average 1.1764705882352942) internal successors, (260), 228 states have internal predecessors, (260), 73 states have call successors, (73), 37 states have call predecessors, (73), 35 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-14 15:53:34,106 INFO L74 IsIncluded]: Start isIncluded. First operand 333 states. Second operand has 330 states, 221 states have (on average 1.1764705882352942) internal successors, (260), 228 states have internal predecessors, (260), 73 states have call successors, (73), 37 states have call predecessors, (73), 35 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-14 15:53:34,106 INFO L87 Difference]: Start difference. First operand 333 states. Second operand has 330 states, 221 states have (on average 1.1764705882352942) internal successors, (260), 228 states have internal predecessors, (260), 73 states have call successors, (73), 37 states have call predecessors, (73), 35 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-14 15:53:34,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:53:34,112 INFO L93 Difference]: Finished difference Result 333 states and 405 transitions. [2022-04-14 15:53:34,112 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 405 transitions. [2022-04-14 15:53:34,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:53:34,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:53:34,114 INFO L74 IsIncluded]: Start isIncluded. First operand has 330 states, 221 states have (on average 1.1764705882352942) internal successors, (260), 228 states have internal predecessors, (260), 73 states have call successors, (73), 37 states have call predecessors, (73), 35 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) Second operand 333 states. [2022-04-14 15:53:34,114 INFO L87 Difference]: Start difference. First operand has 330 states, 221 states have (on average 1.1764705882352942) internal successors, (260), 228 states have internal predecessors, (260), 73 states have call successors, (73), 37 states have call predecessors, (73), 35 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) Second operand 333 states. [2022-04-14 15:53:34,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:53:34,120 INFO L93 Difference]: Finished difference Result 333 states and 405 transitions. [2022-04-14 15:53:34,120 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 405 transitions. [2022-04-14 15:53:34,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:53:34,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:53:34,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:53:34,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:53:34,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 221 states have (on average 1.1764705882352942) internal successors, (260), 228 states have internal predecessors, (260), 73 states have call successors, (73), 37 states have call predecessors, (73), 35 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-14 15:53:34,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 402 transitions. [2022-04-14 15:53:34,128 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 402 transitions. Word has length 78 [2022-04-14 15:53:34,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:53:34,128 INFO L478 AbstractCegarLoop]: Abstraction has 330 states and 402 transitions. [2022-04-14 15:53:34,129 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-14 15:53:34,129 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 402 transitions. [2022-04-14 15:53:34,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-14 15:53:34,129 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:53:34,129 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:53:34,149 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-14 15:53:34,343 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-14 15:53:34,343 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:53:34,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:53:34,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1017110725, now seen corresponding path program 1 times [2022-04-14 15:53:34,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:53:34,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717773185] [2022-04-14 15:53:34,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:53:34,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:53:34,353 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:53:34,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1058330394] [2022-04-14 15:53:34,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:53:34,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:53:34,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:53:34,355 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-14 15:53:34,355 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-14 15:53:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:53:34,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-14 15:53:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:53:34,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:53:35,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {14173#true} call ULTIMATE.init(); {14173#true} is VALID [2022-04-14 15:53:35,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {14173#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14173#true} is VALID [2022-04-14 15:53:35,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-14 15:53:35,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14173#true} {14173#true} #98#return; {14173#true} is VALID [2022-04-14 15:53:35,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {14173#true} call #t~ret8 := main(); {14173#true} is VALID [2022-04-14 15:53:35,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {14173#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {14173#true} is VALID [2022-04-14 15:53:35,080 INFO L272 TraceCheckUtils]: 6: Hoare triple {14173#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {14173#true} is VALID [2022-04-14 15:53:35,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-14 15:53:35,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-14 15:53:35,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-14 15:53:35,080 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14173#true} {14173#true} #78#return; {14173#true} is VALID [2022-04-14 15:53:35,080 INFO L272 TraceCheckUtils]: 11: Hoare triple {14173#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14173#true} is VALID [2022-04-14 15:53:35,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-14 15:53:35,080 INFO L290 TraceCheckUtils]: 13: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-14 15:53:35,080 INFO L290 TraceCheckUtils]: 14: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-14 15:53:35,080 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14173#true} {14173#true} #80#return; {14173#true} is VALID [2022-04-14 15:53:35,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {14173#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {14226#(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-14 15:53:35,082 INFO L272 TraceCheckUtils]: 17: Hoare triple {14226#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {14173#true} is VALID [2022-04-14 15:53:35,082 INFO L290 TraceCheckUtils]: 18: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-14 15:53:35,082 INFO L290 TraceCheckUtils]: 19: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-14 15:53:35,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-14 15:53:35,082 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14173#true} {14226#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {14226#(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-14 15:53:35,082 INFO L272 TraceCheckUtils]: 22: Hoare triple {14226#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {14173#true} is VALID [2022-04-14 15:53:35,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-14 15:53:35,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-14 15:53:35,083 INFO L290 TraceCheckUtils]: 25: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-14 15:53:35,083 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14173#true} {14226#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {14226#(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-14 15:53:35,083 INFO L290 TraceCheckUtils]: 27: Hoare triple {14226#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14226#(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-14 15:53:35,084 INFO L290 TraceCheckUtils]: 28: Hoare triple {14226#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {14226#(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-14 15:53:35,084 INFO L290 TraceCheckUtils]: 29: Hoare triple {14226#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {14266#(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-14 15:53:35,085 INFO L290 TraceCheckUtils]: 30: Hoare triple {14266#(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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14266#(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-14 15:53:35,085 INFO L290 TraceCheckUtils]: 31: Hoare triple {14266#(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 !!(#t~post7 < 100);havoc #t~post7; {14266#(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-14 15:53:35,085 INFO L272 TraceCheckUtils]: 32: Hoare triple {14266#(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))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14173#true} is VALID [2022-04-14 15:53:35,085 INFO L290 TraceCheckUtils]: 33: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-14 15:53:35,085 INFO L290 TraceCheckUtils]: 34: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-14 15:53:35,085 INFO L290 TraceCheckUtils]: 35: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-14 15:53:35,086 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14173#true} {14266#(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))} #86#return; {14266#(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-14 15:53:35,086 INFO L272 TraceCheckUtils]: 37: Hoare triple {14266#(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))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14173#true} is VALID [2022-04-14 15:53:35,086 INFO L290 TraceCheckUtils]: 38: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-14 15:53:35,086 INFO L290 TraceCheckUtils]: 39: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-14 15:53:35,086 INFO L290 TraceCheckUtils]: 40: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-14 15:53:35,086 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14173#true} {14266#(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))} #88#return; {14266#(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-14 15:53:35,087 INFO L272 TraceCheckUtils]: 42: Hoare triple {14266#(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))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14173#true} is VALID [2022-04-14 15:53:35,087 INFO L290 TraceCheckUtils]: 43: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-14 15:53:35,087 INFO L290 TraceCheckUtils]: 44: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-14 15:53:35,087 INFO L290 TraceCheckUtils]: 45: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-14 15:53:35,087 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {14173#true} {14266#(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))} #90#return; {14266#(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-14 15:53:35,087 INFO L272 TraceCheckUtils]: 47: Hoare triple {14266#(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))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14173#true} is VALID [2022-04-14 15:53:35,087 INFO L290 TraceCheckUtils]: 48: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-14 15:53:35,087 INFO L290 TraceCheckUtils]: 49: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-14 15:53:35,088 INFO L290 TraceCheckUtils]: 50: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-14 15:53:35,088 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {14173#true} {14266#(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))} #92#return; {14266#(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-14 15:53:35,089 INFO L290 TraceCheckUtils]: 52: Hoare triple {14266#(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);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {14336#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:53:35,089 INFO L290 TraceCheckUtils]: 53: Hoare triple {14336#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14336#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:53:35,090 INFO L290 TraceCheckUtils]: 54: Hoare triple {14336#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {14336#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:53:35,090 INFO L272 TraceCheckUtils]: 55: Hoare triple {14336#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14173#true} is VALID [2022-04-14 15:53:35,090 INFO L290 TraceCheckUtils]: 56: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-14 15:53:35,090 INFO L290 TraceCheckUtils]: 57: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-14 15:53:35,090 INFO L290 TraceCheckUtils]: 58: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-14 15:53:35,091 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14173#true} {14336#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {14336#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:53:35,091 INFO L272 TraceCheckUtils]: 60: Hoare triple {14336#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14173#true} is VALID [2022-04-14 15:53:35,094 INFO L290 TraceCheckUtils]: 61: Hoare triple {14173#true} ~cond := #in~cond; {14364#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:53:35,094 INFO L290 TraceCheckUtils]: 62: Hoare triple {14364#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {14368#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:53:35,094 INFO L290 TraceCheckUtils]: 63: Hoare triple {14368#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14368#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:53:35,096 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14368#(not (= |__VERIFIER_assert_#in~cond| 0))} {14336#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #88#return; {14375#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 15:53:35,096 INFO L272 TraceCheckUtils]: 65: Hoare triple {14375#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14173#true} is VALID [2022-04-14 15:53:35,096 INFO L290 TraceCheckUtils]: 66: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-14 15:53:35,096 INFO L290 TraceCheckUtils]: 67: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-14 15:53:35,096 INFO L290 TraceCheckUtils]: 68: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-14 15:53:35,097 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {14173#true} {14375#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} #90#return; {14375#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 15:53:35,097 INFO L272 TraceCheckUtils]: 70: Hoare triple {14375#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14173#true} is VALID [2022-04-14 15:53:35,097 INFO L290 TraceCheckUtils]: 71: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-14 15:53:35,097 INFO L290 TraceCheckUtils]: 72: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-14 15:53:35,097 INFO L290 TraceCheckUtils]: 73: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-14 15:53:35,097 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14173#true} {14375#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} #92#return; {14375#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 15:53:35,098 INFO L290 TraceCheckUtils]: 75: Hoare triple {14375#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {14375#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 15:53:35,098 INFO L290 TraceCheckUtils]: 76: Hoare triple {14375#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {14412#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-14 15:53:35,099 INFO L290 TraceCheckUtils]: 77: Hoare triple {14412#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14412#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-14 15:53:35,099 INFO L290 TraceCheckUtils]: 78: Hoare triple {14412#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !!(#t~post6 < 100);havoc #t~post6; {14412#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-14 15:53:35,099 INFO L290 TraceCheckUtils]: 79: Hoare triple {14412#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !(0 != ~b~0); {14422#(and (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-14 15:53:35,100 INFO L272 TraceCheckUtils]: 80: Hoare triple {14422#(and (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {14426#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:53:35,100 INFO L290 TraceCheckUtils]: 81: Hoare triple {14426#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14430#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:53:35,100 INFO L290 TraceCheckUtils]: 82: Hoare triple {14430#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14174#false} is VALID [2022-04-14 15:53:35,100 INFO L290 TraceCheckUtils]: 83: Hoare triple {14174#false} assume !false; {14174#false} is VALID [2022-04-14 15:53:35,101 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-14 15:53:35,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:54:23,753 INFO L290 TraceCheckUtils]: 83: Hoare triple {14174#false} assume !false; {14174#false} is VALID [2022-04-14 15:54:23,754 INFO L290 TraceCheckUtils]: 82: Hoare triple {14430#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14174#false} is VALID [2022-04-14 15:54:23,754 INFO L290 TraceCheckUtils]: 81: Hoare triple {14426#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14430#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:54:23,755 INFO L272 TraceCheckUtils]: 80: Hoare triple {14446#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {14426#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:54:23,755 INFO L290 TraceCheckUtils]: 79: Hoare triple {14450#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !(0 != ~b~0); {14446#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} is VALID [2022-04-14 15:54:23,756 INFO L290 TraceCheckUtils]: 78: Hoare triple {14450#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !!(#t~post6 < 100);havoc #t~post6; {14450#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-14 15:54:23,756 INFO L290 TraceCheckUtils]: 77: Hoare triple {14450#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14450#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-14 15:54:25,618 INFO L290 TraceCheckUtils]: 76: Hoare triple {14460#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {14450#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-14 15:54:25,619 INFO L290 TraceCheckUtils]: 75: Hoare triple {14460#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} assume !(~c~0 >= ~b~0); {14460#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-14 15:54:25,620 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14173#true} {14460#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #92#return; {14460#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-14 15:54:25,620 INFO L290 TraceCheckUtils]: 73: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-14 15:54:25,620 INFO L290 TraceCheckUtils]: 72: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-14 15:54:25,620 INFO L290 TraceCheckUtils]: 71: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-14 15:54:25,620 INFO L272 TraceCheckUtils]: 70: Hoare triple {14460#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14173#true} is VALID [2022-04-14 15:54:25,620 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {14173#true} {14460#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #90#return; {14460#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-14 15:54:25,621 INFO L290 TraceCheckUtils]: 68: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-14 15:54:25,621 INFO L290 TraceCheckUtils]: 67: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-14 15:54:25,621 INFO L290 TraceCheckUtils]: 66: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-14 15:54:25,621 INFO L272 TraceCheckUtils]: 65: Hoare triple {14460#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14173#true} is VALID [2022-04-14 15:54:25,621 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14368#(not (= |__VERIFIER_assert_#in~cond| 0))} {14497#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #88#return; {14460#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-14 15:54:25,622 INFO L290 TraceCheckUtils]: 63: Hoare triple {14368#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14368#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:54:25,622 INFO L290 TraceCheckUtils]: 62: Hoare triple {14507#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {14368#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:54:25,622 INFO L290 TraceCheckUtils]: 61: Hoare triple {14173#true} ~cond := #in~cond; {14507#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:54:25,622 INFO L272 TraceCheckUtils]: 60: Hoare triple {14497#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14173#true} is VALID [2022-04-14 15:54:25,623 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14173#true} {14497#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #86#return; {14497#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-14 15:54:25,623 INFO L290 TraceCheckUtils]: 58: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-14 15:54:25,623 INFO L290 TraceCheckUtils]: 57: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-14 15:54:25,623 INFO L290 TraceCheckUtils]: 56: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-14 15:54:25,623 INFO L272 TraceCheckUtils]: 55: Hoare triple {14497#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14173#true} is VALID [2022-04-14 15:54:25,623 INFO L290 TraceCheckUtils]: 54: Hoare triple {14497#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} assume !!(#t~post7 < 100);havoc #t~post7; {14497#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-14 15:54:25,624 INFO L290 TraceCheckUtils]: 53: Hoare triple {14497#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14497#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-14 15:54:25,818 INFO L290 TraceCheckUtils]: 52: Hoare triple {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {14497#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-14 15:54:25,819 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {14173#true} {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #92#return; {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-14 15:54:25,819 INFO L290 TraceCheckUtils]: 50: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-14 15:54:25,819 INFO L290 TraceCheckUtils]: 49: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-14 15:54:25,819 INFO L290 TraceCheckUtils]: 48: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-14 15:54:25,819 INFO L272 TraceCheckUtils]: 47: Hoare triple {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14173#true} is VALID [2022-04-14 15:54:25,820 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {14173#true} {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #90#return; {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-14 15:54:25,820 INFO L290 TraceCheckUtils]: 45: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-14 15:54:25,820 INFO L290 TraceCheckUtils]: 44: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-14 15:54:25,820 INFO L290 TraceCheckUtils]: 43: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-14 15:54:25,820 INFO L272 TraceCheckUtils]: 42: Hoare triple {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14173#true} is VALID [2022-04-14 15:54:25,821 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14173#true} {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #88#return; {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-14 15:54:25,821 INFO L290 TraceCheckUtils]: 40: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-14 15:54:25,821 INFO L290 TraceCheckUtils]: 39: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-14 15:54:25,821 INFO L290 TraceCheckUtils]: 38: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-14 15:54:25,821 INFO L272 TraceCheckUtils]: 37: Hoare triple {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14173#true} is VALID [2022-04-14 15:54:25,821 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14173#true} {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #86#return; {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-14 15:54:25,821 INFO L290 TraceCheckUtils]: 35: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-14 15:54:25,822 INFO L290 TraceCheckUtils]: 34: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-14 15:54:25,822 INFO L290 TraceCheckUtils]: 33: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-14 15:54:25,822 INFO L272 TraceCheckUtils]: 32: Hoare triple {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14173#true} is VALID [2022-04-14 15:54:25,822 INFO L290 TraceCheckUtils]: 31: Hoare triple {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} assume !!(#t~post7 < 100);havoc #t~post7; {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-14 15:54:25,823 INFO L290 TraceCheckUtils]: 30: Hoare triple {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-14 15:54:25,824 INFO L290 TraceCheckUtils]: 29: Hoare triple {14605#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {14535#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-14 15:54:25,824 INFO L290 TraceCheckUtils]: 28: Hoare triple {14605#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} assume !!(#t~post6 < 100);havoc #t~post6; {14605#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} is VALID [2022-04-14 15:54:25,824 INFO L290 TraceCheckUtils]: 27: Hoare triple {14605#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14605#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} is VALID [2022-04-14 15:54:25,825 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14173#true} {14605#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} #84#return; {14605#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} is VALID [2022-04-14 15:54:25,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-14 15:54:25,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-14 15:54:25,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-14 15:54:25,825 INFO L272 TraceCheckUtils]: 22: Hoare triple {14605#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {14173#true} is VALID [2022-04-14 15:54:25,826 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14173#true} {14605#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} #82#return; {14605#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} is VALID [2022-04-14 15:54:25,826 INFO L290 TraceCheckUtils]: 20: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-14 15:54:25,826 INFO L290 TraceCheckUtils]: 19: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-14 15:54:25,826 INFO L290 TraceCheckUtils]: 18: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-14 15:54:25,826 INFO L272 TraceCheckUtils]: 17: Hoare triple {14605#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {14173#true} is VALID [2022-04-14 15:54:25,827 INFO L290 TraceCheckUtils]: 16: Hoare triple {14173#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {14605#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} is VALID [2022-04-14 15:54:25,827 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14173#true} {14173#true} #80#return; {14173#true} is VALID [2022-04-14 15:54:25,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-14 15:54:25,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-14 15:54:25,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-14 15:54:25,827 INFO L272 TraceCheckUtils]: 11: Hoare triple {14173#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14173#true} is VALID [2022-04-14 15:54:25,827 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14173#true} {14173#true} #78#return; {14173#true} is VALID [2022-04-14 15:54:25,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-14 15:54:25,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {14173#true} assume !(0 == ~cond); {14173#true} is VALID [2022-04-14 15:54:25,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {14173#true} ~cond := #in~cond; {14173#true} is VALID [2022-04-14 15:54:25,827 INFO L272 TraceCheckUtils]: 6: Hoare triple {14173#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {14173#true} is VALID [2022-04-14 15:54:25,827 INFO L290 TraceCheckUtils]: 5: Hoare triple {14173#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {14173#true} is VALID [2022-04-14 15:54:25,827 INFO L272 TraceCheckUtils]: 4: Hoare triple {14173#true} call #t~ret8 := main(); {14173#true} is VALID [2022-04-14 15:54:25,827 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14173#true} {14173#true} #98#return; {14173#true} is VALID [2022-04-14 15:54:25,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {14173#true} assume true; {14173#true} is VALID [2022-04-14 15:54:25,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {14173#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14173#true} is VALID [2022-04-14 15:54:25,827 INFO L272 TraceCheckUtils]: 0: Hoare triple {14173#true} call ULTIMATE.init(); {14173#true} is VALID [2022-04-14 15:54:25,828 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-14 15:54:25,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:54:25,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717773185] [2022-04-14 15:54:25,828 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:54:25,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058330394] [2022-04-14 15:54:25,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058330394] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:54:25,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:54:25,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-04-14 15:54:25,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467457745] [2022-04-14 15:54:25,828 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:54:25,829 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) Word has length 84 [2022-04-14 15:54:25,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:54:25,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-14 15:54:26,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:54:26,427 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-14 15:54:26,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:54:26,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-14 15:54:26,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-04-14 15:54:26,428 INFO L87 Difference]: Start difference. First operand 330 states and 402 transitions. Second operand has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-14 15:54:33,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:54:33,624 INFO L93 Difference]: Finished difference Result 392 states and 488 transitions. [2022-04-14 15:54:33,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-14 15:54:33,624 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) Word has length 84 [2022-04-14 15:54:33,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:54:33,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-14 15:54:33,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 173 transitions. [2022-04-14 15:54:33,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-14 15:54:33,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 173 transitions. [2022-04-14 15:54:33,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 173 transitions. [2022-04-14 15:54:34,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:54:34,954 INFO L225 Difference]: With dead ends: 392 [2022-04-14 15:54:34,955 INFO L226 Difference]: Without dead ends: 377 [2022-04-14 15:54:34,955 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=248, Invalid=1084, Unknown=0, NotChecked=0, Total=1332 [2022-04-14 15:54:34,956 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 88 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-14 15:54:34,956 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 345 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-14 15:54:34,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-04-14 15:54:35,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 368. [2022-04-14 15:54:35,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:54:35,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 377 states. Second operand has 368 states, 247 states have (on average 1.1902834008097165) internal successors, (294), 252 states have internal predecessors, (294), 84 states have call successors, (84), 37 states have call predecessors, (84), 36 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-14 15:54:35,232 INFO L74 IsIncluded]: Start isIncluded. First operand 377 states. Second operand has 368 states, 247 states have (on average 1.1902834008097165) internal successors, (294), 252 states have internal predecessors, (294), 84 states have call successors, (84), 37 states have call predecessors, (84), 36 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-14 15:54:35,232 INFO L87 Difference]: Start difference. First operand 377 states. Second operand has 368 states, 247 states have (on average 1.1902834008097165) internal successors, (294), 252 states have internal predecessors, (294), 84 states have call successors, (84), 37 states have call predecessors, (84), 36 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-14 15:54:35,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:54:35,240 INFO L93 Difference]: Finished difference Result 377 states and 469 transitions. [2022-04-14 15:54:35,240 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 469 transitions. [2022-04-14 15:54:35,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:54:35,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:54:35,241 INFO L74 IsIncluded]: Start isIncluded. First operand has 368 states, 247 states have (on average 1.1902834008097165) internal successors, (294), 252 states have internal predecessors, (294), 84 states have call successors, (84), 37 states have call predecessors, (84), 36 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) Second operand 377 states. [2022-04-14 15:54:35,242 INFO L87 Difference]: Start difference. First operand has 368 states, 247 states have (on average 1.1902834008097165) internal successors, (294), 252 states have internal predecessors, (294), 84 states have call successors, (84), 37 states have call predecessors, (84), 36 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) Second operand 377 states. [2022-04-14 15:54:35,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:54:35,249 INFO L93 Difference]: Finished difference Result 377 states and 469 transitions. [2022-04-14 15:54:35,249 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 469 transitions. [2022-04-14 15:54:35,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:54:35,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:54:35,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:54:35,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:54:35,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 247 states have (on average 1.1902834008097165) internal successors, (294), 252 states have internal predecessors, (294), 84 states have call successors, (84), 37 states have call predecessors, (84), 36 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-14 15:54:35,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 460 transitions. [2022-04-14 15:54:35,258 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 460 transitions. Word has length 84 [2022-04-14 15:54:35,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:54:35,258 INFO L478 AbstractCegarLoop]: Abstraction has 368 states and 460 transitions. [2022-04-14 15:54:35,259 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-14 15:54:35,259 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 460 transitions. [2022-04-14 15:54:35,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-14 15:54:35,259 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:54:35,259 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:54:35,276 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-14 15:54:35,476 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-14 15:54:35,477 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:54:35,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:54:35,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1415088729, now seen corresponding path program 1 times [2022-04-14 15:54:35,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:54:35,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003957509] [2022-04-14 15:54:35,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:54:35,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:54:35,487 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:54:35,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1509893078] [2022-04-14 15:54:35,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:54:35,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:54:35,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:54:35,488 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-14 15:54:35,489 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-14 15:54:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:54:35,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-14 15:54:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:54:35,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:54:44,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {16583#true} call ULTIMATE.init(); {16583#true} is VALID [2022-04-14 15:54:44,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {16583#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16583#true} is VALID [2022-04-14 15:54:44,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-14 15:54:44,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16583#true} {16583#true} #98#return; {16583#true} is VALID [2022-04-14 15:54:44,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {16583#true} call #t~ret8 := main(); {16583#true} is VALID [2022-04-14 15:54:44,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {16583#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {16583#true} is VALID [2022-04-14 15:54:44,744 INFO L272 TraceCheckUtils]: 6: Hoare triple {16583#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16583#true} is VALID [2022-04-14 15:54:44,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-14 15:54:44,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-14 15:54:44,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-14 15:54:44,744 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16583#true} {16583#true} #78#return; {16583#true} is VALID [2022-04-14 15:54:44,744 INFO L272 TraceCheckUtils]: 11: Hoare triple {16583#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16583#true} is VALID [2022-04-14 15:54:44,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-14 15:54:44,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-14 15:54:44,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-14 15:54:44,744 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16583#true} {16583#true} #80#return; {16583#true} is VALID [2022-04-14 15:54:44,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {16583#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {16636#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 15:54:44,745 INFO L272 TraceCheckUtils]: 17: Hoare triple {16636#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {16583#true} is VALID [2022-04-14 15:54:44,745 INFO L290 TraceCheckUtils]: 18: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-14 15:54:44,745 INFO L290 TraceCheckUtils]: 19: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-14 15:54:44,745 INFO L290 TraceCheckUtils]: 20: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-14 15:54:44,746 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {16583#true} {16636#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #82#return; {16636#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 15:54:44,746 INFO L272 TraceCheckUtils]: 22: Hoare triple {16636#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {16583#true} is VALID [2022-04-14 15:54:44,746 INFO L290 TraceCheckUtils]: 23: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-14 15:54:44,746 INFO L290 TraceCheckUtils]: 24: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-14 15:54:44,746 INFO L290 TraceCheckUtils]: 25: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-14 15:54:44,747 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16583#true} {16636#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #84#return; {16636#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 15:54:44,747 INFO L290 TraceCheckUtils]: 27: Hoare triple {16636#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16636#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 15:54:44,747 INFO L290 TraceCheckUtils]: 28: Hoare triple {16636#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 100);havoc #t~post6; {16636#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 15:54:44,748 INFO L290 TraceCheckUtils]: 29: Hoare triple {16636#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 15:54:44,748 INFO L290 TraceCheckUtils]: 30: Hoare triple {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 15:54:44,748 INFO L290 TraceCheckUtils]: 31: Hoare triple {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} assume !!(#t~post7 < 100);havoc #t~post7; {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 15:54:44,749 INFO L272 TraceCheckUtils]: 32: Hoare triple {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16583#true} is VALID [2022-04-14 15:54:44,749 INFO L290 TraceCheckUtils]: 33: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-14 15:54:44,749 INFO L290 TraceCheckUtils]: 34: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-14 15:54:44,749 INFO L290 TraceCheckUtils]: 35: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-14 15:54:44,749 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16583#true} {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} #86#return; {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 15:54:44,749 INFO L272 TraceCheckUtils]: 37: Hoare triple {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16583#true} is VALID [2022-04-14 15:54:44,749 INFO L290 TraceCheckUtils]: 38: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-14 15:54:44,750 INFO L290 TraceCheckUtils]: 39: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-14 15:54:44,750 INFO L290 TraceCheckUtils]: 40: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-14 15:54:44,750 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {16583#true} {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} #88#return; {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 15:54:44,750 INFO L272 TraceCheckUtils]: 42: Hoare triple {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16583#true} is VALID [2022-04-14 15:54:44,750 INFO L290 TraceCheckUtils]: 43: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-14 15:54:44,750 INFO L290 TraceCheckUtils]: 44: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-14 15:54:44,750 INFO L290 TraceCheckUtils]: 45: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-14 15:54:44,751 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {16583#true} {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} #90#return; {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 15:54:44,751 INFO L272 TraceCheckUtils]: 47: Hoare triple {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16583#true} is VALID [2022-04-14 15:54:44,751 INFO L290 TraceCheckUtils]: 48: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-14 15:54:44,751 INFO L290 TraceCheckUtils]: 49: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-14 15:54:44,751 INFO L290 TraceCheckUtils]: 50: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-14 15:54:44,752 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {16583#true} {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} #92#return; {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 15:54:44,752 INFO L290 TraceCheckUtils]: 52: Hoare triple {16676#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:54:44,753 INFO L290 TraceCheckUtils]: 53: Hoare triple {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:54:44,753 INFO L290 TraceCheckUtils]: 54: Hoare triple {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:54:44,753 INFO L272 TraceCheckUtils]: 55: Hoare triple {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16583#true} is VALID [2022-04-14 15:54:44,753 INFO L290 TraceCheckUtils]: 56: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-14 15:54:44,753 INFO L290 TraceCheckUtils]: 57: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-14 15:54:44,753 INFO L290 TraceCheckUtils]: 58: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-14 15:54:44,754 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16583#true} {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:54:44,754 INFO L272 TraceCheckUtils]: 60: Hoare triple {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16583#true} is VALID [2022-04-14 15:54:44,754 INFO L290 TraceCheckUtils]: 61: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-14 15:54:44,754 INFO L290 TraceCheckUtils]: 62: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-14 15:54:44,754 INFO L290 TraceCheckUtils]: 63: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-14 15:54:44,755 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {16583#true} {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:54:44,755 INFO L272 TraceCheckUtils]: 65: Hoare triple {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16583#true} is VALID [2022-04-14 15:54:44,755 INFO L290 TraceCheckUtils]: 66: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-14 15:54:44,755 INFO L290 TraceCheckUtils]: 67: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-14 15:54:44,755 INFO L290 TraceCheckUtils]: 68: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-14 15:54:44,755 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {16583#true} {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:54:44,756 INFO L272 TraceCheckUtils]: 70: Hoare triple {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16583#true} is VALID [2022-04-14 15:54:44,756 INFO L290 TraceCheckUtils]: 71: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-14 15:54:44,756 INFO L290 TraceCheckUtils]: 72: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-14 15:54:44,756 INFO L290 TraceCheckUtils]: 73: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-14 15:54:44,756 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16583#true} {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #92#return; {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:54:44,757 INFO L290 TraceCheckUtils]: 75: Hoare triple {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !(~c~0 >= ~b~0); {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:54:44,758 INFO L290 TraceCheckUtils]: 76: Hoare triple {16746#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~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; {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:54:44,758 INFO L290 TraceCheckUtils]: 77: Hoare triple {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:54:44,758 INFO L290 TraceCheckUtils]: 78: Hoare triple {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post6 < 100);havoc #t~post6; {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:54:44,759 INFO L290 TraceCheckUtils]: 79: Hoare triple {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:54:44,759 INFO L290 TraceCheckUtils]: 80: Hoare triple {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:54:44,760 INFO L290 TraceCheckUtils]: 81: Hoare triple {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:54:44,760 INFO L272 TraceCheckUtils]: 82: Hoare triple {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16583#true} is VALID [2022-04-14 15:54:44,760 INFO L290 TraceCheckUtils]: 83: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-14 15:54:44,760 INFO L290 TraceCheckUtils]: 84: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-14 15:54:44,760 INFO L290 TraceCheckUtils]: 85: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-14 15:54:44,760 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {16583#true} {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:54:44,760 INFO L272 TraceCheckUtils]: 87: Hoare triple {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16583#true} is VALID [2022-04-14 15:54:44,760 INFO L290 TraceCheckUtils]: 88: Hoare triple {16583#true} ~cond := #in~cond; {16583#true} is VALID [2022-04-14 15:54:44,760 INFO L290 TraceCheckUtils]: 89: Hoare triple {16583#true} assume !(0 == ~cond); {16583#true} is VALID [2022-04-14 15:54:44,761 INFO L290 TraceCheckUtils]: 90: Hoare triple {16583#true} assume true; {16583#true} is VALID [2022-04-14 15:54:44,761 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {16583#true} {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:54:44,761 INFO L272 TraceCheckUtils]: 92: Hoare triple {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16583#true} is VALID [2022-04-14 15:54:44,761 INFO L290 TraceCheckUtils]: 93: Hoare triple {16583#true} ~cond := #in~cond; {16871#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:54:44,762 INFO L290 TraceCheckUtils]: 94: Hoare triple {16871#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {16875#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:54:44,762 INFO L290 TraceCheckUtils]: 95: Hoare triple {16875#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16875#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:54:44,763 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {16875#(not (= |__VERIFIER_assert_#in~cond| 0))} {16819#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {16882#(and (<= (+ main_~s~0 1) 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:54:44,788 INFO L272 TraceCheckUtils]: 97: Hoare triple {16882#(and (<= (+ main_~s~0 1) 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16886#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:54:44,789 INFO L290 TraceCheckUtils]: 98: Hoare triple {16886#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16890#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:54:44,789 INFO L290 TraceCheckUtils]: 99: Hoare triple {16890#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16584#false} is VALID [2022-04-14 15:54:44,789 INFO L290 TraceCheckUtils]: 100: Hoare triple {16584#false} assume !false; {16584#false} is VALID [2022-04-14 15:54:44,790 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 51 proven. 23 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2022-04-14 15:54:44,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:55:20,709 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-14 15:55:21,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:55:21,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003957509] [2022-04-14 15:55:21,391 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:55:21,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509893078] [2022-04-14 15:55:21,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509893078] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:55:21,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 15:55:21,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-14 15:55:21,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176934860] [2022-04-14 15:55:21,391 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 15:55:21,392 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) Word has length 101 [2022-04-14 15:55:21,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:55:21,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-14 15:55:21,479 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-14 15:55:21,479 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-14 15:55:21,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:55:21,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-14 15:55:21,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-04-14 15:55:21,480 INFO L87 Difference]: Start difference. First operand 368 states and 460 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-14 15:55:34,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:55:34,789 INFO L93 Difference]: Finished difference Result 377 states and 468 transitions. [2022-04-14 15:55:34,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-14 15:55:34,789 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) Word has length 101 [2022-04-14 15:55:34,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:55:34,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-14 15:55:34,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2022-04-14 15:55:34,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-14 15:55:34,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2022-04-14 15:55:34,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 116 transitions. [2022-04-14 15:55:34,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:55:34,999 INFO L225 Difference]: With dead ends: 377 [2022-04-14 15:55:34,999 INFO L226 Difference]: Without dead ends: 375 [2022-04-14 15:55:34,999 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-04-14 15:55:35,000 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 29 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-14 15:55:35,000 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 315 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-14 15:55:35,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-04-14 15:55:35,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 372. [2022-04-14 15:55:35,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:55:35,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 375 states. Second operand has 372 states, 250 states have (on average 1.184) internal successors, (296), 255 states have internal predecessors, (296), 84 states have call successors, (84), 38 states have call predecessors, (84), 37 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-14 15:55:35,313 INFO L74 IsIncluded]: Start isIncluded. First operand 375 states. Second operand has 372 states, 250 states have (on average 1.184) internal successors, (296), 255 states have internal predecessors, (296), 84 states have call successors, (84), 38 states have call predecessors, (84), 37 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-14 15:55:35,313 INFO L87 Difference]: Start difference. First operand 375 states. Second operand has 372 states, 250 states have (on average 1.184) internal successors, (296), 255 states have internal predecessors, (296), 84 states have call successors, (84), 38 states have call predecessors, (84), 37 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-14 15:55:35,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:55:35,321 INFO L93 Difference]: Finished difference Result 375 states and 465 transitions. [2022-04-14 15:55:35,321 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 465 transitions. [2022-04-14 15:55:35,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:55:35,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:55:35,322 INFO L74 IsIncluded]: Start isIncluded. First operand has 372 states, 250 states have (on average 1.184) internal successors, (296), 255 states have internal predecessors, (296), 84 states have call successors, (84), 38 states have call predecessors, (84), 37 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) Second operand 375 states. [2022-04-14 15:55:35,323 INFO L87 Difference]: Start difference. First operand has 372 states, 250 states have (on average 1.184) internal successors, (296), 255 states have internal predecessors, (296), 84 states have call successors, (84), 38 states have call predecessors, (84), 37 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) Second operand 375 states. [2022-04-14 15:55:35,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:55:35,329 INFO L93 Difference]: Finished difference Result 375 states and 465 transitions. [2022-04-14 15:55:35,329 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 465 transitions. [2022-04-14 15:55:35,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:55:35,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:55:35,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:55:35,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:55:35,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 250 states have (on average 1.184) internal successors, (296), 255 states have internal predecessors, (296), 84 states have call successors, (84), 38 states have call predecessors, (84), 37 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-14 15:55:35,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 462 transitions. [2022-04-14 15:55:35,339 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 462 transitions. Word has length 101 [2022-04-14 15:55:35,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:55:35,339 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 462 transitions. [2022-04-14 15:55:35,339 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-14 15:55:35,339 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 462 transitions. [2022-04-14 15:55:35,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-14 15:55:35,340 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:55:35,340 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:55:35,359 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-14 15:55:35,557 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-14 15:55:35,557 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:55:35,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:55:35,558 INFO L85 PathProgramCache]: Analyzing trace with hash -2076615365, now seen corresponding path program 4 times [2022-04-14 15:55:35,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:55:35,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231289539] [2022-04-14 15:55:35,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:55:35,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:55:35,577 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:55:35,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1923545396] [2022-04-14 15:55:35,577 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-14 15:55:35,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:55:35,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:55:35,579 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-14 15:55:35,580 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-14 15:55:35,635 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-14 15:55:35,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:55:35,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-14 15:55:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:55:35,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:55:35,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {18820#true} call ULTIMATE.init(); {18820#true} is VALID [2022-04-14 15:55:35,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {18820#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18820#true} is VALID [2022-04-14 15:55:35,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {18820#true} assume true; {18820#true} is VALID [2022-04-14 15:55:35,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18820#true} {18820#true} #98#return; {18820#true} is VALID [2022-04-14 15:55:35,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {18820#true} call #t~ret8 := main(); {18820#true} is VALID [2022-04-14 15:55:35,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {18820#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {18820#true} is VALID [2022-04-14 15:55:35,865 INFO L272 TraceCheckUtils]: 6: Hoare triple {18820#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18820#true} is VALID [2022-04-14 15:55:35,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {18820#true} ~cond := #in~cond; {18820#true} is VALID [2022-04-14 15:55:35,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {18820#true} assume !(0 == ~cond); {18820#true} is VALID [2022-04-14 15:55:35,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {18820#true} assume true; {18820#true} is VALID [2022-04-14 15:55:35,865 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18820#true} {18820#true} #78#return; {18820#true} is VALID [2022-04-14 15:55:35,866 INFO L272 TraceCheckUtils]: 11: Hoare triple {18820#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18820#true} is VALID [2022-04-14 15:55:35,866 INFO L290 TraceCheckUtils]: 12: Hoare triple {18820#true} ~cond := #in~cond; {18820#true} is VALID [2022-04-14 15:55:35,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {18820#true} assume !(0 == ~cond); {18820#true} is VALID [2022-04-14 15:55:35,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {18820#true} assume true; {18820#true} is VALID [2022-04-14 15:55:35,866 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18820#true} {18820#true} #80#return; {18820#true} is VALID [2022-04-14 15:55:35,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {18820#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {18820#true} is VALID [2022-04-14 15:55:35,866 INFO L272 TraceCheckUtils]: 17: Hoare triple {18820#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {18820#true} is VALID [2022-04-14 15:55:35,866 INFO L290 TraceCheckUtils]: 18: Hoare triple {18820#true} ~cond := #in~cond; {18820#true} is VALID [2022-04-14 15:55:35,866 INFO L290 TraceCheckUtils]: 19: Hoare triple {18820#true} assume !(0 == ~cond); {18820#true} is VALID [2022-04-14 15:55:35,866 INFO L290 TraceCheckUtils]: 20: Hoare triple {18820#true} assume true; {18820#true} is VALID [2022-04-14 15:55:35,866 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {18820#true} {18820#true} #82#return; {18820#true} is VALID [2022-04-14 15:55:35,866 INFO L272 TraceCheckUtils]: 22: Hoare triple {18820#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {18820#true} is VALID [2022-04-14 15:55:35,866 INFO L290 TraceCheckUtils]: 23: Hoare triple {18820#true} ~cond := #in~cond; {18820#true} is VALID [2022-04-14 15:55:35,866 INFO L290 TraceCheckUtils]: 24: Hoare triple {18820#true} assume !(0 == ~cond); {18820#true} is VALID [2022-04-14 15:55:35,866 INFO L290 TraceCheckUtils]: 25: Hoare triple {18820#true} assume true; {18820#true} is VALID [2022-04-14 15:55:35,866 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18820#true} {18820#true} #84#return; {18820#true} is VALID [2022-04-14 15:55:35,866 INFO L290 TraceCheckUtils]: 27: Hoare triple {18820#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18820#true} is VALID [2022-04-14 15:55:35,866 INFO L290 TraceCheckUtils]: 28: Hoare triple {18820#true} assume !!(#t~post6 < 100);havoc #t~post6; {18820#true} is VALID [2022-04-14 15:55:35,866 INFO L290 TraceCheckUtils]: 29: Hoare triple {18820#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {18820#true} is VALID [2022-04-14 15:55:35,866 INFO L290 TraceCheckUtils]: 30: Hoare triple {18820#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18820#true} is VALID [2022-04-14 15:55:35,866 INFO L290 TraceCheckUtils]: 31: Hoare triple {18820#true} assume !!(#t~post7 < 100);havoc #t~post7; {18820#true} is VALID [2022-04-14 15:55:35,867 INFO L272 TraceCheckUtils]: 32: Hoare triple {18820#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18820#true} is VALID [2022-04-14 15:55:35,867 INFO L290 TraceCheckUtils]: 33: Hoare triple {18820#true} ~cond := #in~cond; {18820#true} is VALID [2022-04-14 15:55:35,867 INFO L290 TraceCheckUtils]: 34: Hoare triple {18820#true} assume !(0 == ~cond); {18820#true} is VALID [2022-04-14 15:55:35,867 INFO L290 TraceCheckUtils]: 35: Hoare triple {18820#true} assume true; {18820#true} is VALID [2022-04-14 15:55:35,867 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18820#true} {18820#true} #86#return; {18820#true} is VALID [2022-04-14 15:55:35,867 INFO L272 TraceCheckUtils]: 37: Hoare triple {18820#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18820#true} is VALID [2022-04-14 15:55:35,867 INFO L290 TraceCheckUtils]: 38: Hoare triple {18820#true} ~cond := #in~cond; {18820#true} is VALID [2022-04-14 15:55:35,867 INFO L290 TraceCheckUtils]: 39: Hoare triple {18820#true} assume !(0 == ~cond); {18820#true} is VALID [2022-04-14 15:55:35,867 INFO L290 TraceCheckUtils]: 40: Hoare triple {18820#true} assume true; {18820#true} is VALID [2022-04-14 15:55:35,867 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18820#true} {18820#true} #88#return; {18820#true} is VALID [2022-04-14 15:55:35,867 INFO L272 TraceCheckUtils]: 42: Hoare triple {18820#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18820#true} is VALID [2022-04-14 15:55:35,867 INFO L290 TraceCheckUtils]: 43: Hoare triple {18820#true} ~cond := #in~cond; {18820#true} is VALID [2022-04-14 15:55:35,867 INFO L290 TraceCheckUtils]: 44: Hoare triple {18820#true} assume !(0 == ~cond); {18820#true} is VALID [2022-04-14 15:55:35,867 INFO L290 TraceCheckUtils]: 45: Hoare triple {18820#true} assume true; {18820#true} is VALID [2022-04-14 15:55:35,867 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {18820#true} {18820#true} #90#return; {18820#true} is VALID [2022-04-14 15:55:35,867 INFO L272 TraceCheckUtils]: 47: Hoare triple {18820#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {18820#true} is VALID [2022-04-14 15:55:35,867 INFO L290 TraceCheckUtils]: 48: Hoare triple {18820#true} ~cond := #in~cond; {18820#true} is VALID [2022-04-14 15:55:35,867 INFO L290 TraceCheckUtils]: 49: Hoare triple {18820#true} assume !(0 == ~cond); {18820#true} is VALID [2022-04-14 15:55:35,867 INFO L290 TraceCheckUtils]: 50: Hoare triple {18820#true} assume true; {18820#true} is VALID [2022-04-14 15:55:35,867 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {18820#true} {18820#true} #92#return; {18820#true} is VALID [2022-04-14 15:55:35,868 INFO L290 TraceCheckUtils]: 52: Hoare triple {18820#true} assume !(~c~0 >= ~b~0); {18981#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-14 15:55:35,868 INFO L290 TraceCheckUtils]: 53: Hoare triple {18981#(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; {18985#(< main_~b~0 main_~a~0)} is VALID [2022-04-14 15:55:35,868 INFO L290 TraceCheckUtils]: 54: Hoare triple {18985#(< main_~b~0 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18985#(< main_~b~0 main_~a~0)} is VALID [2022-04-14 15:55:35,869 INFO L290 TraceCheckUtils]: 55: Hoare triple {18985#(< main_~b~0 main_~a~0)} assume !!(#t~post6 < 100);havoc #t~post6; {18985#(< main_~b~0 main_~a~0)} is VALID [2022-04-14 15:55:35,869 INFO L290 TraceCheckUtils]: 56: Hoare triple {18985#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {18995#(< main_~b~0 main_~c~0)} is VALID [2022-04-14 15:55:35,869 INFO L290 TraceCheckUtils]: 57: Hoare triple {18995#(< main_~b~0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18995#(< main_~b~0 main_~c~0)} is VALID [2022-04-14 15:55:35,869 INFO L290 TraceCheckUtils]: 58: Hoare triple {18995#(< main_~b~0 main_~c~0)} assume !!(#t~post7 < 100);havoc #t~post7; {18995#(< main_~b~0 main_~c~0)} is VALID [2022-04-14 15:55:35,870 INFO L272 TraceCheckUtils]: 59: Hoare triple {18995#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18820#true} is VALID [2022-04-14 15:55:35,870 INFO L290 TraceCheckUtils]: 60: Hoare triple {18820#true} ~cond := #in~cond; {18820#true} is VALID [2022-04-14 15:55:35,870 INFO L290 TraceCheckUtils]: 61: Hoare triple {18820#true} assume !(0 == ~cond); {18820#true} is VALID [2022-04-14 15:55:35,870 INFO L290 TraceCheckUtils]: 62: Hoare triple {18820#true} assume true; {18820#true} is VALID [2022-04-14 15:55:35,870 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {18820#true} {18995#(< main_~b~0 main_~c~0)} #86#return; {18995#(< main_~b~0 main_~c~0)} is VALID [2022-04-14 15:55:35,870 INFO L272 TraceCheckUtils]: 64: Hoare triple {18995#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18820#true} is VALID [2022-04-14 15:55:35,870 INFO L290 TraceCheckUtils]: 65: Hoare triple {18820#true} ~cond := #in~cond; {18820#true} is VALID [2022-04-14 15:55:35,870 INFO L290 TraceCheckUtils]: 66: Hoare triple {18820#true} assume !(0 == ~cond); {18820#true} is VALID [2022-04-14 15:55:35,870 INFO L290 TraceCheckUtils]: 67: Hoare triple {18820#true} assume true; {18820#true} is VALID [2022-04-14 15:55:35,871 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {18820#true} {18995#(< main_~b~0 main_~c~0)} #88#return; {18995#(< main_~b~0 main_~c~0)} is VALID [2022-04-14 15:55:35,871 INFO L272 TraceCheckUtils]: 69: Hoare triple {18995#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18820#true} is VALID [2022-04-14 15:55:35,871 INFO L290 TraceCheckUtils]: 70: Hoare triple {18820#true} ~cond := #in~cond; {18820#true} is VALID [2022-04-14 15:55:35,871 INFO L290 TraceCheckUtils]: 71: Hoare triple {18820#true} assume !(0 == ~cond); {18820#true} is VALID [2022-04-14 15:55:35,871 INFO L290 TraceCheckUtils]: 72: Hoare triple {18820#true} assume true; {18820#true} is VALID [2022-04-14 15:55:35,872 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {18820#true} {18995#(< main_~b~0 main_~c~0)} #90#return; {18995#(< main_~b~0 main_~c~0)} is VALID [2022-04-14 15:55:35,872 INFO L272 TraceCheckUtils]: 74: Hoare triple {18995#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {18820#true} is VALID [2022-04-14 15:55:35,872 INFO L290 TraceCheckUtils]: 75: Hoare triple {18820#true} ~cond := #in~cond; {18820#true} is VALID [2022-04-14 15:55:35,872 INFO L290 TraceCheckUtils]: 76: Hoare triple {18820#true} assume !(0 == ~cond); {18820#true} is VALID [2022-04-14 15:55:35,872 INFO L290 TraceCheckUtils]: 77: Hoare triple {18820#true} assume true; {18820#true} is VALID [2022-04-14 15:55:35,872 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {18820#true} {18995#(< main_~b~0 main_~c~0)} #92#return; {18995#(< main_~b~0 main_~c~0)} is VALID [2022-04-14 15:55:35,873 INFO L290 TraceCheckUtils]: 79: Hoare triple {18995#(< main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {18821#false} is VALID [2022-04-14 15:55:35,873 INFO L290 TraceCheckUtils]: 80: Hoare triple {18821#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; {18821#false} is VALID [2022-04-14 15:55:35,873 INFO L290 TraceCheckUtils]: 81: Hoare triple {18821#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18821#false} is VALID [2022-04-14 15:55:35,873 INFO L290 TraceCheckUtils]: 82: Hoare triple {18821#false} assume !!(#t~post6 < 100);havoc #t~post6; {18821#false} is VALID [2022-04-14 15:55:35,873 INFO L290 TraceCheckUtils]: 83: Hoare triple {18821#false} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {18821#false} is VALID [2022-04-14 15:55:35,873 INFO L290 TraceCheckUtils]: 84: Hoare triple {18821#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18821#false} is VALID [2022-04-14 15:55:35,873 INFO L290 TraceCheckUtils]: 85: Hoare triple {18821#false} assume !!(#t~post7 < 100);havoc #t~post7; {18821#false} is VALID [2022-04-14 15:55:35,873 INFO L272 TraceCheckUtils]: 86: Hoare triple {18821#false} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18821#false} is VALID [2022-04-14 15:55:35,873 INFO L290 TraceCheckUtils]: 87: Hoare triple {18821#false} ~cond := #in~cond; {18821#false} is VALID [2022-04-14 15:55:35,873 INFO L290 TraceCheckUtils]: 88: Hoare triple {18821#false} assume !(0 == ~cond); {18821#false} is VALID [2022-04-14 15:55:35,873 INFO L290 TraceCheckUtils]: 89: Hoare triple {18821#false} assume true; {18821#false} is VALID [2022-04-14 15:55:35,873 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {18821#false} {18821#false} #86#return; {18821#false} is VALID [2022-04-14 15:55:35,874 INFO L272 TraceCheckUtils]: 91: Hoare triple {18821#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18821#false} is VALID [2022-04-14 15:55:35,874 INFO L290 TraceCheckUtils]: 92: Hoare triple {18821#false} ~cond := #in~cond; {18821#false} is VALID [2022-04-14 15:55:35,874 INFO L290 TraceCheckUtils]: 93: Hoare triple {18821#false} assume !(0 == ~cond); {18821#false} is VALID [2022-04-14 15:55:35,874 INFO L290 TraceCheckUtils]: 94: Hoare triple {18821#false} assume true; {18821#false} is VALID [2022-04-14 15:55:35,874 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {18821#false} {18821#false} #88#return; {18821#false} is VALID [2022-04-14 15:55:35,874 INFO L272 TraceCheckUtils]: 96: Hoare triple {18821#false} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18821#false} is VALID [2022-04-14 15:55:35,874 INFO L290 TraceCheckUtils]: 97: Hoare triple {18821#false} ~cond := #in~cond; {18821#false} is VALID [2022-04-14 15:55:35,874 INFO L290 TraceCheckUtils]: 98: Hoare triple {18821#false} assume !(0 == ~cond); {18821#false} is VALID [2022-04-14 15:55:35,874 INFO L290 TraceCheckUtils]: 99: Hoare triple {18821#false} assume true; {18821#false} is VALID [2022-04-14 15:55:35,874 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {18821#false} {18821#false} #90#return; {18821#false} is VALID [2022-04-14 15:55:35,874 INFO L272 TraceCheckUtils]: 101: Hoare triple {18821#false} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {18821#false} is VALID [2022-04-14 15:55:35,874 INFO L290 TraceCheckUtils]: 102: Hoare triple {18821#false} ~cond := #in~cond; {18821#false} is VALID [2022-04-14 15:55:35,874 INFO L290 TraceCheckUtils]: 103: Hoare triple {18821#false} assume 0 == ~cond; {18821#false} is VALID [2022-04-14 15:55:35,874 INFO L290 TraceCheckUtils]: 104: Hoare triple {18821#false} assume !false; {18821#false} is VALID [2022-04-14 15:55:35,874 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-04-14 15:55:35,874 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:55:35,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:55:35,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231289539] [2022-04-14 15:55:35,875 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:55:35,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923545396] [2022-04-14 15:55:35,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923545396] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:55:35,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:55:35,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:55:35,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19895593] [2022-04-14 15:55:35,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:55:35,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 105 [2022-04-14 15:55:35,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:55:35,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-14 15:55:35,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:55:35,929 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:55:35,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:55:35,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:55:35,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:55:35,930 INFO L87 Difference]: Start difference. First operand 372 states and 462 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-14 15:55:36,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:55:36,579 INFO L93 Difference]: Finished difference Result 535 states and 713 transitions. [2022-04-14 15:55:36,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 15:55:36,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 105 [2022-04-14 15:55:36,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:55:36,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-14 15:55:36,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-04-14 15:55:36,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-14 15:55:36,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-04-14 15:55:36,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 104 transitions. [2022-04-14 15:55:36,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:55:36,674 INFO L225 Difference]: With dead ends: 535 [2022-04-14 15:55:36,675 INFO L226 Difference]: Without dead ends: 417 [2022-04-14 15:55:36,675 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 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-14 15:55:36,676 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 12 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:55:36,676 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 172 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 15:55:36,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-04-14 15:55:37,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 387. [2022-04-14 15:55:37,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:55:37,034 INFO L82 GeneralOperation]: Start isEquivalent. First operand 417 states. Second operand has 387 states, 259 states have (on average 1.193050193050193) internal successors, (309), 263 states have internal predecessors, (309), 90 states have call successors, (90), 38 states have call predecessors, (90), 37 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2022-04-14 15:55:37,034 INFO L74 IsIncluded]: Start isIncluded. First operand 417 states. Second operand has 387 states, 259 states have (on average 1.193050193050193) internal successors, (309), 263 states have internal predecessors, (309), 90 states have call successors, (90), 38 states have call predecessors, (90), 37 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2022-04-14 15:55:37,034 INFO L87 Difference]: Start difference. First operand 417 states. Second operand has 387 states, 259 states have (on average 1.193050193050193) internal successors, (309), 263 states have internal predecessors, (309), 90 states have call successors, (90), 38 states have call predecessors, (90), 37 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2022-04-14 15:55:37,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:55:37,047 INFO L93 Difference]: Finished difference Result 417 states and 535 transitions. [2022-04-14 15:55:37,047 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 535 transitions. [2022-04-14 15:55:37,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:55:37,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:55:37,050 INFO L74 IsIncluded]: Start isIncluded. First operand has 387 states, 259 states have (on average 1.193050193050193) internal successors, (309), 263 states have internal predecessors, (309), 90 states have call successors, (90), 38 states have call predecessors, (90), 37 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) Second operand 417 states. [2022-04-14 15:55:37,050 INFO L87 Difference]: Start difference. First operand has 387 states, 259 states have (on average 1.193050193050193) internal successors, (309), 263 states have internal predecessors, (309), 90 states have call successors, (90), 38 states have call predecessors, (90), 37 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) Second operand 417 states. [2022-04-14 15:55:37,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:55:37,059 INFO L93 Difference]: Finished difference Result 417 states and 535 transitions. [2022-04-14 15:55:37,059 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 535 transitions. [2022-04-14 15:55:37,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:55:37,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:55:37,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:55:37,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:55:37,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 259 states have (on average 1.193050193050193) internal successors, (309), 263 states have internal predecessors, (309), 90 states have call successors, (90), 38 states have call predecessors, (90), 37 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2022-04-14 15:55:37,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 487 transitions. [2022-04-14 15:55:37,070 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 487 transitions. Word has length 105 [2022-04-14 15:55:37,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:55:37,070 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 487 transitions. [2022-04-14 15:55:37,070 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-14 15:55:37,071 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 487 transitions. [2022-04-14 15:55:37,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-14 15:55:37,072 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:55:37,072 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:55:37,097 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-14 15:55:37,282 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-14 15:55:37,282 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:55:37,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:55:37,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1546024104, now seen corresponding path program 1 times [2022-04-14 15:55:37,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:55:37,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832588003] [2022-04-14 15:55:37,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:55:37,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:55:37,295 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:55:37,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1087629390] [2022-04-14 15:55:37,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:55:37,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:55:37,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:55:37,297 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-14 15:55:37,300 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-14 15:55:37,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:55:37,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-14 15:55:37,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:55:37,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:55:37,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {21320#true} call ULTIMATE.init(); {21320#true} is VALID [2022-04-14 15:55:37,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {21320#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {21328#(<= ~counter~0 0)} is VALID [2022-04-14 15:55:37,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {21328#(<= ~counter~0 0)} assume true; {21328#(<= ~counter~0 0)} is VALID [2022-04-14 15:55:37,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21328#(<= ~counter~0 0)} {21320#true} #98#return; {21328#(<= ~counter~0 0)} is VALID [2022-04-14 15:55:37,843 INFO L272 TraceCheckUtils]: 4: Hoare triple {21328#(<= ~counter~0 0)} call #t~ret8 := main(); {21328#(<= ~counter~0 0)} is VALID [2022-04-14 15:55:37,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {21328#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {21328#(<= ~counter~0 0)} is VALID [2022-04-14 15:55:37,843 INFO L272 TraceCheckUtils]: 6: Hoare triple {21328#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {21328#(<= ~counter~0 0)} is VALID [2022-04-14 15:55:37,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {21328#(<= ~counter~0 0)} ~cond := #in~cond; {21328#(<= ~counter~0 0)} is VALID [2022-04-14 15:55:37,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {21328#(<= ~counter~0 0)} assume !(0 == ~cond); {21328#(<= ~counter~0 0)} is VALID [2022-04-14 15:55:37,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {21328#(<= ~counter~0 0)} assume true; {21328#(<= ~counter~0 0)} is VALID [2022-04-14 15:55:37,845 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21328#(<= ~counter~0 0)} {21328#(<= ~counter~0 0)} #78#return; {21328#(<= ~counter~0 0)} is VALID [2022-04-14 15:55:37,845 INFO L272 TraceCheckUtils]: 11: Hoare triple {21328#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {21328#(<= ~counter~0 0)} is VALID [2022-04-14 15:55:37,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {21328#(<= ~counter~0 0)} ~cond := #in~cond; {21328#(<= ~counter~0 0)} is VALID [2022-04-14 15:55:37,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {21328#(<= ~counter~0 0)} assume !(0 == ~cond); {21328#(<= ~counter~0 0)} is VALID [2022-04-14 15:55:37,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {21328#(<= ~counter~0 0)} assume true; {21328#(<= ~counter~0 0)} is VALID [2022-04-14 15:55:37,846 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21328#(<= ~counter~0 0)} {21328#(<= ~counter~0 0)} #80#return; {21328#(<= ~counter~0 0)} is VALID [2022-04-14 15:55:37,846 INFO L290 TraceCheckUtils]: 16: Hoare triple {21328#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {21328#(<= ~counter~0 0)} is VALID [2022-04-14 15:55:37,846 INFO L272 TraceCheckUtils]: 17: Hoare triple {21328#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {21328#(<= ~counter~0 0)} is VALID [2022-04-14 15:55:37,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {21328#(<= ~counter~0 0)} ~cond := #in~cond; {21328#(<= ~counter~0 0)} is VALID [2022-04-14 15:55:37,847 INFO L290 TraceCheckUtils]: 19: Hoare triple {21328#(<= ~counter~0 0)} assume !(0 == ~cond); {21328#(<= ~counter~0 0)} is VALID [2022-04-14 15:55:37,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {21328#(<= ~counter~0 0)} assume true; {21328#(<= ~counter~0 0)} is VALID [2022-04-14 15:55:37,848 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {21328#(<= ~counter~0 0)} {21328#(<= ~counter~0 0)} #82#return; {21328#(<= ~counter~0 0)} is VALID [2022-04-14 15:55:37,848 INFO L272 TraceCheckUtils]: 22: Hoare triple {21328#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {21328#(<= ~counter~0 0)} is VALID [2022-04-14 15:55:37,848 INFO L290 TraceCheckUtils]: 23: Hoare triple {21328#(<= ~counter~0 0)} ~cond := #in~cond; {21328#(<= ~counter~0 0)} is VALID [2022-04-14 15:55:37,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {21328#(<= ~counter~0 0)} assume !(0 == ~cond); {21328#(<= ~counter~0 0)} is VALID [2022-04-14 15:55:37,849 INFO L290 TraceCheckUtils]: 25: Hoare triple {21328#(<= ~counter~0 0)} assume true; {21328#(<= ~counter~0 0)} is VALID [2022-04-14 15:55:37,849 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {21328#(<= ~counter~0 0)} {21328#(<= ~counter~0 0)} #84#return; {21328#(<= ~counter~0 0)} is VALID [2022-04-14 15:55:37,850 INFO L290 TraceCheckUtils]: 27: Hoare triple {21328#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21407#(<= ~counter~0 1)} is VALID [2022-04-14 15:55:37,850 INFO L290 TraceCheckUtils]: 28: Hoare triple {21407#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {21407#(<= ~counter~0 1)} is VALID [2022-04-14 15:55:37,850 INFO L290 TraceCheckUtils]: 29: Hoare triple {21407#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {21407#(<= ~counter~0 1)} is VALID [2022-04-14 15:55:37,851 INFO L290 TraceCheckUtils]: 30: Hoare triple {21407#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21417#(<= ~counter~0 2)} is VALID [2022-04-14 15:55:37,851 INFO L290 TraceCheckUtils]: 31: Hoare triple {21417#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {21417#(<= ~counter~0 2)} is VALID [2022-04-14 15:55:37,851 INFO L272 TraceCheckUtils]: 32: Hoare triple {21417#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21417#(<= ~counter~0 2)} is VALID [2022-04-14 15:55:37,851 INFO L290 TraceCheckUtils]: 33: Hoare triple {21417#(<= ~counter~0 2)} ~cond := #in~cond; {21417#(<= ~counter~0 2)} is VALID [2022-04-14 15:55:37,852 INFO L290 TraceCheckUtils]: 34: Hoare triple {21417#(<= ~counter~0 2)} assume !(0 == ~cond); {21417#(<= ~counter~0 2)} is VALID [2022-04-14 15:55:37,852 INFO L290 TraceCheckUtils]: 35: Hoare triple {21417#(<= ~counter~0 2)} assume true; {21417#(<= ~counter~0 2)} is VALID [2022-04-14 15:55:37,852 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {21417#(<= ~counter~0 2)} {21417#(<= ~counter~0 2)} #86#return; {21417#(<= ~counter~0 2)} is VALID [2022-04-14 15:55:37,853 INFO L272 TraceCheckUtils]: 37: Hoare triple {21417#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21417#(<= ~counter~0 2)} is VALID [2022-04-14 15:55:37,857 INFO L290 TraceCheckUtils]: 38: Hoare triple {21417#(<= ~counter~0 2)} ~cond := #in~cond; {21417#(<= ~counter~0 2)} is VALID [2022-04-14 15:55:37,857 INFO L290 TraceCheckUtils]: 39: Hoare triple {21417#(<= ~counter~0 2)} assume !(0 == ~cond); {21417#(<= ~counter~0 2)} is VALID [2022-04-14 15:55:37,858 INFO L290 TraceCheckUtils]: 40: Hoare triple {21417#(<= ~counter~0 2)} assume true; {21417#(<= ~counter~0 2)} is VALID [2022-04-14 15:55:37,858 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {21417#(<= ~counter~0 2)} {21417#(<= ~counter~0 2)} #88#return; {21417#(<= ~counter~0 2)} is VALID [2022-04-14 15:55:37,859 INFO L272 TraceCheckUtils]: 42: Hoare triple {21417#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21417#(<= ~counter~0 2)} is VALID [2022-04-14 15:55:37,859 INFO L290 TraceCheckUtils]: 43: Hoare triple {21417#(<= ~counter~0 2)} ~cond := #in~cond; {21417#(<= ~counter~0 2)} is VALID [2022-04-14 15:55:37,859 INFO L290 TraceCheckUtils]: 44: Hoare triple {21417#(<= ~counter~0 2)} assume !(0 == ~cond); {21417#(<= ~counter~0 2)} is VALID [2022-04-14 15:55:37,859 INFO L290 TraceCheckUtils]: 45: Hoare triple {21417#(<= ~counter~0 2)} assume true; {21417#(<= ~counter~0 2)} is VALID [2022-04-14 15:55:37,860 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {21417#(<= ~counter~0 2)} {21417#(<= ~counter~0 2)} #90#return; {21417#(<= ~counter~0 2)} is VALID [2022-04-14 15:55:37,860 INFO L272 TraceCheckUtils]: 47: Hoare triple {21417#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {21417#(<= ~counter~0 2)} is VALID [2022-04-14 15:55:37,860 INFO L290 TraceCheckUtils]: 48: Hoare triple {21417#(<= ~counter~0 2)} ~cond := #in~cond; {21417#(<= ~counter~0 2)} is VALID [2022-04-14 15:55:37,861 INFO L290 TraceCheckUtils]: 49: Hoare triple {21417#(<= ~counter~0 2)} assume !(0 == ~cond); {21417#(<= ~counter~0 2)} is VALID [2022-04-14 15:55:37,861 INFO L290 TraceCheckUtils]: 50: Hoare triple {21417#(<= ~counter~0 2)} assume true; {21417#(<= ~counter~0 2)} is VALID [2022-04-14 15:55:37,861 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {21417#(<= ~counter~0 2)} {21417#(<= ~counter~0 2)} #92#return; {21417#(<= ~counter~0 2)} is VALID [2022-04-14 15:55:37,862 INFO L290 TraceCheckUtils]: 52: Hoare triple {21417#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {21417#(<= ~counter~0 2)} is VALID [2022-04-14 15:55:37,862 INFO L290 TraceCheckUtils]: 53: Hoare triple {21417#(<= ~counter~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {21417#(<= ~counter~0 2)} is VALID [2022-04-14 15:55:37,863 INFO L290 TraceCheckUtils]: 54: Hoare triple {21417#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21490#(<= ~counter~0 3)} is VALID [2022-04-14 15:55:37,863 INFO L290 TraceCheckUtils]: 55: Hoare triple {21490#(<= ~counter~0 3)} assume !!(#t~post6 < 100);havoc #t~post6; {21490#(<= ~counter~0 3)} is VALID [2022-04-14 15:55:37,863 INFO L290 TraceCheckUtils]: 56: Hoare triple {21490#(<= ~counter~0 3)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {21490#(<= ~counter~0 3)} is VALID [2022-04-14 15:55:37,863 INFO L290 TraceCheckUtils]: 57: Hoare triple {21490#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21500#(<= ~counter~0 4)} is VALID [2022-04-14 15:55:37,864 INFO L290 TraceCheckUtils]: 58: Hoare triple {21500#(<= ~counter~0 4)} assume !!(#t~post7 < 100);havoc #t~post7; {21500#(<= ~counter~0 4)} is VALID [2022-04-14 15:55:37,864 INFO L272 TraceCheckUtils]: 59: Hoare triple {21500#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21500#(<= ~counter~0 4)} is VALID [2022-04-14 15:55:37,864 INFO L290 TraceCheckUtils]: 60: Hoare triple {21500#(<= ~counter~0 4)} ~cond := #in~cond; {21500#(<= ~counter~0 4)} is VALID [2022-04-14 15:55:37,865 INFO L290 TraceCheckUtils]: 61: Hoare triple {21500#(<= ~counter~0 4)} assume !(0 == ~cond); {21500#(<= ~counter~0 4)} is VALID [2022-04-14 15:55:37,865 INFO L290 TraceCheckUtils]: 62: Hoare triple {21500#(<= ~counter~0 4)} assume true; {21500#(<= ~counter~0 4)} is VALID [2022-04-14 15:55:37,865 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {21500#(<= ~counter~0 4)} {21500#(<= ~counter~0 4)} #86#return; {21500#(<= ~counter~0 4)} is VALID [2022-04-14 15:55:37,866 INFO L272 TraceCheckUtils]: 64: Hoare triple {21500#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21500#(<= ~counter~0 4)} is VALID [2022-04-14 15:55:37,866 INFO L290 TraceCheckUtils]: 65: Hoare triple {21500#(<= ~counter~0 4)} ~cond := #in~cond; {21500#(<= ~counter~0 4)} is VALID [2022-04-14 15:55:37,866 INFO L290 TraceCheckUtils]: 66: Hoare triple {21500#(<= ~counter~0 4)} assume !(0 == ~cond); {21500#(<= ~counter~0 4)} is VALID [2022-04-14 15:55:37,866 INFO L290 TraceCheckUtils]: 67: Hoare triple {21500#(<= ~counter~0 4)} assume true; {21500#(<= ~counter~0 4)} is VALID [2022-04-14 15:55:37,867 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {21500#(<= ~counter~0 4)} {21500#(<= ~counter~0 4)} #88#return; {21500#(<= ~counter~0 4)} is VALID [2022-04-14 15:55:37,867 INFO L272 TraceCheckUtils]: 69: Hoare triple {21500#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21500#(<= ~counter~0 4)} is VALID [2022-04-14 15:55:37,868 INFO L290 TraceCheckUtils]: 70: Hoare triple {21500#(<= ~counter~0 4)} ~cond := #in~cond; {21500#(<= ~counter~0 4)} is VALID [2022-04-14 15:55:37,868 INFO L290 TraceCheckUtils]: 71: Hoare triple {21500#(<= ~counter~0 4)} assume !(0 == ~cond); {21500#(<= ~counter~0 4)} is VALID [2022-04-14 15:55:37,868 INFO L290 TraceCheckUtils]: 72: Hoare triple {21500#(<= ~counter~0 4)} assume true; {21500#(<= ~counter~0 4)} is VALID [2022-04-14 15:55:37,869 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {21500#(<= ~counter~0 4)} {21500#(<= ~counter~0 4)} #90#return; {21500#(<= ~counter~0 4)} is VALID [2022-04-14 15:55:37,869 INFO L272 TraceCheckUtils]: 74: Hoare triple {21500#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {21500#(<= ~counter~0 4)} is VALID [2022-04-14 15:55:37,869 INFO L290 TraceCheckUtils]: 75: Hoare triple {21500#(<= ~counter~0 4)} ~cond := #in~cond; {21500#(<= ~counter~0 4)} is VALID [2022-04-14 15:55:37,869 INFO L290 TraceCheckUtils]: 76: Hoare triple {21500#(<= ~counter~0 4)} assume !(0 == ~cond); {21500#(<= ~counter~0 4)} is VALID [2022-04-14 15:55:37,870 INFO L290 TraceCheckUtils]: 77: Hoare triple {21500#(<= ~counter~0 4)} assume true; {21500#(<= ~counter~0 4)} is VALID [2022-04-14 15:55:37,870 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {21500#(<= ~counter~0 4)} {21500#(<= ~counter~0 4)} #92#return; {21500#(<= ~counter~0 4)} is VALID [2022-04-14 15:55:37,870 INFO L290 TraceCheckUtils]: 79: Hoare triple {21500#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {21500#(<= ~counter~0 4)} is VALID [2022-04-14 15:55:37,871 INFO L290 TraceCheckUtils]: 80: Hoare triple {21500#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21570#(<= ~counter~0 5)} is VALID [2022-04-14 15:55:37,871 INFO L290 TraceCheckUtils]: 81: Hoare triple {21570#(<= ~counter~0 5)} assume !!(#t~post7 < 100);havoc #t~post7; {21570#(<= ~counter~0 5)} is VALID [2022-04-14 15:55:37,872 INFO L272 TraceCheckUtils]: 82: Hoare triple {21570#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21570#(<= ~counter~0 5)} is VALID [2022-04-14 15:55:37,872 INFO L290 TraceCheckUtils]: 83: Hoare triple {21570#(<= ~counter~0 5)} ~cond := #in~cond; {21570#(<= ~counter~0 5)} is VALID [2022-04-14 15:55:37,872 INFO L290 TraceCheckUtils]: 84: Hoare triple {21570#(<= ~counter~0 5)} assume !(0 == ~cond); {21570#(<= ~counter~0 5)} is VALID [2022-04-14 15:55:37,873 INFO L290 TraceCheckUtils]: 85: Hoare triple {21570#(<= ~counter~0 5)} assume true; {21570#(<= ~counter~0 5)} is VALID [2022-04-14 15:55:37,873 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {21570#(<= ~counter~0 5)} {21570#(<= ~counter~0 5)} #86#return; {21570#(<= ~counter~0 5)} is VALID [2022-04-14 15:55:37,873 INFO L272 TraceCheckUtils]: 87: Hoare triple {21570#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21570#(<= ~counter~0 5)} is VALID [2022-04-14 15:55:37,874 INFO L290 TraceCheckUtils]: 88: Hoare triple {21570#(<= ~counter~0 5)} ~cond := #in~cond; {21570#(<= ~counter~0 5)} is VALID [2022-04-14 15:55:37,874 INFO L290 TraceCheckUtils]: 89: Hoare triple {21570#(<= ~counter~0 5)} assume !(0 == ~cond); {21570#(<= ~counter~0 5)} is VALID [2022-04-14 15:55:37,874 INFO L290 TraceCheckUtils]: 90: Hoare triple {21570#(<= ~counter~0 5)} assume true; {21570#(<= ~counter~0 5)} is VALID [2022-04-14 15:55:37,875 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {21570#(<= ~counter~0 5)} {21570#(<= ~counter~0 5)} #88#return; {21570#(<= ~counter~0 5)} is VALID [2022-04-14 15:55:37,875 INFO L272 TraceCheckUtils]: 92: Hoare triple {21570#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21570#(<= ~counter~0 5)} is VALID [2022-04-14 15:55:37,875 INFO L290 TraceCheckUtils]: 93: Hoare triple {21570#(<= ~counter~0 5)} ~cond := #in~cond; {21570#(<= ~counter~0 5)} is VALID [2022-04-14 15:55:37,876 INFO L290 TraceCheckUtils]: 94: Hoare triple {21570#(<= ~counter~0 5)} assume !(0 == ~cond); {21570#(<= ~counter~0 5)} is VALID [2022-04-14 15:55:37,876 INFO L290 TraceCheckUtils]: 95: Hoare triple {21570#(<= ~counter~0 5)} assume true; {21570#(<= ~counter~0 5)} is VALID [2022-04-14 15:55:37,876 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {21570#(<= ~counter~0 5)} {21570#(<= ~counter~0 5)} #90#return; {21570#(<= ~counter~0 5)} is VALID [2022-04-14 15:55:37,878 INFO L272 TraceCheckUtils]: 97: Hoare triple {21570#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {21570#(<= ~counter~0 5)} is VALID [2022-04-14 15:55:37,878 INFO L290 TraceCheckUtils]: 98: Hoare triple {21570#(<= ~counter~0 5)} ~cond := #in~cond; {21570#(<= ~counter~0 5)} is VALID [2022-04-14 15:55:37,878 INFO L290 TraceCheckUtils]: 99: Hoare triple {21570#(<= ~counter~0 5)} assume !(0 == ~cond); {21570#(<= ~counter~0 5)} is VALID [2022-04-14 15:55:37,878 INFO L290 TraceCheckUtils]: 100: Hoare triple {21570#(<= ~counter~0 5)} assume true; {21570#(<= ~counter~0 5)} is VALID [2022-04-14 15:55:37,879 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {21570#(<= ~counter~0 5)} {21570#(<= ~counter~0 5)} #92#return; {21570#(<= ~counter~0 5)} is VALID [2022-04-14 15:55:37,879 INFO L290 TraceCheckUtils]: 102: Hoare triple {21570#(<= ~counter~0 5)} assume !(~c~0 >= ~b~0); {21570#(<= ~counter~0 5)} is VALID [2022-04-14 15:55:37,879 INFO L290 TraceCheckUtils]: 103: Hoare triple {21570#(<= ~counter~0 5)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {21570#(<= ~counter~0 5)} is VALID [2022-04-14 15:55:37,880 INFO L290 TraceCheckUtils]: 104: Hoare triple {21570#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21643#(<= ~counter~0 6)} is VALID [2022-04-14 15:55:37,880 INFO L290 TraceCheckUtils]: 105: Hoare triple {21643#(<= ~counter~0 6)} assume !!(#t~post6 < 100);havoc #t~post6; {21643#(<= ~counter~0 6)} is VALID [2022-04-14 15:55:37,891 INFO L290 TraceCheckUtils]: 106: Hoare triple {21643#(<= ~counter~0 6)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {21643#(<= ~counter~0 6)} is VALID [2022-04-14 15:55:37,891 INFO L290 TraceCheckUtils]: 107: Hoare triple {21643#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21653#(<= |main_#t~post7| 6)} is VALID [2022-04-14 15:55:37,892 INFO L290 TraceCheckUtils]: 108: Hoare triple {21653#(<= |main_#t~post7| 6)} assume !(#t~post7 < 100);havoc #t~post7; {21321#false} is VALID [2022-04-14 15:55:37,892 INFO L290 TraceCheckUtils]: 109: Hoare triple {21321#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; {21321#false} is VALID [2022-04-14 15:55:37,892 INFO L290 TraceCheckUtils]: 110: Hoare triple {21321#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21321#false} is VALID [2022-04-14 15:55:37,892 INFO L290 TraceCheckUtils]: 111: Hoare triple {21321#false} assume !(#t~post6 < 100);havoc #t~post6; {21321#false} is VALID [2022-04-14 15:55:37,892 INFO L272 TraceCheckUtils]: 112: Hoare triple {21321#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {21321#false} is VALID [2022-04-14 15:55:37,892 INFO L290 TraceCheckUtils]: 113: Hoare triple {21321#false} ~cond := #in~cond; {21321#false} is VALID [2022-04-14 15:55:37,892 INFO L290 TraceCheckUtils]: 114: Hoare triple {21321#false} assume 0 == ~cond; {21321#false} is VALID [2022-04-14 15:55:37,892 INFO L290 TraceCheckUtils]: 115: Hoare triple {21321#false} assume !false; {21321#false} is VALID [2022-04-14 15:55:37,893 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 32 proven. 229 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-04-14 15:55:37,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:55:38,382 INFO L290 TraceCheckUtils]: 115: Hoare triple {21321#false} assume !false; {21321#false} is VALID [2022-04-14 15:55:38,383 INFO L290 TraceCheckUtils]: 114: Hoare triple {21321#false} assume 0 == ~cond; {21321#false} is VALID [2022-04-14 15:55:38,383 INFO L290 TraceCheckUtils]: 113: Hoare triple {21321#false} ~cond := #in~cond; {21321#false} is VALID [2022-04-14 15:55:38,383 INFO L272 TraceCheckUtils]: 112: Hoare triple {21321#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {21321#false} is VALID [2022-04-14 15:55:38,383 INFO L290 TraceCheckUtils]: 111: Hoare triple {21321#false} assume !(#t~post6 < 100);havoc #t~post6; {21321#false} is VALID [2022-04-14 15:55:38,383 INFO L290 TraceCheckUtils]: 110: Hoare triple {21321#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21321#false} is VALID [2022-04-14 15:55:38,383 INFO L290 TraceCheckUtils]: 109: Hoare triple {21321#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; {21321#false} is VALID [2022-04-14 15:55:38,383 INFO L290 TraceCheckUtils]: 108: Hoare triple {21699#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {21321#false} is VALID [2022-04-14 15:55:38,384 INFO L290 TraceCheckUtils]: 107: Hoare triple {21703#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21699#(< |main_#t~post7| 100)} is VALID [2022-04-14 15:55:38,384 INFO L290 TraceCheckUtils]: 106: Hoare triple {21703#(< ~counter~0 100)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {21703#(< ~counter~0 100)} is VALID [2022-04-14 15:55:38,384 INFO L290 TraceCheckUtils]: 105: Hoare triple {21703#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {21703#(< ~counter~0 100)} is VALID [2022-04-14 15:55:38,385 INFO L290 TraceCheckUtils]: 104: Hoare triple {21713#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21703#(< ~counter~0 100)} is VALID [2022-04-14 15:55:38,385 INFO L290 TraceCheckUtils]: 103: Hoare triple {21713#(< ~counter~0 99)} ~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; {21713#(< ~counter~0 99)} is VALID [2022-04-14 15:55:38,385 INFO L290 TraceCheckUtils]: 102: Hoare triple {21713#(< ~counter~0 99)} assume !(~c~0 >= ~b~0); {21713#(< ~counter~0 99)} is VALID [2022-04-14 15:55:38,386 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {21320#true} {21713#(< ~counter~0 99)} #92#return; {21713#(< ~counter~0 99)} is VALID [2022-04-14 15:55:38,386 INFO L290 TraceCheckUtils]: 100: Hoare triple {21320#true} assume true; {21320#true} is VALID [2022-04-14 15:55:38,386 INFO L290 TraceCheckUtils]: 99: Hoare triple {21320#true} assume !(0 == ~cond); {21320#true} is VALID [2022-04-14 15:55:38,386 INFO L290 TraceCheckUtils]: 98: Hoare triple {21320#true} ~cond := #in~cond; {21320#true} is VALID [2022-04-14 15:55:38,386 INFO L272 TraceCheckUtils]: 97: Hoare triple {21713#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {21320#true} is VALID [2022-04-14 15:55:38,387 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {21320#true} {21713#(< ~counter~0 99)} #90#return; {21713#(< ~counter~0 99)} is VALID [2022-04-14 15:55:38,387 INFO L290 TraceCheckUtils]: 95: Hoare triple {21320#true} assume true; {21320#true} is VALID [2022-04-14 15:55:38,387 INFO L290 TraceCheckUtils]: 94: Hoare triple {21320#true} assume !(0 == ~cond); {21320#true} is VALID [2022-04-14 15:55:38,387 INFO L290 TraceCheckUtils]: 93: Hoare triple {21320#true} ~cond := #in~cond; {21320#true} is VALID [2022-04-14 15:55:38,387 INFO L272 TraceCheckUtils]: 92: Hoare triple {21713#(< ~counter~0 99)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21320#true} is VALID [2022-04-14 15:55:38,387 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {21320#true} {21713#(< ~counter~0 99)} #88#return; {21713#(< ~counter~0 99)} is VALID [2022-04-14 15:55:38,387 INFO L290 TraceCheckUtils]: 90: Hoare triple {21320#true} assume true; {21320#true} is VALID [2022-04-14 15:55:38,387 INFO L290 TraceCheckUtils]: 89: Hoare triple {21320#true} assume !(0 == ~cond); {21320#true} is VALID [2022-04-14 15:55:38,387 INFO L290 TraceCheckUtils]: 88: Hoare triple {21320#true} ~cond := #in~cond; {21320#true} is VALID [2022-04-14 15:55:38,387 INFO L272 TraceCheckUtils]: 87: Hoare triple {21713#(< ~counter~0 99)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21320#true} is VALID [2022-04-14 15:55:38,388 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {21320#true} {21713#(< ~counter~0 99)} #86#return; {21713#(< ~counter~0 99)} is VALID [2022-04-14 15:55:38,388 INFO L290 TraceCheckUtils]: 85: Hoare triple {21320#true} assume true; {21320#true} is VALID [2022-04-14 15:55:38,388 INFO L290 TraceCheckUtils]: 84: Hoare triple {21320#true} assume !(0 == ~cond); {21320#true} is VALID [2022-04-14 15:55:38,388 INFO L290 TraceCheckUtils]: 83: Hoare triple {21320#true} ~cond := #in~cond; {21320#true} is VALID [2022-04-14 15:55:38,388 INFO L272 TraceCheckUtils]: 82: Hoare triple {21713#(< ~counter~0 99)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21320#true} is VALID [2022-04-14 15:55:38,388 INFO L290 TraceCheckUtils]: 81: Hoare triple {21713#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {21713#(< ~counter~0 99)} is VALID [2022-04-14 15:55:38,389 INFO L290 TraceCheckUtils]: 80: Hoare triple {21786#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21713#(< ~counter~0 99)} is VALID [2022-04-14 15:55:38,389 INFO L290 TraceCheckUtils]: 79: Hoare triple {21786#(< ~counter~0 98)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {21786#(< ~counter~0 98)} is VALID [2022-04-14 15:55:38,390 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {21320#true} {21786#(< ~counter~0 98)} #92#return; {21786#(< ~counter~0 98)} is VALID [2022-04-14 15:55:38,390 INFO L290 TraceCheckUtils]: 77: Hoare triple {21320#true} assume true; {21320#true} is VALID [2022-04-14 15:55:38,390 INFO L290 TraceCheckUtils]: 76: Hoare triple {21320#true} assume !(0 == ~cond); {21320#true} is VALID [2022-04-14 15:55:38,390 INFO L290 TraceCheckUtils]: 75: Hoare triple {21320#true} ~cond := #in~cond; {21320#true} is VALID [2022-04-14 15:55:38,390 INFO L272 TraceCheckUtils]: 74: Hoare triple {21786#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {21320#true} is VALID [2022-04-14 15:55:38,391 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {21320#true} {21786#(< ~counter~0 98)} #90#return; {21786#(< ~counter~0 98)} is VALID [2022-04-14 15:55:38,391 INFO L290 TraceCheckUtils]: 72: Hoare triple {21320#true} assume true; {21320#true} is VALID [2022-04-14 15:55:38,391 INFO L290 TraceCheckUtils]: 71: Hoare triple {21320#true} assume !(0 == ~cond); {21320#true} is VALID [2022-04-14 15:55:38,391 INFO L290 TraceCheckUtils]: 70: Hoare triple {21320#true} ~cond := #in~cond; {21320#true} is VALID [2022-04-14 15:55:38,391 INFO L272 TraceCheckUtils]: 69: Hoare triple {21786#(< ~counter~0 98)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21320#true} is VALID [2022-04-14 15:55:38,391 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {21320#true} {21786#(< ~counter~0 98)} #88#return; {21786#(< ~counter~0 98)} is VALID [2022-04-14 15:55:38,391 INFO L290 TraceCheckUtils]: 67: Hoare triple {21320#true} assume true; {21320#true} is VALID [2022-04-14 15:55:38,392 INFO L290 TraceCheckUtils]: 66: Hoare triple {21320#true} assume !(0 == ~cond); {21320#true} is VALID [2022-04-14 15:55:38,392 INFO L290 TraceCheckUtils]: 65: Hoare triple {21320#true} ~cond := #in~cond; {21320#true} is VALID [2022-04-14 15:55:38,392 INFO L272 TraceCheckUtils]: 64: Hoare triple {21786#(< ~counter~0 98)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21320#true} is VALID [2022-04-14 15:55:38,392 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {21320#true} {21786#(< ~counter~0 98)} #86#return; {21786#(< ~counter~0 98)} is VALID [2022-04-14 15:55:38,392 INFO L290 TraceCheckUtils]: 62: Hoare triple {21320#true} assume true; {21320#true} is VALID [2022-04-14 15:55:38,392 INFO L290 TraceCheckUtils]: 61: Hoare triple {21320#true} assume !(0 == ~cond); {21320#true} is VALID [2022-04-14 15:55:38,392 INFO L290 TraceCheckUtils]: 60: Hoare triple {21320#true} ~cond := #in~cond; {21320#true} is VALID [2022-04-14 15:55:38,392 INFO L272 TraceCheckUtils]: 59: Hoare triple {21786#(< ~counter~0 98)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21320#true} is VALID [2022-04-14 15:55:38,393 INFO L290 TraceCheckUtils]: 58: Hoare triple {21786#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {21786#(< ~counter~0 98)} is VALID [2022-04-14 15:55:38,393 INFO L290 TraceCheckUtils]: 57: Hoare triple {21856#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21786#(< ~counter~0 98)} is VALID [2022-04-14 15:55:38,393 INFO L290 TraceCheckUtils]: 56: Hoare triple {21856#(< ~counter~0 97)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {21856#(< ~counter~0 97)} is VALID [2022-04-14 15:55:38,394 INFO L290 TraceCheckUtils]: 55: Hoare triple {21856#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {21856#(< ~counter~0 97)} is VALID [2022-04-14 15:55:38,394 INFO L290 TraceCheckUtils]: 54: Hoare triple {21866#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21856#(< ~counter~0 97)} is VALID [2022-04-14 15:55:38,394 INFO L290 TraceCheckUtils]: 53: Hoare triple {21866#(< ~counter~0 96)} ~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; {21866#(< ~counter~0 96)} is VALID [2022-04-14 15:55:38,395 INFO L290 TraceCheckUtils]: 52: Hoare triple {21866#(< ~counter~0 96)} assume !(~c~0 >= ~b~0); {21866#(< ~counter~0 96)} is VALID [2022-04-14 15:55:38,395 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {21320#true} {21866#(< ~counter~0 96)} #92#return; {21866#(< ~counter~0 96)} is VALID [2022-04-14 15:55:38,395 INFO L290 TraceCheckUtils]: 50: Hoare triple {21320#true} assume true; {21320#true} is VALID [2022-04-14 15:55:38,395 INFO L290 TraceCheckUtils]: 49: Hoare triple {21320#true} assume !(0 == ~cond); {21320#true} is VALID [2022-04-14 15:55:38,395 INFO L290 TraceCheckUtils]: 48: Hoare triple {21320#true} ~cond := #in~cond; {21320#true} is VALID [2022-04-14 15:55:38,395 INFO L272 TraceCheckUtils]: 47: Hoare triple {21866#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {21320#true} is VALID [2022-04-14 15:55:38,396 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {21320#true} {21866#(< ~counter~0 96)} #90#return; {21866#(< ~counter~0 96)} is VALID [2022-04-14 15:55:38,396 INFO L290 TraceCheckUtils]: 45: Hoare triple {21320#true} assume true; {21320#true} is VALID [2022-04-14 15:55:38,396 INFO L290 TraceCheckUtils]: 44: Hoare triple {21320#true} assume !(0 == ~cond); {21320#true} is VALID [2022-04-14 15:55:38,396 INFO L290 TraceCheckUtils]: 43: Hoare triple {21320#true} ~cond := #in~cond; {21320#true} is VALID [2022-04-14 15:55:38,396 INFO L272 TraceCheckUtils]: 42: Hoare triple {21866#(< ~counter~0 96)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21320#true} is VALID [2022-04-14 15:55:38,397 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {21320#true} {21866#(< ~counter~0 96)} #88#return; {21866#(< ~counter~0 96)} is VALID [2022-04-14 15:55:38,397 INFO L290 TraceCheckUtils]: 40: Hoare triple {21320#true} assume true; {21320#true} is VALID [2022-04-14 15:55:38,397 INFO L290 TraceCheckUtils]: 39: Hoare triple {21320#true} assume !(0 == ~cond); {21320#true} is VALID [2022-04-14 15:55:38,397 INFO L290 TraceCheckUtils]: 38: Hoare triple {21320#true} ~cond := #in~cond; {21320#true} is VALID [2022-04-14 15:55:38,397 INFO L272 TraceCheckUtils]: 37: Hoare triple {21866#(< ~counter~0 96)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21320#true} is VALID [2022-04-14 15:55:38,397 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {21320#true} {21866#(< ~counter~0 96)} #86#return; {21866#(< ~counter~0 96)} is VALID [2022-04-14 15:55:38,397 INFO L290 TraceCheckUtils]: 35: Hoare triple {21320#true} assume true; {21320#true} is VALID [2022-04-14 15:55:38,397 INFO L290 TraceCheckUtils]: 34: Hoare triple {21320#true} assume !(0 == ~cond); {21320#true} is VALID [2022-04-14 15:55:38,397 INFO L290 TraceCheckUtils]: 33: Hoare triple {21320#true} ~cond := #in~cond; {21320#true} is VALID [2022-04-14 15:55:38,398 INFO L272 TraceCheckUtils]: 32: Hoare triple {21866#(< ~counter~0 96)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21320#true} is VALID [2022-04-14 15:55:38,398 INFO L290 TraceCheckUtils]: 31: Hoare triple {21866#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {21866#(< ~counter~0 96)} is VALID [2022-04-14 15:55:38,398 INFO L290 TraceCheckUtils]: 30: Hoare triple {21939#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21866#(< ~counter~0 96)} is VALID [2022-04-14 15:55:38,399 INFO L290 TraceCheckUtils]: 29: Hoare triple {21939#(< ~counter~0 95)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {21939#(< ~counter~0 95)} is VALID [2022-04-14 15:55:38,399 INFO L290 TraceCheckUtils]: 28: Hoare triple {21939#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {21939#(< ~counter~0 95)} is VALID [2022-04-14 15:55:38,400 INFO L290 TraceCheckUtils]: 27: Hoare triple {21949#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21939#(< ~counter~0 95)} is VALID [2022-04-14 15:55:38,400 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {21320#true} {21949#(< ~counter~0 94)} #84#return; {21949#(< ~counter~0 94)} is VALID [2022-04-14 15:55:38,400 INFO L290 TraceCheckUtils]: 25: Hoare triple {21320#true} assume true; {21320#true} is VALID [2022-04-14 15:55:38,400 INFO L290 TraceCheckUtils]: 24: Hoare triple {21320#true} assume !(0 == ~cond); {21320#true} is VALID [2022-04-14 15:55:38,400 INFO L290 TraceCheckUtils]: 23: Hoare triple {21320#true} ~cond := #in~cond; {21320#true} is VALID [2022-04-14 15:55:38,400 INFO L272 TraceCheckUtils]: 22: Hoare triple {21949#(< ~counter~0 94)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {21320#true} is VALID [2022-04-14 15:55:38,400 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {21320#true} {21949#(< ~counter~0 94)} #82#return; {21949#(< ~counter~0 94)} is VALID [2022-04-14 15:55:38,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {21320#true} assume true; {21320#true} is VALID [2022-04-14 15:55:38,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {21320#true} assume !(0 == ~cond); {21320#true} is VALID [2022-04-14 15:55:38,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {21320#true} ~cond := #in~cond; {21320#true} is VALID [2022-04-14 15:55:38,401 INFO L272 TraceCheckUtils]: 17: Hoare triple {21949#(< ~counter~0 94)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {21320#true} is VALID [2022-04-14 15:55:38,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {21949#(< ~counter~0 94)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {21949#(< ~counter~0 94)} is VALID [2022-04-14 15:55:38,401 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21320#true} {21949#(< ~counter~0 94)} #80#return; {21949#(< ~counter~0 94)} is VALID [2022-04-14 15:55:38,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {21320#true} assume true; {21320#true} is VALID [2022-04-14 15:55:38,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {21320#true} assume !(0 == ~cond); {21320#true} is VALID [2022-04-14 15:55:38,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {21320#true} ~cond := #in~cond; {21320#true} is VALID [2022-04-14 15:55:38,401 INFO L272 TraceCheckUtils]: 11: Hoare triple {21949#(< ~counter~0 94)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {21320#true} is VALID [2022-04-14 15:55:38,402 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21320#true} {21949#(< ~counter~0 94)} #78#return; {21949#(< ~counter~0 94)} is VALID [2022-04-14 15:55:38,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {21320#true} assume true; {21320#true} is VALID [2022-04-14 15:55:38,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {21320#true} assume !(0 == ~cond); {21320#true} is VALID [2022-04-14 15:55:38,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {21320#true} ~cond := #in~cond; {21320#true} is VALID [2022-04-14 15:55:38,402 INFO L272 TraceCheckUtils]: 6: Hoare triple {21949#(< ~counter~0 94)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {21320#true} is VALID [2022-04-14 15:55:38,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {21949#(< ~counter~0 94)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {21949#(< ~counter~0 94)} is VALID [2022-04-14 15:55:38,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {21949#(< ~counter~0 94)} call #t~ret8 := main(); {21949#(< ~counter~0 94)} is VALID [2022-04-14 15:55:38,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21949#(< ~counter~0 94)} {21320#true} #98#return; {21949#(< ~counter~0 94)} is VALID [2022-04-14 15:55:38,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {21949#(< ~counter~0 94)} assume true; {21949#(< ~counter~0 94)} is VALID [2022-04-14 15:55:38,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {21320#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {21949#(< ~counter~0 94)} is VALID [2022-04-14 15:55:38,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {21320#true} call ULTIMATE.init(); {21320#true} is VALID [2022-04-14 15:55:38,404 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 32 proven. 37 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-04-14 15:55:38,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:55:38,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832588003] [2022-04-14 15:55:38,404 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:55:38,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087629390] [2022-04-14 15:55:38,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087629390] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:55:38,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:55:38,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-14 15:55:38,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631735243] [2022-04-14 15:55:38,405 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:55:38,405 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) Word has length 116 [2022-04-14 15:55:38,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:55:38,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2022-04-14 15:55:38,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:55:38,525 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-14 15:55:38,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:55:38,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-14 15:55:38,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-14 15:55:38,526 INFO L87 Difference]: Start difference. First operand 387 states and 487 transitions. Second operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2022-04-14 15:55:41,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:55:41,323 INFO L93 Difference]: Finished difference Result 1393 states and 1817 transitions. [2022-04-14 15:55:41,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-14 15:55:41,323 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) Word has length 116 [2022-04-14 15:55:41,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:55:41,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2022-04-14 15:55:41,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 344 transitions. [2022-04-14 15:55:41,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2022-04-14 15:55:41,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 344 transitions. [2022-04-14 15:55:41,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 344 transitions. [2022-04-14 15:55:41,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 344 edges. 344 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:55:41,684 INFO L225 Difference]: With dead ends: 1393 [2022-04-14 15:55:41,685 INFO L226 Difference]: Without dead ends: 1260 [2022-04-14 15:55:41,686 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=311, Invalid=559, Unknown=0, NotChecked=0, Total=870 [2022-04-14 15:55:41,686 INFO L913 BasicCegarLoop]: 90 mSDtfsCounter, 285 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-14 15:55:41,686 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 479 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-14 15:55:41,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2022-04-14 15:55:42,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1202. [2022-04-14 15:55:42,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:55:42,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1260 states. Second operand has 1202 states, 771 states have (on average 1.1595330739299612) internal successors, (894), 782 states have internal predecessors, (894), 305 states have call successors, (305), 126 states have call predecessors, (305), 125 states have return successors, (296), 293 states have call predecessors, (296), 296 states have call successors, (296) [2022-04-14 15:55:42,928 INFO L74 IsIncluded]: Start isIncluded. First operand 1260 states. Second operand has 1202 states, 771 states have (on average 1.1595330739299612) internal successors, (894), 782 states have internal predecessors, (894), 305 states have call successors, (305), 126 states have call predecessors, (305), 125 states have return successors, (296), 293 states have call predecessors, (296), 296 states have call successors, (296) [2022-04-14 15:55:42,929 INFO L87 Difference]: Start difference. First operand 1260 states. Second operand has 1202 states, 771 states have (on average 1.1595330739299612) internal successors, (894), 782 states have internal predecessors, (894), 305 states have call successors, (305), 126 states have call predecessors, (305), 125 states have return successors, (296), 293 states have call predecessors, (296), 296 states have call successors, (296) [2022-04-14 15:55:42,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:55:42,976 INFO L93 Difference]: Finished difference Result 1260 states and 1555 transitions. [2022-04-14 15:55:42,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1555 transitions. [2022-04-14 15:55:42,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:55:42,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:55:42,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 1202 states, 771 states have (on average 1.1595330739299612) internal successors, (894), 782 states have internal predecessors, (894), 305 states have call successors, (305), 126 states have call predecessors, (305), 125 states have return successors, (296), 293 states have call predecessors, (296), 296 states have call successors, (296) Second operand 1260 states. [2022-04-14 15:55:42,981 INFO L87 Difference]: Start difference. First operand has 1202 states, 771 states have (on average 1.1595330739299612) internal successors, (894), 782 states have internal predecessors, (894), 305 states have call successors, (305), 126 states have call predecessors, (305), 125 states have return successors, (296), 293 states have call predecessors, (296), 296 states have call successors, (296) Second operand 1260 states. [2022-04-14 15:55:43,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:55:43,028 INFO L93 Difference]: Finished difference Result 1260 states and 1555 transitions. [2022-04-14 15:55:43,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1555 transitions. [2022-04-14 15:55:43,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:55:43,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:55:43,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:55:43,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:55:43,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 771 states have (on average 1.1595330739299612) internal successors, (894), 782 states have internal predecessors, (894), 305 states have call successors, (305), 126 states have call predecessors, (305), 125 states have return successors, (296), 293 states have call predecessors, (296), 296 states have call successors, (296) [2022-04-14 15:55:43,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1495 transitions. [2022-04-14 15:55:43,091 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1495 transitions. Word has length 116 [2022-04-14 15:55:43,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:55:43,091 INFO L478 AbstractCegarLoop]: Abstraction has 1202 states and 1495 transitions. [2022-04-14 15:55:43,091 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2022-04-14 15:55:43,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1495 transitions. [2022-04-14 15:55:43,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-14 15:55:43,092 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:55:43,092 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:55:43,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-14 15:55:43,309 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-14 15:55:43,310 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:55:43,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:55:43,310 INFO L85 PathProgramCache]: Analyzing trace with hash 992936989, now seen corresponding path program 2 times [2022-04-14 15:55:43,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:55:43,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016724731] [2022-04-14 15:55:43,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:55:43,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:55:43,325 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:55:43,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1647592607] [2022-04-14 15:55:43,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 15:55:43,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:55:43,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:55:43,326 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:55:43,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-14 15:55:43,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 15:55:43,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:55:43,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-14 15:55:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:55:43,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:55:58,934 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-14 15:56:01,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {28358#true} call ULTIMATE.init(); {28358#true} is VALID [2022-04-14 15:56:01,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {28358#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {28358#true} is VALID [2022-04-14 15:56:01,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {28358#true} assume true; {28358#true} is VALID [2022-04-14 15:56:01,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28358#true} {28358#true} #98#return; {28358#true} is VALID [2022-04-14 15:56:01,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {28358#true} call #t~ret8 := main(); {28358#true} is VALID [2022-04-14 15:56:01,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {28358#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {28358#true} is VALID [2022-04-14 15:56:01,934 INFO L272 TraceCheckUtils]: 6: Hoare triple {28358#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {28358#true} is VALID [2022-04-14 15:56:01,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {28358#true} ~cond := #in~cond; {28358#true} is VALID [2022-04-14 15:56:01,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {28358#true} assume !(0 == ~cond); {28358#true} is VALID [2022-04-14 15:56:01,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {28358#true} assume true; {28358#true} is VALID [2022-04-14 15:56:01,934 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28358#true} {28358#true} #78#return; {28358#true} is VALID [2022-04-14 15:56:01,934 INFO L272 TraceCheckUtils]: 11: Hoare triple {28358#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {28358#true} is VALID [2022-04-14 15:56:01,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {28358#true} ~cond := #in~cond; {28399#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 15:56:01,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {28399#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {28403#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 15:56:01,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {28403#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {28403#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 15:56:01,935 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {28403#(not (= |assume_abort_if_not_#in~cond| 0))} {28358#true} #80#return; {28410#(<= 1 main_~y~0)} is VALID [2022-04-14 15:56:01,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {28410#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {28414#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:56:01,936 INFO L272 TraceCheckUtils]: 17: Hoare triple {28414#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {28358#true} is VALID [2022-04-14 15:56:01,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {28358#true} ~cond := #in~cond; {28358#true} is VALID [2022-04-14 15:56:01,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {28358#true} assume !(0 == ~cond); {28358#true} is VALID [2022-04-14 15:56:01,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {28358#true} assume true; {28358#true} is VALID [2022-04-14 15:56:01,936 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {28358#true} {28414#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {28414#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:56:01,936 INFO L272 TraceCheckUtils]: 22: Hoare triple {28414#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {28358#true} is VALID [2022-04-14 15:56:01,936 INFO L290 TraceCheckUtils]: 23: Hoare triple {28358#true} ~cond := #in~cond; {28358#true} is VALID [2022-04-14 15:56:01,936 INFO L290 TraceCheckUtils]: 24: Hoare triple {28358#true} assume !(0 == ~cond); {28358#true} is VALID [2022-04-14 15:56:01,936 INFO L290 TraceCheckUtils]: 25: Hoare triple {28358#true} assume true; {28358#true} is VALID [2022-04-14 15:56:01,937 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {28358#true} {28414#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {28414#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:56:01,937 INFO L290 TraceCheckUtils]: 27: Hoare triple {28414#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28414#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:56:01,938 INFO L290 TraceCheckUtils]: 28: Hoare triple {28414#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {28414#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:56:01,938 INFO L290 TraceCheckUtils]: 29: Hoare triple {28414#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:56:01,939 INFO L290 TraceCheckUtils]: 30: Hoare triple {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:56:01,939 INFO L290 TraceCheckUtils]: 31: Hoare triple {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:56:01,939 INFO L272 TraceCheckUtils]: 32: Hoare triple {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {28358#true} is VALID [2022-04-14 15:56:01,939 INFO L290 TraceCheckUtils]: 33: Hoare triple {28358#true} ~cond := #in~cond; {28358#true} is VALID [2022-04-14 15:56:01,939 INFO L290 TraceCheckUtils]: 34: Hoare triple {28358#true} assume !(0 == ~cond); {28358#true} is VALID [2022-04-14 15:56:01,939 INFO L290 TraceCheckUtils]: 35: Hoare triple {28358#true} assume true; {28358#true} is VALID [2022-04-14 15:56:01,940 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {28358#true} {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:56:01,940 INFO L272 TraceCheckUtils]: 37: Hoare triple {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {28358#true} is VALID [2022-04-14 15:56:01,940 INFO L290 TraceCheckUtils]: 38: Hoare triple {28358#true} ~cond := #in~cond; {28358#true} is VALID [2022-04-14 15:56:01,940 INFO L290 TraceCheckUtils]: 39: Hoare triple {28358#true} assume !(0 == ~cond); {28358#true} is VALID [2022-04-14 15:56:01,940 INFO L290 TraceCheckUtils]: 40: Hoare triple {28358#true} assume true; {28358#true} is VALID [2022-04-14 15:56:01,941 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {28358#true} {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #88#return; {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:56:01,941 INFO L272 TraceCheckUtils]: 42: Hoare triple {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {28358#true} is VALID [2022-04-14 15:56:01,941 INFO L290 TraceCheckUtils]: 43: Hoare triple {28358#true} ~cond := #in~cond; {28358#true} is VALID [2022-04-14 15:56:01,941 INFO L290 TraceCheckUtils]: 44: Hoare triple {28358#true} assume !(0 == ~cond); {28358#true} is VALID [2022-04-14 15:56:01,941 INFO L290 TraceCheckUtils]: 45: Hoare triple {28358#true} assume true; {28358#true} is VALID [2022-04-14 15:56:01,942 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {28358#true} {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #90#return; {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:56:01,942 INFO L272 TraceCheckUtils]: 47: Hoare triple {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {28358#true} is VALID [2022-04-14 15:56:01,942 INFO L290 TraceCheckUtils]: 48: Hoare triple {28358#true} ~cond := #in~cond; {28358#true} is VALID [2022-04-14 15:56:01,942 INFO L290 TraceCheckUtils]: 49: Hoare triple {28358#true} assume !(0 == ~cond); {28358#true} is VALID [2022-04-14 15:56:01,942 INFO L290 TraceCheckUtils]: 50: Hoare triple {28358#true} assume true; {28358#true} is VALID [2022-04-14 15:56:01,943 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {28358#true} {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #92#return; {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:56:01,944 INFO L290 TraceCheckUtils]: 52: Hoare triple {28454#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {28524#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:56:01,945 INFO L290 TraceCheckUtils]: 53: Hoare triple {28524#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28524#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:56:01,945 INFO L290 TraceCheckUtils]: 54: Hoare triple {28524#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {28524#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:56:01,945 INFO L272 TraceCheckUtils]: 55: Hoare triple {28524#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {28358#true} is VALID [2022-04-14 15:56:01,945 INFO L290 TraceCheckUtils]: 56: Hoare triple {28358#true} ~cond := #in~cond; {28537#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:56:01,946 INFO L290 TraceCheckUtils]: 57: Hoare triple {28537#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:56:01,946 INFO L290 TraceCheckUtils]: 58: Hoare triple {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:56:01,947 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} {28524#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {28548#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:56:01,947 INFO L272 TraceCheckUtils]: 60: Hoare triple {28548#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {28358#true} is VALID [2022-04-14 15:56:01,947 INFO L290 TraceCheckUtils]: 61: Hoare triple {28358#true} ~cond := #in~cond; {28358#true} is VALID [2022-04-14 15:56:01,947 INFO L290 TraceCheckUtils]: 62: Hoare triple {28358#true} assume !(0 == ~cond); {28358#true} is VALID [2022-04-14 15:56:01,947 INFO L290 TraceCheckUtils]: 63: Hoare triple {28358#true} assume true; {28358#true} is VALID [2022-04-14 15:56:01,948 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {28358#true} {28548#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #88#return; {28548#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:56:01,948 INFO L272 TraceCheckUtils]: 65: Hoare triple {28548#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {28358#true} is VALID [2022-04-14 15:56:01,948 INFO L290 TraceCheckUtils]: 66: Hoare triple {28358#true} ~cond := #in~cond; {28358#true} is VALID [2022-04-14 15:56:01,948 INFO L290 TraceCheckUtils]: 67: Hoare triple {28358#true} assume !(0 == ~cond); {28358#true} is VALID [2022-04-14 15:56:01,948 INFO L290 TraceCheckUtils]: 68: Hoare triple {28358#true} assume true; {28358#true} is VALID [2022-04-14 15:56:01,949 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {28358#true} {28548#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #90#return; {28548#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:56:01,949 INFO L272 TraceCheckUtils]: 70: Hoare triple {28548#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {28358#true} is VALID [2022-04-14 15:56:01,949 INFO L290 TraceCheckUtils]: 71: Hoare triple {28358#true} ~cond := #in~cond; {28358#true} is VALID [2022-04-14 15:56:01,949 INFO L290 TraceCheckUtils]: 72: Hoare triple {28358#true} assume !(0 == ~cond); {28358#true} is VALID [2022-04-14 15:56:01,949 INFO L290 TraceCheckUtils]: 73: Hoare triple {28358#true} assume true; {28358#true} is VALID [2022-04-14 15:56:01,956 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {28358#true} {28548#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #92#return; {28548#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:56:01,959 INFO L290 TraceCheckUtils]: 75: Hoare triple {28548#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {28597#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:56:01,959 INFO L290 TraceCheckUtils]: 76: Hoare triple {28597#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28597#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:56:01,960 INFO L290 TraceCheckUtils]: 77: Hoare triple {28597#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {28597#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:56:01,960 INFO L272 TraceCheckUtils]: 78: Hoare triple {28597#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {28358#true} is VALID [2022-04-14 15:56:01,960 INFO L290 TraceCheckUtils]: 79: Hoare triple {28358#true} ~cond := #in~cond; {28537#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:56:01,961 INFO L290 TraceCheckUtils]: 80: Hoare triple {28537#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:56:01,961 INFO L290 TraceCheckUtils]: 81: Hoare triple {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:56:01,963 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} {28597#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {28619#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-14 15:56:01,963 INFO L272 TraceCheckUtils]: 83: Hoare triple {28619#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {28358#true} is VALID [2022-04-14 15:56:01,963 INFO L290 TraceCheckUtils]: 84: Hoare triple {28358#true} ~cond := #in~cond; {28358#true} is VALID [2022-04-14 15:56:01,963 INFO L290 TraceCheckUtils]: 85: Hoare triple {28358#true} assume !(0 == ~cond); {28358#true} is VALID [2022-04-14 15:56:01,963 INFO L290 TraceCheckUtils]: 86: Hoare triple {28358#true} assume true; {28358#true} is VALID [2022-04-14 15:56:01,964 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {28358#true} {28619#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} #88#return; {28619#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-14 15:56:01,964 INFO L272 TraceCheckUtils]: 88: Hoare triple {28619#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {28358#true} is VALID [2022-04-14 15:56:01,964 INFO L290 TraceCheckUtils]: 89: Hoare triple {28358#true} ~cond := #in~cond; {28537#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:56:01,965 INFO L290 TraceCheckUtils]: 90: Hoare triple {28537#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:56:01,965 INFO L290 TraceCheckUtils]: 91: Hoare triple {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:56:01,966 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} {28619#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} #90#return; {28619#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-14 15:56:01,966 INFO L272 TraceCheckUtils]: 93: Hoare triple {28619#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {28358#true} is VALID [2022-04-14 15:56:01,966 INFO L290 TraceCheckUtils]: 94: Hoare triple {28358#true} ~cond := #in~cond; {28537#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:56:01,966 INFO L290 TraceCheckUtils]: 95: Hoare triple {28537#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:56:01,966 INFO L290 TraceCheckUtils]: 96: Hoare triple {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:56:01,967 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} {28619#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} #92#return; {28619#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-14 15:56:01,968 INFO L290 TraceCheckUtils]: 98: Hoare triple {28619#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {28668#(and (= main_~r~0 0) (< main_~c~0 main_~y~0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= (* main_~y~0 2) (* main_~k~0 main_~y~0)) (= main_~p~0 1))} is VALID [2022-04-14 15:56:01,970 INFO L290 TraceCheckUtils]: 99: Hoare triple {28668#(and (= main_~r~0 0) (< main_~c~0 main_~y~0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= (* main_~y~0 2) (* main_~k~0 main_~y~0)) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:56:01,971 INFO L290 TraceCheckUtils]: 100: Hoare triple {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:56:01,971 INFO L290 TraceCheckUtils]: 101: Hoare triple {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post6 < 100);havoc #t~post6; {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:56:01,972 INFO L290 TraceCheckUtils]: 102: Hoare triple {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:56:01,972 INFO L290 TraceCheckUtils]: 103: Hoare triple {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:56:01,973 INFO L290 TraceCheckUtils]: 104: Hoare triple {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:56:01,973 INFO L272 TraceCheckUtils]: 105: Hoare triple {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {28358#true} is VALID [2022-04-14 15:56:01,973 INFO L290 TraceCheckUtils]: 106: Hoare triple {28358#true} ~cond := #in~cond; {28358#true} is VALID [2022-04-14 15:56:01,973 INFO L290 TraceCheckUtils]: 107: Hoare triple {28358#true} assume !(0 == ~cond); {28358#true} is VALID [2022-04-14 15:56:01,973 INFO L290 TraceCheckUtils]: 108: Hoare triple {28358#true} assume true; {28358#true} is VALID [2022-04-14 15:56:01,973 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {28358#true} {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:56:01,974 INFO L272 TraceCheckUtils]: 110: Hoare triple {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {28358#true} is VALID [2022-04-14 15:56:01,974 INFO L290 TraceCheckUtils]: 111: Hoare triple {28358#true} ~cond := #in~cond; {28358#true} is VALID [2022-04-14 15:56:01,974 INFO L290 TraceCheckUtils]: 112: Hoare triple {28358#true} assume !(0 == ~cond); {28358#true} is VALID [2022-04-14 15:56:01,974 INFO L290 TraceCheckUtils]: 113: Hoare triple {28358#true} assume true; {28358#true} is VALID [2022-04-14 15:56:01,974 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {28358#true} {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:56:01,974 INFO L272 TraceCheckUtils]: 115: Hoare triple {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {28358#true} is VALID [2022-04-14 15:56:01,975 INFO L290 TraceCheckUtils]: 116: Hoare triple {28358#true} ~cond := #in~cond; {28537#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:56:01,975 INFO L290 TraceCheckUtils]: 117: Hoare triple {28537#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:56:01,975 INFO L290 TraceCheckUtils]: 118: Hoare triple {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:56:01,976 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {28541#(not (= |__VERIFIER_assert_#in~cond| 0))} {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:56:01,979 INFO L272 TraceCheckUtils]: 120: Hoare triple {28672#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {28736#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:56:01,979 INFO L290 TraceCheckUtils]: 121: Hoare triple {28736#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28740#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:56:01,979 INFO L290 TraceCheckUtils]: 122: Hoare triple {28740#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28359#false} is VALID [2022-04-14 15:56:01,979 INFO L290 TraceCheckUtils]: 123: Hoare triple {28359#false} assume !false; {28359#false} is VALID [2022-04-14 15:56:01,980 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 139 proven. 92 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2022-04-14 15:56:01,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:58:40,186 WARN L232 SmtUtils]: Spent 45.49s on a formula simplification that was a NOOP. DAG size: 10 (called from [L1074] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-14 15:58:46,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:58:46,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016724731] [2022-04-14 15:58:46,910 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:58:46,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647592607] [2022-04-14 15:58:46,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647592607] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:58:46,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 15:58:46,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-14 15:58:46,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967977151] [2022-04-14 15:58:46,910 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 15:58:46,911 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 13 states have internal predecessors, (37), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20) Word has length 124 [2022-04-14 15:58:46,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:58:46,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 13 states have internal predecessors, (37), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20) [2022-04-14 15:58:47,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:58:47,025 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-14 15:58:47,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:58:47,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-14 15:58:47,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2022-04-14 15:58:47,026 INFO L87 Difference]: Start difference. First operand 1202 states and 1495 transitions. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 13 states have internal predecessors, (37), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20) [2022-04-14 15:59:05,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:59:05,895 INFO L93 Difference]: Finished difference Result 1331 states and 1650 transitions. [2022-04-14 15:59:05,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-14 15:59:05,895 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 13 states have internal predecessors, (37), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20) Word has length 124 [2022-04-14 15:59:05,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:59:05,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 13 states have internal predecessors, (37), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20) [2022-04-14 15:59:05,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 121 transitions. [2022-04-14 15:59:05,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 13 states have internal predecessors, (37), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20) [2022-04-14 15:59:05,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 121 transitions. [2022-04-14 15:59:05,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 121 transitions. [2022-04-14 15:59:06,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:59:06,154 INFO L225 Difference]: With dead ends: 1331 [2022-04-14 15:59:06,155 INFO L226 Difference]: Without dead ends: 1329 [2022-04-14 15:59:06,155 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 147 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=187, Invalid=743, Unknown=0, NotChecked=0, Total=930 [2022-04-14 15:59:06,156 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 60 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-14 15:59:06,156 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 320 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-04-14 15:59:06,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2022-04-14 15:59:07,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1321. [2022-04-14 15:59:07,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:59:07,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1329 states. Second operand has 1321 states, 845 states have (on average 1.1538461538461537) internal successors, (975), 856 states have internal predecessors, (975), 333 states have call successors, (333), 143 states have call predecessors, (333), 142 states have return successors, (324), 321 states have call predecessors, (324), 324 states have call successors, (324) [2022-04-14 15:59:07,478 INFO L74 IsIncluded]: Start isIncluded. First operand 1329 states. Second operand has 1321 states, 845 states have (on average 1.1538461538461537) internal successors, (975), 856 states have internal predecessors, (975), 333 states have call successors, (333), 143 states have call predecessors, (333), 142 states have return successors, (324), 321 states have call predecessors, (324), 324 states have call successors, (324) [2022-04-14 15:59:07,479 INFO L87 Difference]: Start difference. First operand 1329 states. Second operand has 1321 states, 845 states have (on average 1.1538461538461537) internal successors, (975), 856 states have internal predecessors, (975), 333 states have call successors, (333), 143 states have call predecessors, (333), 142 states have return successors, (324), 321 states have call predecessors, (324), 324 states have call successors, (324) [2022-04-14 15:59:07,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:59:07,534 INFO L93 Difference]: Finished difference Result 1329 states and 1640 transitions. [2022-04-14 15:59:07,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1640 transitions. [2022-04-14 15:59:07,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:59:07,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:59:07,540 INFO L74 IsIncluded]: Start isIncluded. First operand has 1321 states, 845 states have (on average 1.1538461538461537) internal successors, (975), 856 states have internal predecessors, (975), 333 states have call successors, (333), 143 states have call predecessors, (333), 142 states have return successors, (324), 321 states have call predecessors, (324), 324 states have call successors, (324) Second operand 1329 states. [2022-04-14 15:59:07,541 INFO L87 Difference]: Start difference. First operand has 1321 states, 845 states have (on average 1.1538461538461537) internal successors, (975), 856 states have internal predecessors, (975), 333 states have call successors, (333), 143 states have call predecessors, (333), 142 states have return successors, (324), 321 states have call predecessors, (324), 324 states have call successors, (324) Second operand 1329 states. [2022-04-14 15:59:07,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:59:07,592 INFO L93 Difference]: Finished difference Result 1329 states and 1640 transitions. [2022-04-14 15:59:07,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1640 transitions. [2022-04-14 15:59:07,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:59:07,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:59:07,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:59:07,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:59:07,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 845 states have (on average 1.1538461538461537) internal successors, (975), 856 states have internal predecessors, (975), 333 states have call successors, (333), 143 states have call predecessors, (333), 142 states have return successors, (324), 321 states have call predecessors, (324), 324 states have call successors, (324) [2022-04-14 15:59:07,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1632 transitions. [2022-04-14 15:59:07,673 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1632 transitions. Word has length 124 [2022-04-14 15:59:07,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:59:07,673 INFO L478 AbstractCegarLoop]: Abstraction has 1321 states and 1632 transitions. [2022-04-14 15:59:07,674 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 13 states have internal predecessors, (37), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20) [2022-04-14 15:59:07,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1632 transitions. [2022-04-14 15:59:07,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-14 15:59:07,675 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:59:07,675 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:59:07,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-14 15:59:07,891 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:59:07,891 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:59:07,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:59:07,892 INFO L85 PathProgramCache]: Analyzing trace with hash -270396677, now seen corresponding path program 3 times [2022-04-14 15:59:07,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:59:07,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412831952] [2022-04-14 15:59:07,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:59:07,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:59:07,908 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:59:07,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [387563059] [2022-04-14 15:59:07,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 15:59:07,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:59:07,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:59:07,914 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:59:07,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-14 15:59:07,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-14 15:59:07,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:59:07,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 67 conjunts are in the unsatisfiable core [2022-04-14 15:59:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:59:08,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:59:09,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {35437#true} call ULTIMATE.init(); {35437#true} is VALID [2022-04-14 15:59:09,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {35437#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {35437#true} is VALID [2022-04-14 15:59:09,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 15:59:09,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35437#true} {35437#true} #98#return; {35437#true} is VALID [2022-04-14 15:59:09,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {35437#true} call #t~ret8 := main(); {35437#true} is VALID [2022-04-14 15:59:09,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {35437#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {35437#true} is VALID [2022-04-14 15:59:09,569 INFO L272 TraceCheckUtils]: 6: Hoare triple {35437#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {35437#true} is VALID [2022-04-14 15:59:09,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 15:59:09,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 15:59:09,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 15:59:09,569 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35437#true} {35437#true} #78#return; {35437#true} is VALID [2022-04-14 15:59:09,569 INFO L272 TraceCheckUtils]: 11: Hoare triple {35437#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {35437#true} is VALID [2022-04-14 15:59:09,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 15:59:09,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 15:59:09,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 15:59:09,569 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35437#true} {35437#true} #80#return; {35437#true} is VALID [2022-04-14 15:59:09,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {35437#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {35490#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:59:09,570 INFO L272 TraceCheckUtils]: 17: Hoare triple {35490#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {35437#true} is VALID [2022-04-14 15:59:09,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 15:59:09,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 15:59:09,570 INFO L290 TraceCheckUtils]: 20: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 15:59:09,570 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {35437#true} {35490#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {35490#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:59:09,571 INFO L272 TraceCheckUtils]: 22: Hoare triple {35490#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {35437#true} is VALID [2022-04-14 15:59:09,571 INFO L290 TraceCheckUtils]: 23: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 15:59:09,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 15:59:09,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 15:59:09,571 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {35437#true} {35490#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {35490#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:59:09,572 INFO L290 TraceCheckUtils]: 27: Hoare triple {35490#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35490#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:59:09,572 INFO L290 TraceCheckUtils]: 28: Hoare triple {35490#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {35490#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:59:09,573 INFO L290 TraceCheckUtils]: 29: Hoare triple {35490#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:59:09,573 INFO L290 TraceCheckUtils]: 30: Hoare triple {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:59:09,573 INFO L290 TraceCheckUtils]: 31: Hoare triple {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:59:09,573 INFO L272 TraceCheckUtils]: 32: Hoare triple {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {35437#true} is VALID [2022-04-14 15:59:09,573 INFO L290 TraceCheckUtils]: 33: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 15:59:09,573 INFO L290 TraceCheckUtils]: 34: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 15:59:09,574 INFO L290 TraceCheckUtils]: 35: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 15:59:09,574 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {35437#true} {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #86#return; {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:59:09,574 INFO L272 TraceCheckUtils]: 37: Hoare triple {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {35437#true} is VALID [2022-04-14 15:59:09,574 INFO L290 TraceCheckUtils]: 38: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 15:59:09,574 INFO L290 TraceCheckUtils]: 39: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 15:59:09,574 INFO L290 TraceCheckUtils]: 40: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 15:59:09,575 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {35437#true} {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #88#return; {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:59:09,575 INFO L272 TraceCheckUtils]: 42: Hoare triple {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {35437#true} is VALID [2022-04-14 15:59:09,575 INFO L290 TraceCheckUtils]: 43: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 15:59:09,575 INFO L290 TraceCheckUtils]: 44: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 15:59:09,575 INFO L290 TraceCheckUtils]: 45: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 15:59:09,576 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {35437#true} {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #90#return; {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:59:09,576 INFO L272 TraceCheckUtils]: 47: Hoare triple {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {35437#true} is VALID [2022-04-14 15:59:09,576 INFO L290 TraceCheckUtils]: 48: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 15:59:09,576 INFO L290 TraceCheckUtils]: 49: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 15:59:09,576 INFO L290 TraceCheckUtils]: 50: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 15:59:09,577 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {35437#true} {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #92#return; {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:59:09,577 INFO L290 TraceCheckUtils]: 52: Hoare triple {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:59:09,578 INFO L290 TraceCheckUtils]: 53: Hoare triple {35530#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {35603#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:59:09,578 INFO L290 TraceCheckUtils]: 54: Hoare triple {35603#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35603#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:59:09,578 INFO L290 TraceCheckUtils]: 55: Hoare triple {35603#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post6 < 100);havoc #t~post6; {35603#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:59:09,579 INFO L290 TraceCheckUtils]: 56: Hoare triple {35603#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:59:09,579 INFO L290 TraceCheckUtils]: 57: Hoare triple {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:59:09,580 INFO L290 TraceCheckUtils]: 58: Hoare triple {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:59:09,580 INFO L272 TraceCheckUtils]: 59: Hoare triple {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {35437#true} is VALID [2022-04-14 15:59:09,580 INFO L290 TraceCheckUtils]: 60: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 15:59:09,580 INFO L290 TraceCheckUtils]: 61: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 15:59:09,580 INFO L290 TraceCheckUtils]: 62: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 15:59:09,580 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {35437#true} {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:59:09,581 INFO L272 TraceCheckUtils]: 64: Hoare triple {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {35437#true} is VALID [2022-04-14 15:59:09,581 INFO L290 TraceCheckUtils]: 65: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 15:59:09,581 INFO L290 TraceCheckUtils]: 66: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 15:59:09,581 INFO L290 TraceCheckUtils]: 67: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 15:59:09,581 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {35437#true} {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:59:09,581 INFO L272 TraceCheckUtils]: 69: Hoare triple {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {35437#true} is VALID [2022-04-14 15:59:09,581 INFO L290 TraceCheckUtils]: 70: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 15:59:09,581 INFO L290 TraceCheckUtils]: 71: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 15:59:09,582 INFO L290 TraceCheckUtils]: 72: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 15:59:09,582 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {35437#true} {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:59:09,582 INFO L272 TraceCheckUtils]: 74: Hoare triple {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {35437#true} is VALID [2022-04-14 15:59:09,582 INFO L290 TraceCheckUtils]: 75: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 15:59:09,582 INFO L290 TraceCheckUtils]: 76: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 15:59:09,582 INFO L290 TraceCheckUtils]: 77: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 15:59:09,583 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {35437#true} {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #92#return; {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:59:09,583 INFO L290 TraceCheckUtils]: 79: Hoare triple {35613#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {35683#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} is VALID [2022-04-14 15:59:09,584 INFO L290 TraceCheckUtils]: 80: Hoare triple {35683#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35683#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} is VALID [2022-04-14 15:59:09,584 INFO L290 TraceCheckUtils]: 81: Hoare triple {35683#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {35683#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} is VALID [2022-04-14 15:59:09,584 INFO L272 TraceCheckUtils]: 82: Hoare triple {35683#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {35437#true} is VALID [2022-04-14 15:59:09,584 INFO L290 TraceCheckUtils]: 83: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 15:59:09,584 INFO L290 TraceCheckUtils]: 84: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 15:59:09,585 INFO L290 TraceCheckUtils]: 85: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 15:59:09,585 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {35437#true} {35683#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} #86#return; {35683#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} is VALID [2022-04-14 15:59:09,585 INFO L272 TraceCheckUtils]: 87: Hoare triple {35683#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {35437#true} is VALID [2022-04-14 15:59:09,585 INFO L290 TraceCheckUtils]: 88: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 15:59:09,585 INFO L290 TraceCheckUtils]: 89: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 15:59:09,585 INFO L290 TraceCheckUtils]: 90: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 15:59:09,586 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {35437#true} {35683#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} #88#return; {35683#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} is VALID [2022-04-14 15:59:09,586 INFO L272 TraceCheckUtils]: 92: Hoare triple {35683#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {35437#true} is VALID [2022-04-14 15:59:09,586 INFO L290 TraceCheckUtils]: 93: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 15:59:09,586 INFO L290 TraceCheckUtils]: 94: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 15:59:09,586 INFO L290 TraceCheckUtils]: 95: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 15:59:09,587 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {35437#true} {35683#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} #90#return; {35683#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} is VALID [2022-04-14 15:59:09,587 INFO L272 TraceCheckUtils]: 97: Hoare triple {35683#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {35437#true} is VALID [2022-04-14 15:59:09,587 INFO L290 TraceCheckUtils]: 98: Hoare triple {35437#true} ~cond := #in~cond; {35741#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:59:09,587 INFO L290 TraceCheckUtils]: 99: Hoare triple {35741#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {35745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:59:09,588 INFO L290 TraceCheckUtils]: 100: Hoare triple {35745#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {35745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:59:09,589 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {35745#(not (= |__VERIFIER_assert_#in~cond| 0))} {35683#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} #92#return; {35752#(and (= (+ main_~c~0 main_~x~0) main_~y~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:59:09,590 INFO L290 TraceCheckUtils]: 102: Hoare triple {35752#(and (= (+ main_~c~0 main_~x~0) main_~y~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !(~c~0 >= ~b~0); {35752#(and (= (+ main_~c~0 main_~x~0) main_~y~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:59:09,590 INFO L290 TraceCheckUtils]: 103: Hoare triple {35752#(and (= (+ main_~c~0 main_~x~0) main_~y~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~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; {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:59:09,591 INFO L290 TraceCheckUtils]: 104: Hoare triple {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:59:09,591 INFO L290 TraceCheckUtils]: 105: Hoare triple {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post6 < 100);havoc #t~post6; {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:59:09,591 INFO L290 TraceCheckUtils]: 106: Hoare triple {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:59:09,592 INFO L290 TraceCheckUtils]: 107: Hoare triple {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:59:09,592 INFO L290 TraceCheckUtils]: 108: Hoare triple {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:59:09,592 INFO L272 TraceCheckUtils]: 109: Hoare triple {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {35437#true} is VALID [2022-04-14 15:59:09,592 INFO L290 TraceCheckUtils]: 110: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 15:59:09,592 INFO L290 TraceCheckUtils]: 111: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 15:59:09,592 INFO L290 TraceCheckUtils]: 112: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 15:59:09,593 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {35437#true} {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:59:09,593 INFO L272 TraceCheckUtils]: 114: Hoare triple {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {35437#true} is VALID [2022-04-14 15:59:09,593 INFO L290 TraceCheckUtils]: 115: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 15:59:09,593 INFO L290 TraceCheckUtils]: 116: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 15:59:09,593 INFO L290 TraceCheckUtils]: 117: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 15:59:09,594 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {35437#true} {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:59:09,594 INFO L272 TraceCheckUtils]: 119: Hoare triple {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {35437#true} is VALID [2022-04-14 15:59:09,594 INFO L290 TraceCheckUtils]: 120: Hoare triple {35437#true} ~cond := #in~cond; {35741#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:59:09,594 INFO L290 TraceCheckUtils]: 121: Hoare triple {35741#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {35745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:59:09,594 INFO L290 TraceCheckUtils]: 122: Hoare triple {35745#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {35745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:59:09,595 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {35745#(not (= |__VERIFIER_assert_#in~cond| 0))} {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:59:09,597 INFO L272 TraceCheckUtils]: 124: Hoare triple {35759#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {35823#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:59:09,597 INFO L290 TraceCheckUtils]: 125: Hoare triple {35823#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {35827#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:59:09,598 INFO L290 TraceCheckUtils]: 126: Hoare triple {35827#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {35438#false} is VALID [2022-04-14 15:59:09,598 INFO L290 TraceCheckUtils]: 127: Hoare triple {35438#false} assume !false; {35438#false} is VALID [2022-04-14 15:59:09,598 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 100 proven. 57 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2022-04-14 15:59:09,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:01:04,261 WARN L232 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 26 (called from [L1074] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-14 16:01:44,769 INFO L290 TraceCheckUtils]: 127: Hoare triple {35438#false} assume !false; {35438#false} is VALID [2022-04-14 16:01:44,769 INFO L290 TraceCheckUtils]: 126: Hoare triple {35827#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {35438#false} is VALID [2022-04-14 16:01:44,770 INFO L290 TraceCheckUtils]: 125: Hoare triple {35823#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {35827#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:01:44,771 INFO L272 TraceCheckUtils]: 124: Hoare triple {35843#(= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {35823#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:01:44,771 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {35745#(not (= |__VERIFIER_assert_#in~cond| 0))} {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #90#return; {35843#(= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))} is VALID [2022-04-14 16:01:44,771 INFO L290 TraceCheckUtils]: 122: Hoare triple {35745#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {35745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:01:44,772 INFO L290 TraceCheckUtils]: 121: Hoare triple {35857#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {35745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:01:44,772 INFO L290 TraceCheckUtils]: 120: Hoare triple {35437#true} ~cond := #in~cond; {35857#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 16:01:44,772 INFO L272 TraceCheckUtils]: 119: Hoare triple {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {35437#true} is VALID [2022-04-14 16:01:44,773 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {35437#true} {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #88#return; {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 16:01:44,773 INFO L290 TraceCheckUtils]: 117: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 16:01:44,773 INFO L290 TraceCheckUtils]: 116: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 16:01:44,773 INFO L290 TraceCheckUtils]: 115: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 16:01:44,773 INFO L272 TraceCheckUtils]: 114: Hoare triple {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {35437#true} is VALID [2022-04-14 16:01:44,774 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {35437#true} {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #86#return; {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 16:01:44,774 INFO L290 TraceCheckUtils]: 112: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 16:01:44,774 INFO L290 TraceCheckUtils]: 111: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 16:01:44,774 INFO L290 TraceCheckUtils]: 110: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 16:01:44,774 INFO L272 TraceCheckUtils]: 109: Hoare triple {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {35437#true} is VALID [2022-04-14 16:01:44,774 INFO L290 TraceCheckUtils]: 108: Hoare triple {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !!(#t~post7 < 100);havoc #t~post7; {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 16:01:44,775 INFO L290 TraceCheckUtils]: 107: Hoare triple {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 16:01:44,775 INFO L290 TraceCheckUtils]: 106: Hoare triple {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 16:01:44,775 INFO L290 TraceCheckUtils]: 105: Hoare triple {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !!(#t~post6 < 100);havoc #t~post6; {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 16:01:44,776 INFO L290 TraceCheckUtils]: 104: Hoare triple {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 16:01:46,779 WARN L290 TraceCheckUtils]: 103: Hoare triple {35909#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} ~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; {35847#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is UNKNOWN [2022-04-14 16:01:46,780 INFO L290 TraceCheckUtils]: 102: Hoare triple {35909#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} assume !(~c~0 >= ~b~0); {35909#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-14 16:01:46,781 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {35745#(not (= |__VERIFIER_assert_#in~cond| 0))} {35916#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #92#return; {35909#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-14 16:01:46,782 INFO L290 TraceCheckUtils]: 100: Hoare triple {35745#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {35745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:01:46,782 INFO L290 TraceCheckUtils]: 99: Hoare triple {35857#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {35745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:01:46,782 INFO L290 TraceCheckUtils]: 98: Hoare triple {35437#true} ~cond := #in~cond; {35857#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 16:01:46,782 INFO L272 TraceCheckUtils]: 97: Hoare triple {35916#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {35437#true} is VALID [2022-04-14 16:01:46,783 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {35437#true} {35916#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #90#return; {35916#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-14 16:01:46,783 INFO L290 TraceCheckUtils]: 95: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 16:01:46,783 INFO L290 TraceCheckUtils]: 94: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 16:01:46,783 INFO L290 TraceCheckUtils]: 93: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 16:01:46,783 INFO L272 TraceCheckUtils]: 92: Hoare triple {35916#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {35437#true} is VALID [2022-04-14 16:01:46,784 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {35437#true} {35916#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #88#return; {35916#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-14 16:01:46,784 INFO L290 TraceCheckUtils]: 90: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 16:01:46,784 INFO L290 TraceCheckUtils]: 89: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 16:01:46,784 INFO L290 TraceCheckUtils]: 88: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 16:01:46,784 INFO L272 TraceCheckUtils]: 87: Hoare triple {35916#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {35437#true} is VALID [2022-04-14 16:01:46,785 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {35437#true} {35916#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #86#return; {35916#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-14 16:01:46,785 INFO L290 TraceCheckUtils]: 85: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 16:01:46,785 INFO L290 TraceCheckUtils]: 84: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 16:01:46,785 INFO L290 TraceCheckUtils]: 83: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 16:01:46,785 INFO L272 TraceCheckUtils]: 82: Hoare triple {35916#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {35437#true} is VALID [2022-04-14 16:01:46,786 INFO L290 TraceCheckUtils]: 81: Hoare triple {35916#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {35916#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-14 16:01:46,786 INFO L290 TraceCheckUtils]: 80: Hoare triple {35916#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35916#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-14 16:01:48,791 WARN L290 TraceCheckUtils]: 79: Hoare triple {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {35916#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is UNKNOWN [2022-04-14 16:01:48,792 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {35437#true} {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} #92#return; {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} is VALID [2022-04-14 16:01:48,792 INFO L290 TraceCheckUtils]: 77: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 16:01:48,792 INFO L290 TraceCheckUtils]: 76: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 16:01:48,792 INFO L290 TraceCheckUtils]: 75: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 16:01:48,792 INFO L272 TraceCheckUtils]: 74: Hoare triple {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {35437#true} is VALID [2022-04-14 16:01:48,793 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {35437#true} {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} #90#return; {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} is VALID [2022-04-14 16:01:48,793 INFO L290 TraceCheckUtils]: 72: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 16:01:48,793 INFO L290 TraceCheckUtils]: 71: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 16:01:48,793 INFO L290 TraceCheckUtils]: 70: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 16:01:48,793 INFO L272 TraceCheckUtils]: 69: Hoare triple {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {35437#true} is VALID [2022-04-14 16:01:48,794 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {35437#true} {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} #88#return; {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} is VALID [2022-04-14 16:01:48,794 INFO L290 TraceCheckUtils]: 67: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 16:01:48,794 INFO L290 TraceCheckUtils]: 66: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 16:01:48,794 INFO L290 TraceCheckUtils]: 65: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 16:01:48,794 INFO L272 TraceCheckUtils]: 64: Hoare triple {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {35437#true} is VALID [2022-04-14 16:01:48,795 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {35437#true} {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} #86#return; {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} is VALID [2022-04-14 16:01:48,795 INFO L290 TraceCheckUtils]: 62: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 16:01:48,795 INFO L290 TraceCheckUtils]: 61: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 16:01:48,795 INFO L290 TraceCheckUtils]: 60: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 16:01:48,795 INFO L272 TraceCheckUtils]: 59: Hoare triple {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {35437#true} is VALID [2022-04-14 16:01:48,796 INFO L290 TraceCheckUtils]: 58: Hoare triple {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} assume !!(#t~post7 < 100);havoc #t~post7; {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} is VALID [2022-04-14 16:01:48,797 INFO L290 TraceCheckUtils]: 57: Hoare triple {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} is VALID [2022-04-14 16:01:48,797 INFO L290 TraceCheckUtils]: 56: Hoare triple {36053#(or (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) main_~y~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {35983#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} is VALID [2022-04-14 16:01:48,798 INFO L290 TraceCheckUtils]: 55: Hoare triple {36053#(or (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) main_~y~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} assume !!(#t~post6 < 100);havoc #t~post6; {36053#(or (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) main_~y~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} is VALID [2022-04-14 16:01:48,798 INFO L290 TraceCheckUtils]: 54: Hoare triple {36053#(or (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) main_~y~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36053#(or (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) main_~y~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} is VALID [2022-04-14 16:01:50,800 WARN L290 TraceCheckUtils]: 53: Hoare triple {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) 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; {36053#(or (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) main_~y~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} is UNKNOWN [2022-04-14 16:01:50,801 INFO L290 TraceCheckUtils]: 52: Hoare triple {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} assume !(~c~0 >= ~b~0); {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} is VALID [2022-04-14 16:01:50,802 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {35437#true} {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} #92#return; {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} is VALID [2022-04-14 16:01:50,802 INFO L290 TraceCheckUtils]: 50: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 16:01:50,802 INFO L290 TraceCheckUtils]: 49: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 16:01:50,802 INFO L290 TraceCheckUtils]: 48: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 16:01:50,802 INFO L272 TraceCheckUtils]: 47: Hoare triple {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {35437#true} is VALID [2022-04-14 16:01:50,803 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {35437#true} {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} #90#return; {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} is VALID [2022-04-14 16:01:50,803 INFO L290 TraceCheckUtils]: 45: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 16:01:50,803 INFO L290 TraceCheckUtils]: 44: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 16:01:50,803 INFO L290 TraceCheckUtils]: 43: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 16:01:50,803 INFO L272 TraceCheckUtils]: 42: Hoare triple {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {35437#true} is VALID [2022-04-14 16:01:50,804 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {35437#true} {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} #88#return; {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} is VALID [2022-04-14 16:01:50,804 INFO L290 TraceCheckUtils]: 40: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 16:01:50,804 INFO L290 TraceCheckUtils]: 39: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 16:01:50,804 INFO L290 TraceCheckUtils]: 38: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 16:01:50,804 INFO L272 TraceCheckUtils]: 37: Hoare triple {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {35437#true} is VALID [2022-04-14 16:01:50,805 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {35437#true} {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} #86#return; {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} is VALID [2022-04-14 16:01:50,805 INFO L290 TraceCheckUtils]: 35: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 16:01:50,805 INFO L290 TraceCheckUtils]: 34: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 16:01:50,805 INFO L290 TraceCheckUtils]: 33: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 16:01:50,805 INFO L272 TraceCheckUtils]: 32: Hoare triple {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {35437#true} is VALID [2022-04-14 16:01:50,806 INFO L290 TraceCheckUtils]: 31: Hoare triple {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} assume !!(#t~post7 < 100);havoc #t~post7; {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} is VALID [2022-04-14 16:01:50,806 INFO L290 TraceCheckUtils]: 30: Hoare triple {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} is VALID [2022-04-14 16:01:50,908 INFO L290 TraceCheckUtils]: 29: Hoare triple {36136#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {36063#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} is VALID [2022-04-14 16:01:50,909 INFO L290 TraceCheckUtils]: 28: Hoare triple {36136#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} assume !!(#t~post6 < 100);havoc #t~post6; {36136#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-14 16:01:50,910 INFO L290 TraceCheckUtils]: 27: Hoare triple {36136#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36136#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-14 16:01:50,910 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {35437#true} {36136#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} #84#return; {36136#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-14 16:01:50,910 INFO L290 TraceCheckUtils]: 25: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 16:01:50,910 INFO L290 TraceCheckUtils]: 24: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 16:01:50,911 INFO L290 TraceCheckUtils]: 23: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 16:01:50,911 INFO L272 TraceCheckUtils]: 22: Hoare triple {36136#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {35437#true} is VALID [2022-04-14 16:01:50,911 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {35437#true} {36136#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} #82#return; {36136#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-14 16:01:50,911 INFO L290 TraceCheckUtils]: 20: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 16:01:50,911 INFO L290 TraceCheckUtils]: 19: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 16:01:50,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 16:01:50,911 INFO L272 TraceCheckUtils]: 17: Hoare triple {36136#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {35437#true} is VALID [2022-04-14 16:01:50,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {35437#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {36136#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-14 16:01:50,913 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35437#true} {35437#true} #80#return; {35437#true} is VALID [2022-04-14 16:01:50,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 16:01:50,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 16:01:50,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 16:01:50,913 INFO L272 TraceCheckUtils]: 11: Hoare triple {35437#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {35437#true} is VALID [2022-04-14 16:01:50,913 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35437#true} {35437#true} #78#return; {35437#true} is VALID [2022-04-14 16:01:50,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 16:01:50,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {35437#true} assume !(0 == ~cond); {35437#true} is VALID [2022-04-14 16:01:50,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {35437#true} ~cond := #in~cond; {35437#true} is VALID [2022-04-14 16:01:50,913 INFO L272 TraceCheckUtils]: 6: Hoare triple {35437#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {35437#true} is VALID [2022-04-14 16:01:50,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {35437#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {35437#true} is VALID [2022-04-14 16:01:50,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {35437#true} call #t~ret8 := main(); {35437#true} is VALID [2022-04-14 16:01:50,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35437#true} {35437#true} #98#return; {35437#true} is VALID [2022-04-14 16:01:50,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {35437#true} assume true; {35437#true} is VALID [2022-04-14 16:01:50,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {35437#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {35437#true} is VALID [2022-04-14 16:01:50,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {35437#true} call ULTIMATE.init(); {35437#true} is VALID [2022-04-14 16:01:50,914 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 100 proven. 56 refuted. 1 times theorem prover too weak. 366 trivial. 0 not checked. [2022-04-14 16:01:50,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:01:50,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412831952] [2022-04-14 16:01:50,915 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:01:50,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387563059] [2022-04-14 16:01:50,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387563059] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:01:50,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:01:50,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2022-04-14 16:01:50,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529077357] [2022-04-14 16:01:50,915 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:01:50,916 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 12 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 14 states have call predecessors, (37), 11 states have call successors, (37) Word has length 128 [2022-04-14 16:01:50,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:01:50,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 12 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 14 states have call predecessors, (37), 11 states have call successors, (37) [2022-04-14 16:01:55,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 138 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 16:01:55,410 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-14 16:01:55,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:01:55,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-14 16:01:55,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=354, Unknown=4, NotChecked=0, Total=462 [2022-04-14 16:01:55,411 INFO L87 Difference]: Start difference. First operand 1321 states and 1632 transitions. Second operand has 22 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 12 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 14 states have call predecessors, (37), 11 states have call successors, (37) [2022-04-14 16:02:02,854 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:02:09,449 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:02:30,985 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:02:34,315 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:02:37,818 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:02:40,044 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:02:42,196 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:03:01,992 WARN L232 SmtUtils]: Spent 16.33s on a formula simplification that was a NOOP. DAG size: 132 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-14 16:03:04,089 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:03:27,755 WARN L232 SmtUtils]: Spent 21.32s on a formula simplification that was a NOOP. DAG size: 124 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-14 16:03:31,835 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:03:33,738 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:03:36,105 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:03:40,267 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:03:42,302 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:03:48,972 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:03:50,983 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:03:52,740 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:03:57,186 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:04:07,587 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:04:10,896 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:04:19,838 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:04:27,265 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:04:41,440 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:04:43,235 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:04:46,570 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:04:48,794 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:04:50,834 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:04:55,132 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:05:03,500 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:05:05,502 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:05:08,195 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:05:21,060 WARN L232 SmtUtils]: Spent 6.48s on a formula simplification that was a NOOP. DAG size: 110 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-14 16:05:23,072 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:05:25,111 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:05:27,179 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:05:29,188 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []