/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/mannadiv_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:23:07,822 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:23:07,833 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:23:07,879 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:23:07,879 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:23:07,880 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:23:07,882 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:23:07,883 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:23:07,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:23:07,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:23:07,888 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:23:07,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:23:07,890 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:23:07,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:23:07,892 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:23:07,894 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:23:07,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:23:07,894 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:23:07,896 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:23:07,900 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:23:07,901 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:23:07,902 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:23:07,902 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:23:07,903 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:23:07,904 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:23:07,908 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:23:07,908 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:23:07,908 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:23:07,909 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:23:07,909 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:23:07,910 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:23:07,910 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:23:07,911 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:23:07,911 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:23:07,912 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:23:07,912 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:23:07,912 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:23:07,913 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:23:07,913 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:23:07,913 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:23:07,913 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:23:07,914 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:23:07,915 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-27 14:23:07,937 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:23:07,937 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:23:07,937 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:23:07,937 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:23:07,938 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:23:07,938 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:23:07,938 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:23:07,938 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:23:07,938 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:23:07,939 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:23:07,939 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:23:07,939 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:23:07,939 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:23:07,939 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:23:07,939 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:23:07,939 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:23:07,939 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:23:07,939 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:23:07,939 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:23:07,940 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:23:07,940 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:23:07,940 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:23:07,940 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:23:07,940 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:23:07,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:23:07,940 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:23:07,940 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:23:07,940 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:23:07,940 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:23:07,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:23:07,941 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:23:07,941 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:23:07,941 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:23:07,941 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-27 14:23:08,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:23:08,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:23:08,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:23:08,101 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:23:08,103 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:23:08,104 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound50.c [2022-04-27 14:23:08,143 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/609aac06a/273b17f3cf0046489046cbd46724a04c/FLAG396586fd6 [2022-04-27 14:23:08,470 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:23:08,470 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound50.c [2022-04-27 14:23:08,474 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/609aac06a/273b17f3cf0046489046cbd46724a04c/FLAG396586fd6 [2022-04-27 14:23:08,915 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/609aac06a/273b17f3cf0046489046cbd46724a04c [2022-04-27 14:23:08,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:23:08,917 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:23:08,924 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:23:08,924 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:23:08,926 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:23:08,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:23:08" (1/1) ... [2022-04-27 14:23:08,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55ccc65c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:23:08, skipping insertion in model container [2022-04-27 14:23:08,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:23:08" (1/1) ... [2022-04-27 14:23:08,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:23:08,941 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:23:09,048 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/mannadiv_unwindbound50.c[573,586] [2022-04-27 14:23:09,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:23:09,064 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:23:09,071 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/mannadiv_unwindbound50.c[573,586] [2022-04-27 14:23:09,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:23:09,082 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:23:09,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:23:09 WrapperNode [2022-04-27 14:23:09,082 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:23:09,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:23:09,083 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:23:09,083 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:23:09,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:23:09" (1/1) ... [2022-04-27 14:23:09,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:23:09" (1/1) ... [2022-04-27 14:23:09,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:23:09" (1/1) ... [2022-04-27 14:23:09,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:23:09" (1/1) ... [2022-04-27 14:23:09,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:23:09" (1/1) ... [2022-04-27 14:23:09,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:23:09" (1/1) ... [2022-04-27 14:23:09,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:23:09" (1/1) ... [2022-04-27 14:23:09,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:23:09,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:23:09,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:23:09,119 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:23:09,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:23:09" (1/1) ... [2022-04-27 14:23:09,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:23:09,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:23:09,145 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-27 14:23:09,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:23:09,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:23:09,174 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:23:09,174 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:23:09,161 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-27 14:23:09,175 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:23:09,176 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:23:09,177 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:23:09,177 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:23:09,177 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:23:09,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:23:09,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 14:23:09,177 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:23:09,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:23:09,177 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:23:09,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:23:09,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:23:09,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:23:09,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:23:09,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:23:09,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:23:09,230 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:23:09,231 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:23:09,315 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:23:09,320 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:23:09,320 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:23:09,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:23:09 BoogieIcfgContainer [2022-04-27 14:23:09,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:23:09,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:23:09,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:23:09,325 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:23:09,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:23:08" (1/3) ... [2022-04-27 14:23:09,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dbd8e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:23:09, skipping insertion in model container [2022-04-27 14:23:09,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:23:09" (2/3) ... [2022-04-27 14:23:09,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dbd8e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:23:09, skipping insertion in model container [2022-04-27 14:23:09,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:23:09" (3/3) ... [2022-04-27 14:23:09,326 INFO L111 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound50.c [2022-04-27 14:23:09,335 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:23:09,335 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:23:09,363 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:23:09,367 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@62465334, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7fd7c491 [2022-04-27 14:23:09,368 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:23:09,373 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:23:09,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 14:23:09,379 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:23:09,379 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:23:09,380 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:23:09,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:23:09,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1859024204, now seen corresponding path program 1 times [2022-04-27 14:23:09,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:23:09,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188177580] [2022-04-27 14:23:09,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:23:09,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:23:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:23:09,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:23:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:23:09,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {46#(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; {33#true} is VALID [2022-04-27 14:23:09,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-27 14:23:09,521 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #67#return; {33#true} is VALID [2022-04-27 14:23:09,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:23:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:23:09,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 14:23:09,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 14:23:09,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 14:23:09,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID [2022-04-27 14:23:09,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 14:23:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:23:09,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 14:23:09,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 14:23:09,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 14:23:09,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {34#false} #61#return; {34#false} is VALID [2022-04-27 14:23:09,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:23:09,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#(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; {33#true} is VALID [2022-04-27 14:23:09,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-27 14:23:09,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #67#return; {33#true} is VALID [2022-04-27 14:23:09,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2022-04-27 14:23:09,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {33#true} is VALID [2022-04-27 14:23:09,538 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {33#true} is VALID [2022-04-27 14:23:09,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 14:23:09,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 14:23:09,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 14:23:09,539 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID [2022-04-27 14:23:09,539 INFO L272 TraceCheckUtils]: 11: Hoare triple {34#false} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {33#true} is VALID [2022-04-27 14:23:09,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 14:23:09,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 14:23:09,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 14:23:09,540 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34#false} {34#false} #61#return; {34#false} is VALID [2022-04-27 14:23:09,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {34#false} is VALID [2022-04-27 14:23:09,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-27 14:23:09,540 INFO L272 TraceCheckUtils]: 18: Hoare triple {34#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {34#false} is VALID [2022-04-27 14:23:09,540 INFO L290 TraceCheckUtils]: 19: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-27 14:23:09,540 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-27 14:23:09,541 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-27 14:23:09,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:23:09,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:23:09,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188177580] [2022-04-27 14:23:09,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188177580] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:23:09,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:23:09,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:23:09,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80727169] [2022-04-27 14:23:09,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:23:09,547 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 14:23:09,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:23:09,550 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:23:09,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:23:09,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:23:09,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:23:09,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:23:09,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:23:09,592 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:23:09,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:09,707 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2022-04-27 14:23:09,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:23:09,708 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 14:23:09,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:23:09,709 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:23:09,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-04-27 14:23:09,721 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:23:09,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-04-27 14:23:09,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 72 transitions. [2022-04-27 14:23:09,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:23:09,816 INFO L225 Difference]: With dead ends: 54 [2022-04-27 14:23:09,816 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 14:23:09,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-27 14:23:09,823 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:23:09,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 35 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:23:09,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 14:23:09,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-27 14:23:09,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:23:09,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:23:09,849 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:23:09,850 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:23:09,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:09,852 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-27 14:23:09,852 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-27 14:23:09,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:09,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:09,853 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 14:23:09,853 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 14:23:09,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:09,855 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-27 14:23:09,855 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-27 14:23:09,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:09,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:09,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:23:09,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:23:09,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:23:09,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-27 14:23:09,859 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2022-04-27 14:23:09,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:23:09,860 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-27 14:23:09,860 INFO L496 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:23:09,860 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-27 14:23:09,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 14:23:09,861 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:23:09,861 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:23:09,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:23:09,861 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:23:09,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:23:09,862 INFO L85 PathProgramCache]: Analyzing trace with hash 243739414, now seen corresponding path program 1 times [2022-04-27 14:23:09,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:23:09,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542934480] [2022-04-27 14:23:09,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:23:09,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:23:09,878 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:23:09,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [793814418] [2022-04-27 14:23:09,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:23:09,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:23:09,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:23:09,880 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-27 14:23:09,883 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-27 14:23:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:23:09,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 14:23:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:23:09,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:23:10,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {209#true} call ULTIMATE.init(); {209#true} is VALID [2022-04-27 14:23:10,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {209#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; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:10,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {217#(<= ~counter~0 0)} assume true; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:10,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {217#(<= ~counter~0 0)} {209#true} #67#return; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:10,142 INFO L272 TraceCheckUtils]: 4: Hoare triple {217#(<= ~counter~0 0)} call #t~ret7 := main(); {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:10,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {217#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:10,143 INFO L272 TraceCheckUtils]: 6: Hoare triple {217#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:10,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {217#(<= ~counter~0 0)} ~cond := #in~cond; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:10,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {217#(<= ~counter~0 0)} assume !(0 == ~cond); {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:10,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {217#(<= ~counter~0 0)} assume true; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:10,145 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {217#(<= ~counter~0 0)} {217#(<= ~counter~0 0)} #59#return; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:10,146 INFO L272 TraceCheckUtils]: 11: Hoare triple {217#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:10,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {217#(<= ~counter~0 0)} ~cond := #in~cond; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:10,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {217#(<= ~counter~0 0)} assume !(0 == ~cond); {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:10,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {217#(<= ~counter~0 0)} assume true; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:10,150 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {217#(<= ~counter~0 0)} {217#(<= ~counter~0 0)} #61#return; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:10,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {217#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:10,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {217#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {266#(<= |main_#t~post6| 0)} is VALID [2022-04-27 14:23:10,152 INFO L290 TraceCheckUtils]: 18: Hoare triple {266#(<= |main_#t~post6| 0)} assume !(#t~post6 < 50);havoc #t~post6; {210#false} is VALID [2022-04-27 14:23:10,152 INFO L272 TraceCheckUtils]: 19: Hoare triple {210#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {210#false} is VALID [2022-04-27 14:23:10,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {210#false} ~cond := #in~cond; {210#false} is VALID [2022-04-27 14:23:10,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {210#false} assume 0 == ~cond; {210#false} is VALID [2022-04-27 14:23:10,154 INFO L290 TraceCheckUtils]: 22: Hoare triple {210#false} assume !false; {210#false} is VALID [2022-04-27 14:23:10,154 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:23:10,154 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:23:10,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:23:10,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542934480] [2022-04-27 14:23:10,155 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:23:10,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793814418] [2022-04-27 14:23:10,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793814418] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:23:10,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:23:10,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 14:23:10,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899663115] [2022-04-27 14:23:10,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:23:10,161 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 14:23:10,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:23:10,162 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:23:10,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:23:10,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 14:23:10,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:23:10,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 14:23:10,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 14:23:10,181 INFO L87 Difference]: Start difference. First operand 25 states and 29 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:23:10,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:10,232 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 14:23:10,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 14:23:10,233 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 14:23:10,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:23:10,233 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:23:10,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-27 14:23:10,244 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:23:10,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-27 14:23:10,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-27 14:23:10,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:23:10,275 INFO L225 Difference]: With dead ends: 34 [2022-04-27 14:23:10,276 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 14:23:10,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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-27 14:23:10,280 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:23:10,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:23:10,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 14:23:10,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-27 14:23:10,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:23:10,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:23:10,293 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:23:10,294 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:23:10,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:10,298 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 14:23:10,298 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 14:23:10,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:10,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:10,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-27 14:23:10,301 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-27 14:23:10,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:10,303 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 14:23:10,304 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 14:23:10,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:10,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:10,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:23:10,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:23:10,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:23:10,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-27 14:23:10,313 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-04-27 14:23:10,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:23:10,314 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-27 14:23:10,316 INFO L496 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:23:10,316 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 14:23:10,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 14:23:10,316 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:23:10,316 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:23:10,333 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-27 14:23:10,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:23:10,517 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:23:10,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:23:10,518 INFO L85 PathProgramCache]: Analyzing trace with hash 245526874, now seen corresponding path program 1 times [2022-04-27 14:23:10,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:23:10,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975933247] [2022-04-27 14:23:10,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:23:10,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:23:10,534 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:23:10,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1192712137] [2022-04-27 14:23:10,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:23:10,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:23:10,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:23:10,538 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-27 14:23:10,561 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-27 14:23:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:23:10,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 14:23:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:23:10,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:23:10,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {422#true} call ULTIMATE.init(); {422#true} is VALID [2022-04-27 14:23:10,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {422#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; {422#true} is VALID [2022-04-27 14:23:10,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {422#true} assume true; {422#true} is VALID [2022-04-27 14:23:10,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {422#true} {422#true} #67#return; {422#true} is VALID [2022-04-27 14:23:10,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {422#true} call #t~ret7 := main(); {422#true} is VALID [2022-04-27 14:23:10,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {422#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {422#true} is VALID [2022-04-27 14:23:10,738 INFO L272 TraceCheckUtils]: 6: Hoare triple {422#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {422#true} is VALID [2022-04-27 14:23:10,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {422#true} ~cond := #in~cond; {422#true} is VALID [2022-04-27 14:23:10,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {422#true} assume !(0 == ~cond); {422#true} is VALID [2022-04-27 14:23:10,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {422#true} assume true; {422#true} is VALID [2022-04-27 14:23:10,738 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {422#true} {422#true} #59#return; {422#true} is VALID [2022-04-27 14:23:10,738 INFO L272 TraceCheckUtils]: 11: Hoare triple {422#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {422#true} is VALID [2022-04-27 14:23:10,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {422#true} ~cond := #in~cond; {463#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:23:10,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {463#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {467#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:23:10,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {467#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {467#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:23:10,740 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {467#(not (= |assume_abort_if_not_#in~cond| 0))} {422#true} #61#return; {474#(not (= main_~x2~0 0))} is VALID [2022-04-27 14:23:10,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#(not (= main_~x2~0 0))} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {478#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-27 14:23:10,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {478#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {478#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-27 14:23:10,742 INFO L290 TraceCheckUtils]: 18: Hoare triple {478#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} assume !!(#t~post6 < 50);havoc #t~post6; {478#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-27 14:23:10,742 INFO L272 TraceCheckUtils]: 19: Hoare triple {478#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {488#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:23:10,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {488#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {492#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:23:10,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {492#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {423#false} is VALID [2022-04-27 14:23:10,743 INFO L290 TraceCheckUtils]: 22: Hoare triple {423#false} assume !false; {423#false} is VALID [2022-04-27 14:23:10,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 14:23:10,744 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:23:10,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:23:10,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975933247] [2022-04-27 14:23:10,744 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:23:10,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192712137] [2022-04-27 14:23:10,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192712137] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:23:10,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:23:10,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 14:23:10,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132963142] [2022-04-27 14:23:10,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:23:10,745 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-27 14:23:10,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:23:10,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:23:10,758 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-27 14:23:10,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:23:10,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:23:10,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:23:10,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:23:10,759 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:23:10,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:10,948 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-27 14:23:10,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 14:23:10,948 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-27 14:23:10,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:23:10,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:23:10,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-27 14:23:10,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:23:10,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-27 14:23:10,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-27 14:23:10,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:23:10,981 INFO L225 Difference]: With dead ends: 37 [2022-04-27 14:23:10,981 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 14:23:10,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-27 14:23:10,982 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 21 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:23:10,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 98 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:23:10,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 14:23:10,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-04-27 14:23:10,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:23:10,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:23:10,990 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:23:10,990 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:23:10,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:10,992 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-27 14:23:10,992 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-27 14:23:10,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:10,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:10,992 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-27 14:23:10,993 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-27 14:23:10,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:10,994 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-27 14:23:10,994 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-27 14:23:10,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:10,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:10,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:23:10,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:23:10,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:23:10,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-27 14:23:10,996 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-04-27 14:23:10,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:23:10,996 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-27 14:23:10,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:23:10,996 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-27 14:23:10,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 14:23:10,997 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:23:10,997 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:23:11,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 14:23:11,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 14:23:11,212 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:23:11,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:23:11,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1019533657, now seen corresponding path program 1 times [2022-04-27 14:23:11,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:23:11,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502007596] [2022-04-27 14:23:11,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:23:11,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:23:11,226 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:23:11,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [406264318] [2022-04-27 14:23:11,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:23:11,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:23:11,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:23:11,227 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-27 14:23:11,228 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-27 14:23:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:23:11,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 14:23:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:23:11,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:23:11,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {670#true} call ULTIMATE.init(); {670#true} is VALID [2022-04-27 14:23:11,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {670#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; {670#true} is VALID [2022-04-27 14:23:11,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {670#true} assume true; {670#true} is VALID [2022-04-27 14:23:11,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {670#true} {670#true} #67#return; {670#true} is VALID [2022-04-27 14:23:11,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {670#true} call #t~ret7 := main(); {670#true} is VALID [2022-04-27 14:23:11,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {670#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {670#true} is VALID [2022-04-27 14:23:11,437 INFO L272 TraceCheckUtils]: 6: Hoare triple {670#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {670#true} is VALID [2022-04-27 14:23:11,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {670#true} ~cond := #in~cond; {670#true} is VALID [2022-04-27 14:23:11,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {670#true} assume !(0 == ~cond); {670#true} is VALID [2022-04-27 14:23:11,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {670#true} assume true; {670#true} is VALID [2022-04-27 14:23:11,437 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {670#true} {670#true} #59#return; {670#true} is VALID [2022-04-27 14:23:11,438 INFO L272 TraceCheckUtils]: 11: Hoare triple {670#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {670#true} is VALID [2022-04-27 14:23:11,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {670#true} ~cond := #in~cond; {670#true} is VALID [2022-04-27 14:23:11,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {670#true} assume !(0 == ~cond); {670#true} is VALID [2022-04-27 14:23:11,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {670#true} assume true; {670#true} is VALID [2022-04-27 14:23:11,438 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {670#true} {670#true} #61#return; {670#true} is VALID [2022-04-27 14:23:11,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {670#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {670#true} is VALID [2022-04-27 14:23:11,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {670#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {670#true} is VALID [2022-04-27 14:23:11,439 INFO L290 TraceCheckUtils]: 18: Hoare triple {670#true} assume !!(#t~post6 < 50);havoc #t~post6; {670#true} is VALID [2022-04-27 14:23:11,439 INFO L272 TraceCheckUtils]: 19: Hoare triple {670#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {670#true} is VALID [2022-04-27 14:23:11,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {670#true} ~cond := #in~cond; {735#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:23:11,440 INFO L290 TraceCheckUtils]: 21: Hoare triple {735#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {739#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:23:11,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {739#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {739#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:23:11,442 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {739#(not (= |__VERIFIER_assert_#in~cond| 0))} {670#true} #63#return; {746#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} is VALID [2022-04-27 14:23:11,442 INFO L290 TraceCheckUtils]: 24: Hoare triple {746#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} assume !(0 != ~y3~0); {750#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID [2022-04-27 14:23:11,443 INFO L272 TraceCheckUtils]: 25: Hoare triple {750#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {754#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:23:11,443 INFO L290 TraceCheckUtils]: 26: Hoare triple {754#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {758#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:23:11,443 INFO L290 TraceCheckUtils]: 27: Hoare triple {758#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {671#false} is VALID [2022-04-27 14:23:11,444 INFO L290 TraceCheckUtils]: 28: Hoare triple {671#false} assume !false; {671#false} is VALID [2022-04-27 14:23:11,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:23:11,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:23:17,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {671#false} assume !false; {671#false} is VALID [2022-04-27 14:23:17,673 INFO L290 TraceCheckUtils]: 27: Hoare triple {758#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {671#false} is VALID [2022-04-27 14:23:17,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {754#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {758#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:23:17,675 INFO L272 TraceCheckUtils]: 25: Hoare triple {750#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {754#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:23:17,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {777#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} assume !(0 != ~y3~0); {750#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID [2022-04-27 14:23:17,680 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {739#(not (= |__VERIFIER_assert_#in~cond| 0))} {670#true} #63#return; {777#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} is VALID [2022-04-27 14:23:17,680 INFO L290 TraceCheckUtils]: 22: Hoare triple {739#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {739#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:23:17,680 INFO L290 TraceCheckUtils]: 21: Hoare triple {790#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {739#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:23:17,687 INFO L290 TraceCheckUtils]: 20: Hoare triple {670#true} ~cond := #in~cond; {790#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 14:23:17,687 INFO L272 TraceCheckUtils]: 19: Hoare triple {670#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {670#true} is VALID [2022-04-27 14:23:17,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {670#true} assume !!(#t~post6 < 50);havoc #t~post6; {670#true} is VALID [2022-04-27 14:23:17,687 INFO L290 TraceCheckUtils]: 17: Hoare triple {670#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {670#true} is VALID [2022-04-27 14:23:17,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {670#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {670#true} is VALID [2022-04-27 14:23:17,688 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {670#true} {670#true} #61#return; {670#true} is VALID [2022-04-27 14:23:17,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {670#true} assume true; {670#true} is VALID [2022-04-27 14:23:17,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {670#true} assume !(0 == ~cond); {670#true} is VALID [2022-04-27 14:23:17,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {670#true} ~cond := #in~cond; {670#true} is VALID [2022-04-27 14:23:17,688 INFO L272 TraceCheckUtils]: 11: Hoare triple {670#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {670#true} is VALID [2022-04-27 14:23:17,688 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {670#true} {670#true} #59#return; {670#true} is VALID [2022-04-27 14:23:17,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {670#true} assume true; {670#true} is VALID [2022-04-27 14:23:17,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {670#true} assume !(0 == ~cond); {670#true} is VALID [2022-04-27 14:23:17,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {670#true} ~cond := #in~cond; {670#true} is VALID [2022-04-27 14:23:17,689 INFO L272 TraceCheckUtils]: 6: Hoare triple {670#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {670#true} is VALID [2022-04-27 14:23:17,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {670#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {670#true} is VALID [2022-04-27 14:23:17,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {670#true} call #t~ret7 := main(); {670#true} is VALID [2022-04-27 14:23:17,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {670#true} {670#true} #67#return; {670#true} is VALID [2022-04-27 14:23:17,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {670#true} assume true; {670#true} is VALID [2022-04-27 14:23:17,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {670#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; {670#true} is VALID [2022-04-27 14:23:17,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {670#true} call ULTIMATE.init(); {670#true} is VALID [2022-04-27 14:23:17,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:23:17,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:23:17,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502007596] [2022-04-27 14:23:17,690 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:23:17,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406264318] [2022-04-27 14:23:17,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406264318] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:23:17,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:23:17,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 14:23:17,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832551160] [2022-04-27 14:23:17,690 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:23:17,703 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-27 14:23:17,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:23:17,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 14:23:17,721 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-27 14:23:17,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:23:17,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:23:17,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:23:17,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 14:23:17,722 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 14:23:17,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:17,921 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-27 14:23:17,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 14:23:17,921 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-27 14:23:17,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:23:17,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 14:23:17,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-27 14:23:17,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 14:23:17,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-27 14:23:17,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-27 14:23:17,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:23:17,948 INFO L225 Difference]: With dead ends: 39 [2022-04-27 14:23:17,948 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 14:23:17,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-27 14:23:17,949 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:23:17,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 120 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:23:17,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 14:23:17,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-04-27 14:23:17,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:23:17,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:23:17,956 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:23:17,956 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:23:17,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:17,957 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-27 14:23:17,957 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-27 14:23:17,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:17,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:17,958 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-27 14:23:17,958 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-27 14:23:17,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:17,959 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-27 14:23:17,959 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-27 14:23:17,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:17,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:17,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:23:17,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:23:17,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:23:17,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-27 14:23:17,961 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-04-27 14:23:17,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:23:17,961 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-27 14:23:17,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 14:23:17,963 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-27 14:23:17,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 14:23:17,964 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:23:17,964 INFO L195 NwaCegarLoop]: trace histogram [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-27 14:23:17,989 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-27 14:23:18,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:23:18,180 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:23:18,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:23:18,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1080225052, now seen corresponding path program 1 times [2022-04-27 14:23:18,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:23:18,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519162108] [2022-04-27 14:23:18,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:23:18,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:23:18,192 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:23:18,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1424193315] [2022-04-27 14:23:18,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:23:18,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:23:18,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:23:18,196 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-27 14:23:18,197 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-27 14:23:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:23:18,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:23:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:23:18,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:23:18,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {1024#true} call ULTIMATE.init(); {1024#true} is VALID [2022-04-27 14:23:18,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {1024#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; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:18,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {1032#(<= ~counter~0 0)} assume true; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:18,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1032#(<= ~counter~0 0)} {1024#true} #67#return; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:18,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {1032#(<= ~counter~0 0)} call #t~ret7 := main(); {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:18,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {1032#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:18,351 INFO L272 TraceCheckUtils]: 6: Hoare triple {1032#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:18,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {1032#(<= ~counter~0 0)} ~cond := #in~cond; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:18,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {1032#(<= ~counter~0 0)} assume !(0 == ~cond); {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:18,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {1032#(<= ~counter~0 0)} assume true; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:18,352 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1032#(<= ~counter~0 0)} {1032#(<= ~counter~0 0)} #59#return; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:18,353 INFO L272 TraceCheckUtils]: 11: Hoare triple {1032#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:18,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {1032#(<= ~counter~0 0)} ~cond := #in~cond; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:18,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {1032#(<= ~counter~0 0)} assume !(0 == ~cond); {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:18,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {1032#(<= ~counter~0 0)} assume true; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:18,354 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1032#(<= ~counter~0 0)} {1032#(<= ~counter~0 0)} #61#return; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:18,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {1032#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:18,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {1032#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1081#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:18,355 INFO L290 TraceCheckUtils]: 18: Hoare triple {1081#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {1081#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:18,355 INFO L272 TraceCheckUtils]: 19: Hoare triple {1081#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1081#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:18,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {1081#(<= ~counter~0 1)} ~cond := #in~cond; {1081#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:18,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {1081#(<= ~counter~0 1)} assume !(0 == ~cond); {1081#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:18,356 INFO L290 TraceCheckUtils]: 22: Hoare triple {1081#(<= ~counter~0 1)} assume true; {1081#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:18,357 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1081#(<= ~counter~0 1)} {1081#(<= ~counter~0 1)} #63#return; {1081#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:18,357 INFO L290 TraceCheckUtils]: 24: Hoare triple {1081#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {1081#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:18,357 INFO L290 TraceCheckUtils]: 25: Hoare triple {1081#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1081#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:18,357 INFO L290 TraceCheckUtils]: 26: Hoare triple {1081#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1109#(<= |main_#t~post6| 1)} is VALID [2022-04-27 14:23:18,358 INFO L290 TraceCheckUtils]: 27: Hoare triple {1109#(<= |main_#t~post6| 1)} assume !(#t~post6 < 50);havoc #t~post6; {1025#false} is VALID [2022-04-27 14:23:18,358 INFO L272 TraceCheckUtils]: 28: Hoare triple {1025#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {1025#false} is VALID [2022-04-27 14:23:18,358 INFO L290 TraceCheckUtils]: 29: Hoare triple {1025#false} ~cond := #in~cond; {1025#false} is VALID [2022-04-27 14:23:18,358 INFO L290 TraceCheckUtils]: 30: Hoare triple {1025#false} assume 0 == ~cond; {1025#false} is VALID [2022-04-27 14:23:18,358 INFO L290 TraceCheckUtils]: 31: Hoare triple {1025#false} assume !false; {1025#false} is VALID [2022-04-27 14:23:18,359 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:23:18,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:23:18,483 INFO L290 TraceCheckUtils]: 31: Hoare triple {1025#false} assume !false; {1025#false} is VALID [2022-04-27 14:23:18,483 INFO L290 TraceCheckUtils]: 30: Hoare triple {1025#false} assume 0 == ~cond; {1025#false} is VALID [2022-04-27 14:23:18,484 INFO L290 TraceCheckUtils]: 29: Hoare triple {1025#false} ~cond := #in~cond; {1025#false} is VALID [2022-04-27 14:23:18,484 INFO L272 TraceCheckUtils]: 28: Hoare triple {1025#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {1025#false} is VALID [2022-04-27 14:23:18,492 INFO L290 TraceCheckUtils]: 27: Hoare triple {1137#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {1025#false} is VALID [2022-04-27 14:23:18,492 INFO L290 TraceCheckUtils]: 26: Hoare triple {1141#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1137#(< |main_#t~post6| 50)} is VALID [2022-04-27 14:23:18,493 INFO L290 TraceCheckUtils]: 25: Hoare triple {1141#(< ~counter~0 50)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1141#(< ~counter~0 50)} is VALID [2022-04-27 14:23:18,493 INFO L290 TraceCheckUtils]: 24: Hoare triple {1141#(< ~counter~0 50)} assume !!(0 != ~y3~0); {1141#(< ~counter~0 50)} is VALID [2022-04-27 14:23:18,494 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1024#true} {1141#(< ~counter~0 50)} #63#return; {1141#(< ~counter~0 50)} is VALID [2022-04-27 14:23:18,494 INFO L290 TraceCheckUtils]: 22: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:23:18,494 INFO L290 TraceCheckUtils]: 21: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-27 14:23:18,494 INFO L290 TraceCheckUtils]: 20: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-27 14:23:18,495 INFO L272 TraceCheckUtils]: 19: Hoare triple {1141#(< ~counter~0 50)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1024#true} is VALID [2022-04-27 14:23:18,495 INFO L290 TraceCheckUtils]: 18: Hoare triple {1141#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {1141#(< ~counter~0 50)} is VALID [2022-04-27 14:23:18,495 INFO L290 TraceCheckUtils]: 17: Hoare triple {1169#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1141#(< ~counter~0 50)} is VALID [2022-04-27 14:23:18,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {1169#(< ~counter~0 49)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1169#(< ~counter~0 49)} is VALID [2022-04-27 14:23:18,496 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1024#true} {1169#(< ~counter~0 49)} #61#return; {1169#(< ~counter~0 49)} is VALID [2022-04-27 14:23:18,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:23:18,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-27 14:23:18,497 INFO L290 TraceCheckUtils]: 12: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-27 14:23:18,497 INFO L272 TraceCheckUtils]: 11: Hoare triple {1169#(< ~counter~0 49)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1024#true} is VALID [2022-04-27 14:23:18,497 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1024#true} {1169#(< ~counter~0 49)} #59#return; {1169#(< ~counter~0 49)} is VALID [2022-04-27 14:23:18,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:23:18,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-27 14:23:18,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-27 14:23:18,498 INFO L272 TraceCheckUtils]: 6: Hoare triple {1169#(< ~counter~0 49)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1024#true} is VALID [2022-04-27 14:23:18,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {1169#(< ~counter~0 49)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {1169#(< ~counter~0 49)} is VALID [2022-04-27 14:23:18,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {1169#(< ~counter~0 49)} call #t~ret7 := main(); {1169#(< ~counter~0 49)} is VALID [2022-04-27 14:23:18,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1169#(< ~counter~0 49)} {1024#true} #67#return; {1169#(< ~counter~0 49)} is VALID [2022-04-27 14:23:18,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {1169#(< ~counter~0 49)} assume true; {1169#(< ~counter~0 49)} is VALID [2022-04-27 14:23:18,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {1024#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; {1169#(< ~counter~0 49)} is VALID [2022-04-27 14:23:18,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {1024#true} call ULTIMATE.init(); {1024#true} is VALID [2022-04-27 14:23:18,500 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:23:18,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:23:18,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519162108] [2022-04-27 14:23:18,500 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:23:18,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424193315] [2022-04-27 14:23:18,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424193315] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:23:18,500 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:23:18,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 14:23:18,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361730599] [2022-04-27 14:23:18,501 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:23:18,501 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 32 [2022-04-27 14:23:18,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:23:18,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 14:23:18,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:23:18,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:23:18,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:23:18,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:23:18,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:23:18,534 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 14:23:18,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:18,695 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-04-27 14:23:18,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:23:18,696 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 32 [2022-04-27 14:23:18,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:23:18,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 14:23:18,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-27 14:23:18,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 14:23:18,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-27 14:23:18,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 67 transitions. [2022-04-27 14:23:18,740 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-27 14:23:18,741 INFO L225 Difference]: With dead ends: 61 [2022-04-27 14:23:18,741 INFO L226 Difference]: Without dead ends: 56 [2022-04-27 14:23:18,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:23:18,742 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 43 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:23:18,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 116 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:23:18,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-27 14:23:18,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-27 14:23:18,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:23:18,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:23:18,755 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:23:18,756 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:23:18,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:18,757 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-27 14:23:18,757 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-27 14:23:18,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:18,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:18,758 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-27 14:23:18,758 INFO L87 Difference]: Start difference. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-27 14:23:18,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:18,759 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-27 14:23:18,760 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-27 14:23:18,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:18,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:18,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:23:18,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:23:18,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:23:18,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-04-27 14:23:18,761 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 32 [2022-04-27 14:23:18,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:23:18,762 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-04-27 14:23:18,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 14:23:18,762 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-27 14:23:18,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-27 14:23:18,763 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:23:18,763 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:23:18,779 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-27 14:23:18,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:23:18,978 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:23:18,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:23:18,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1632159894, now seen corresponding path program 2 times [2022-04-27 14:23:18,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:23:18,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796123762] [2022-04-27 14:23:18,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:23:18,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:23:18,990 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:23:18,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1120050381] [2022-04-27 14:23:18,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:23:18,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:23:18,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:23:18,992 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-27 14:23:18,992 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-27 14:23:19,038 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:23:19,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:23:19,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 14:23:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:23:19,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:23:19,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} call ULTIMATE.init(); {1504#true} is VALID [2022-04-27 14:23:19,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {1504#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; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:19,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {1512#(<= ~counter~0 0)} assume true; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:19,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1512#(<= ~counter~0 0)} {1504#true} #67#return; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:19,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {1512#(<= ~counter~0 0)} call #t~ret7 := main(); {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:19,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {1512#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:19,309 INFO L272 TraceCheckUtils]: 6: Hoare triple {1512#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:19,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {1512#(<= ~counter~0 0)} ~cond := #in~cond; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:19,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {1512#(<= ~counter~0 0)} assume !(0 == ~cond); {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:19,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {1512#(<= ~counter~0 0)} assume true; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:19,310 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1512#(<= ~counter~0 0)} {1512#(<= ~counter~0 0)} #59#return; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:19,310 INFO L272 TraceCheckUtils]: 11: Hoare triple {1512#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:19,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {1512#(<= ~counter~0 0)} ~cond := #in~cond; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:19,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {1512#(<= ~counter~0 0)} assume !(0 == ~cond); {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:19,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {1512#(<= ~counter~0 0)} assume true; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:19,312 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1512#(<= ~counter~0 0)} {1512#(<= ~counter~0 0)} #61#return; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:19,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {1512#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:19,312 INFO L290 TraceCheckUtils]: 17: Hoare triple {1512#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1561#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:19,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {1561#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {1561#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:19,314 INFO L272 TraceCheckUtils]: 19: Hoare triple {1561#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1561#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:19,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {1561#(<= ~counter~0 1)} ~cond := #in~cond; {1561#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:19,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {1561#(<= ~counter~0 1)} assume !(0 == ~cond); {1561#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:19,314 INFO L290 TraceCheckUtils]: 22: Hoare triple {1561#(<= ~counter~0 1)} assume true; {1561#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:19,319 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1561#(<= ~counter~0 1)} {1561#(<= ~counter~0 1)} #63#return; {1561#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:19,319 INFO L290 TraceCheckUtils]: 24: Hoare triple {1561#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {1561#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:19,320 INFO L290 TraceCheckUtils]: 25: Hoare triple {1561#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1561#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:19,320 INFO L290 TraceCheckUtils]: 26: Hoare triple {1561#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1589#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:19,320 INFO L290 TraceCheckUtils]: 27: Hoare triple {1589#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {1589#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:19,321 INFO L272 TraceCheckUtils]: 28: Hoare triple {1589#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1589#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:19,321 INFO L290 TraceCheckUtils]: 29: Hoare triple {1589#(<= ~counter~0 2)} ~cond := #in~cond; {1589#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:19,321 INFO L290 TraceCheckUtils]: 30: Hoare triple {1589#(<= ~counter~0 2)} assume !(0 == ~cond); {1589#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:19,322 INFO L290 TraceCheckUtils]: 31: Hoare triple {1589#(<= ~counter~0 2)} assume true; {1589#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:19,322 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1589#(<= ~counter~0 2)} {1589#(<= ~counter~0 2)} #63#return; {1589#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:19,323 INFO L290 TraceCheckUtils]: 33: Hoare triple {1589#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {1589#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:19,323 INFO L290 TraceCheckUtils]: 34: Hoare triple {1589#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1589#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:19,323 INFO L290 TraceCheckUtils]: 35: Hoare triple {1589#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1617#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:19,324 INFO L290 TraceCheckUtils]: 36: Hoare triple {1617#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {1617#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:19,324 INFO L272 TraceCheckUtils]: 37: Hoare triple {1617#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1617#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:19,324 INFO L290 TraceCheckUtils]: 38: Hoare triple {1617#(<= ~counter~0 3)} ~cond := #in~cond; {1617#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:19,325 INFO L290 TraceCheckUtils]: 39: Hoare triple {1617#(<= ~counter~0 3)} assume !(0 == ~cond); {1617#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:19,325 INFO L290 TraceCheckUtils]: 40: Hoare triple {1617#(<= ~counter~0 3)} assume true; {1617#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:19,325 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1617#(<= ~counter~0 3)} {1617#(<= ~counter~0 3)} #63#return; {1617#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:19,326 INFO L290 TraceCheckUtils]: 42: Hoare triple {1617#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {1617#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:19,326 INFO L290 TraceCheckUtils]: 43: Hoare triple {1617#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1617#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:19,327 INFO L290 TraceCheckUtils]: 44: Hoare triple {1617#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1645#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:19,330 INFO L290 TraceCheckUtils]: 45: Hoare triple {1645#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {1645#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:19,331 INFO L272 TraceCheckUtils]: 46: Hoare triple {1645#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1645#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:19,336 INFO L290 TraceCheckUtils]: 47: Hoare triple {1645#(<= ~counter~0 4)} ~cond := #in~cond; {1645#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:19,337 INFO L290 TraceCheckUtils]: 48: Hoare triple {1645#(<= ~counter~0 4)} assume !(0 == ~cond); {1645#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:19,337 INFO L290 TraceCheckUtils]: 49: Hoare triple {1645#(<= ~counter~0 4)} assume true; {1645#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:19,338 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1645#(<= ~counter~0 4)} {1645#(<= ~counter~0 4)} #63#return; {1645#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:19,338 INFO L290 TraceCheckUtils]: 51: Hoare triple {1645#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {1645#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:19,342 INFO L290 TraceCheckUtils]: 52: Hoare triple {1645#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1645#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:19,342 INFO L290 TraceCheckUtils]: 53: Hoare triple {1645#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1673#(<= |main_#t~post6| 4)} is VALID [2022-04-27 14:23:19,344 INFO L290 TraceCheckUtils]: 54: Hoare triple {1673#(<= |main_#t~post6| 4)} assume !(#t~post6 < 50);havoc #t~post6; {1505#false} is VALID [2022-04-27 14:23:19,345 INFO L272 TraceCheckUtils]: 55: Hoare triple {1505#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {1505#false} is VALID [2022-04-27 14:23:19,345 INFO L290 TraceCheckUtils]: 56: Hoare triple {1505#false} ~cond := #in~cond; {1505#false} is VALID [2022-04-27 14:23:19,345 INFO L290 TraceCheckUtils]: 57: Hoare triple {1505#false} assume 0 == ~cond; {1505#false} is VALID [2022-04-27 14:23:19,345 INFO L290 TraceCheckUtils]: 58: Hoare triple {1505#false} assume !false; {1505#false} is VALID [2022-04-27 14:23:19,345 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:23:19,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:23:19,639 INFO L290 TraceCheckUtils]: 58: Hoare triple {1505#false} assume !false; {1505#false} is VALID [2022-04-27 14:23:19,639 INFO L290 TraceCheckUtils]: 57: Hoare triple {1505#false} assume 0 == ~cond; {1505#false} is VALID [2022-04-27 14:23:19,639 INFO L290 TraceCheckUtils]: 56: Hoare triple {1505#false} ~cond := #in~cond; {1505#false} is VALID [2022-04-27 14:23:19,640 INFO L272 TraceCheckUtils]: 55: Hoare triple {1505#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {1505#false} is VALID [2022-04-27 14:23:19,640 INFO L290 TraceCheckUtils]: 54: Hoare triple {1701#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {1505#false} is VALID [2022-04-27 14:23:19,640 INFO L290 TraceCheckUtils]: 53: Hoare triple {1705#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1701#(< |main_#t~post6| 50)} is VALID [2022-04-27 14:23:19,640 INFO L290 TraceCheckUtils]: 52: Hoare triple {1705#(< ~counter~0 50)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1705#(< ~counter~0 50)} is VALID [2022-04-27 14:23:19,641 INFO L290 TraceCheckUtils]: 51: Hoare triple {1705#(< ~counter~0 50)} assume !!(0 != ~y3~0); {1705#(< ~counter~0 50)} is VALID [2022-04-27 14:23:19,641 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1504#true} {1705#(< ~counter~0 50)} #63#return; {1705#(< ~counter~0 50)} is VALID [2022-04-27 14:23:19,641 INFO L290 TraceCheckUtils]: 49: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-27 14:23:19,641 INFO L290 TraceCheckUtils]: 48: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-27 14:23:19,641 INFO L290 TraceCheckUtils]: 47: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-27 14:23:19,642 INFO L272 TraceCheckUtils]: 46: Hoare triple {1705#(< ~counter~0 50)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1504#true} is VALID [2022-04-27 14:23:19,642 INFO L290 TraceCheckUtils]: 45: Hoare triple {1705#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {1705#(< ~counter~0 50)} is VALID [2022-04-27 14:23:19,642 INFO L290 TraceCheckUtils]: 44: Hoare triple {1733#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1705#(< ~counter~0 50)} is VALID [2022-04-27 14:23:19,642 INFO L290 TraceCheckUtils]: 43: Hoare triple {1733#(< ~counter~0 49)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1733#(< ~counter~0 49)} is VALID [2022-04-27 14:23:19,643 INFO L290 TraceCheckUtils]: 42: Hoare triple {1733#(< ~counter~0 49)} assume !!(0 != ~y3~0); {1733#(< ~counter~0 49)} is VALID [2022-04-27 14:23:19,643 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1504#true} {1733#(< ~counter~0 49)} #63#return; {1733#(< ~counter~0 49)} is VALID [2022-04-27 14:23:19,643 INFO L290 TraceCheckUtils]: 40: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-27 14:23:19,643 INFO L290 TraceCheckUtils]: 39: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-27 14:23:19,643 INFO L290 TraceCheckUtils]: 38: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-27 14:23:19,644 INFO L272 TraceCheckUtils]: 37: Hoare triple {1733#(< ~counter~0 49)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1504#true} is VALID [2022-04-27 14:23:19,644 INFO L290 TraceCheckUtils]: 36: Hoare triple {1733#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {1733#(< ~counter~0 49)} is VALID [2022-04-27 14:23:19,644 INFO L290 TraceCheckUtils]: 35: Hoare triple {1761#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1733#(< ~counter~0 49)} is VALID [2022-04-27 14:23:19,644 INFO L290 TraceCheckUtils]: 34: Hoare triple {1761#(< ~counter~0 48)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1761#(< ~counter~0 48)} is VALID [2022-04-27 14:23:19,645 INFO L290 TraceCheckUtils]: 33: Hoare triple {1761#(< ~counter~0 48)} assume !!(0 != ~y3~0); {1761#(< ~counter~0 48)} is VALID [2022-04-27 14:23:19,645 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1504#true} {1761#(< ~counter~0 48)} #63#return; {1761#(< ~counter~0 48)} is VALID [2022-04-27 14:23:19,645 INFO L290 TraceCheckUtils]: 31: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-27 14:23:19,645 INFO L290 TraceCheckUtils]: 30: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-27 14:23:19,646 INFO L290 TraceCheckUtils]: 29: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-27 14:23:19,646 INFO L272 TraceCheckUtils]: 28: Hoare triple {1761#(< ~counter~0 48)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1504#true} is VALID [2022-04-27 14:23:19,646 INFO L290 TraceCheckUtils]: 27: Hoare triple {1761#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {1761#(< ~counter~0 48)} is VALID [2022-04-27 14:23:19,647 INFO L290 TraceCheckUtils]: 26: Hoare triple {1789#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1761#(< ~counter~0 48)} is VALID [2022-04-27 14:23:19,647 INFO L290 TraceCheckUtils]: 25: Hoare triple {1789#(< ~counter~0 47)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1789#(< ~counter~0 47)} is VALID [2022-04-27 14:23:19,647 INFO L290 TraceCheckUtils]: 24: Hoare triple {1789#(< ~counter~0 47)} assume !!(0 != ~y3~0); {1789#(< ~counter~0 47)} is VALID [2022-04-27 14:23:19,648 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1504#true} {1789#(< ~counter~0 47)} #63#return; {1789#(< ~counter~0 47)} is VALID [2022-04-27 14:23:19,648 INFO L290 TraceCheckUtils]: 22: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-27 14:23:19,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-27 14:23:19,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-27 14:23:19,648 INFO L272 TraceCheckUtils]: 19: Hoare triple {1789#(< ~counter~0 47)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1504#true} is VALID [2022-04-27 14:23:19,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {1789#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {1789#(< ~counter~0 47)} is VALID [2022-04-27 14:23:19,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {1817#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1789#(< ~counter~0 47)} is VALID [2022-04-27 14:23:19,650 INFO L290 TraceCheckUtils]: 16: Hoare triple {1817#(< ~counter~0 46)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1817#(< ~counter~0 46)} is VALID [2022-04-27 14:23:19,650 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1504#true} {1817#(< ~counter~0 46)} #61#return; {1817#(< ~counter~0 46)} is VALID [2022-04-27 14:23:19,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-27 14:23:19,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-27 14:23:19,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-27 14:23:19,651 INFO L272 TraceCheckUtils]: 11: Hoare triple {1817#(< ~counter~0 46)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1504#true} is VALID [2022-04-27 14:23:19,652 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1504#true} {1817#(< ~counter~0 46)} #59#return; {1817#(< ~counter~0 46)} is VALID [2022-04-27 14:23:19,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-27 14:23:19,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-27 14:23:19,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-27 14:23:19,652 INFO L272 TraceCheckUtils]: 6: Hoare triple {1817#(< ~counter~0 46)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1504#true} is VALID [2022-04-27 14:23:19,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {1817#(< ~counter~0 46)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {1817#(< ~counter~0 46)} is VALID [2022-04-27 14:23:19,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {1817#(< ~counter~0 46)} call #t~ret7 := main(); {1817#(< ~counter~0 46)} is VALID [2022-04-27 14:23:19,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1817#(< ~counter~0 46)} {1504#true} #67#return; {1817#(< ~counter~0 46)} is VALID [2022-04-27 14:23:19,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {1817#(< ~counter~0 46)} assume true; {1817#(< ~counter~0 46)} is VALID [2022-04-27 14:23:19,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {1504#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; {1817#(< ~counter~0 46)} is VALID [2022-04-27 14:23:19,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} call ULTIMATE.init(); {1504#true} is VALID [2022-04-27 14:23:19,654 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 14:23:19,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:23:19,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796123762] [2022-04-27 14:23:19,654 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:23:19,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120050381] [2022-04-27 14:23:19,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120050381] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:23:19,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:23:19,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-27 14:23:19,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318171396] [2022-04-27 14:23:19,655 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:23:19,655 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 59 [2022-04-27 14:23:19,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:23:19,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 14:23:19,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:23:19,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 14:23:19,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:23:19,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 14:23:19,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:23:19,716 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 14:23:20,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:20,109 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2022-04-27 14:23:20,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 14:23:20,110 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 59 [2022-04-27 14:23:20,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:23:20,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 14:23:20,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 130 transitions. [2022-04-27 14:23:20,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 14:23:20,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 130 transitions. [2022-04-27 14:23:20,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 130 transitions. [2022-04-27 14:23:20,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:23:20,195 INFO L225 Difference]: With dead ends: 115 [2022-04-27 14:23:20,195 INFO L226 Difference]: Without dead ends: 110 [2022-04-27 14:23:20,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-27 14:23:20,196 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 158 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:23:20,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 176 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:23:20,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-27 14:23:20,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-04-27 14:23:20,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:23:20,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:23:20,225 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:23:20,225 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:23:20,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:20,228 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-27 14:23:20,228 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-27 14:23:20,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:20,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:20,229 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 110 states. [2022-04-27 14:23:20,229 INFO L87 Difference]: Start difference. First operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 110 states. [2022-04-27 14:23:20,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:20,231 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-27 14:23:20,231 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-27 14:23:20,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:20,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:20,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:23:20,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:23:20,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:23:20,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-04-27 14:23:20,234 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 59 [2022-04-27 14:23:20,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:23:20,235 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-04-27 14:23:20,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 14:23:20,235 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-27 14:23:20,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-27 14:23:20,236 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:23:20,236 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:23:20,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-27 14:23:20,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:23:20,453 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:23:20,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:23:20,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1468805930, now seen corresponding path program 3 times [2022-04-27 14:23:20,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:23:20,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782368598] [2022-04-27 14:23:20,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:23:20,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:23:20,467 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:23:20,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1321734111] [2022-04-27 14:23:20,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:23:20,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:23:20,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:23:20,468 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-27 14:23:20,469 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-27 14:23:20,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-27 14:23:20,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:23:20,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 14:23:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:23:20,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:23:21,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {2416#true} call ULTIMATE.init(); {2416#true} is VALID [2022-04-27 14:23:21,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {2416#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; {2424#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:21,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {2424#(<= ~counter~0 0)} assume true; {2424#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:21,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2424#(<= ~counter~0 0)} {2416#true} #67#return; {2424#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:21,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {2424#(<= ~counter~0 0)} call #t~ret7 := main(); {2424#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:21,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {2424#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {2424#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:21,091 INFO L272 TraceCheckUtils]: 6: Hoare triple {2424#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {2424#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:21,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {2424#(<= ~counter~0 0)} ~cond := #in~cond; {2424#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:21,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {2424#(<= ~counter~0 0)} assume !(0 == ~cond); {2424#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:21,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {2424#(<= ~counter~0 0)} assume true; {2424#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:21,092 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2424#(<= ~counter~0 0)} {2424#(<= ~counter~0 0)} #59#return; {2424#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:21,094 INFO L272 TraceCheckUtils]: 11: Hoare triple {2424#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {2424#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:21,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {2424#(<= ~counter~0 0)} ~cond := #in~cond; {2424#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:21,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {2424#(<= ~counter~0 0)} assume !(0 == ~cond); {2424#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:21,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {2424#(<= ~counter~0 0)} assume true; {2424#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:21,095 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2424#(<= ~counter~0 0)} {2424#(<= ~counter~0 0)} #61#return; {2424#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:21,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {2424#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {2424#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:21,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {2424#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2473#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:21,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {2473#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {2473#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:21,097 INFO L272 TraceCheckUtils]: 19: Hoare triple {2473#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2473#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:21,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {2473#(<= ~counter~0 1)} ~cond := #in~cond; {2473#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:21,098 INFO L290 TraceCheckUtils]: 21: Hoare triple {2473#(<= ~counter~0 1)} assume !(0 == ~cond); {2473#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:21,098 INFO L290 TraceCheckUtils]: 22: Hoare triple {2473#(<= ~counter~0 1)} assume true; {2473#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:21,098 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2473#(<= ~counter~0 1)} {2473#(<= ~counter~0 1)} #63#return; {2473#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:21,099 INFO L290 TraceCheckUtils]: 24: Hoare triple {2473#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {2473#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:21,099 INFO L290 TraceCheckUtils]: 25: Hoare triple {2473#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2473#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:21,099 INFO L290 TraceCheckUtils]: 26: Hoare triple {2473#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2501#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:21,099 INFO L290 TraceCheckUtils]: 27: Hoare triple {2501#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {2501#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:21,100 INFO L272 TraceCheckUtils]: 28: Hoare triple {2501#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2501#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:21,100 INFO L290 TraceCheckUtils]: 29: Hoare triple {2501#(<= ~counter~0 2)} ~cond := #in~cond; {2501#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:21,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {2501#(<= ~counter~0 2)} assume !(0 == ~cond); {2501#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:21,101 INFO L290 TraceCheckUtils]: 31: Hoare triple {2501#(<= ~counter~0 2)} assume true; {2501#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:21,101 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2501#(<= ~counter~0 2)} {2501#(<= ~counter~0 2)} #63#return; {2501#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:21,101 INFO L290 TraceCheckUtils]: 33: Hoare triple {2501#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {2501#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:21,101 INFO L290 TraceCheckUtils]: 34: Hoare triple {2501#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2501#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:21,102 INFO L290 TraceCheckUtils]: 35: Hoare triple {2501#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2529#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:21,102 INFO L290 TraceCheckUtils]: 36: Hoare triple {2529#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {2529#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:21,103 INFO L272 TraceCheckUtils]: 37: Hoare triple {2529#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2529#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:21,103 INFO L290 TraceCheckUtils]: 38: Hoare triple {2529#(<= ~counter~0 3)} ~cond := #in~cond; {2529#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:21,103 INFO L290 TraceCheckUtils]: 39: Hoare triple {2529#(<= ~counter~0 3)} assume !(0 == ~cond); {2529#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:21,103 INFO L290 TraceCheckUtils]: 40: Hoare triple {2529#(<= ~counter~0 3)} assume true; {2529#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:21,104 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2529#(<= ~counter~0 3)} {2529#(<= ~counter~0 3)} #63#return; {2529#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:21,104 INFO L290 TraceCheckUtils]: 42: Hoare triple {2529#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {2529#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:21,104 INFO L290 TraceCheckUtils]: 43: Hoare triple {2529#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2529#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:21,105 INFO L290 TraceCheckUtils]: 44: Hoare triple {2529#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2557#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:21,105 INFO L290 TraceCheckUtils]: 45: Hoare triple {2557#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {2557#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:21,105 INFO L272 TraceCheckUtils]: 46: Hoare triple {2557#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2557#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:21,106 INFO L290 TraceCheckUtils]: 47: Hoare triple {2557#(<= ~counter~0 4)} ~cond := #in~cond; {2557#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:21,106 INFO L290 TraceCheckUtils]: 48: Hoare triple {2557#(<= ~counter~0 4)} assume !(0 == ~cond); {2557#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:21,106 INFO L290 TraceCheckUtils]: 49: Hoare triple {2557#(<= ~counter~0 4)} assume true; {2557#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:21,111 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2557#(<= ~counter~0 4)} {2557#(<= ~counter~0 4)} #63#return; {2557#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:21,112 INFO L290 TraceCheckUtils]: 51: Hoare triple {2557#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {2557#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:21,112 INFO L290 TraceCheckUtils]: 52: Hoare triple {2557#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2557#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:21,112 INFO L290 TraceCheckUtils]: 53: Hoare triple {2557#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2585#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:21,115 INFO L290 TraceCheckUtils]: 54: Hoare triple {2585#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {2585#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:21,117 INFO L272 TraceCheckUtils]: 55: Hoare triple {2585#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2585#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:21,118 INFO L290 TraceCheckUtils]: 56: Hoare triple {2585#(<= ~counter~0 5)} ~cond := #in~cond; {2585#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:21,118 INFO L290 TraceCheckUtils]: 57: Hoare triple {2585#(<= ~counter~0 5)} assume !(0 == ~cond); {2585#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:21,119 INFO L290 TraceCheckUtils]: 58: Hoare triple {2585#(<= ~counter~0 5)} assume true; {2585#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:21,119 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2585#(<= ~counter~0 5)} {2585#(<= ~counter~0 5)} #63#return; {2585#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:21,119 INFO L290 TraceCheckUtils]: 60: Hoare triple {2585#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {2585#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:21,120 INFO L290 TraceCheckUtils]: 61: Hoare triple {2585#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2585#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:21,120 INFO L290 TraceCheckUtils]: 62: Hoare triple {2585#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2613#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:21,120 INFO L290 TraceCheckUtils]: 63: Hoare triple {2613#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {2613#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:21,121 INFO L272 TraceCheckUtils]: 64: Hoare triple {2613#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2613#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:21,121 INFO L290 TraceCheckUtils]: 65: Hoare triple {2613#(<= ~counter~0 6)} ~cond := #in~cond; {2613#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:21,121 INFO L290 TraceCheckUtils]: 66: Hoare triple {2613#(<= ~counter~0 6)} assume !(0 == ~cond); {2613#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:21,122 INFO L290 TraceCheckUtils]: 67: Hoare triple {2613#(<= ~counter~0 6)} assume true; {2613#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:21,122 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {2613#(<= ~counter~0 6)} {2613#(<= ~counter~0 6)} #63#return; {2613#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:21,122 INFO L290 TraceCheckUtils]: 69: Hoare triple {2613#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {2613#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:21,123 INFO L290 TraceCheckUtils]: 70: Hoare triple {2613#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2613#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:21,123 INFO L290 TraceCheckUtils]: 71: Hoare triple {2613#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2641#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:21,123 INFO L290 TraceCheckUtils]: 72: Hoare triple {2641#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {2641#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:21,124 INFO L272 TraceCheckUtils]: 73: Hoare triple {2641#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2641#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:21,124 INFO L290 TraceCheckUtils]: 74: Hoare triple {2641#(<= ~counter~0 7)} ~cond := #in~cond; {2641#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:21,124 INFO L290 TraceCheckUtils]: 75: Hoare triple {2641#(<= ~counter~0 7)} assume !(0 == ~cond); {2641#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:21,125 INFO L290 TraceCheckUtils]: 76: Hoare triple {2641#(<= ~counter~0 7)} assume true; {2641#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:21,125 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {2641#(<= ~counter~0 7)} {2641#(<= ~counter~0 7)} #63#return; {2641#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:21,125 INFO L290 TraceCheckUtils]: 78: Hoare triple {2641#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {2641#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:21,126 INFO L290 TraceCheckUtils]: 79: Hoare triple {2641#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2641#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:21,126 INFO L290 TraceCheckUtils]: 80: Hoare triple {2641#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2669#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:21,126 INFO L290 TraceCheckUtils]: 81: Hoare triple {2669#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {2669#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:21,127 INFO L272 TraceCheckUtils]: 82: Hoare triple {2669#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2669#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:21,127 INFO L290 TraceCheckUtils]: 83: Hoare triple {2669#(<= ~counter~0 8)} ~cond := #in~cond; {2669#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:21,127 INFO L290 TraceCheckUtils]: 84: Hoare triple {2669#(<= ~counter~0 8)} assume !(0 == ~cond); {2669#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:21,128 INFO L290 TraceCheckUtils]: 85: Hoare triple {2669#(<= ~counter~0 8)} assume true; {2669#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:21,128 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {2669#(<= ~counter~0 8)} {2669#(<= ~counter~0 8)} #63#return; {2669#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:21,128 INFO L290 TraceCheckUtils]: 87: Hoare triple {2669#(<= ~counter~0 8)} assume !!(0 != ~y3~0); {2669#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:21,128 INFO L290 TraceCheckUtils]: 88: Hoare triple {2669#(<= ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2669#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:21,129 INFO L290 TraceCheckUtils]: 89: Hoare triple {2669#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2697#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:21,129 INFO L290 TraceCheckUtils]: 90: Hoare triple {2697#(<= ~counter~0 9)} assume !!(#t~post6 < 50);havoc #t~post6; {2697#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:21,130 INFO L272 TraceCheckUtils]: 91: Hoare triple {2697#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2697#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:21,130 INFO L290 TraceCheckUtils]: 92: Hoare triple {2697#(<= ~counter~0 9)} ~cond := #in~cond; {2697#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:21,130 INFO L290 TraceCheckUtils]: 93: Hoare triple {2697#(<= ~counter~0 9)} assume !(0 == ~cond); {2697#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:21,130 INFO L290 TraceCheckUtils]: 94: Hoare triple {2697#(<= ~counter~0 9)} assume true; {2697#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:21,131 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {2697#(<= ~counter~0 9)} {2697#(<= ~counter~0 9)} #63#return; {2697#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:21,131 INFO L290 TraceCheckUtils]: 96: Hoare triple {2697#(<= ~counter~0 9)} assume !!(0 != ~y3~0); {2697#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:21,131 INFO L290 TraceCheckUtils]: 97: Hoare triple {2697#(<= ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2697#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:21,132 INFO L290 TraceCheckUtils]: 98: Hoare triple {2697#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2725#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:21,132 INFO L290 TraceCheckUtils]: 99: Hoare triple {2725#(<= ~counter~0 10)} assume !!(#t~post6 < 50);havoc #t~post6; {2725#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:21,133 INFO L272 TraceCheckUtils]: 100: Hoare triple {2725#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2725#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:21,133 INFO L290 TraceCheckUtils]: 101: Hoare triple {2725#(<= ~counter~0 10)} ~cond := #in~cond; {2725#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:21,133 INFO L290 TraceCheckUtils]: 102: Hoare triple {2725#(<= ~counter~0 10)} assume !(0 == ~cond); {2725#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:21,133 INFO L290 TraceCheckUtils]: 103: Hoare triple {2725#(<= ~counter~0 10)} assume true; {2725#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:21,134 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {2725#(<= ~counter~0 10)} {2725#(<= ~counter~0 10)} #63#return; {2725#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:21,134 INFO L290 TraceCheckUtils]: 105: Hoare triple {2725#(<= ~counter~0 10)} assume !!(0 != ~y3~0); {2725#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:21,134 INFO L290 TraceCheckUtils]: 106: Hoare triple {2725#(<= ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2725#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:21,135 INFO L290 TraceCheckUtils]: 107: Hoare triple {2725#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2753#(<= |main_#t~post6| 10)} is VALID [2022-04-27 14:23:21,135 INFO L290 TraceCheckUtils]: 108: Hoare triple {2753#(<= |main_#t~post6| 10)} assume !(#t~post6 < 50);havoc #t~post6; {2417#false} is VALID [2022-04-27 14:23:21,136 INFO L272 TraceCheckUtils]: 109: Hoare triple {2417#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {2417#false} is VALID [2022-04-27 14:23:21,136 INFO L290 TraceCheckUtils]: 110: Hoare triple {2417#false} ~cond := #in~cond; {2417#false} is VALID [2022-04-27 14:23:21,136 INFO L290 TraceCheckUtils]: 111: Hoare triple {2417#false} assume 0 == ~cond; {2417#false} is VALID [2022-04-27 14:23:21,136 INFO L290 TraceCheckUtils]: 112: Hoare triple {2417#false} assume !false; {2417#false} is VALID [2022-04-27 14:23:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:23:21,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:23:21,763 INFO L290 TraceCheckUtils]: 112: Hoare triple {2417#false} assume !false; {2417#false} is VALID [2022-04-27 14:23:21,763 INFO L290 TraceCheckUtils]: 111: Hoare triple {2417#false} assume 0 == ~cond; {2417#false} is VALID [2022-04-27 14:23:21,763 INFO L290 TraceCheckUtils]: 110: Hoare triple {2417#false} ~cond := #in~cond; {2417#false} is VALID [2022-04-27 14:23:21,763 INFO L272 TraceCheckUtils]: 109: Hoare triple {2417#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {2417#false} is VALID [2022-04-27 14:23:21,764 INFO L290 TraceCheckUtils]: 108: Hoare triple {2781#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {2417#false} is VALID [2022-04-27 14:23:21,764 INFO L290 TraceCheckUtils]: 107: Hoare triple {2785#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2781#(< |main_#t~post6| 50)} is VALID [2022-04-27 14:23:21,764 INFO L290 TraceCheckUtils]: 106: Hoare triple {2785#(< ~counter~0 50)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2785#(< ~counter~0 50)} is VALID [2022-04-27 14:23:21,765 INFO L290 TraceCheckUtils]: 105: Hoare triple {2785#(< ~counter~0 50)} assume !!(0 != ~y3~0); {2785#(< ~counter~0 50)} is VALID [2022-04-27 14:23:21,765 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {2416#true} {2785#(< ~counter~0 50)} #63#return; {2785#(< ~counter~0 50)} is VALID [2022-04-27 14:23:21,765 INFO L290 TraceCheckUtils]: 103: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-04-27 14:23:21,765 INFO L290 TraceCheckUtils]: 102: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-04-27 14:23:21,765 INFO L290 TraceCheckUtils]: 101: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-04-27 14:23:21,765 INFO L272 TraceCheckUtils]: 100: Hoare triple {2785#(< ~counter~0 50)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2416#true} is VALID [2022-04-27 14:23:21,766 INFO L290 TraceCheckUtils]: 99: Hoare triple {2785#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {2785#(< ~counter~0 50)} is VALID [2022-04-27 14:23:21,766 INFO L290 TraceCheckUtils]: 98: Hoare triple {2813#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2785#(< ~counter~0 50)} is VALID [2022-04-27 14:23:21,766 INFO L290 TraceCheckUtils]: 97: Hoare triple {2813#(< ~counter~0 49)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2813#(< ~counter~0 49)} is VALID [2022-04-27 14:23:21,766 INFO L290 TraceCheckUtils]: 96: Hoare triple {2813#(< ~counter~0 49)} assume !!(0 != ~y3~0); {2813#(< ~counter~0 49)} is VALID [2022-04-27 14:23:21,767 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {2416#true} {2813#(< ~counter~0 49)} #63#return; {2813#(< ~counter~0 49)} is VALID [2022-04-27 14:23:21,767 INFO L290 TraceCheckUtils]: 94: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-04-27 14:23:21,767 INFO L290 TraceCheckUtils]: 93: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-04-27 14:23:21,767 INFO L290 TraceCheckUtils]: 92: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-04-27 14:23:21,767 INFO L272 TraceCheckUtils]: 91: Hoare triple {2813#(< ~counter~0 49)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2416#true} is VALID [2022-04-27 14:23:21,767 INFO L290 TraceCheckUtils]: 90: Hoare triple {2813#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {2813#(< ~counter~0 49)} is VALID [2022-04-27 14:23:21,768 INFO L290 TraceCheckUtils]: 89: Hoare triple {2841#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2813#(< ~counter~0 49)} is VALID [2022-04-27 14:23:21,768 INFO L290 TraceCheckUtils]: 88: Hoare triple {2841#(< ~counter~0 48)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2841#(< ~counter~0 48)} is VALID [2022-04-27 14:23:21,768 INFO L290 TraceCheckUtils]: 87: Hoare triple {2841#(< ~counter~0 48)} assume !!(0 != ~y3~0); {2841#(< ~counter~0 48)} is VALID [2022-04-27 14:23:21,769 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {2416#true} {2841#(< ~counter~0 48)} #63#return; {2841#(< ~counter~0 48)} is VALID [2022-04-27 14:23:21,769 INFO L290 TraceCheckUtils]: 85: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-04-27 14:23:21,769 INFO L290 TraceCheckUtils]: 84: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-04-27 14:23:21,769 INFO L290 TraceCheckUtils]: 83: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-04-27 14:23:21,769 INFO L272 TraceCheckUtils]: 82: Hoare triple {2841#(< ~counter~0 48)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2416#true} is VALID [2022-04-27 14:23:21,769 INFO L290 TraceCheckUtils]: 81: Hoare triple {2841#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {2841#(< ~counter~0 48)} is VALID [2022-04-27 14:23:21,770 INFO L290 TraceCheckUtils]: 80: Hoare triple {2869#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2841#(< ~counter~0 48)} is VALID [2022-04-27 14:23:21,770 INFO L290 TraceCheckUtils]: 79: Hoare triple {2869#(< ~counter~0 47)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2869#(< ~counter~0 47)} is VALID [2022-04-27 14:23:21,770 INFO L290 TraceCheckUtils]: 78: Hoare triple {2869#(< ~counter~0 47)} assume !!(0 != ~y3~0); {2869#(< ~counter~0 47)} is VALID [2022-04-27 14:23:21,771 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {2416#true} {2869#(< ~counter~0 47)} #63#return; {2869#(< ~counter~0 47)} is VALID [2022-04-27 14:23:21,771 INFO L290 TraceCheckUtils]: 76: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-04-27 14:23:21,771 INFO L290 TraceCheckUtils]: 75: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-04-27 14:23:21,771 INFO L290 TraceCheckUtils]: 74: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-04-27 14:23:21,771 INFO L272 TraceCheckUtils]: 73: Hoare triple {2869#(< ~counter~0 47)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2416#true} is VALID [2022-04-27 14:23:21,771 INFO L290 TraceCheckUtils]: 72: Hoare triple {2869#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {2869#(< ~counter~0 47)} is VALID [2022-04-27 14:23:21,776 INFO L290 TraceCheckUtils]: 71: Hoare triple {2897#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2869#(< ~counter~0 47)} is VALID [2022-04-27 14:23:21,776 INFO L290 TraceCheckUtils]: 70: Hoare triple {2897#(< ~counter~0 46)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2897#(< ~counter~0 46)} is VALID [2022-04-27 14:23:21,776 INFO L290 TraceCheckUtils]: 69: Hoare triple {2897#(< ~counter~0 46)} assume !!(0 != ~y3~0); {2897#(< ~counter~0 46)} is VALID [2022-04-27 14:23:21,777 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {2416#true} {2897#(< ~counter~0 46)} #63#return; {2897#(< ~counter~0 46)} is VALID [2022-04-27 14:23:21,777 INFO L290 TraceCheckUtils]: 67: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-04-27 14:23:21,777 INFO L290 TraceCheckUtils]: 66: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-04-27 14:23:21,777 INFO L290 TraceCheckUtils]: 65: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-04-27 14:23:21,777 INFO L272 TraceCheckUtils]: 64: Hoare triple {2897#(< ~counter~0 46)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2416#true} is VALID [2022-04-27 14:23:21,777 INFO L290 TraceCheckUtils]: 63: Hoare triple {2897#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {2897#(< ~counter~0 46)} is VALID [2022-04-27 14:23:21,778 INFO L290 TraceCheckUtils]: 62: Hoare triple {2925#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2897#(< ~counter~0 46)} is VALID [2022-04-27 14:23:21,778 INFO L290 TraceCheckUtils]: 61: Hoare triple {2925#(< ~counter~0 45)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2925#(< ~counter~0 45)} is VALID [2022-04-27 14:23:21,778 INFO L290 TraceCheckUtils]: 60: Hoare triple {2925#(< ~counter~0 45)} assume !!(0 != ~y3~0); {2925#(< ~counter~0 45)} is VALID [2022-04-27 14:23:21,779 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2416#true} {2925#(< ~counter~0 45)} #63#return; {2925#(< ~counter~0 45)} is VALID [2022-04-27 14:23:21,779 INFO L290 TraceCheckUtils]: 58: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-04-27 14:23:21,779 INFO L290 TraceCheckUtils]: 57: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-04-27 14:23:21,779 INFO L290 TraceCheckUtils]: 56: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-04-27 14:23:21,779 INFO L272 TraceCheckUtils]: 55: Hoare triple {2925#(< ~counter~0 45)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2416#true} is VALID [2022-04-27 14:23:21,787 INFO L290 TraceCheckUtils]: 54: Hoare triple {2925#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {2925#(< ~counter~0 45)} is VALID [2022-04-27 14:23:21,788 INFO L290 TraceCheckUtils]: 53: Hoare triple {2953#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2925#(< ~counter~0 45)} is VALID [2022-04-27 14:23:21,788 INFO L290 TraceCheckUtils]: 52: Hoare triple {2953#(< ~counter~0 44)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2953#(< ~counter~0 44)} is VALID [2022-04-27 14:23:21,788 INFO L290 TraceCheckUtils]: 51: Hoare triple {2953#(< ~counter~0 44)} assume !!(0 != ~y3~0); {2953#(< ~counter~0 44)} is VALID [2022-04-27 14:23:21,789 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2416#true} {2953#(< ~counter~0 44)} #63#return; {2953#(< ~counter~0 44)} is VALID [2022-04-27 14:23:21,789 INFO L290 TraceCheckUtils]: 49: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-04-27 14:23:21,789 INFO L290 TraceCheckUtils]: 48: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-04-27 14:23:21,789 INFO L290 TraceCheckUtils]: 47: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-04-27 14:23:21,789 INFO L272 TraceCheckUtils]: 46: Hoare triple {2953#(< ~counter~0 44)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2416#true} is VALID [2022-04-27 14:23:21,789 INFO L290 TraceCheckUtils]: 45: Hoare triple {2953#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {2953#(< ~counter~0 44)} is VALID [2022-04-27 14:23:21,790 INFO L290 TraceCheckUtils]: 44: Hoare triple {2981#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2953#(< ~counter~0 44)} is VALID [2022-04-27 14:23:21,790 INFO L290 TraceCheckUtils]: 43: Hoare triple {2981#(< ~counter~0 43)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2981#(< ~counter~0 43)} is VALID [2022-04-27 14:23:21,790 INFO L290 TraceCheckUtils]: 42: Hoare triple {2981#(< ~counter~0 43)} assume !!(0 != ~y3~0); {2981#(< ~counter~0 43)} is VALID [2022-04-27 14:23:21,791 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2416#true} {2981#(< ~counter~0 43)} #63#return; {2981#(< ~counter~0 43)} is VALID [2022-04-27 14:23:21,791 INFO L290 TraceCheckUtils]: 40: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-04-27 14:23:21,791 INFO L290 TraceCheckUtils]: 39: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-04-27 14:23:21,791 INFO L290 TraceCheckUtils]: 38: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-04-27 14:23:21,791 INFO L272 TraceCheckUtils]: 37: Hoare triple {2981#(< ~counter~0 43)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2416#true} is VALID [2022-04-27 14:23:21,791 INFO L290 TraceCheckUtils]: 36: Hoare triple {2981#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {2981#(< ~counter~0 43)} is VALID [2022-04-27 14:23:21,792 INFO L290 TraceCheckUtils]: 35: Hoare triple {3009#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2981#(< ~counter~0 43)} is VALID [2022-04-27 14:23:21,792 INFO L290 TraceCheckUtils]: 34: Hoare triple {3009#(< ~counter~0 42)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3009#(< ~counter~0 42)} is VALID [2022-04-27 14:23:21,792 INFO L290 TraceCheckUtils]: 33: Hoare triple {3009#(< ~counter~0 42)} assume !!(0 != ~y3~0); {3009#(< ~counter~0 42)} is VALID [2022-04-27 14:23:21,793 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2416#true} {3009#(< ~counter~0 42)} #63#return; {3009#(< ~counter~0 42)} is VALID [2022-04-27 14:23:21,793 INFO L290 TraceCheckUtils]: 31: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-04-27 14:23:21,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-04-27 14:23:21,793 INFO L290 TraceCheckUtils]: 29: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-04-27 14:23:21,793 INFO L272 TraceCheckUtils]: 28: Hoare triple {3009#(< ~counter~0 42)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2416#true} is VALID [2022-04-27 14:23:21,793 INFO L290 TraceCheckUtils]: 27: Hoare triple {3009#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {3009#(< ~counter~0 42)} is VALID [2022-04-27 14:23:21,794 INFO L290 TraceCheckUtils]: 26: Hoare triple {3037#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3009#(< ~counter~0 42)} is VALID [2022-04-27 14:23:21,794 INFO L290 TraceCheckUtils]: 25: Hoare triple {3037#(< ~counter~0 41)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3037#(< ~counter~0 41)} is VALID [2022-04-27 14:23:21,794 INFO L290 TraceCheckUtils]: 24: Hoare triple {3037#(< ~counter~0 41)} assume !!(0 != ~y3~0); {3037#(< ~counter~0 41)} is VALID [2022-04-27 14:23:21,795 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2416#true} {3037#(< ~counter~0 41)} #63#return; {3037#(< ~counter~0 41)} is VALID [2022-04-27 14:23:21,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-04-27 14:23:21,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-04-27 14:23:21,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-04-27 14:23:21,795 INFO L272 TraceCheckUtils]: 19: Hoare triple {3037#(< ~counter~0 41)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2416#true} is VALID [2022-04-27 14:23:21,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {3037#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {3037#(< ~counter~0 41)} is VALID [2022-04-27 14:23:21,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {3065#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3037#(< ~counter~0 41)} is VALID [2022-04-27 14:23:21,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {3065#(< ~counter~0 40)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {3065#(< ~counter~0 40)} is VALID [2022-04-27 14:23:21,797 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2416#true} {3065#(< ~counter~0 40)} #61#return; {3065#(< ~counter~0 40)} is VALID [2022-04-27 14:23:21,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-04-27 14:23:21,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-04-27 14:23:21,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-04-27 14:23:21,797 INFO L272 TraceCheckUtils]: 11: Hoare triple {3065#(< ~counter~0 40)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {2416#true} is VALID [2022-04-27 14:23:21,798 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2416#true} {3065#(< ~counter~0 40)} #59#return; {3065#(< ~counter~0 40)} is VALID [2022-04-27 14:23:21,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-04-27 14:23:21,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-04-27 14:23:21,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-04-27 14:23:21,798 INFO L272 TraceCheckUtils]: 6: Hoare triple {3065#(< ~counter~0 40)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {2416#true} is VALID [2022-04-27 14:23:21,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {3065#(< ~counter~0 40)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {3065#(< ~counter~0 40)} is VALID [2022-04-27 14:23:21,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {3065#(< ~counter~0 40)} call #t~ret7 := main(); {3065#(< ~counter~0 40)} is VALID [2022-04-27 14:23:21,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3065#(< ~counter~0 40)} {2416#true} #67#return; {3065#(< ~counter~0 40)} is VALID [2022-04-27 14:23:21,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {3065#(< ~counter~0 40)} assume true; {3065#(< ~counter~0 40)} is VALID [2022-04-27 14:23:21,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {2416#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; {3065#(< ~counter~0 40)} is VALID [2022-04-27 14:23:21,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {2416#true} call ULTIMATE.init(); {2416#true} is VALID [2022-04-27 14:23:21,800 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-27 14:23:21,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:23:21,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782368598] [2022-04-27 14:23:21,801 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:23:21,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321734111] [2022-04-27 14:23:21,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321734111] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:23:21,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:23:21,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-27 14:23:21,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650350127] [2022-04-27 14:23:21,801 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:23:21,804 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) Word has length 113 [2022-04-27 14:23:21,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:23:21,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-27 14:23:21,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:23:21,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 14:23:21,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:23:21,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 14:23:21,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-27 14:23:21,918 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-27 14:23:22,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:22,810 INFO L93 Difference]: Finished difference Result 223 states and 257 transitions. [2022-04-27 14:23:22,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-27 14:23:22,811 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) Word has length 113 [2022-04-27 14:23:22,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:23:22,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-27 14:23:22,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 256 transitions. [2022-04-27 14:23:22,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-27 14:23:22,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 256 transitions. [2022-04-27 14:23:22,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 256 transitions. [2022-04-27 14:23:22,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:23:22,973 INFO L225 Difference]: With dead ends: 223 [2022-04-27 14:23:22,973 INFO L226 Difference]: Without dead ends: 218 [2022-04-27 14:23:22,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2022-04-27 14:23:22,975 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 251 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:23:22,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 262 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:23:22,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-04-27 14:23:23,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2022-04-27 14:23:23,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:23:23,062 INFO L82 GeneralOperation]: Start isEquivalent. First operand 218 states. Second operand has 218 states, 166 states have (on average 1.1385542168674698) internal successors, (189), 166 states have internal predecessors, (189), 27 states have call successors, (27), 26 states have call predecessors, (27), 24 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 14:23:23,062 INFO L74 IsIncluded]: Start isIncluded. First operand 218 states. Second operand has 218 states, 166 states have (on average 1.1385542168674698) internal successors, (189), 166 states have internal predecessors, (189), 27 states have call successors, (27), 26 states have call predecessors, (27), 24 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 14:23:23,062 INFO L87 Difference]: Start difference. First operand 218 states. Second operand has 218 states, 166 states have (on average 1.1385542168674698) internal successors, (189), 166 states have internal predecessors, (189), 27 states have call successors, (27), 26 states have call predecessors, (27), 24 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 14:23:23,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:23,067 INFO L93 Difference]: Finished difference Result 218 states and 241 transitions. [2022-04-27 14:23:23,067 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 241 transitions. [2022-04-27 14:23:23,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:23,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:23,068 INFO L74 IsIncluded]: Start isIncluded. First operand has 218 states, 166 states have (on average 1.1385542168674698) internal successors, (189), 166 states have internal predecessors, (189), 27 states have call successors, (27), 26 states have call predecessors, (27), 24 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 218 states. [2022-04-27 14:23:23,068 INFO L87 Difference]: Start difference. First operand has 218 states, 166 states have (on average 1.1385542168674698) internal successors, (189), 166 states have internal predecessors, (189), 27 states have call successors, (27), 26 states have call predecessors, (27), 24 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 218 states. [2022-04-27 14:23:23,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:23,073 INFO L93 Difference]: Finished difference Result 218 states and 241 transitions. [2022-04-27 14:23:23,073 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 241 transitions. [2022-04-27 14:23:23,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:23,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:23,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:23:23,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:23:23,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 166 states have (on average 1.1385542168674698) internal successors, (189), 166 states have internal predecessors, (189), 27 states have call successors, (27), 26 states have call predecessors, (27), 24 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 14:23:23,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 241 transitions. [2022-04-27 14:23:23,079 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 241 transitions. Word has length 113 [2022-04-27 14:23:23,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:23:23,079 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 241 transitions. [2022-04-27 14:23:23,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-27 14:23:23,079 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 241 transitions. [2022-04-27 14:23:23,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-04-27 14:23:23,082 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:23:23,082 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:23:23,100 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-27 14:23:23,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:23:23,295 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:23:23,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:23:23,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1234385578, now seen corresponding path program 4 times [2022-04-27 14:23:23,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:23:23,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397482019] [2022-04-27 14:23:23,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:23:23,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:23:23,323 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:23:23,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [325391408] [2022-04-27 14:23:23,323 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:23:23,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:23:23,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:23:23,329 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-27 14:23:23,330 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-27 14:23:23,429 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:23:23,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:23:23,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-27 14:23:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:23:23,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:23:24,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {4192#true} call ULTIMATE.init(); {4192#true} is VALID [2022-04-27 14:23:24,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {4192#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; {4200#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:24,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {4200#(<= ~counter~0 0)} assume true; {4200#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:24,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4200#(<= ~counter~0 0)} {4192#true} #67#return; {4200#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:24,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {4200#(<= ~counter~0 0)} call #t~ret7 := main(); {4200#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:24,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {4200#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {4200#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:24,598 INFO L272 TraceCheckUtils]: 6: Hoare triple {4200#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {4200#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:24,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {4200#(<= ~counter~0 0)} ~cond := #in~cond; {4200#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:24,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {4200#(<= ~counter~0 0)} assume !(0 == ~cond); {4200#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:24,598 INFO L290 TraceCheckUtils]: 9: Hoare triple {4200#(<= ~counter~0 0)} assume true; {4200#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:24,599 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4200#(<= ~counter~0 0)} {4200#(<= ~counter~0 0)} #59#return; {4200#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:24,599 INFO L272 TraceCheckUtils]: 11: Hoare triple {4200#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {4200#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:24,599 INFO L290 TraceCheckUtils]: 12: Hoare triple {4200#(<= ~counter~0 0)} ~cond := #in~cond; {4200#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:24,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {4200#(<= ~counter~0 0)} assume !(0 == ~cond); {4200#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:24,600 INFO L290 TraceCheckUtils]: 14: Hoare triple {4200#(<= ~counter~0 0)} assume true; {4200#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:24,600 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4200#(<= ~counter~0 0)} {4200#(<= ~counter~0 0)} #61#return; {4200#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:24,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {4200#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {4200#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:24,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {4200#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4249#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:24,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {4249#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {4249#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:24,605 INFO L272 TraceCheckUtils]: 19: Hoare triple {4249#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4249#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:24,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {4249#(<= ~counter~0 1)} ~cond := #in~cond; {4249#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:24,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {4249#(<= ~counter~0 1)} assume !(0 == ~cond); {4249#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:24,605 INFO L290 TraceCheckUtils]: 22: Hoare triple {4249#(<= ~counter~0 1)} assume true; {4249#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:24,606 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4249#(<= ~counter~0 1)} {4249#(<= ~counter~0 1)} #63#return; {4249#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:24,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {4249#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {4249#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:24,606 INFO L290 TraceCheckUtils]: 25: Hoare triple {4249#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4249#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:24,607 INFO L290 TraceCheckUtils]: 26: Hoare triple {4249#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4277#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:24,607 INFO L290 TraceCheckUtils]: 27: Hoare triple {4277#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {4277#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:24,607 INFO L272 TraceCheckUtils]: 28: Hoare triple {4277#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4277#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:24,608 INFO L290 TraceCheckUtils]: 29: Hoare triple {4277#(<= ~counter~0 2)} ~cond := #in~cond; {4277#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:24,608 INFO L290 TraceCheckUtils]: 30: Hoare triple {4277#(<= ~counter~0 2)} assume !(0 == ~cond); {4277#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:24,608 INFO L290 TraceCheckUtils]: 31: Hoare triple {4277#(<= ~counter~0 2)} assume true; {4277#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:24,609 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4277#(<= ~counter~0 2)} {4277#(<= ~counter~0 2)} #63#return; {4277#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:24,609 INFO L290 TraceCheckUtils]: 33: Hoare triple {4277#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {4277#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:24,609 INFO L290 TraceCheckUtils]: 34: Hoare triple {4277#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4277#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:24,610 INFO L290 TraceCheckUtils]: 35: Hoare triple {4277#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4305#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:24,610 INFO L290 TraceCheckUtils]: 36: Hoare triple {4305#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {4305#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:24,610 INFO L272 TraceCheckUtils]: 37: Hoare triple {4305#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4305#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:24,611 INFO L290 TraceCheckUtils]: 38: Hoare triple {4305#(<= ~counter~0 3)} ~cond := #in~cond; {4305#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:24,611 INFO L290 TraceCheckUtils]: 39: Hoare triple {4305#(<= ~counter~0 3)} assume !(0 == ~cond); {4305#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:24,611 INFO L290 TraceCheckUtils]: 40: Hoare triple {4305#(<= ~counter~0 3)} assume true; {4305#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:24,612 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4305#(<= ~counter~0 3)} {4305#(<= ~counter~0 3)} #63#return; {4305#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:24,612 INFO L290 TraceCheckUtils]: 42: Hoare triple {4305#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {4305#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:24,612 INFO L290 TraceCheckUtils]: 43: Hoare triple {4305#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4305#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:24,612 INFO L290 TraceCheckUtils]: 44: Hoare triple {4305#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4333#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:24,613 INFO L290 TraceCheckUtils]: 45: Hoare triple {4333#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {4333#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:24,613 INFO L272 TraceCheckUtils]: 46: Hoare triple {4333#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4333#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:24,613 INFO L290 TraceCheckUtils]: 47: Hoare triple {4333#(<= ~counter~0 4)} ~cond := #in~cond; {4333#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:24,614 INFO L290 TraceCheckUtils]: 48: Hoare triple {4333#(<= ~counter~0 4)} assume !(0 == ~cond); {4333#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:24,614 INFO L290 TraceCheckUtils]: 49: Hoare triple {4333#(<= ~counter~0 4)} assume true; {4333#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:24,614 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4333#(<= ~counter~0 4)} {4333#(<= ~counter~0 4)} #63#return; {4333#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:24,615 INFO L290 TraceCheckUtils]: 51: Hoare triple {4333#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {4333#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:24,615 INFO L290 TraceCheckUtils]: 52: Hoare triple {4333#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4333#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:24,615 INFO L290 TraceCheckUtils]: 53: Hoare triple {4333#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4361#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:24,616 INFO L290 TraceCheckUtils]: 54: Hoare triple {4361#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {4361#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:24,616 INFO L272 TraceCheckUtils]: 55: Hoare triple {4361#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4361#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:24,616 INFO L290 TraceCheckUtils]: 56: Hoare triple {4361#(<= ~counter~0 5)} ~cond := #in~cond; {4361#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:24,616 INFO L290 TraceCheckUtils]: 57: Hoare triple {4361#(<= ~counter~0 5)} assume !(0 == ~cond); {4361#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:24,617 INFO L290 TraceCheckUtils]: 58: Hoare triple {4361#(<= ~counter~0 5)} assume true; {4361#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:24,617 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4361#(<= ~counter~0 5)} {4361#(<= ~counter~0 5)} #63#return; {4361#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:24,617 INFO L290 TraceCheckUtils]: 60: Hoare triple {4361#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {4361#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:24,618 INFO L290 TraceCheckUtils]: 61: Hoare triple {4361#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4361#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:24,618 INFO L290 TraceCheckUtils]: 62: Hoare triple {4361#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4389#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:24,618 INFO L290 TraceCheckUtils]: 63: Hoare triple {4389#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {4389#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:24,619 INFO L272 TraceCheckUtils]: 64: Hoare triple {4389#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4389#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:24,619 INFO L290 TraceCheckUtils]: 65: Hoare triple {4389#(<= ~counter~0 6)} ~cond := #in~cond; {4389#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:24,619 INFO L290 TraceCheckUtils]: 66: Hoare triple {4389#(<= ~counter~0 6)} assume !(0 == ~cond); {4389#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:24,620 INFO L290 TraceCheckUtils]: 67: Hoare triple {4389#(<= ~counter~0 6)} assume true; {4389#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:24,620 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4389#(<= ~counter~0 6)} {4389#(<= ~counter~0 6)} #63#return; {4389#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:24,620 INFO L290 TraceCheckUtils]: 69: Hoare triple {4389#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {4389#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:24,620 INFO L290 TraceCheckUtils]: 70: Hoare triple {4389#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4389#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:24,621 INFO L290 TraceCheckUtils]: 71: Hoare triple {4389#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4417#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:24,621 INFO L290 TraceCheckUtils]: 72: Hoare triple {4417#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {4417#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:24,622 INFO L272 TraceCheckUtils]: 73: Hoare triple {4417#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4417#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:24,622 INFO L290 TraceCheckUtils]: 74: Hoare triple {4417#(<= ~counter~0 7)} ~cond := #in~cond; {4417#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:24,622 INFO L290 TraceCheckUtils]: 75: Hoare triple {4417#(<= ~counter~0 7)} assume !(0 == ~cond); {4417#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:24,622 INFO L290 TraceCheckUtils]: 76: Hoare triple {4417#(<= ~counter~0 7)} assume true; {4417#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:24,623 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {4417#(<= ~counter~0 7)} {4417#(<= ~counter~0 7)} #63#return; {4417#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:24,623 INFO L290 TraceCheckUtils]: 78: Hoare triple {4417#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {4417#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:24,623 INFO L290 TraceCheckUtils]: 79: Hoare triple {4417#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4417#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:24,624 INFO L290 TraceCheckUtils]: 80: Hoare triple {4417#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4445#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:24,624 INFO L290 TraceCheckUtils]: 81: Hoare triple {4445#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {4445#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:24,624 INFO L272 TraceCheckUtils]: 82: Hoare triple {4445#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4445#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:24,625 INFO L290 TraceCheckUtils]: 83: Hoare triple {4445#(<= ~counter~0 8)} ~cond := #in~cond; {4445#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:24,625 INFO L290 TraceCheckUtils]: 84: Hoare triple {4445#(<= ~counter~0 8)} assume !(0 == ~cond); {4445#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:24,625 INFO L290 TraceCheckUtils]: 85: Hoare triple {4445#(<= ~counter~0 8)} assume true; {4445#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:24,626 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {4445#(<= ~counter~0 8)} {4445#(<= ~counter~0 8)} #63#return; {4445#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:24,626 INFO L290 TraceCheckUtils]: 87: Hoare triple {4445#(<= ~counter~0 8)} assume !!(0 != ~y3~0); {4445#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:24,626 INFO L290 TraceCheckUtils]: 88: Hoare triple {4445#(<= ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4445#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:24,626 INFO L290 TraceCheckUtils]: 89: Hoare triple {4445#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4473#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:24,627 INFO L290 TraceCheckUtils]: 90: Hoare triple {4473#(<= ~counter~0 9)} assume !!(#t~post6 < 50);havoc #t~post6; {4473#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:24,627 INFO L272 TraceCheckUtils]: 91: Hoare triple {4473#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4473#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:24,627 INFO L290 TraceCheckUtils]: 92: Hoare triple {4473#(<= ~counter~0 9)} ~cond := #in~cond; {4473#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:24,628 INFO L290 TraceCheckUtils]: 93: Hoare triple {4473#(<= ~counter~0 9)} assume !(0 == ~cond); {4473#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:24,628 INFO L290 TraceCheckUtils]: 94: Hoare triple {4473#(<= ~counter~0 9)} assume true; {4473#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:24,628 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {4473#(<= ~counter~0 9)} {4473#(<= ~counter~0 9)} #63#return; {4473#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:24,629 INFO L290 TraceCheckUtils]: 96: Hoare triple {4473#(<= ~counter~0 9)} assume !!(0 != ~y3~0); {4473#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:24,629 INFO L290 TraceCheckUtils]: 97: Hoare triple {4473#(<= ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4473#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:24,629 INFO L290 TraceCheckUtils]: 98: Hoare triple {4473#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4501#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:24,629 INFO L290 TraceCheckUtils]: 99: Hoare triple {4501#(<= ~counter~0 10)} assume !!(#t~post6 < 50);havoc #t~post6; {4501#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:24,630 INFO L272 TraceCheckUtils]: 100: Hoare triple {4501#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4501#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:24,630 INFO L290 TraceCheckUtils]: 101: Hoare triple {4501#(<= ~counter~0 10)} ~cond := #in~cond; {4501#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:24,630 INFO L290 TraceCheckUtils]: 102: Hoare triple {4501#(<= ~counter~0 10)} assume !(0 == ~cond); {4501#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:24,631 INFO L290 TraceCheckUtils]: 103: Hoare triple {4501#(<= ~counter~0 10)} assume true; {4501#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:24,639 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {4501#(<= ~counter~0 10)} {4501#(<= ~counter~0 10)} #63#return; {4501#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:24,640 INFO L290 TraceCheckUtils]: 105: Hoare triple {4501#(<= ~counter~0 10)} assume !!(0 != ~y3~0); {4501#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:24,640 INFO L290 TraceCheckUtils]: 106: Hoare triple {4501#(<= ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4501#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:24,640 INFO L290 TraceCheckUtils]: 107: Hoare triple {4501#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4529#(<= ~counter~0 11)} is VALID [2022-04-27 14:23:24,641 INFO L290 TraceCheckUtils]: 108: Hoare triple {4529#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {4529#(<= ~counter~0 11)} is VALID [2022-04-27 14:23:24,641 INFO L272 TraceCheckUtils]: 109: Hoare triple {4529#(<= ~counter~0 11)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4529#(<= ~counter~0 11)} is VALID [2022-04-27 14:23:24,641 INFO L290 TraceCheckUtils]: 110: Hoare triple {4529#(<= ~counter~0 11)} ~cond := #in~cond; {4529#(<= ~counter~0 11)} is VALID [2022-04-27 14:23:24,642 INFO L290 TraceCheckUtils]: 111: Hoare triple {4529#(<= ~counter~0 11)} assume !(0 == ~cond); {4529#(<= ~counter~0 11)} is VALID [2022-04-27 14:23:24,642 INFO L290 TraceCheckUtils]: 112: Hoare triple {4529#(<= ~counter~0 11)} assume true; {4529#(<= ~counter~0 11)} is VALID [2022-04-27 14:23:24,642 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {4529#(<= ~counter~0 11)} {4529#(<= ~counter~0 11)} #63#return; {4529#(<= ~counter~0 11)} is VALID [2022-04-27 14:23:24,643 INFO L290 TraceCheckUtils]: 114: Hoare triple {4529#(<= ~counter~0 11)} assume !!(0 != ~y3~0); {4529#(<= ~counter~0 11)} is VALID [2022-04-27 14:23:24,645 INFO L290 TraceCheckUtils]: 115: Hoare triple {4529#(<= ~counter~0 11)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4529#(<= ~counter~0 11)} is VALID [2022-04-27 14:23:24,645 INFO L290 TraceCheckUtils]: 116: Hoare triple {4529#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4557#(<= ~counter~0 12)} is VALID [2022-04-27 14:23:24,645 INFO L290 TraceCheckUtils]: 117: Hoare triple {4557#(<= ~counter~0 12)} assume !!(#t~post6 < 50);havoc #t~post6; {4557#(<= ~counter~0 12)} is VALID [2022-04-27 14:23:24,646 INFO L272 TraceCheckUtils]: 118: Hoare triple {4557#(<= ~counter~0 12)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4557#(<= ~counter~0 12)} is VALID [2022-04-27 14:23:24,646 INFO L290 TraceCheckUtils]: 119: Hoare triple {4557#(<= ~counter~0 12)} ~cond := #in~cond; {4557#(<= ~counter~0 12)} is VALID [2022-04-27 14:23:24,646 INFO L290 TraceCheckUtils]: 120: Hoare triple {4557#(<= ~counter~0 12)} assume !(0 == ~cond); {4557#(<= ~counter~0 12)} is VALID [2022-04-27 14:23:24,647 INFO L290 TraceCheckUtils]: 121: Hoare triple {4557#(<= ~counter~0 12)} assume true; {4557#(<= ~counter~0 12)} is VALID [2022-04-27 14:23:24,648 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {4557#(<= ~counter~0 12)} {4557#(<= ~counter~0 12)} #63#return; {4557#(<= ~counter~0 12)} is VALID [2022-04-27 14:23:24,648 INFO L290 TraceCheckUtils]: 123: Hoare triple {4557#(<= ~counter~0 12)} assume !!(0 != ~y3~0); {4557#(<= ~counter~0 12)} is VALID [2022-04-27 14:23:24,648 INFO L290 TraceCheckUtils]: 124: Hoare triple {4557#(<= ~counter~0 12)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4557#(<= ~counter~0 12)} is VALID [2022-04-27 14:23:24,649 INFO L290 TraceCheckUtils]: 125: Hoare triple {4557#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4585#(<= ~counter~0 13)} is VALID [2022-04-27 14:23:24,649 INFO L290 TraceCheckUtils]: 126: Hoare triple {4585#(<= ~counter~0 13)} assume !!(#t~post6 < 50);havoc #t~post6; {4585#(<= ~counter~0 13)} is VALID [2022-04-27 14:23:24,649 INFO L272 TraceCheckUtils]: 127: Hoare triple {4585#(<= ~counter~0 13)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4585#(<= ~counter~0 13)} is VALID [2022-04-27 14:23:24,650 INFO L290 TraceCheckUtils]: 128: Hoare triple {4585#(<= ~counter~0 13)} ~cond := #in~cond; {4585#(<= ~counter~0 13)} is VALID [2022-04-27 14:23:24,650 INFO L290 TraceCheckUtils]: 129: Hoare triple {4585#(<= ~counter~0 13)} assume !(0 == ~cond); {4585#(<= ~counter~0 13)} is VALID [2022-04-27 14:23:24,650 INFO L290 TraceCheckUtils]: 130: Hoare triple {4585#(<= ~counter~0 13)} assume true; {4585#(<= ~counter~0 13)} is VALID [2022-04-27 14:23:24,651 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {4585#(<= ~counter~0 13)} {4585#(<= ~counter~0 13)} #63#return; {4585#(<= ~counter~0 13)} is VALID [2022-04-27 14:23:24,651 INFO L290 TraceCheckUtils]: 132: Hoare triple {4585#(<= ~counter~0 13)} assume !!(0 != ~y3~0); {4585#(<= ~counter~0 13)} is VALID [2022-04-27 14:23:24,651 INFO L290 TraceCheckUtils]: 133: Hoare triple {4585#(<= ~counter~0 13)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4585#(<= ~counter~0 13)} is VALID [2022-04-27 14:23:24,652 INFO L290 TraceCheckUtils]: 134: Hoare triple {4585#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4613#(<= ~counter~0 14)} is VALID [2022-04-27 14:23:24,652 INFO L290 TraceCheckUtils]: 135: Hoare triple {4613#(<= ~counter~0 14)} assume !!(#t~post6 < 50);havoc #t~post6; {4613#(<= ~counter~0 14)} is VALID [2022-04-27 14:23:24,653 INFO L272 TraceCheckUtils]: 136: Hoare triple {4613#(<= ~counter~0 14)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4613#(<= ~counter~0 14)} is VALID [2022-04-27 14:23:24,653 INFO L290 TraceCheckUtils]: 137: Hoare triple {4613#(<= ~counter~0 14)} ~cond := #in~cond; {4613#(<= ~counter~0 14)} is VALID [2022-04-27 14:23:24,653 INFO L290 TraceCheckUtils]: 138: Hoare triple {4613#(<= ~counter~0 14)} assume !(0 == ~cond); {4613#(<= ~counter~0 14)} is VALID [2022-04-27 14:23:24,653 INFO L290 TraceCheckUtils]: 139: Hoare triple {4613#(<= ~counter~0 14)} assume true; {4613#(<= ~counter~0 14)} is VALID [2022-04-27 14:23:24,654 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {4613#(<= ~counter~0 14)} {4613#(<= ~counter~0 14)} #63#return; {4613#(<= ~counter~0 14)} is VALID [2022-04-27 14:23:24,654 INFO L290 TraceCheckUtils]: 141: Hoare triple {4613#(<= ~counter~0 14)} assume !!(0 != ~y3~0); {4613#(<= ~counter~0 14)} is VALID [2022-04-27 14:23:24,654 INFO L290 TraceCheckUtils]: 142: Hoare triple {4613#(<= ~counter~0 14)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4613#(<= ~counter~0 14)} is VALID [2022-04-27 14:23:24,655 INFO L290 TraceCheckUtils]: 143: Hoare triple {4613#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4641#(<= ~counter~0 15)} is VALID [2022-04-27 14:23:24,655 INFO L290 TraceCheckUtils]: 144: Hoare triple {4641#(<= ~counter~0 15)} assume !!(#t~post6 < 50);havoc #t~post6; {4641#(<= ~counter~0 15)} is VALID [2022-04-27 14:23:24,655 INFO L272 TraceCheckUtils]: 145: Hoare triple {4641#(<= ~counter~0 15)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4641#(<= ~counter~0 15)} is VALID [2022-04-27 14:23:24,656 INFO L290 TraceCheckUtils]: 146: Hoare triple {4641#(<= ~counter~0 15)} ~cond := #in~cond; {4641#(<= ~counter~0 15)} is VALID [2022-04-27 14:23:24,656 INFO L290 TraceCheckUtils]: 147: Hoare triple {4641#(<= ~counter~0 15)} assume !(0 == ~cond); {4641#(<= ~counter~0 15)} is VALID [2022-04-27 14:23:24,656 INFO L290 TraceCheckUtils]: 148: Hoare triple {4641#(<= ~counter~0 15)} assume true; {4641#(<= ~counter~0 15)} is VALID [2022-04-27 14:23:24,657 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {4641#(<= ~counter~0 15)} {4641#(<= ~counter~0 15)} #63#return; {4641#(<= ~counter~0 15)} is VALID [2022-04-27 14:23:24,657 INFO L290 TraceCheckUtils]: 150: Hoare triple {4641#(<= ~counter~0 15)} assume !!(0 != ~y3~0); {4641#(<= ~counter~0 15)} is VALID [2022-04-27 14:23:24,657 INFO L290 TraceCheckUtils]: 151: Hoare triple {4641#(<= ~counter~0 15)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4641#(<= ~counter~0 15)} is VALID [2022-04-27 14:23:24,658 INFO L290 TraceCheckUtils]: 152: Hoare triple {4641#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4669#(<= ~counter~0 16)} is VALID [2022-04-27 14:23:24,658 INFO L290 TraceCheckUtils]: 153: Hoare triple {4669#(<= ~counter~0 16)} assume !!(#t~post6 < 50);havoc #t~post6; {4669#(<= ~counter~0 16)} is VALID [2022-04-27 14:23:24,658 INFO L272 TraceCheckUtils]: 154: Hoare triple {4669#(<= ~counter~0 16)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4669#(<= ~counter~0 16)} is VALID [2022-04-27 14:23:24,659 INFO L290 TraceCheckUtils]: 155: Hoare triple {4669#(<= ~counter~0 16)} ~cond := #in~cond; {4669#(<= ~counter~0 16)} is VALID [2022-04-27 14:23:24,659 INFO L290 TraceCheckUtils]: 156: Hoare triple {4669#(<= ~counter~0 16)} assume !(0 == ~cond); {4669#(<= ~counter~0 16)} is VALID [2022-04-27 14:23:24,659 INFO L290 TraceCheckUtils]: 157: Hoare triple {4669#(<= ~counter~0 16)} assume true; {4669#(<= ~counter~0 16)} is VALID [2022-04-27 14:23:24,660 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {4669#(<= ~counter~0 16)} {4669#(<= ~counter~0 16)} #63#return; {4669#(<= ~counter~0 16)} is VALID [2022-04-27 14:23:24,660 INFO L290 TraceCheckUtils]: 159: Hoare triple {4669#(<= ~counter~0 16)} assume !!(0 != ~y3~0); {4669#(<= ~counter~0 16)} is VALID [2022-04-27 14:23:24,660 INFO L290 TraceCheckUtils]: 160: Hoare triple {4669#(<= ~counter~0 16)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4669#(<= ~counter~0 16)} is VALID [2022-04-27 14:23:24,660 INFO L290 TraceCheckUtils]: 161: Hoare triple {4669#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4697#(<= ~counter~0 17)} is VALID [2022-04-27 14:23:24,661 INFO L290 TraceCheckUtils]: 162: Hoare triple {4697#(<= ~counter~0 17)} assume !!(#t~post6 < 50);havoc #t~post6; {4697#(<= ~counter~0 17)} is VALID [2022-04-27 14:23:24,661 INFO L272 TraceCheckUtils]: 163: Hoare triple {4697#(<= ~counter~0 17)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4697#(<= ~counter~0 17)} is VALID [2022-04-27 14:23:24,662 INFO L290 TraceCheckUtils]: 164: Hoare triple {4697#(<= ~counter~0 17)} ~cond := #in~cond; {4697#(<= ~counter~0 17)} is VALID [2022-04-27 14:23:24,662 INFO L290 TraceCheckUtils]: 165: Hoare triple {4697#(<= ~counter~0 17)} assume !(0 == ~cond); {4697#(<= ~counter~0 17)} is VALID [2022-04-27 14:23:24,662 INFO L290 TraceCheckUtils]: 166: Hoare triple {4697#(<= ~counter~0 17)} assume true; {4697#(<= ~counter~0 17)} is VALID [2022-04-27 14:23:24,662 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {4697#(<= ~counter~0 17)} {4697#(<= ~counter~0 17)} #63#return; {4697#(<= ~counter~0 17)} is VALID [2022-04-27 14:23:24,663 INFO L290 TraceCheckUtils]: 168: Hoare triple {4697#(<= ~counter~0 17)} assume !!(0 != ~y3~0); {4697#(<= ~counter~0 17)} is VALID [2022-04-27 14:23:24,663 INFO L290 TraceCheckUtils]: 169: Hoare triple {4697#(<= ~counter~0 17)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4697#(<= ~counter~0 17)} is VALID [2022-04-27 14:23:24,663 INFO L290 TraceCheckUtils]: 170: Hoare triple {4697#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4725#(<= ~counter~0 18)} is VALID [2022-04-27 14:23:24,664 INFO L290 TraceCheckUtils]: 171: Hoare triple {4725#(<= ~counter~0 18)} assume !!(#t~post6 < 50);havoc #t~post6; {4725#(<= ~counter~0 18)} is VALID [2022-04-27 14:23:24,664 INFO L272 TraceCheckUtils]: 172: Hoare triple {4725#(<= ~counter~0 18)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4725#(<= ~counter~0 18)} is VALID [2022-04-27 14:23:24,664 INFO L290 TraceCheckUtils]: 173: Hoare triple {4725#(<= ~counter~0 18)} ~cond := #in~cond; {4725#(<= ~counter~0 18)} is VALID [2022-04-27 14:23:24,665 INFO L290 TraceCheckUtils]: 174: Hoare triple {4725#(<= ~counter~0 18)} assume !(0 == ~cond); {4725#(<= ~counter~0 18)} is VALID [2022-04-27 14:23:24,665 INFO L290 TraceCheckUtils]: 175: Hoare triple {4725#(<= ~counter~0 18)} assume true; {4725#(<= ~counter~0 18)} is VALID [2022-04-27 14:23:24,665 INFO L284 TraceCheckUtils]: 176: Hoare quadruple {4725#(<= ~counter~0 18)} {4725#(<= ~counter~0 18)} #63#return; {4725#(<= ~counter~0 18)} is VALID [2022-04-27 14:23:24,666 INFO L290 TraceCheckUtils]: 177: Hoare triple {4725#(<= ~counter~0 18)} assume !!(0 != ~y3~0); {4725#(<= ~counter~0 18)} is VALID [2022-04-27 14:23:24,666 INFO L290 TraceCheckUtils]: 178: Hoare triple {4725#(<= ~counter~0 18)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4725#(<= ~counter~0 18)} is VALID [2022-04-27 14:23:24,666 INFO L290 TraceCheckUtils]: 179: Hoare triple {4725#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4753#(<= ~counter~0 19)} is VALID [2022-04-27 14:23:24,666 INFO L290 TraceCheckUtils]: 180: Hoare triple {4753#(<= ~counter~0 19)} assume !!(#t~post6 < 50);havoc #t~post6; {4753#(<= ~counter~0 19)} is VALID [2022-04-27 14:23:24,667 INFO L272 TraceCheckUtils]: 181: Hoare triple {4753#(<= ~counter~0 19)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4753#(<= ~counter~0 19)} is VALID [2022-04-27 14:23:24,667 INFO L290 TraceCheckUtils]: 182: Hoare triple {4753#(<= ~counter~0 19)} ~cond := #in~cond; {4753#(<= ~counter~0 19)} is VALID [2022-04-27 14:23:24,667 INFO L290 TraceCheckUtils]: 183: Hoare triple {4753#(<= ~counter~0 19)} assume !(0 == ~cond); {4753#(<= ~counter~0 19)} is VALID [2022-04-27 14:23:24,668 INFO L290 TraceCheckUtils]: 184: Hoare triple {4753#(<= ~counter~0 19)} assume true; {4753#(<= ~counter~0 19)} is VALID [2022-04-27 14:23:24,668 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {4753#(<= ~counter~0 19)} {4753#(<= ~counter~0 19)} #63#return; {4753#(<= ~counter~0 19)} is VALID [2022-04-27 14:23:24,668 INFO L290 TraceCheckUtils]: 186: Hoare triple {4753#(<= ~counter~0 19)} assume !!(0 != ~y3~0); {4753#(<= ~counter~0 19)} is VALID [2022-04-27 14:23:24,669 INFO L290 TraceCheckUtils]: 187: Hoare triple {4753#(<= ~counter~0 19)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4753#(<= ~counter~0 19)} is VALID [2022-04-27 14:23:24,669 INFO L290 TraceCheckUtils]: 188: Hoare triple {4753#(<= ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4781#(<= ~counter~0 20)} is VALID [2022-04-27 14:23:24,669 INFO L290 TraceCheckUtils]: 189: Hoare triple {4781#(<= ~counter~0 20)} assume !!(#t~post6 < 50);havoc #t~post6; {4781#(<= ~counter~0 20)} is VALID [2022-04-27 14:23:24,670 INFO L272 TraceCheckUtils]: 190: Hoare triple {4781#(<= ~counter~0 20)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4781#(<= ~counter~0 20)} is VALID [2022-04-27 14:23:24,670 INFO L290 TraceCheckUtils]: 191: Hoare triple {4781#(<= ~counter~0 20)} ~cond := #in~cond; {4781#(<= ~counter~0 20)} is VALID [2022-04-27 14:23:24,670 INFO L290 TraceCheckUtils]: 192: Hoare triple {4781#(<= ~counter~0 20)} assume !(0 == ~cond); {4781#(<= ~counter~0 20)} is VALID [2022-04-27 14:23:24,670 INFO L290 TraceCheckUtils]: 193: Hoare triple {4781#(<= ~counter~0 20)} assume true; {4781#(<= ~counter~0 20)} is VALID [2022-04-27 14:23:24,671 INFO L284 TraceCheckUtils]: 194: Hoare quadruple {4781#(<= ~counter~0 20)} {4781#(<= ~counter~0 20)} #63#return; {4781#(<= ~counter~0 20)} is VALID [2022-04-27 14:23:24,671 INFO L290 TraceCheckUtils]: 195: Hoare triple {4781#(<= ~counter~0 20)} assume !!(0 != ~y3~0); {4781#(<= ~counter~0 20)} is VALID [2022-04-27 14:23:24,671 INFO L290 TraceCheckUtils]: 196: Hoare triple {4781#(<= ~counter~0 20)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4781#(<= ~counter~0 20)} is VALID [2022-04-27 14:23:24,672 INFO L290 TraceCheckUtils]: 197: Hoare triple {4781#(<= ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4809#(<= ~counter~0 21)} is VALID [2022-04-27 14:23:24,672 INFO L290 TraceCheckUtils]: 198: Hoare triple {4809#(<= ~counter~0 21)} assume !!(#t~post6 < 50);havoc #t~post6; {4809#(<= ~counter~0 21)} is VALID [2022-04-27 14:23:24,673 INFO L272 TraceCheckUtils]: 199: Hoare triple {4809#(<= ~counter~0 21)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4809#(<= ~counter~0 21)} is VALID [2022-04-27 14:23:24,673 INFO L290 TraceCheckUtils]: 200: Hoare triple {4809#(<= ~counter~0 21)} ~cond := #in~cond; {4809#(<= ~counter~0 21)} is VALID [2022-04-27 14:23:24,673 INFO L290 TraceCheckUtils]: 201: Hoare triple {4809#(<= ~counter~0 21)} assume !(0 == ~cond); {4809#(<= ~counter~0 21)} is VALID [2022-04-27 14:23:24,673 INFO L290 TraceCheckUtils]: 202: Hoare triple {4809#(<= ~counter~0 21)} assume true; {4809#(<= ~counter~0 21)} is VALID [2022-04-27 14:23:24,674 INFO L284 TraceCheckUtils]: 203: Hoare quadruple {4809#(<= ~counter~0 21)} {4809#(<= ~counter~0 21)} #63#return; {4809#(<= ~counter~0 21)} is VALID [2022-04-27 14:23:24,674 INFO L290 TraceCheckUtils]: 204: Hoare triple {4809#(<= ~counter~0 21)} assume !!(0 != ~y3~0); {4809#(<= ~counter~0 21)} is VALID [2022-04-27 14:23:24,674 INFO L290 TraceCheckUtils]: 205: Hoare triple {4809#(<= ~counter~0 21)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4809#(<= ~counter~0 21)} is VALID [2022-04-27 14:23:24,675 INFO L290 TraceCheckUtils]: 206: Hoare triple {4809#(<= ~counter~0 21)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4837#(<= ~counter~0 22)} is VALID [2022-04-27 14:23:24,675 INFO L290 TraceCheckUtils]: 207: Hoare triple {4837#(<= ~counter~0 22)} assume !!(#t~post6 < 50);havoc #t~post6; {4837#(<= ~counter~0 22)} is VALID [2022-04-27 14:23:24,675 INFO L272 TraceCheckUtils]: 208: Hoare triple {4837#(<= ~counter~0 22)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4837#(<= ~counter~0 22)} is VALID [2022-04-27 14:23:24,676 INFO L290 TraceCheckUtils]: 209: Hoare triple {4837#(<= ~counter~0 22)} ~cond := #in~cond; {4837#(<= ~counter~0 22)} is VALID [2022-04-27 14:23:24,676 INFO L290 TraceCheckUtils]: 210: Hoare triple {4837#(<= ~counter~0 22)} assume !(0 == ~cond); {4837#(<= ~counter~0 22)} is VALID [2022-04-27 14:23:24,676 INFO L290 TraceCheckUtils]: 211: Hoare triple {4837#(<= ~counter~0 22)} assume true; {4837#(<= ~counter~0 22)} is VALID [2022-04-27 14:23:24,677 INFO L284 TraceCheckUtils]: 212: Hoare quadruple {4837#(<= ~counter~0 22)} {4837#(<= ~counter~0 22)} #63#return; {4837#(<= ~counter~0 22)} is VALID [2022-04-27 14:23:24,677 INFO L290 TraceCheckUtils]: 213: Hoare triple {4837#(<= ~counter~0 22)} assume !!(0 != ~y3~0); {4837#(<= ~counter~0 22)} is VALID [2022-04-27 14:23:24,677 INFO L290 TraceCheckUtils]: 214: Hoare triple {4837#(<= ~counter~0 22)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4837#(<= ~counter~0 22)} is VALID [2022-04-27 14:23:24,677 INFO L290 TraceCheckUtils]: 215: Hoare triple {4837#(<= ~counter~0 22)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4865#(<= |main_#t~post6| 22)} is VALID [2022-04-27 14:23:24,678 INFO L290 TraceCheckUtils]: 216: Hoare triple {4865#(<= |main_#t~post6| 22)} assume !(#t~post6 < 50);havoc #t~post6; {4193#false} is VALID [2022-04-27 14:23:24,678 INFO L272 TraceCheckUtils]: 217: Hoare triple {4193#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {4193#false} is VALID [2022-04-27 14:23:24,678 INFO L290 TraceCheckUtils]: 218: Hoare triple {4193#false} ~cond := #in~cond; {4193#false} is VALID [2022-04-27 14:23:24,678 INFO L290 TraceCheckUtils]: 219: Hoare triple {4193#false} assume 0 == ~cond; {4193#false} is VALID [2022-04-27 14:23:24,678 INFO L290 TraceCheckUtils]: 220: Hoare triple {4193#false} assume !false; {4193#false} is VALID [2022-04-27 14:23:24,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 44 proven. 2123 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:23:24,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:23:26,035 INFO L290 TraceCheckUtils]: 220: Hoare triple {4193#false} assume !false; {4193#false} is VALID [2022-04-27 14:23:26,035 INFO L290 TraceCheckUtils]: 219: Hoare triple {4193#false} assume 0 == ~cond; {4193#false} is VALID [2022-04-27 14:23:26,035 INFO L290 TraceCheckUtils]: 218: Hoare triple {4193#false} ~cond := #in~cond; {4193#false} is VALID [2022-04-27 14:23:26,035 INFO L272 TraceCheckUtils]: 217: Hoare triple {4193#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {4193#false} is VALID [2022-04-27 14:23:26,035 INFO L290 TraceCheckUtils]: 216: Hoare triple {4893#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {4193#false} is VALID [2022-04-27 14:23:26,036 INFO L290 TraceCheckUtils]: 215: Hoare triple {4897#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4893#(< |main_#t~post6| 50)} is VALID [2022-04-27 14:23:26,036 INFO L290 TraceCheckUtils]: 214: Hoare triple {4897#(< ~counter~0 50)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4897#(< ~counter~0 50)} is VALID [2022-04-27 14:23:26,036 INFO L290 TraceCheckUtils]: 213: Hoare triple {4897#(< ~counter~0 50)} assume !!(0 != ~y3~0); {4897#(< ~counter~0 50)} is VALID [2022-04-27 14:23:26,037 INFO L284 TraceCheckUtils]: 212: Hoare quadruple {4192#true} {4897#(< ~counter~0 50)} #63#return; {4897#(< ~counter~0 50)} is VALID [2022-04-27 14:23:26,037 INFO L290 TraceCheckUtils]: 211: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-27 14:23:26,037 INFO L290 TraceCheckUtils]: 210: Hoare triple {4192#true} assume !(0 == ~cond); {4192#true} is VALID [2022-04-27 14:23:26,037 INFO L290 TraceCheckUtils]: 209: Hoare triple {4192#true} ~cond := #in~cond; {4192#true} is VALID [2022-04-27 14:23:26,037 INFO L272 TraceCheckUtils]: 208: Hoare triple {4897#(< ~counter~0 50)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4192#true} is VALID [2022-04-27 14:23:26,037 INFO L290 TraceCheckUtils]: 207: Hoare triple {4897#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {4897#(< ~counter~0 50)} is VALID [2022-04-27 14:23:26,038 INFO L290 TraceCheckUtils]: 206: Hoare triple {4925#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4897#(< ~counter~0 50)} is VALID [2022-04-27 14:23:26,038 INFO L290 TraceCheckUtils]: 205: Hoare triple {4925#(< ~counter~0 49)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4925#(< ~counter~0 49)} is VALID [2022-04-27 14:23:26,038 INFO L290 TraceCheckUtils]: 204: Hoare triple {4925#(< ~counter~0 49)} assume !!(0 != ~y3~0); {4925#(< ~counter~0 49)} is VALID [2022-04-27 14:23:26,039 INFO L284 TraceCheckUtils]: 203: Hoare quadruple {4192#true} {4925#(< ~counter~0 49)} #63#return; {4925#(< ~counter~0 49)} is VALID [2022-04-27 14:23:26,039 INFO L290 TraceCheckUtils]: 202: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-27 14:23:26,039 INFO L290 TraceCheckUtils]: 201: Hoare triple {4192#true} assume !(0 == ~cond); {4192#true} is VALID [2022-04-27 14:23:26,039 INFO L290 TraceCheckUtils]: 200: Hoare triple {4192#true} ~cond := #in~cond; {4192#true} is VALID [2022-04-27 14:23:26,039 INFO L272 TraceCheckUtils]: 199: Hoare triple {4925#(< ~counter~0 49)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4192#true} is VALID [2022-04-27 14:23:26,039 INFO L290 TraceCheckUtils]: 198: Hoare triple {4925#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {4925#(< ~counter~0 49)} is VALID [2022-04-27 14:23:26,040 INFO L290 TraceCheckUtils]: 197: Hoare triple {4953#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4925#(< ~counter~0 49)} is VALID [2022-04-27 14:23:26,040 INFO L290 TraceCheckUtils]: 196: Hoare triple {4953#(< ~counter~0 48)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4953#(< ~counter~0 48)} is VALID [2022-04-27 14:23:26,040 INFO L290 TraceCheckUtils]: 195: Hoare triple {4953#(< ~counter~0 48)} assume !!(0 != ~y3~0); {4953#(< ~counter~0 48)} is VALID [2022-04-27 14:23:26,041 INFO L284 TraceCheckUtils]: 194: Hoare quadruple {4192#true} {4953#(< ~counter~0 48)} #63#return; {4953#(< ~counter~0 48)} is VALID [2022-04-27 14:23:26,041 INFO L290 TraceCheckUtils]: 193: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-27 14:23:26,041 INFO L290 TraceCheckUtils]: 192: Hoare triple {4192#true} assume !(0 == ~cond); {4192#true} is VALID [2022-04-27 14:23:26,041 INFO L290 TraceCheckUtils]: 191: Hoare triple {4192#true} ~cond := #in~cond; {4192#true} is VALID [2022-04-27 14:23:26,041 INFO L272 TraceCheckUtils]: 190: Hoare triple {4953#(< ~counter~0 48)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4192#true} is VALID [2022-04-27 14:23:26,041 INFO L290 TraceCheckUtils]: 189: Hoare triple {4953#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {4953#(< ~counter~0 48)} is VALID [2022-04-27 14:23:26,041 INFO L290 TraceCheckUtils]: 188: Hoare triple {4981#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4953#(< ~counter~0 48)} is VALID [2022-04-27 14:23:26,042 INFO L290 TraceCheckUtils]: 187: Hoare triple {4981#(< ~counter~0 47)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4981#(< ~counter~0 47)} is VALID [2022-04-27 14:23:26,042 INFO L290 TraceCheckUtils]: 186: Hoare triple {4981#(< ~counter~0 47)} assume !!(0 != ~y3~0); {4981#(< ~counter~0 47)} is VALID [2022-04-27 14:23:26,042 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {4192#true} {4981#(< ~counter~0 47)} #63#return; {4981#(< ~counter~0 47)} is VALID [2022-04-27 14:23:26,042 INFO L290 TraceCheckUtils]: 184: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-27 14:23:26,043 INFO L290 TraceCheckUtils]: 183: Hoare triple {4192#true} assume !(0 == ~cond); {4192#true} is VALID [2022-04-27 14:23:26,043 INFO L290 TraceCheckUtils]: 182: Hoare triple {4192#true} ~cond := #in~cond; {4192#true} is VALID [2022-04-27 14:23:26,043 INFO L272 TraceCheckUtils]: 181: Hoare triple {4981#(< ~counter~0 47)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4192#true} is VALID [2022-04-27 14:23:26,043 INFO L290 TraceCheckUtils]: 180: Hoare triple {4981#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {4981#(< ~counter~0 47)} is VALID [2022-04-27 14:23:26,043 INFO L290 TraceCheckUtils]: 179: Hoare triple {5009#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4981#(< ~counter~0 47)} is VALID [2022-04-27 14:23:26,043 INFO L290 TraceCheckUtils]: 178: Hoare triple {5009#(< ~counter~0 46)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5009#(< ~counter~0 46)} is VALID [2022-04-27 14:23:26,044 INFO L290 TraceCheckUtils]: 177: Hoare triple {5009#(< ~counter~0 46)} assume !!(0 != ~y3~0); {5009#(< ~counter~0 46)} is VALID [2022-04-27 14:23:26,044 INFO L284 TraceCheckUtils]: 176: Hoare quadruple {4192#true} {5009#(< ~counter~0 46)} #63#return; {5009#(< ~counter~0 46)} is VALID [2022-04-27 14:23:26,044 INFO L290 TraceCheckUtils]: 175: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-27 14:23:26,044 INFO L290 TraceCheckUtils]: 174: Hoare triple {4192#true} assume !(0 == ~cond); {4192#true} is VALID [2022-04-27 14:23:26,044 INFO L290 TraceCheckUtils]: 173: Hoare triple {4192#true} ~cond := #in~cond; {4192#true} is VALID [2022-04-27 14:23:26,044 INFO L272 TraceCheckUtils]: 172: Hoare triple {5009#(< ~counter~0 46)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4192#true} is VALID [2022-04-27 14:23:26,045 INFO L290 TraceCheckUtils]: 171: Hoare triple {5009#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {5009#(< ~counter~0 46)} is VALID [2022-04-27 14:23:26,045 INFO L290 TraceCheckUtils]: 170: Hoare triple {5037#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5009#(< ~counter~0 46)} is VALID [2022-04-27 14:23:26,045 INFO L290 TraceCheckUtils]: 169: Hoare triple {5037#(< ~counter~0 45)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5037#(< ~counter~0 45)} is VALID [2022-04-27 14:23:26,046 INFO L290 TraceCheckUtils]: 168: Hoare triple {5037#(< ~counter~0 45)} assume !!(0 != ~y3~0); {5037#(< ~counter~0 45)} is VALID [2022-04-27 14:23:26,046 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {4192#true} {5037#(< ~counter~0 45)} #63#return; {5037#(< ~counter~0 45)} is VALID [2022-04-27 14:23:26,046 INFO L290 TraceCheckUtils]: 166: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-27 14:23:26,046 INFO L290 TraceCheckUtils]: 165: Hoare triple {4192#true} assume !(0 == ~cond); {4192#true} is VALID [2022-04-27 14:23:26,046 INFO L290 TraceCheckUtils]: 164: Hoare triple {4192#true} ~cond := #in~cond; {4192#true} is VALID [2022-04-27 14:23:26,046 INFO L272 TraceCheckUtils]: 163: Hoare triple {5037#(< ~counter~0 45)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4192#true} is VALID [2022-04-27 14:23:26,047 INFO L290 TraceCheckUtils]: 162: Hoare triple {5037#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {5037#(< ~counter~0 45)} is VALID [2022-04-27 14:23:26,047 INFO L290 TraceCheckUtils]: 161: Hoare triple {5065#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5037#(< ~counter~0 45)} is VALID [2022-04-27 14:23:26,047 INFO L290 TraceCheckUtils]: 160: Hoare triple {5065#(< ~counter~0 44)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5065#(< ~counter~0 44)} is VALID [2022-04-27 14:23:26,047 INFO L290 TraceCheckUtils]: 159: Hoare triple {5065#(< ~counter~0 44)} assume !!(0 != ~y3~0); {5065#(< ~counter~0 44)} is VALID [2022-04-27 14:23:26,048 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {4192#true} {5065#(< ~counter~0 44)} #63#return; {5065#(< ~counter~0 44)} is VALID [2022-04-27 14:23:26,048 INFO L290 TraceCheckUtils]: 157: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-27 14:23:26,048 INFO L290 TraceCheckUtils]: 156: Hoare triple {4192#true} assume !(0 == ~cond); {4192#true} is VALID [2022-04-27 14:23:26,048 INFO L290 TraceCheckUtils]: 155: Hoare triple {4192#true} ~cond := #in~cond; {4192#true} is VALID [2022-04-27 14:23:26,048 INFO L272 TraceCheckUtils]: 154: Hoare triple {5065#(< ~counter~0 44)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4192#true} is VALID [2022-04-27 14:23:26,048 INFO L290 TraceCheckUtils]: 153: Hoare triple {5065#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {5065#(< ~counter~0 44)} is VALID [2022-04-27 14:23:26,049 INFO L290 TraceCheckUtils]: 152: Hoare triple {5093#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5065#(< ~counter~0 44)} is VALID [2022-04-27 14:23:26,049 INFO L290 TraceCheckUtils]: 151: Hoare triple {5093#(< ~counter~0 43)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5093#(< ~counter~0 43)} is VALID [2022-04-27 14:23:26,049 INFO L290 TraceCheckUtils]: 150: Hoare triple {5093#(< ~counter~0 43)} assume !!(0 != ~y3~0); {5093#(< ~counter~0 43)} is VALID [2022-04-27 14:23:26,050 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {4192#true} {5093#(< ~counter~0 43)} #63#return; {5093#(< ~counter~0 43)} is VALID [2022-04-27 14:23:26,050 INFO L290 TraceCheckUtils]: 148: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-27 14:23:26,050 INFO L290 TraceCheckUtils]: 147: Hoare triple {4192#true} assume !(0 == ~cond); {4192#true} is VALID [2022-04-27 14:23:26,050 INFO L290 TraceCheckUtils]: 146: Hoare triple {4192#true} ~cond := #in~cond; {4192#true} is VALID [2022-04-27 14:23:26,050 INFO L272 TraceCheckUtils]: 145: Hoare triple {5093#(< ~counter~0 43)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4192#true} is VALID [2022-04-27 14:23:26,055 INFO L290 TraceCheckUtils]: 144: Hoare triple {5093#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {5093#(< ~counter~0 43)} is VALID [2022-04-27 14:23:26,056 INFO L290 TraceCheckUtils]: 143: Hoare triple {5121#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5093#(< ~counter~0 43)} is VALID [2022-04-27 14:23:26,056 INFO L290 TraceCheckUtils]: 142: Hoare triple {5121#(< ~counter~0 42)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5121#(< ~counter~0 42)} is VALID [2022-04-27 14:23:26,056 INFO L290 TraceCheckUtils]: 141: Hoare triple {5121#(< ~counter~0 42)} assume !!(0 != ~y3~0); {5121#(< ~counter~0 42)} is VALID [2022-04-27 14:23:26,057 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {4192#true} {5121#(< ~counter~0 42)} #63#return; {5121#(< ~counter~0 42)} is VALID [2022-04-27 14:23:26,057 INFO L290 TraceCheckUtils]: 139: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-27 14:23:26,057 INFO L290 TraceCheckUtils]: 138: Hoare triple {4192#true} assume !(0 == ~cond); {4192#true} is VALID [2022-04-27 14:23:26,057 INFO L290 TraceCheckUtils]: 137: Hoare triple {4192#true} ~cond := #in~cond; {4192#true} is VALID [2022-04-27 14:23:26,057 INFO L272 TraceCheckUtils]: 136: Hoare triple {5121#(< ~counter~0 42)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4192#true} is VALID [2022-04-27 14:23:26,057 INFO L290 TraceCheckUtils]: 135: Hoare triple {5121#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {5121#(< ~counter~0 42)} is VALID [2022-04-27 14:23:26,058 INFO L290 TraceCheckUtils]: 134: Hoare triple {5149#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5121#(< ~counter~0 42)} is VALID [2022-04-27 14:23:26,058 INFO L290 TraceCheckUtils]: 133: Hoare triple {5149#(< ~counter~0 41)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5149#(< ~counter~0 41)} is VALID [2022-04-27 14:23:26,058 INFO L290 TraceCheckUtils]: 132: Hoare triple {5149#(< ~counter~0 41)} assume !!(0 != ~y3~0); {5149#(< ~counter~0 41)} is VALID [2022-04-27 14:23:26,059 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {4192#true} {5149#(< ~counter~0 41)} #63#return; {5149#(< ~counter~0 41)} is VALID [2022-04-27 14:23:26,059 INFO L290 TraceCheckUtils]: 130: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-27 14:23:26,059 INFO L290 TraceCheckUtils]: 129: Hoare triple {4192#true} assume !(0 == ~cond); {4192#true} is VALID [2022-04-27 14:23:26,059 INFO L290 TraceCheckUtils]: 128: Hoare triple {4192#true} ~cond := #in~cond; {4192#true} is VALID [2022-04-27 14:23:26,059 INFO L272 TraceCheckUtils]: 127: Hoare triple {5149#(< ~counter~0 41)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4192#true} is VALID [2022-04-27 14:23:26,059 INFO L290 TraceCheckUtils]: 126: Hoare triple {5149#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {5149#(< ~counter~0 41)} is VALID [2022-04-27 14:23:26,059 INFO L290 TraceCheckUtils]: 125: Hoare triple {5177#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5149#(< ~counter~0 41)} is VALID [2022-04-27 14:23:26,060 INFO L290 TraceCheckUtils]: 124: Hoare triple {5177#(< ~counter~0 40)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5177#(< ~counter~0 40)} is VALID [2022-04-27 14:23:26,060 INFO L290 TraceCheckUtils]: 123: Hoare triple {5177#(< ~counter~0 40)} assume !!(0 != ~y3~0); {5177#(< ~counter~0 40)} is VALID [2022-04-27 14:23:26,060 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {4192#true} {5177#(< ~counter~0 40)} #63#return; {5177#(< ~counter~0 40)} is VALID [2022-04-27 14:23:26,060 INFO L290 TraceCheckUtils]: 121: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-27 14:23:26,060 INFO L290 TraceCheckUtils]: 120: Hoare triple {4192#true} assume !(0 == ~cond); {4192#true} is VALID [2022-04-27 14:23:26,061 INFO L290 TraceCheckUtils]: 119: Hoare triple {4192#true} ~cond := #in~cond; {4192#true} is VALID [2022-04-27 14:23:26,061 INFO L272 TraceCheckUtils]: 118: Hoare triple {5177#(< ~counter~0 40)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4192#true} is VALID [2022-04-27 14:23:26,061 INFO L290 TraceCheckUtils]: 117: Hoare triple {5177#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {5177#(< ~counter~0 40)} is VALID [2022-04-27 14:23:26,061 INFO L290 TraceCheckUtils]: 116: Hoare triple {5205#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5177#(< ~counter~0 40)} is VALID [2022-04-27 14:23:26,061 INFO L290 TraceCheckUtils]: 115: Hoare triple {5205#(< ~counter~0 39)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5205#(< ~counter~0 39)} is VALID [2022-04-27 14:23:26,062 INFO L290 TraceCheckUtils]: 114: Hoare triple {5205#(< ~counter~0 39)} assume !!(0 != ~y3~0); {5205#(< ~counter~0 39)} is VALID [2022-04-27 14:23:26,062 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {4192#true} {5205#(< ~counter~0 39)} #63#return; {5205#(< ~counter~0 39)} is VALID [2022-04-27 14:23:26,062 INFO L290 TraceCheckUtils]: 112: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-27 14:23:26,062 INFO L290 TraceCheckUtils]: 111: Hoare triple {4192#true} assume !(0 == ~cond); {4192#true} is VALID [2022-04-27 14:23:26,062 INFO L290 TraceCheckUtils]: 110: Hoare triple {4192#true} ~cond := #in~cond; {4192#true} is VALID [2022-04-27 14:23:26,062 INFO L272 TraceCheckUtils]: 109: Hoare triple {5205#(< ~counter~0 39)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4192#true} is VALID [2022-04-27 14:23:26,063 INFO L290 TraceCheckUtils]: 108: Hoare triple {5205#(< ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {5205#(< ~counter~0 39)} is VALID [2022-04-27 14:23:26,063 INFO L290 TraceCheckUtils]: 107: Hoare triple {5233#(< ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5205#(< ~counter~0 39)} is VALID [2022-04-27 14:23:26,063 INFO L290 TraceCheckUtils]: 106: Hoare triple {5233#(< ~counter~0 38)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5233#(< ~counter~0 38)} is VALID [2022-04-27 14:23:26,064 INFO L290 TraceCheckUtils]: 105: Hoare triple {5233#(< ~counter~0 38)} assume !!(0 != ~y3~0); {5233#(< ~counter~0 38)} is VALID [2022-04-27 14:23:26,064 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {4192#true} {5233#(< ~counter~0 38)} #63#return; {5233#(< ~counter~0 38)} is VALID [2022-04-27 14:23:26,064 INFO L290 TraceCheckUtils]: 103: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-27 14:23:26,064 INFO L290 TraceCheckUtils]: 102: Hoare triple {4192#true} assume !(0 == ~cond); {4192#true} is VALID [2022-04-27 14:23:26,064 INFO L290 TraceCheckUtils]: 101: Hoare triple {4192#true} ~cond := #in~cond; {4192#true} is VALID [2022-04-27 14:23:26,064 INFO L272 TraceCheckUtils]: 100: Hoare triple {5233#(< ~counter~0 38)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4192#true} is VALID [2022-04-27 14:23:26,075 INFO L290 TraceCheckUtils]: 99: Hoare triple {5233#(< ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {5233#(< ~counter~0 38)} is VALID [2022-04-27 14:23:26,075 INFO L290 TraceCheckUtils]: 98: Hoare triple {5261#(< ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5233#(< ~counter~0 38)} is VALID [2022-04-27 14:23:26,076 INFO L290 TraceCheckUtils]: 97: Hoare triple {5261#(< ~counter~0 37)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5261#(< ~counter~0 37)} is VALID [2022-04-27 14:23:26,076 INFO L290 TraceCheckUtils]: 96: Hoare triple {5261#(< ~counter~0 37)} assume !!(0 != ~y3~0); {5261#(< ~counter~0 37)} is VALID [2022-04-27 14:23:26,076 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {4192#true} {5261#(< ~counter~0 37)} #63#return; {5261#(< ~counter~0 37)} is VALID [2022-04-27 14:23:26,077 INFO L290 TraceCheckUtils]: 94: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-27 14:23:26,077 INFO L290 TraceCheckUtils]: 93: Hoare triple {4192#true} assume !(0 == ~cond); {4192#true} is VALID [2022-04-27 14:23:26,077 INFO L290 TraceCheckUtils]: 92: Hoare triple {4192#true} ~cond := #in~cond; {4192#true} is VALID [2022-04-27 14:23:26,077 INFO L272 TraceCheckUtils]: 91: Hoare triple {5261#(< ~counter~0 37)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4192#true} is VALID [2022-04-27 14:23:26,077 INFO L290 TraceCheckUtils]: 90: Hoare triple {5261#(< ~counter~0 37)} assume !!(#t~post6 < 50);havoc #t~post6; {5261#(< ~counter~0 37)} is VALID [2022-04-27 14:23:26,077 INFO L290 TraceCheckUtils]: 89: Hoare triple {5289#(< ~counter~0 36)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5261#(< ~counter~0 37)} is VALID [2022-04-27 14:23:26,078 INFO L290 TraceCheckUtils]: 88: Hoare triple {5289#(< ~counter~0 36)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5289#(< ~counter~0 36)} is VALID [2022-04-27 14:23:26,078 INFO L290 TraceCheckUtils]: 87: Hoare triple {5289#(< ~counter~0 36)} assume !!(0 != ~y3~0); {5289#(< ~counter~0 36)} is VALID [2022-04-27 14:23:26,078 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {4192#true} {5289#(< ~counter~0 36)} #63#return; {5289#(< ~counter~0 36)} is VALID [2022-04-27 14:23:26,078 INFO L290 TraceCheckUtils]: 85: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-27 14:23:26,079 INFO L290 TraceCheckUtils]: 84: Hoare triple {4192#true} assume !(0 == ~cond); {4192#true} is VALID [2022-04-27 14:23:26,079 INFO L290 TraceCheckUtils]: 83: Hoare triple {4192#true} ~cond := #in~cond; {4192#true} is VALID [2022-04-27 14:23:26,079 INFO L272 TraceCheckUtils]: 82: Hoare triple {5289#(< ~counter~0 36)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4192#true} is VALID [2022-04-27 14:23:26,079 INFO L290 TraceCheckUtils]: 81: Hoare triple {5289#(< ~counter~0 36)} assume !!(#t~post6 < 50);havoc #t~post6; {5289#(< ~counter~0 36)} is VALID [2022-04-27 14:23:26,079 INFO L290 TraceCheckUtils]: 80: Hoare triple {5317#(< ~counter~0 35)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5289#(< ~counter~0 36)} is VALID [2022-04-27 14:23:26,080 INFO L290 TraceCheckUtils]: 79: Hoare triple {5317#(< ~counter~0 35)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5317#(< ~counter~0 35)} is VALID [2022-04-27 14:23:26,080 INFO L290 TraceCheckUtils]: 78: Hoare triple {5317#(< ~counter~0 35)} assume !!(0 != ~y3~0); {5317#(< ~counter~0 35)} is VALID [2022-04-27 14:23:26,080 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {4192#true} {5317#(< ~counter~0 35)} #63#return; {5317#(< ~counter~0 35)} is VALID [2022-04-27 14:23:26,080 INFO L290 TraceCheckUtils]: 76: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-27 14:23:26,080 INFO L290 TraceCheckUtils]: 75: Hoare triple {4192#true} assume !(0 == ~cond); {4192#true} is VALID [2022-04-27 14:23:26,080 INFO L290 TraceCheckUtils]: 74: Hoare triple {4192#true} ~cond := #in~cond; {4192#true} is VALID [2022-04-27 14:23:26,081 INFO L272 TraceCheckUtils]: 73: Hoare triple {5317#(< ~counter~0 35)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4192#true} is VALID [2022-04-27 14:23:26,081 INFO L290 TraceCheckUtils]: 72: Hoare triple {5317#(< ~counter~0 35)} assume !!(#t~post6 < 50);havoc #t~post6; {5317#(< ~counter~0 35)} is VALID [2022-04-27 14:23:26,081 INFO L290 TraceCheckUtils]: 71: Hoare triple {5345#(< ~counter~0 34)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5317#(< ~counter~0 35)} is VALID [2022-04-27 14:23:26,081 INFO L290 TraceCheckUtils]: 70: Hoare triple {5345#(< ~counter~0 34)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5345#(< ~counter~0 34)} is VALID [2022-04-27 14:23:26,082 INFO L290 TraceCheckUtils]: 69: Hoare triple {5345#(< ~counter~0 34)} assume !!(0 != ~y3~0); {5345#(< ~counter~0 34)} is VALID [2022-04-27 14:23:26,082 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4192#true} {5345#(< ~counter~0 34)} #63#return; {5345#(< ~counter~0 34)} is VALID [2022-04-27 14:23:26,082 INFO L290 TraceCheckUtils]: 67: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-27 14:23:26,082 INFO L290 TraceCheckUtils]: 66: Hoare triple {4192#true} assume !(0 == ~cond); {4192#true} is VALID [2022-04-27 14:23:26,082 INFO L290 TraceCheckUtils]: 65: Hoare triple {4192#true} ~cond := #in~cond; {4192#true} is VALID [2022-04-27 14:23:26,082 INFO L272 TraceCheckUtils]: 64: Hoare triple {5345#(< ~counter~0 34)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4192#true} is VALID [2022-04-27 14:23:26,083 INFO L290 TraceCheckUtils]: 63: Hoare triple {5345#(< ~counter~0 34)} assume !!(#t~post6 < 50);havoc #t~post6; {5345#(< ~counter~0 34)} is VALID [2022-04-27 14:23:26,083 INFO L290 TraceCheckUtils]: 62: Hoare triple {5373#(< ~counter~0 33)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5345#(< ~counter~0 34)} is VALID [2022-04-27 14:23:26,083 INFO L290 TraceCheckUtils]: 61: Hoare triple {5373#(< ~counter~0 33)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5373#(< ~counter~0 33)} is VALID [2022-04-27 14:23:26,084 INFO L290 TraceCheckUtils]: 60: Hoare triple {5373#(< ~counter~0 33)} assume !!(0 != ~y3~0); {5373#(< ~counter~0 33)} is VALID [2022-04-27 14:23:26,084 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4192#true} {5373#(< ~counter~0 33)} #63#return; {5373#(< ~counter~0 33)} is VALID [2022-04-27 14:23:26,084 INFO L290 TraceCheckUtils]: 58: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-27 14:23:26,084 INFO L290 TraceCheckUtils]: 57: Hoare triple {4192#true} assume !(0 == ~cond); {4192#true} is VALID [2022-04-27 14:23:26,084 INFO L290 TraceCheckUtils]: 56: Hoare triple {4192#true} ~cond := #in~cond; {4192#true} is VALID [2022-04-27 14:23:26,084 INFO L272 TraceCheckUtils]: 55: Hoare triple {5373#(< ~counter~0 33)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4192#true} is VALID [2022-04-27 14:23:26,085 INFO L290 TraceCheckUtils]: 54: Hoare triple {5373#(< ~counter~0 33)} assume !!(#t~post6 < 50);havoc #t~post6; {5373#(< ~counter~0 33)} is VALID [2022-04-27 14:23:26,085 INFO L290 TraceCheckUtils]: 53: Hoare triple {5401#(< ~counter~0 32)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5373#(< ~counter~0 33)} is VALID [2022-04-27 14:23:26,085 INFO L290 TraceCheckUtils]: 52: Hoare triple {5401#(< ~counter~0 32)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5401#(< ~counter~0 32)} is VALID [2022-04-27 14:23:26,086 INFO L290 TraceCheckUtils]: 51: Hoare triple {5401#(< ~counter~0 32)} assume !!(0 != ~y3~0); {5401#(< ~counter~0 32)} is VALID [2022-04-27 14:23:26,086 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4192#true} {5401#(< ~counter~0 32)} #63#return; {5401#(< ~counter~0 32)} is VALID [2022-04-27 14:23:26,086 INFO L290 TraceCheckUtils]: 49: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-27 14:23:26,086 INFO L290 TraceCheckUtils]: 48: Hoare triple {4192#true} assume !(0 == ~cond); {4192#true} is VALID [2022-04-27 14:23:26,086 INFO L290 TraceCheckUtils]: 47: Hoare triple {4192#true} ~cond := #in~cond; {4192#true} is VALID [2022-04-27 14:23:26,086 INFO L272 TraceCheckUtils]: 46: Hoare triple {5401#(< ~counter~0 32)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4192#true} is VALID [2022-04-27 14:23:26,087 INFO L290 TraceCheckUtils]: 45: Hoare triple {5401#(< ~counter~0 32)} assume !!(#t~post6 < 50);havoc #t~post6; {5401#(< ~counter~0 32)} is VALID [2022-04-27 14:23:26,087 INFO L290 TraceCheckUtils]: 44: Hoare triple {5429#(< ~counter~0 31)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5401#(< ~counter~0 32)} is VALID [2022-04-27 14:23:26,087 INFO L290 TraceCheckUtils]: 43: Hoare triple {5429#(< ~counter~0 31)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5429#(< ~counter~0 31)} is VALID [2022-04-27 14:23:26,087 INFO L290 TraceCheckUtils]: 42: Hoare triple {5429#(< ~counter~0 31)} assume !!(0 != ~y3~0); {5429#(< ~counter~0 31)} is VALID [2022-04-27 14:23:26,088 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4192#true} {5429#(< ~counter~0 31)} #63#return; {5429#(< ~counter~0 31)} is VALID [2022-04-27 14:23:26,088 INFO L290 TraceCheckUtils]: 40: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-27 14:23:26,088 INFO L290 TraceCheckUtils]: 39: Hoare triple {4192#true} assume !(0 == ~cond); {4192#true} is VALID [2022-04-27 14:23:26,088 INFO L290 TraceCheckUtils]: 38: Hoare triple {4192#true} ~cond := #in~cond; {4192#true} is VALID [2022-04-27 14:23:26,088 INFO L272 TraceCheckUtils]: 37: Hoare triple {5429#(< ~counter~0 31)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4192#true} is VALID [2022-04-27 14:23:26,088 INFO L290 TraceCheckUtils]: 36: Hoare triple {5429#(< ~counter~0 31)} assume !!(#t~post6 < 50);havoc #t~post6; {5429#(< ~counter~0 31)} is VALID [2022-04-27 14:23:26,089 INFO L290 TraceCheckUtils]: 35: Hoare triple {5457#(< ~counter~0 30)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5429#(< ~counter~0 31)} is VALID [2022-04-27 14:23:26,089 INFO L290 TraceCheckUtils]: 34: Hoare triple {5457#(< ~counter~0 30)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5457#(< ~counter~0 30)} is VALID [2022-04-27 14:23:26,089 INFO L290 TraceCheckUtils]: 33: Hoare triple {5457#(< ~counter~0 30)} assume !!(0 != ~y3~0); {5457#(< ~counter~0 30)} is VALID [2022-04-27 14:23:26,090 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4192#true} {5457#(< ~counter~0 30)} #63#return; {5457#(< ~counter~0 30)} is VALID [2022-04-27 14:23:26,090 INFO L290 TraceCheckUtils]: 31: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-27 14:23:26,090 INFO L290 TraceCheckUtils]: 30: Hoare triple {4192#true} assume !(0 == ~cond); {4192#true} is VALID [2022-04-27 14:23:26,090 INFO L290 TraceCheckUtils]: 29: Hoare triple {4192#true} ~cond := #in~cond; {4192#true} is VALID [2022-04-27 14:23:26,090 INFO L272 TraceCheckUtils]: 28: Hoare triple {5457#(< ~counter~0 30)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4192#true} is VALID [2022-04-27 14:23:26,090 INFO L290 TraceCheckUtils]: 27: Hoare triple {5457#(< ~counter~0 30)} assume !!(#t~post6 < 50);havoc #t~post6; {5457#(< ~counter~0 30)} is VALID [2022-04-27 14:23:26,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {5485#(< ~counter~0 29)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5457#(< ~counter~0 30)} is VALID [2022-04-27 14:23:26,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {5485#(< ~counter~0 29)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5485#(< ~counter~0 29)} is VALID [2022-04-27 14:23:26,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {5485#(< ~counter~0 29)} assume !!(0 != ~y3~0); {5485#(< ~counter~0 29)} is VALID [2022-04-27 14:23:26,092 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4192#true} {5485#(< ~counter~0 29)} #63#return; {5485#(< ~counter~0 29)} is VALID [2022-04-27 14:23:26,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-27 14:23:26,092 INFO L290 TraceCheckUtils]: 21: Hoare triple {4192#true} assume !(0 == ~cond); {4192#true} is VALID [2022-04-27 14:23:26,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {4192#true} ~cond := #in~cond; {4192#true} is VALID [2022-04-27 14:23:26,092 INFO L272 TraceCheckUtils]: 19: Hoare triple {5485#(< ~counter~0 29)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4192#true} is VALID [2022-04-27 14:23:26,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {5485#(< ~counter~0 29)} assume !!(#t~post6 < 50);havoc #t~post6; {5485#(< ~counter~0 29)} is VALID [2022-04-27 14:23:26,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {5513#(< ~counter~0 28)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5485#(< ~counter~0 29)} is VALID [2022-04-27 14:23:26,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {5513#(< ~counter~0 28)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {5513#(< ~counter~0 28)} is VALID [2022-04-27 14:23:26,093 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4192#true} {5513#(< ~counter~0 28)} #61#return; {5513#(< ~counter~0 28)} is VALID [2022-04-27 14:23:26,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-27 14:23:26,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {4192#true} assume !(0 == ~cond); {4192#true} is VALID [2022-04-27 14:23:26,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {4192#true} ~cond := #in~cond; {4192#true} is VALID [2022-04-27 14:23:26,094 INFO L272 TraceCheckUtils]: 11: Hoare triple {5513#(< ~counter~0 28)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {4192#true} is VALID [2022-04-27 14:23:26,094 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4192#true} {5513#(< ~counter~0 28)} #59#return; {5513#(< ~counter~0 28)} is VALID [2022-04-27 14:23:26,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-27 14:23:26,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {4192#true} assume !(0 == ~cond); {4192#true} is VALID [2022-04-27 14:23:26,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {4192#true} ~cond := #in~cond; {4192#true} is VALID [2022-04-27 14:23:26,094 INFO L272 TraceCheckUtils]: 6: Hoare triple {5513#(< ~counter~0 28)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {4192#true} is VALID [2022-04-27 14:23:26,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {5513#(< ~counter~0 28)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {5513#(< ~counter~0 28)} is VALID [2022-04-27 14:23:26,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {5513#(< ~counter~0 28)} call #t~ret7 := main(); {5513#(< ~counter~0 28)} is VALID [2022-04-27 14:23:26,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5513#(< ~counter~0 28)} {4192#true} #67#return; {5513#(< ~counter~0 28)} is VALID [2022-04-27 14:23:26,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {5513#(< ~counter~0 28)} assume true; {5513#(< ~counter~0 28)} is VALID [2022-04-27 14:23:26,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {4192#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; {5513#(< ~counter~0 28)} is VALID [2022-04-27 14:23:26,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {4192#true} call ULTIMATE.init(); {4192#true} is VALID [2022-04-27 14:23:26,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 44 proven. 1199 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2022-04-27 14:23:26,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:23:26,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397482019] [2022-04-27 14:23:26,097 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:23:26,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325391408] [2022-04-27 14:23:26,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325391408] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:23:26,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:23:26,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-04-27 14:23:26,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402522024] [2022-04-27 14:23:26,098 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:23:26,099 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) Word has length 221 [2022-04-27 14:23:26,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:23:26,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2022-04-27 14:23:26,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 368 edges. 368 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:23:26,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-27 14:23:26,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:23:26,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-27 14:23:26,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-04-27 14:23:26,323 INFO L87 Difference]: Start difference. First operand 218 states and 241 transitions. Second operand has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2022-04-27 14:23:28,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:28,605 INFO L93 Difference]: Finished difference Result 439 states and 509 transitions. [2022-04-27 14:23:28,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-04-27 14:23:28,606 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) Word has length 221 [2022-04-27 14:23:28,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:23:28,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2022-04-27 14:23:28,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 508 transitions. [2022-04-27 14:23:28,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2022-04-27 14:23:28,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 508 transitions. [2022-04-27 14:23:28,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 508 transitions. [2022-04-27 14:23:28,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 508 edges. 508 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:23:28,985 INFO L225 Difference]: With dead ends: 439 [2022-04-27 14:23:28,985 INFO L226 Difference]: Without dead ends: 434 [2022-04-27 14:23:28,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2022-04-27 14:23:28,987 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 759 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 14:23:28,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 430 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 14:23:28,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-04-27 14:23:29,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2022-04-27 14:23:29,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:23:29,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 434 states. Second operand has 434 states, 334 states have (on average 1.1407185628742516) internal successors, (381), 334 states have internal predecessors, (381), 51 states have call successors, (51), 50 states have call predecessors, (51), 48 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-27 14:23:29,103 INFO L74 IsIncluded]: Start isIncluded. First operand 434 states. Second operand has 434 states, 334 states have (on average 1.1407185628742516) internal successors, (381), 334 states have internal predecessors, (381), 51 states have call successors, (51), 50 states have call predecessors, (51), 48 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-27 14:23:29,104 INFO L87 Difference]: Start difference. First operand 434 states. Second operand has 434 states, 334 states have (on average 1.1407185628742516) internal successors, (381), 334 states have internal predecessors, (381), 51 states have call successors, (51), 50 states have call predecessors, (51), 48 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-27 14:23:29,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:29,114 INFO L93 Difference]: Finished difference Result 434 states and 481 transitions. [2022-04-27 14:23:29,114 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 481 transitions. [2022-04-27 14:23:29,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:29,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:29,116 INFO L74 IsIncluded]: Start isIncluded. First operand has 434 states, 334 states have (on average 1.1407185628742516) internal successors, (381), 334 states have internal predecessors, (381), 51 states have call successors, (51), 50 states have call predecessors, (51), 48 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) Second operand 434 states. [2022-04-27 14:23:29,117 INFO L87 Difference]: Start difference. First operand has 434 states, 334 states have (on average 1.1407185628742516) internal successors, (381), 334 states have internal predecessors, (381), 51 states have call successors, (51), 50 states have call predecessors, (51), 48 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) Second operand 434 states. [2022-04-27 14:23:29,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:29,127 INFO L93 Difference]: Finished difference Result 434 states and 481 transitions. [2022-04-27 14:23:29,127 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 481 transitions. [2022-04-27 14:23:29,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:29,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:29,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:23:29,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:23:29,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 334 states have (on average 1.1407185628742516) internal successors, (381), 334 states have internal predecessors, (381), 51 states have call successors, (51), 50 states have call predecessors, (51), 48 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-27 14:23:29,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 481 transitions. [2022-04-27 14:23:29,144 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 481 transitions. Word has length 221 [2022-04-27 14:23:29,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:23:29,144 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 481 transitions. [2022-04-27 14:23:29,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2022-04-27 14:23:29,144 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 481 transitions. [2022-04-27 14:23:29,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2022-04-27 14:23:29,149 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:23:29,149 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:23:29,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-27 14:23:29,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:23:29,369 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:23:29,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:23:29,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1876588118, now seen corresponding path program 5 times [2022-04-27 14:23:29,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:23:29,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549030628] [2022-04-27 14:23:29,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:23:29,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:23:29,396 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:23:29,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1967471399] [2022-04-27 14:23:29,397 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:23:29,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:23:29,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:23:29,398 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-27 14:23:29,398 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-27 14:23:29,739 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2022-04-27 14:23:29,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:23:29,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 1151 conjuncts, 97 conjunts are in the unsatisfiable core [2022-04-27 14:23:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:23:29,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:23:32,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {7696#true} call ULTIMATE.init(); {7696#true} is VALID [2022-04-27 14:23:32,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {7696#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; {7704#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:32,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {7704#(<= ~counter~0 0)} assume true; {7704#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:32,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7704#(<= ~counter~0 0)} {7696#true} #67#return; {7704#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:32,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {7704#(<= ~counter~0 0)} call #t~ret7 := main(); {7704#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:32,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {7704#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {7704#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:32,238 INFO L272 TraceCheckUtils]: 6: Hoare triple {7704#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {7704#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:32,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {7704#(<= ~counter~0 0)} ~cond := #in~cond; {7704#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:32,238 INFO L290 TraceCheckUtils]: 8: Hoare triple {7704#(<= ~counter~0 0)} assume !(0 == ~cond); {7704#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:32,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {7704#(<= ~counter~0 0)} assume true; {7704#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:32,239 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7704#(<= ~counter~0 0)} {7704#(<= ~counter~0 0)} #59#return; {7704#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:32,239 INFO L272 TraceCheckUtils]: 11: Hoare triple {7704#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {7704#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:32,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {7704#(<= ~counter~0 0)} ~cond := #in~cond; {7704#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:32,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {7704#(<= ~counter~0 0)} assume !(0 == ~cond); {7704#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:32,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {7704#(<= ~counter~0 0)} assume true; {7704#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:32,240 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7704#(<= ~counter~0 0)} {7704#(<= ~counter~0 0)} #61#return; {7704#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:32,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {7704#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {7704#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:32,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {7704#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7753#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:32,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {7753#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {7753#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:32,242 INFO L272 TraceCheckUtils]: 19: Hoare triple {7753#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7753#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:32,242 INFO L290 TraceCheckUtils]: 20: Hoare triple {7753#(<= ~counter~0 1)} ~cond := #in~cond; {7753#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:32,242 INFO L290 TraceCheckUtils]: 21: Hoare triple {7753#(<= ~counter~0 1)} assume !(0 == ~cond); {7753#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:32,242 INFO L290 TraceCheckUtils]: 22: Hoare triple {7753#(<= ~counter~0 1)} assume true; {7753#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:32,243 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7753#(<= ~counter~0 1)} {7753#(<= ~counter~0 1)} #63#return; {7753#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:32,243 INFO L290 TraceCheckUtils]: 24: Hoare triple {7753#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {7753#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:32,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {7753#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7753#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:32,244 INFO L290 TraceCheckUtils]: 26: Hoare triple {7753#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7781#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:32,244 INFO L290 TraceCheckUtils]: 27: Hoare triple {7781#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {7781#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:32,245 INFO L272 TraceCheckUtils]: 28: Hoare triple {7781#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7781#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:32,245 INFO L290 TraceCheckUtils]: 29: Hoare triple {7781#(<= ~counter~0 2)} ~cond := #in~cond; {7781#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:32,245 INFO L290 TraceCheckUtils]: 30: Hoare triple {7781#(<= ~counter~0 2)} assume !(0 == ~cond); {7781#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:32,245 INFO L290 TraceCheckUtils]: 31: Hoare triple {7781#(<= ~counter~0 2)} assume true; {7781#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:32,246 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7781#(<= ~counter~0 2)} {7781#(<= ~counter~0 2)} #63#return; {7781#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:32,246 INFO L290 TraceCheckUtils]: 33: Hoare triple {7781#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {7781#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:32,246 INFO L290 TraceCheckUtils]: 34: Hoare triple {7781#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7781#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:32,247 INFO L290 TraceCheckUtils]: 35: Hoare triple {7781#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7809#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:32,247 INFO L290 TraceCheckUtils]: 36: Hoare triple {7809#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {7809#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:32,247 INFO L272 TraceCheckUtils]: 37: Hoare triple {7809#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7809#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:32,248 INFO L290 TraceCheckUtils]: 38: Hoare triple {7809#(<= ~counter~0 3)} ~cond := #in~cond; {7809#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:32,248 INFO L290 TraceCheckUtils]: 39: Hoare triple {7809#(<= ~counter~0 3)} assume !(0 == ~cond); {7809#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:32,248 INFO L290 TraceCheckUtils]: 40: Hoare triple {7809#(<= ~counter~0 3)} assume true; {7809#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:32,249 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7809#(<= ~counter~0 3)} {7809#(<= ~counter~0 3)} #63#return; {7809#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:32,249 INFO L290 TraceCheckUtils]: 42: Hoare triple {7809#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {7809#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:32,249 INFO L290 TraceCheckUtils]: 43: Hoare triple {7809#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7809#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:32,249 INFO L290 TraceCheckUtils]: 44: Hoare triple {7809#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7837#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:32,250 INFO L290 TraceCheckUtils]: 45: Hoare triple {7837#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {7837#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:32,250 INFO L272 TraceCheckUtils]: 46: Hoare triple {7837#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7837#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:32,250 INFO L290 TraceCheckUtils]: 47: Hoare triple {7837#(<= ~counter~0 4)} ~cond := #in~cond; {7837#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:32,251 INFO L290 TraceCheckUtils]: 48: Hoare triple {7837#(<= ~counter~0 4)} assume !(0 == ~cond); {7837#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:32,251 INFO L290 TraceCheckUtils]: 49: Hoare triple {7837#(<= ~counter~0 4)} assume true; {7837#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:32,251 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7837#(<= ~counter~0 4)} {7837#(<= ~counter~0 4)} #63#return; {7837#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:32,252 INFO L290 TraceCheckUtils]: 51: Hoare triple {7837#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {7837#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:32,252 INFO L290 TraceCheckUtils]: 52: Hoare triple {7837#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7837#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:32,252 INFO L290 TraceCheckUtils]: 53: Hoare triple {7837#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7865#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:32,252 INFO L290 TraceCheckUtils]: 54: Hoare triple {7865#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {7865#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:32,253 INFO L272 TraceCheckUtils]: 55: Hoare triple {7865#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7865#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:32,253 INFO L290 TraceCheckUtils]: 56: Hoare triple {7865#(<= ~counter~0 5)} ~cond := #in~cond; {7865#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:32,253 INFO L290 TraceCheckUtils]: 57: Hoare triple {7865#(<= ~counter~0 5)} assume !(0 == ~cond); {7865#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:32,254 INFO L290 TraceCheckUtils]: 58: Hoare triple {7865#(<= ~counter~0 5)} assume true; {7865#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:32,254 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7865#(<= ~counter~0 5)} {7865#(<= ~counter~0 5)} #63#return; {7865#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:32,254 INFO L290 TraceCheckUtils]: 60: Hoare triple {7865#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {7865#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:32,255 INFO L290 TraceCheckUtils]: 61: Hoare triple {7865#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7865#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:32,255 INFO L290 TraceCheckUtils]: 62: Hoare triple {7865#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7893#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:32,255 INFO L290 TraceCheckUtils]: 63: Hoare triple {7893#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {7893#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:32,256 INFO L272 TraceCheckUtils]: 64: Hoare triple {7893#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7893#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:32,256 INFO L290 TraceCheckUtils]: 65: Hoare triple {7893#(<= ~counter~0 6)} ~cond := #in~cond; {7893#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:32,256 INFO L290 TraceCheckUtils]: 66: Hoare triple {7893#(<= ~counter~0 6)} assume !(0 == ~cond); {7893#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:32,256 INFO L290 TraceCheckUtils]: 67: Hoare triple {7893#(<= ~counter~0 6)} assume true; {7893#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:32,257 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7893#(<= ~counter~0 6)} {7893#(<= ~counter~0 6)} #63#return; {7893#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:32,257 INFO L290 TraceCheckUtils]: 69: Hoare triple {7893#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {7893#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:32,257 INFO L290 TraceCheckUtils]: 70: Hoare triple {7893#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7893#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:32,258 INFO L290 TraceCheckUtils]: 71: Hoare triple {7893#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7921#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:32,258 INFO L290 TraceCheckUtils]: 72: Hoare triple {7921#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {7921#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:32,258 INFO L272 TraceCheckUtils]: 73: Hoare triple {7921#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7921#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:32,259 INFO L290 TraceCheckUtils]: 74: Hoare triple {7921#(<= ~counter~0 7)} ~cond := #in~cond; {7921#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:32,259 INFO L290 TraceCheckUtils]: 75: Hoare triple {7921#(<= ~counter~0 7)} assume !(0 == ~cond); {7921#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:32,259 INFO L290 TraceCheckUtils]: 76: Hoare triple {7921#(<= ~counter~0 7)} assume true; {7921#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:32,260 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {7921#(<= ~counter~0 7)} {7921#(<= ~counter~0 7)} #63#return; {7921#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:32,260 INFO L290 TraceCheckUtils]: 78: Hoare triple {7921#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {7921#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:32,260 INFO L290 TraceCheckUtils]: 79: Hoare triple {7921#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7921#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:32,261 INFO L290 TraceCheckUtils]: 80: Hoare triple {7921#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7949#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:32,261 INFO L290 TraceCheckUtils]: 81: Hoare triple {7949#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {7949#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:32,261 INFO L272 TraceCheckUtils]: 82: Hoare triple {7949#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7949#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:32,261 INFO L290 TraceCheckUtils]: 83: Hoare triple {7949#(<= ~counter~0 8)} ~cond := #in~cond; {7949#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:32,262 INFO L290 TraceCheckUtils]: 84: Hoare triple {7949#(<= ~counter~0 8)} assume !(0 == ~cond); {7949#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:32,262 INFO L290 TraceCheckUtils]: 85: Hoare triple {7949#(<= ~counter~0 8)} assume true; {7949#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:32,262 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {7949#(<= ~counter~0 8)} {7949#(<= ~counter~0 8)} #63#return; {7949#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:32,263 INFO L290 TraceCheckUtils]: 87: Hoare triple {7949#(<= ~counter~0 8)} assume !!(0 != ~y3~0); {7949#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:32,263 INFO L290 TraceCheckUtils]: 88: Hoare triple {7949#(<= ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7949#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:32,263 INFO L290 TraceCheckUtils]: 89: Hoare triple {7949#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7977#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:32,264 INFO L290 TraceCheckUtils]: 90: Hoare triple {7977#(<= ~counter~0 9)} assume !!(#t~post6 < 50);havoc #t~post6; {7977#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:32,264 INFO L272 TraceCheckUtils]: 91: Hoare triple {7977#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7977#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:32,264 INFO L290 TraceCheckUtils]: 92: Hoare triple {7977#(<= ~counter~0 9)} ~cond := #in~cond; {7977#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:32,265 INFO L290 TraceCheckUtils]: 93: Hoare triple {7977#(<= ~counter~0 9)} assume !(0 == ~cond); {7977#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:32,265 INFO L290 TraceCheckUtils]: 94: Hoare triple {7977#(<= ~counter~0 9)} assume true; {7977#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:32,265 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {7977#(<= ~counter~0 9)} {7977#(<= ~counter~0 9)} #63#return; {7977#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:32,266 INFO L290 TraceCheckUtils]: 96: Hoare triple {7977#(<= ~counter~0 9)} assume !!(0 != ~y3~0); {7977#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:32,266 INFO L290 TraceCheckUtils]: 97: Hoare triple {7977#(<= ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7977#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:32,266 INFO L290 TraceCheckUtils]: 98: Hoare triple {7977#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8005#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:32,266 INFO L290 TraceCheckUtils]: 99: Hoare triple {8005#(<= ~counter~0 10)} assume !!(#t~post6 < 50);havoc #t~post6; {8005#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:32,267 INFO L272 TraceCheckUtils]: 100: Hoare triple {8005#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8005#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:32,267 INFO L290 TraceCheckUtils]: 101: Hoare triple {8005#(<= ~counter~0 10)} ~cond := #in~cond; {8005#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:32,267 INFO L290 TraceCheckUtils]: 102: Hoare triple {8005#(<= ~counter~0 10)} assume !(0 == ~cond); {8005#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:32,268 INFO L290 TraceCheckUtils]: 103: Hoare triple {8005#(<= ~counter~0 10)} assume true; {8005#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:32,268 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {8005#(<= ~counter~0 10)} {8005#(<= ~counter~0 10)} #63#return; {8005#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:32,268 INFO L290 TraceCheckUtils]: 105: Hoare triple {8005#(<= ~counter~0 10)} assume !!(0 != ~y3~0); {8005#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:32,269 INFO L290 TraceCheckUtils]: 106: Hoare triple {8005#(<= ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8005#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:32,269 INFO L290 TraceCheckUtils]: 107: Hoare triple {8005#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8033#(<= ~counter~0 11)} is VALID [2022-04-27 14:23:32,269 INFO L290 TraceCheckUtils]: 108: Hoare triple {8033#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {8033#(<= ~counter~0 11)} is VALID [2022-04-27 14:23:32,270 INFO L272 TraceCheckUtils]: 109: Hoare triple {8033#(<= ~counter~0 11)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8033#(<= ~counter~0 11)} is VALID [2022-04-27 14:23:32,270 INFO L290 TraceCheckUtils]: 110: Hoare triple {8033#(<= ~counter~0 11)} ~cond := #in~cond; {8033#(<= ~counter~0 11)} is VALID [2022-04-27 14:23:32,270 INFO L290 TraceCheckUtils]: 111: Hoare triple {8033#(<= ~counter~0 11)} assume !(0 == ~cond); {8033#(<= ~counter~0 11)} is VALID [2022-04-27 14:23:32,270 INFO L290 TraceCheckUtils]: 112: Hoare triple {8033#(<= ~counter~0 11)} assume true; {8033#(<= ~counter~0 11)} is VALID [2022-04-27 14:23:32,271 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {8033#(<= ~counter~0 11)} {8033#(<= ~counter~0 11)} #63#return; {8033#(<= ~counter~0 11)} is VALID [2022-04-27 14:23:32,271 INFO L290 TraceCheckUtils]: 114: Hoare triple {8033#(<= ~counter~0 11)} assume !!(0 != ~y3~0); {8033#(<= ~counter~0 11)} is VALID [2022-04-27 14:23:32,271 INFO L290 TraceCheckUtils]: 115: Hoare triple {8033#(<= ~counter~0 11)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8033#(<= ~counter~0 11)} is VALID [2022-04-27 14:23:32,272 INFO L290 TraceCheckUtils]: 116: Hoare triple {8033#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8061#(<= ~counter~0 12)} is VALID [2022-04-27 14:23:32,272 INFO L290 TraceCheckUtils]: 117: Hoare triple {8061#(<= ~counter~0 12)} assume !!(#t~post6 < 50);havoc #t~post6; {8061#(<= ~counter~0 12)} is VALID [2022-04-27 14:23:32,273 INFO L272 TraceCheckUtils]: 118: Hoare triple {8061#(<= ~counter~0 12)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8061#(<= ~counter~0 12)} is VALID [2022-04-27 14:23:32,273 INFO L290 TraceCheckUtils]: 119: Hoare triple {8061#(<= ~counter~0 12)} ~cond := #in~cond; {8061#(<= ~counter~0 12)} is VALID [2022-04-27 14:23:32,273 INFO L290 TraceCheckUtils]: 120: Hoare triple {8061#(<= ~counter~0 12)} assume !(0 == ~cond); {8061#(<= ~counter~0 12)} is VALID [2022-04-27 14:23:32,273 INFO L290 TraceCheckUtils]: 121: Hoare triple {8061#(<= ~counter~0 12)} assume true; {8061#(<= ~counter~0 12)} is VALID [2022-04-27 14:23:32,274 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {8061#(<= ~counter~0 12)} {8061#(<= ~counter~0 12)} #63#return; {8061#(<= ~counter~0 12)} is VALID [2022-04-27 14:23:32,274 INFO L290 TraceCheckUtils]: 123: Hoare triple {8061#(<= ~counter~0 12)} assume !!(0 != ~y3~0); {8061#(<= ~counter~0 12)} is VALID [2022-04-27 14:23:32,274 INFO L290 TraceCheckUtils]: 124: Hoare triple {8061#(<= ~counter~0 12)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8061#(<= ~counter~0 12)} is VALID [2022-04-27 14:23:32,275 INFO L290 TraceCheckUtils]: 125: Hoare triple {8061#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8089#(<= ~counter~0 13)} is VALID [2022-04-27 14:23:32,275 INFO L290 TraceCheckUtils]: 126: Hoare triple {8089#(<= ~counter~0 13)} assume !!(#t~post6 < 50);havoc #t~post6; {8089#(<= ~counter~0 13)} is VALID [2022-04-27 14:23:32,275 INFO L272 TraceCheckUtils]: 127: Hoare triple {8089#(<= ~counter~0 13)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8089#(<= ~counter~0 13)} is VALID [2022-04-27 14:23:32,276 INFO L290 TraceCheckUtils]: 128: Hoare triple {8089#(<= ~counter~0 13)} ~cond := #in~cond; {8089#(<= ~counter~0 13)} is VALID [2022-04-27 14:23:32,276 INFO L290 TraceCheckUtils]: 129: Hoare triple {8089#(<= ~counter~0 13)} assume !(0 == ~cond); {8089#(<= ~counter~0 13)} is VALID [2022-04-27 14:23:32,276 INFO L290 TraceCheckUtils]: 130: Hoare triple {8089#(<= ~counter~0 13)} assume true; {8089#(<= ~counter~0 13)} is VALID [2022-04-27 14:23:32,277 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {8089#(<= ~counter~0 13)} {8089#(<= ~counter~0 13)} #63#return; {8089#(<= ~counter~0 13)} is VALID [2022-04-27 14:23:32,277 INFO L290 TraceCheckUtils]: 132: Hoare triple {8089#(<= ~counter~0 13)} assume !!(0 != ~y3~0); {8089#(<= ~counter~0 13)} is VALID [2022-04-27 14:23:32,277 INFO L290 TraceCheckUtils]: 133: Hoare triple {8089#(<= ~counter~0 13)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8089#(<= ~counter~0 13)} is VALID [2022-04-27 14:23:32,277 INFO L290 TraceCheckUtils]: 134: Hoare triple {8089#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8117#(<= ~counter~0 14)} is VALID [2022-04-27 14:23:32,278 INFO L290 TraceCheckUtils]: 135: Hoare triple {8117#(<= ~counter~0 14)} assume !!(#t~post6 < 50);havoc #t~post6; {8117#(<= ~counter~0 14)} is VALID [2022-04-27 14:23:32,278 INFO L272 TraceCheckUtils]: 136: Hoare triple {8117#(<= ~counter~0 14)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8117#(<= ~counter~0 14)} is VALID [2022-04-27 14:23:32,278 INFO L290 TraceCheckUtils]: 137: Hoare triple {8117#(<= ~counter~0 14)} ~cond := #in~cond; {8117#(<= ~counter~0 14)} is VALID [2022-04-27 14:23:32,279 INFO L290 TraceCheckUtils]: 138: Hoare triple {8117#(<= ~counter~0 14)} assume !(0 == ~cond); {8117#(<= ~counter~0 14)} is VALID [2022-04-27 14:23:32,279 INFO L290 TraceCheckUtils]: 139: Hoare triple {8117#(<= ~counter~0 14)} assume true; {8117#(<= ~counter~0 14)} is VALID [2022-04-27 14:23:32,279 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {8117#(<= ~counter~0 14)} {8117#(<= ~counter~0 14)} #63#return; {8117#(<= ~counter~0 14)} is VALID [2022-04-27 14:23:32,280 INFO L290 TraceCheckUtils]: 141: Hoare triple {8117#(<= ~counter~0 14)} assume !!(0 != ~y3~0); {8117#(<= ~counter~0 14)} is VALID [2022-04-27 14:23:32,280 INFO L290 TraceCheckUtils]: 142: Hoare triple {8117#(<= ~counter~0 14)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8117#(<= ~counter~0 14)} is VALID [2022-04-27 14:23:32,280 INFO L290 TraceCheckUtils]: 143: Hoare triple {8117#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8145#(<= ~counter~0 15)} is VALID [2022-04-27 14:23:32,281 INFO L290 TraceCheckUtils]: 144: Hoare triple {8145#(<= ~counter~0 15)} assume !!(#t~post6 < 50);havoc #t~post6; {8145#(<= ~counter~0 15)} is VALID [2022-04-27 14:23:32,281 INFO L272 TraceCheckUtils]: 145: Hoare triple {8145#(<= ~counter~0 15)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8145#(<= ~counter~0 15)} is VALID [2022-04-27 14:23:32,281 INFO L290 TraceCheckUtils]: 146: Hoare triple {8145#(<= ~counter~0 15)} ~cond := #in~cond; {8145#(<= ~counter~0 15)} is VALID [2022-04-27 14:23:32,282 INFO L290 TraceCheckUtils]: 147: Hoare triple {8145#(<= ~counter~0 15)} assume !(0 == ~cond); {8145#(<= ~counter~0 15)} is VALID [2022-04-27 14:23:32,282 INFO L290 TraceCheckUtils]: 148: Hoare triple {8145#(<= ~counter~0 15)} assume true; {8145#(<= ~counter~0 15)} is VALID [2022-04-27 14:23:32,282 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {8145#(<= ~counter~0 15)} {8145#(<= ~counter~0 15)} #63#return; {8145#(<= ~counter~0 15)} is VALID [2022-04-27 14:23:32,283 INFO L290 TraceCheckUtils]: 150: Hoare triple {8145#(<= ~counter~0 15)} assume !!(0 != ~y3~0); {8145#(<= ~counter~0 15)} is VALID [2022-04-27 14:23:32,283 INFO L290 TraceCheckUtils]: 151: Hoare triple {8145#(<= ~counter~0 15)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8145#(<= ~counter~0 15)} is VALID [2022-04-27 14:23:32,283 INFO L290 TraceCheckUtils]: 152: Hoare triple {8145#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8173#(<= ~counter~0 16)} is VALID [2022-04-27 14:23:32,283 INFO L290 TraceCheckUtils]: 153: Hoare triple {8173#(<= ~counter~0 16)} assume !!(#t~post6 < 50);havoc #t~post6; {8173#(<= ~counter~0 16)} is VALID [2022-04-27 14:23:32,284 INFO L272 TraceCheckUtils]: 154: Hoare triple {8173#(<= ~counter~0 16)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8173#(<= ~counter~0 16)} is VALID [2022-04-27 14:23:32,284 INFO L290 TraceCheckUtils]: 155: Hoare triple {8173#(<= ~counter~0 16)} ~cond := #in~cond; {8173#(<= ~counter~0 16)} is VALID [2022-04-27 14:23:32,284 INFO L290 TraceCheckUtils]: 156: Hoare triple {8173#(<= ~counter~0 16)} assume !(0 == ~cond); {8173#(<= ~counter~0 16)} is VALID [2022-04-27 14:23:32,285 INFO L290 TraceCheckUtils]: 157: Hoare triple {8173#(<= ~counter~0 16)} assume true; {8173#(<= ~counter~0 16)} is VALID [2022-04-27 14:23:32,285 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {8173#(<= ~counter~0 16)} {8173#(<= ~counter~0 16)} #63#return; {8173#(<= ~counter~0 16)} is VALID [2022-04-27 14:23:32,285 INFO L290 TraceCheckUtils]: 159: Hoare triple {8173#(<= ~counter~0 16)} assume !!(0 != ~y3~0); {8173#(<= ~counter~0 16)} is VALID [2022-04-27 14:23:32,286 INFO L290 TraceCheckUtils]: 160: Hoare triple {8173#(<= ~counter~0 16)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8173#(<= ~counter~0 16)} is VALID [2022-04-27 14:23:32,286 INFO L290 TraceCheckUtils]: 161: Hoare triple {8173#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8201#(<= ~counter~0 17)} is VALID [2022-04-27 14:23:32,286 INFO L290 TraceCheckUtils]: 162: Hoare triple {8201#(<= ~counter~0 17)} assume !!(#t~post6 < 50);havoc #t~post6; {8201#(<= ~counter~0 17)} is VALID [2022-04-27 14:23:32,287 INFO L272 TraceCheckUtils]: 163: Hoare triple {8201#(<= ~counter~0 17)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8201#(<= ~counter~0 17)} is VALID [2022-04-27 14:23:32,287 INFO L290 TraceCheckUtils]: 164: Hoare triple {8201#(<= ~counter~0 17)} ~cond := #in~cond; {8201#(<= ~counter~0 17)} is VALID [2022-04-27 14:23:32,287 INFO L290 TraceCheckUtils]: 165: Hoare triple {8201#(<= ~counter~0 17)} assume !(0 == ~cond); {8201#(<= ~counter~0 17)} is VALID [2022-04-27 14:23:32,288 INFO L290 TraceCheckUtils]: 166: Hoare triple {8201#(<= ~counter~0 17)} assume true; {8201#(<= ~counter~0 17)} is VALID [2022-04-27 14:23:32,288 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {8201#(<= ~counter~0 17)} {8201#(<= ~counter~0 17)} #63#return; {8201#(<= ~counter~0 17)} is VALID [2022-04-27 14:23:32,288 INFO L290 TraceCheckUtils]: 168: Hoare triple {8201#(<= ~counter~0 17)} assume !!(0 != ~y3~0); {8201#(<= ~counter~0 17)} is VALID [2022-04-27 14:23:32,289 INFO L290 TraceCheckUtils]: 169: Hoare triple {8201#(<= ~counter~0 17)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8201#(<= ~counter~0 17)} is VALID [2022-04-27 14:23:32,289 INFO L290 TraceCheckUtils]: 170: Hoare triple {8201#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8229#(<= ~counter~0 18)} is VALID [2022-04-27 14:23:32,289 INFO L290 TraceCheckUtils]: 171: Hoare triple {8229#(<= ~counter~0 18)} assume !!(#t~post6 < 50);havoc #t~post6; {8229#(<= ~counter~0 18)} is VALID [2022-04-27 14:23:32,290 INFO L272 TraceCheckUtils]: 172: Hoare triple {8229#(<= ~counter~0 18)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8229#(<= ~counter~0 18)} is VALID [2022-04-27 14:23:32,290 INFO L290 TraceCheckUtils]: 173: Hoare triple {8229#(<= ~counter~0 18)} ~cond := #in~cond; {8229#(<= ~counter~0 18)} is VALID [2022-04-27 14:23:32,290 INFO L290 TraceCheckUtils]: 174: Hoare triple {8229#(<= ~counter~0 18)} assume !(0 == ~cond); {8229#(<= ~counter~0 18)} is VALID [2022-04-27 14:23:32,290 INFO L290 TraceCheckUtils]: 175: Hoare triple {8229#(<= ~counter~0 18)} assume true; {8229#(<= ~counter~0 18)} is VALID [2022-04-27 14:23:32,291 INFO L284 TraceCheckUtils]: 176: Hoare quadruple {8229#(<= ~counter~0 18)} {8229#(<= ~counter~0 18)} #63#return; {8229#(<= ~counter~0 18)} is VALID [2022-04-27 14:23:32,291 INFO L290 TraceCheckUtils]: 177: Hoare triple {8229#(<= ~counter~0 18)} assume !!(0 != ~y3~0); {8229#(<= ~counter~0 18)} is VALID [2022-04-27 14:23:32,291 INFO L290 TraceCheckUtils]: 178: Hoare triple {8229#(<= ~counter~0 18)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8229#(<= ~counter~0 18)} is VALID [2022-04-27 14:23:32,292 INFO L290 TraceCheckUtils]: 179: Hoare triple {8229#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8257#(<= ~counter~0 19)} is VALID [2022-04-27 14:23:32,292 INFO L290 TraceCheckUtils]: 180: Hoare triple {8257#(<= ~counter~0 19)} assume !!(#t~post6 < 50);havoc #t~post6; {8257#(<= ~counter~0 19)} is VALID [2022-04-27 14:23:32,292 INFO L272 TraceCheckUtils]: 181: Hoare triple {8257#(<= ~counter~0 19)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8257#(<= ~counter~0 19)} is VALID [2022-04-27 14:23:32,293 INFO L290 TraceCheckUtils]: 182: Hoare triple {8257#(<= ~counter~0 19)} ~cond := #in~cond; {8257#(<= ~counter~0 19)} is VALID [2022-04-27 14:23:32,293 INFO L290 TraceCheckUtils]: 183: Hoare triple {8257#(<= ~counter~0 19)} assume !(0 == ~cond); {8257#(<= ~counter~0 19)} is VALID [2022-04-27 14:23:32,293 INFO L290 TraceCheckUtils]: 184: Hoare triple {8257#(<= ~counter~0 19)} assume true; {8257#(<= ~counter~0 19)} is VALID [2022-04-27 14:23:32,294 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {8257#(<= ~counter~0 19)} {8257#(<= ~counter~0 19)} #63#return; {8257#(<= ~counter~0 19)} is VALID [2022-04-27 14:23:32,294 INFO L290 TraceCheckUtils]: 186: Hoare triple {8257#(<= ~counter~0 19)} assume !!(0 != ~y3~0); {8257#(<= ~counter~0 19)} is VALID [2022-04-27 14:23:32,294 INFO L290 TraceCheckUtils]: 187: Hoare triple {8257#(<= ~counter~0 19)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8257#(<= ~counter~0 19)} is VALID [2022-04-27 14:23:32,295 INFO L290 TraceCheckUtils]: 188: Hoare triple {8257#(<= ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8285#(<= ~counter~0 20)} is VALID [2022-04-27 14:23:32,295 INFO L290 TraceCheckUtils]: 189: Hoare triple {8285#(<= ~counter~0 20)} assume !!(#t~post6 < 50);havoc #t~post6; {8285#(<= ~counter~0 20)} is VALID [2022-04-27 14:23:32,295 INFO L272 TraceCheckUtils]: 190: Hoare triple {8285#(<= ~counter~0 20)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8285#(<= ~counter~0 20)} is VALID [2022-04-27 14:23:32,296 INFO L290 TraceCheckUtils]: 191: Hoare triple {8285#(<= ~counter~0 20)} ~cond := #in~cond; {8285#(<= ~counter~0 20)} is VALID [2022-04-27 14:23:32,296 INFO L290 TraceCheckUtils]: 192: Hoare triple {8285#(<= ~counter~0 20)} assume !(0 == ~cond); {8285#(<= ~counter~0 20)} is VALID [2022-04-27 14:23:32,296 INFO L290 TraceCheckUtils]: 193: Hoare triple {8285#(<= ~counter~0 20)} assume true; {8285#(<= ~counter~0 20)} is VALID [2022-04-27 14:23:32,297 INFO L284 TraceCheckUtils]: 194: Hoare quadruple {8285#(<= ~counter~0 20)} {8285#(<= ~counter~0 20)} #63#return; {8285#(<= ~counter~0 20)} is VALID [2022-04-27 14:23:32,297 INFO L290 TraceCheckUtils]: 195: Hoare triple {8285#(<= ~counter~0 20)} assume !!(0 != ~y3~0); {8285#(<= ~counter~0 20)} is VALID [2022-04-27 14:23:32,297 INFO L290 TraceCheckUtils]: 196: Hoare triple {8285#(<= ~counter~0 20)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8285#(<= ~counter~0 20)} is VALID [2022-04-27 14:23:32,297 INFO L290 TraceCheckUtils]: 197: Hoare triple {8285#(<= ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8313#(<= ~counter~0 21)} is VALID [2022-04-27 14:23:32,298 INFO L290 TraceCheckUtils]: 198: Hoare triple {8313#(<= ~counter~0 21)} assume !!(#t~post6 < 50);havoc #t~post6; {8313#(<= ~counter~0 21)} is VALID [2022-04-27 14:23:32,298 INFO L272 TraceCheckUtils]: 199: Hoare triple {8313#(<= ~counter~0 21)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8313#(<= ~counter~0 21)} is VALID [2022-04-27 14:23:32,298 INFO L290 TraceCheckUtils]: 200: Hoare triple {8313#(<= ~counter~0 21)} ~cond := #in~cond; {8313#(<= ~counter~0 21)} is VALID [2022-04-27 14:23:32,299 INFO L290 TraceCheckUtils]: 201: Hoare triple {8313#(<= ~counter~0 21)} assume !(0 == ~cond); {8313#(<= ~counter~0 21)} is VALID [2022-04-27 14:23:32,299 INFO L290 TraceCheckUtils]: 202: Hoare triple {8313#(<= ~counter~0 21)} assume true; {8313#(<= ~counter~0 21)} is VALID [2022-04-27 14:23:32,299 INFO L284 TraceCheckUtils]: 203: Hoare quadruple {8313#(<= ~counter~0 21)} {8313#(<= ~counter~0 21)} #63#return; {8313#(<= ~counter~0 21)} is VALID [2022-04-27 14:23:32,300 INFO L290 TraceCheckUtils]: 204: Hoare triple {8313#(<= ~counter~0 21)} assume !!(0 != ~y3~0); {8313#(<= ~counter~0 21)} is VALID [2022-04-27 14:23:32,300 INFO L290 TraceCheckUtils]: 205: Hoare triple {8313#(<= ~counter~0 21)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8313#(<= ~counter~0 21)} is VALID [2022-04-27 14:23:32,300 INFO L290 TraceCheckUtils]: 206: Hoare triple {8313#(<= ~counter~0 21)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8341#(<= ~counter~0 22)} is VALID [2022-04-27 14:23:32,300 INFO L290 TraceCheckUtils]: 207: Hoare triple {8341#(<= ~counter~0 22)} assume !!(#t~post6 < 50);havoc #t~post6; {8341#(<= ~counter~0 22)} is VALID [2022-04-27 14:23:32,301 INFO L272 TraceCheckUtils]: 208: Hoare triple {8341#(<= ~counter~0 22)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8341#(<= ~counter~0 22)} is VALID [2022-04-27 14:23:32,301 INFO L290 TraceCheckUtils]: 209: Hoare triple {8341#(<= ~counter~0 22)} ~cond := #in~cond; {8341#(<= ~counter~0 22)} is VALID [2022-04-27 14:23:32,301 INFO L290 TraceCheckUtils]: 210: Hoare triple {8341#(<= ~counter~0 22)} assume !(0 == ~cond); {8341#(<= ~counter~0 22)} is VALID [2022-04-27 14:23:32,302 INFO L290 TraceCheckUtils]: 211: Hoare triple {8341#(<= ~counter~0 22)} assume true; {8341#(<= ~counter~0 22)} is VALID [2022-04-27 14:23:32,302 INFO L284 TraceCheckUtils]: 212: Hoare quadruple {8341#(<= ~counter~0 22)} {8341#(<= ~counter~0 22)} #63#return; {8341#(<= ~counter~0 22)} is VALID [2022-04-27 14:23:32,302 INFO L290 TraceCheckUtils]: 213: Hoare triple {8341#(<= ~counter~0 22)} assume !!(0 != ~y3~0); {8341#(<= ~counter~0 22)} is VALID [2022-04-27 14:23:32,303 INFO L290 TraceCheckUtils]: 214: Hoare triple {8341#(<= ~counter~0 22)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8341#(<= ~counter~0 22)} is VALID [2022-04-27 14:23:32,303 INFO L290 TraceCheckUtils]: 215: Hoare triple {8341#(<= ~counter~0 22)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8369#(<= ~counter~0 23)} is VALID [2022-04-27 14:23:32,303 INFO L290 TraceCheckUtils]: 216: Hoare triple {8369#(<= ~counter~0 23)} assume !!(#t~post6 < 50);havoc #t~post6; {8369#(<= ~counter~0 23)} is VALID [2022-04-27 14:23:32,304 INFO L272 TraceCheckUtils]: 217: Hoare triple {8369#(<= ~counter~0 23)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8369#(<= ~counter~0 23)} is VALID [2022-04-27 14:23:32,304 INFO L290 TraceCheckUtils]: 218: Hoare triple {8369#(<= ~counter~0 23)} ~cond := #in~cond; {8369#(<= ~counter~0 23)} is VALID [2022-04-27 14:23:32,304 INFO L290 TraceCheckUtils]: 219: Hoare triple {8369#(<= ~counter~0 23)} assume !(0 == ~cond); {8369#(<= ~counter~0 23)} is VALID [2022-04-27 14:23:32,304 INFO L290 TraceCheckUtils]: 220: Hoare triple {8369#(<= ~counter~0 23)} assume true; {8369#(<= ~counter~0 23)} is VALID [2022-04-27 14:23:32,305 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {8369#(<= ~counter~0 23)} {8369#(<= ~counter~0 23)} #63#return; {8369#(<= ~counter~0 23)} is VALID [2022-04-27 14:23:32,305 INFO L290 TraceCheckUtils]: 222: Hoare triple {8369#(<= ~counter~0 23)} assume !!(0 != ~y3~0); {8369#(<= ~counter~0 23)} is VALID [2022-04-27 14:23:32,305 INFO L290 TraceCheckUtils]: 223: Hoare triple {8369#(<= ~counter~0 23)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8369#(<= ~counter~0 23)} is VALID [2022-04-27 14:23:32,306 INFO L290 TraceCheckUtils]: 224: Hoare triple {8369#(<= ~counter~0 23)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8397#(<= ~counter~0 24)} is VALID [2022-04-27 14:23:32,306 INFO L290 TraceCheckUtils]: 225: Hoare triple {8397#(<= ~counter~0 24)} assume !!(#t~post6 < 50);havoc #t~post6; {8397#(<= ~counter~0 24)} is VALID [2022-04-27 14:23:32,307 INFO L272 TraceCheckUtils]: 226: Hoare triple {8397#(<= ~counter~0 24)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8397#(<= ~counter~0 24)} is VALID [2022-04-27 14:23:32,307 INFO L290 TraceCheckUtils]: 227: Hoare triple {8397#(<= ~counter~0 24)} ~cond := #in~cond; {8397#(<= ~counter~0 24)} is VALID [2022-04-27 14:23:32,307 INFO L290 TraceCheckUtils]: 228: Hoare triple {8397#(<= ~counter~0 24)} assume !(0 == ~cond); {8397#(<= ~counter~0 24)} is VALID [2022-04-27 14:23:32,307 INFO L290 TraceCheckUtils]: 229: Hoare triple {8397#(<= ~counter~0 24)} assume true; {8397#(<= ~counter~0 24)} is VALID [2022-04-27 14:23:32,308 INFO L284 TraceCheckUtils]: 230: Hoare quadruple {8397#(<= ~counter~0 24)} {8397#(<= ~counter~0 24)} #63#return; {8397#(<= ~counter~0 24)} is VALID [2022-04-27 14:23:32,308 INFO L290 TraceCheckUtils]: 231: Hoare triple {8397#(<= ~counter~0 24)} assume !!(0 != ~y3~0); {8397#(<= ~counter~0 24)} is VALID [2022-04-27 14:23:32,308 INFO L290 TraceCheckUtils]: 232: Hoare triple {8397#(<= ~counter~0 24)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8397#(<= ~counter~0 24)} is VALID [2022-04-27 14:23:32,309 INFO L290 TraceCheckUtils]: 233: Hoare triple {8397#(<= ~counter~0 24)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8425#(<= ~counter~0 25)} is VALID [2022-04-27 14:23:32,309 INFO L290 TraceCheckUtils]: 234: Hoare triple {8425#(<= ~counter~0 25)} assume !!(#t~post6 < 50);havoc #t~post6; {8425#(<= ~counter~0 25)} is VALID [2022-04-27 14:23:32,309 INFO L272 TraceCheckUtils]: 235: Hoare triple {8425#(<= ~counter~0 25)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8425#(<= ~counter~0 25)} is VALID [2022-04-27 14:23:32,310 INFO L290 TraceCheckUtils]: 236: Hoare triple {8425#(<= ~counter~0 25)} ~cond := #in~cond; {8425#(<= ~counter~0 25)} is VALID [2022-04-27 14:23:32,310 INFO L290 TraceCheckUtils]: 237: Hoare triple {8425#(<= ~counter~0 25)} assume !(0 == ~cond); {8425#(<= ~counter~0 25)} is VALID [2022-04-27 14:23:32,310 INFO L290 TraceCheckUtils]: 238: Hoare triple {8425#(<= ~counter~0 25)} assume true; {8425#(<= ~counter~0 25)} is VALID [2022-04-27 14:23:32,311 INFO L284 TraceCheckUtils]: 239: Hoare quadruple {8425#(<= ~counter~0 25)} {8425#(<= ~counter~0 25)} #63#return; {8425#(<= ~counter~0 25)} is VALID [2022-04-27 14:23:32,311 INFO L290 TraceCheckUtils]: 240: Hoare triple {8425#(<= ~counter~0 25)} assume !!(0 != ~y3~0); {8425#(<= ~counter~0 25)} is VALID [2022-04-27 14:23:32,311 INFO L290 TraceCheckUtils]: 241: Hoare triple {8425#(<= ~counter~0 25)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8425#(<= ~counter~0 25)} is VALID [2022-04-27 14:23:32,311 INFO L290 TraceCheckUtils]: 242: Hoare triple {8425#(<= ~counter~0 25)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8453#(<= ~counter~0 26)} is VALID [2022-04-27 14:23:32,312 INFO L290 TraceCheckUtils]: 243: Hoare triple {8453#(<= ~counter~0 26)} assume !!(#t~post6 < 50);havoc #t~post6; {8453#(<= ~counter~0 26)} is VALID [2022-04-27 14:23:32,312 INFO L272 TraceCheckUtils]: 244: Hoare triple {8453#(<= ~counter~0 26)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8453#(<= ~counter~0 26)} is VALID [2022-04-27 14:23:32,312 INFO L290 TraceCheckUtils]: 245: Hoare triple {8453#(<= ~counter~0 26)} ~cond := #in~cond; {8453#(<= ~counter~0 26)} is VALID [2022-04-27 14:23:32,313 INFO L290 TraceCheckUtils]: 246: Hoare triple {8453#(<= ~counter~0 26)} assume !(0 == ~cond); {8453#(<= ~counter~0 26)} is VALID [2022-04-27 14:23:32,313 INFO L290 TraceCheckUtils]: 247: Hoare triple {8453#(<= ~counter~0 26)} assume true; {8453#(<= ~counter~0 26)} is VALID [2022-04-27 14:23:32,313 INFO L284 TraceCheckUtils]: 248: Hoare quadruple {8453#(<= ~counter~0 26)} {8453#(<= ~counter~0 26)} #63#return; {8453#(<= ~counter~0 26)} is VALID [2022-04-27 14:23:32,314 INFO L290 TraceCheckUtils]: 249: Hoare triple {8453#(<= ~counter~0 26)} assume !!(0 != ~y3~0); {8453#(<= ~counter~0 26)} is VALID [2022-04-27 14:23:32,314 INFO L290 TraceCheckUtils]: 250: Hoare triple {8453#(<= ~counter~0 26)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8453#(<= ~counter~0 26)} is VALID [2022-04-27 14:23:32,314 INFO L290 TraceCheckUtils]: 251: Hoare triple {8453#(<= ~counter~0 26)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8481#(<= ~counter~0 27)} is VALID [2022-04-27 14:23:32,314 INFO L290 TraceCheckUtils]: 252: Hoare triple {8481#(<= ~counter~0 27)} assume !!(#t~post6 < 50);havoc #t~post6; {8481#(<= ~counter~0 27)} is VALID [2022-04-27 14:23:32,315 INFO L272 TraceCheckUtils]: 253: Hoare triple {8481#(<= ~counter~0 27)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8481#(<= ~counter~0 27)} is VALID [2022-04-27 14:23:32,315 INFO L290 TraceCheckUtils]: 254: Hoare triple {8481#(<= ~counter~0 27)} ~cond := #in~cond; {8481#(<= ~counter~0 27)} is VALID [2022-04-27 14:23:32,315 INFO L290 TraceCheckUtils]: 255: Hoare triple {8481#(<= ~counter~0 27)} assume !(0 == ~cond); {8481#(<= ~counter~0 27)} is VALID [2022-04-27 14:23:32,316 INFO L290 TraceCheckUtils]: 256: Hoare triple {8481#(<= ~counter~0 27)} assume true; {8481#(<= ~counter~0 27)} is VALID [2022-04-27 14:23:32,316 INFO L284 TraceCheckUtils]: 257: Hoare quadruple {8481#(<= ~counter~0 27)} {8481#(<= ~counter~0 27)} #63#return; {8481#(<= ~counter~0 27)} is VALID [2022-04-27 14:23:32,316 INFO L290 TraceCheckUtils]: 258: Hoare triple {8481#(<= ~counter~0 27)} assume !!(0 != ~y3~0); {8481#(<= ~counter~0 27)} is VALID [2022-04-27 14:23:32,317 INFO L290 TraceCheckUtils]: 259: Hoare triple {8481#(<= ~counter~0 27)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8481#(<= ~counter~0 27)} is VALID [2022-04-27 14:23:32,317 INFO L290 TraceCheckUtils]: 260: Hoare triple {8481#(<= ~counter~0 27)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8509#(<= ~counter~0 28)} is VALID [2022-04-27 14:23:32,317 INFO L290 TraceCheckUtils]: 261: Hoare triple {8509#(<= ~counter~0 28)} assume !!(#t~post6 < 50);havoc #t~post6; {8509#(<= ~counter~0 28)} is VALID [2022-04-27 14:23:32,318 INFO L272 TraceCheckUtils]: 262: Hoare triple {8509#(<= ~counter~0 28)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8509#(<= ~counter~0 28)} is VALID [2022-04-27 14:23:32,318 INFO L290 TraceCheckUtils]: 263: Hoare triple {8509#(<= ~counter~0 28)} ~cond := #in~cond; {8509#(<= ~counter~0 28)} is VALID [2022-04-27 14:23:32,318 INFO L290 TraceCheckUtils]: 264: Hoare triple {8509#(<= ~counter~0 28)} assume !(0 == ~cond); {8509#(<= ~counter~0 28)} is VALID [2022-04-27 14:23:32,318 INFO L290 TraceCheckUtils]: 265: Hoare triple {8509#(<= ~counter~0 28)} assume true; {8509#(<= ~counter~0 28)} is VALID [2022-04-27 14:23:32,319 INFO L284 TraceCheckUtils]: 266: Hoare quadruple {8509#(<= ~counter~0 28)} {8509#(<= ~counter~0 28)} #63#return; {8509#(<= ~counter~0 28)} is VALID [2022-04-27 14:23:32,319 INFO L290 TraceCheckUtils]: 267: Hoare triple {8509#(<= ~counter~0 28)} assume !!(0 != ~y3~0); {8509#(<= ~counter~0 28)} is VALID [2022-04-27 14:23:32,319 INFO L290 TraceCheckUtils]: 268: Hoare triple {8509#(<= ~counter~0 28)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8509#(<= ~counter~0 28)} is VALID [2022-04-27 14:23:32,320 INFO L290 TraceCheckUtils]: 269: Hoare triple {8509#(<= ~counter~0 28)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8537#(<= ~counter~0 29)} is VALID [2022-04-27 14:23:32,320 INFO L290 TraceCheckUtils]: 270: Hoare triple {8537#(<= ~counter~0 29)} assume !!(#t~post6 < 50);havoc #t~post6; {8537#(<= ~counter~0 29)} is VALID [2022-04-27 14:23:32,320 INFO L272 TraceCheckUtils]: 271: Hoare triple {8537#(<= ~counter~0 29)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8537#(<= ~counter~0 29)} is VALID [2022-04-27 14:23:32,321 INFO L290 TraceCheckUtils]: 272: Hoare triple {8537#(<= ~counter~0 29)} ~cond := #in~cond; {8537#(<= ~counter~0 29)} is VALID [2022-04-27 14:23:32,321 INFO L290 TraceCheckUtils]: 273: Hoare triple {8537#(<= ~counter~0 29)} assume !(0 == ~cond); {8537#(<= ~counter~0 29)} is VALID [2022-04-27 14:23:32,321 INFO L290 TraceCheckUtils]: 274: Hoare triple {8537#(<= ~counter~0 29)} assume true; {8537#(<= ~counter~0 29)} is VALID [2022-04-27 14:23:32,322 INFO L284 TraceCheckUtils]: 275: Hoare quadruple {8537#(<= ~counter~0 29)} {8537#(<= ~counter~0 29)} #63#return; {8537#(<= ~counter~0 29)} is VALID [2022-04-27 14:23:32,322 INFO L290 TraceCheckUtils]: 276: Hoare triple {8537#(<= ~counter~0 29)} assume !!(0 != ~y3~0); {8537#(<= ~counter~0 29)} is VALID [2022-04-27 14:23:32,322 INFO L290 TraceCheckUtils]: 277: Hoare triple {8537#(<= ~counter~0 29)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8537#(<= ~counter~0 29)} is VALID [2022-04-27 14:23:32,323 INFO L290 TraceCheckUtils]: 278: Hoare triple {8537#(<= ~counter~0 29)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8565#(<= ~counter~0 30)} is VALID [2022-04-27 14:23:32,323 INFO L290 TraceCheckUtils]: 279: Hoare triple {8565#(<= ~counter~0 30)} assume !!(#t~post6 < 50);havoc #t~post6; {8565#(<= ~counter~0 30)} is VALID [2022-04-27 14:23:32,323 INFO L272 TraceCheckUtils]: 280: Hoare triple {8565#(<= ~counter~0 30)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8565#(<= ~counter~0 30)} is VALID [2022-04-27 14:23:32,323 INFO L290 TraceCheckUtils]: 281: Hoare triple {8565#(<= ~counter~0 30)} ~cond := #in~cond; {8565#(<= ~counter~0 30)} is VALID [2022-04-27 14:23:32,324 INFO L290 TraceCheckUtils]: 282: Hoare triple {8565#(<= ~counter~0 30)} assume !(0 == ~cond); {8565#(<= ~counter~0 30)} is VALID [2022-04-27 14:23:32,324 INFO L290 TraceCheckUtils]: 283: Hoare triple {8565#(<= ~counter~0 30)} assume true; {8565#(<= ~counter~0 30)} is VALID [2022-04-27 14:23:32,324 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {8565#(<= ~counter~0 30)} {8565#(<= ~counter~0 30)} #63#return; {8565#(<= ~counter~0 30)} is VALID [2022-04-27 14:23:32,325 INFO L290 TraceCheckUtils]: 285: Hoare triple {8565#(<= ~counter~0 30)} assume !!(0 != ~y3~0); {8565#(<= ~counter~0 30)} is VALID [2022-04-27 14:23:32,343 INFO L290 TraceCheckUtils]: 286: Hoare triple {8565#(<= ~counter~0 30)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8565#(<= ~counter~0 30)} is VALID [2022-04-27 14:23:32,344 INFO L290 TraceCheckUtils]: 287: Hoare triple {8565#(<= ~counter~0 30)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8593#(<= ~counter~0 31)} is VALID [2022-04-27 14:23:32,344 INFO L290 TraceCheckUtils]: 288: Hoare triple {8593#(<= ~counter~0 31)} assume !!(#t~post6 < 50);havoc #t~post6; {8593#(<= ~counter~0 31)} is VALID [2022-04-27 14:23:32,345 INFO L272 TraceCheckUtils]: 289: Hoare triple {8593#(<= ~counter~0 31)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8593#(<= ~counter~0 31)} is VALID [2022-04-27 14:23:32,345 INFO L290 TraceCheckUtils]: 290: Hoare triple {8593#(<= ~counter~0 31)} ~cond := #in~cond; {8593#(<= ~counter~0 31)} is VALID [2022-04-27 14:23:32,346 INFO L290 TraceCheckUtils]: 291: Hoare triple {8593#(<= ~counter~0 31)} assume !(0 == ~cond); {8593#(<= ~counter~0 31)} is VALID [2022-04-27 14:23:32,346 INFO L290 TraceCheckUtils]: 292: Hoare triple {8593#(<= ~counter~0 31)} assume true; {8593#(<= ~counter~0 31)} is VALID [2022-04-27 14:23:32,347 INFO L284 TraceCheckUtils]: 293: Hoare quadruple {8593#(<= ~counter~0 31)} {8593#(<= ~counter~0 31)} #63#return; {8593#(<= ~counter~0 31)} is VALID [2022-04-27 14:23:32,347 INFO L290 TraceCheckUtils]: 294: Hoare triple {8593#(<= ~counter~0 31)} assume !!(0 != ~y3~0); {8593#(<= ~counter~0 31)} is VALID [2022-04-27 14:23:32,347 INFO L290 TraceCheckUtils]: 295: Hoare triple {8593#(<= ~counter~0 31)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8593#(<= ~counter~0 31)} is VALID [2022-04-27 14:23:32,348 INFO L290 TraceCheckUtils]: 296: Hoare triple {8593#(<= ~counter~0 31)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8621#(<= ~counter~0 32)} is VALID [2022-04-27 14:23:32,348 INFO L290 TraceCheckUtils]: 297: Hoare triple {8621#(<= ~counter~0 32)} assume !!(#t~post6 < 50);havoc #t~post6; {8621#(<= ~counter~0 32)} is VALID [2022-04-27 14:23:32,349 INFO L272 TraceCheckUtils]: 298: Hoare triple {8621#(<= ~counter~0 32)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8621#(<= ~counter~0 32)} is VALID [2022-04-27 14:23:32,349 INFO L290 TraceCheckUtils]: 299: Hoare triple {8621#(<= ~counter~0 32)} ~cond := #in~cond; {8621#(<= ~counter~0 32)} is VALID [2022-04-27 14:23:32,349 INFO L290 TraceCheckUtils]: 300: Hoare triple {8621#(<= ~counter~0 32)} assume !(0 == ~cond); {8621#(<= ~counter~0 32)} is VALID [2022-04-27 14:23:32,349 INFO L290 TraceCheckUtils]: 301: Hoare triple {8621#(<= ~counter~0 32)} assume true; {8621#(<= ~counter~0 32)} is VALID [2022-04-27 14:23:32,350 INFO L284 TraceCheckUtils]: 302: Hoare quadruple {8621#(<= ~counter~0 32)} {8621#(<= ~counter~0 32)} #63#return; {8621#(<= ~counter~0 32)} is VALID [2022-04-27 14:23:32,350 INFO L290 TraceCheckUtils]: 303: Hoare triple {8621#(<= ~counter~0 32)} assume !!(0 != ~y3~0); {8621#(<= ~counter~0 32)} is VALID [2022-04-27 14:23:32,351 INFO L290 TraceCheckUtils]: 304: Hoare triple {8621#(<= ~counter~0 32)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8621#(<= ~counter~0 32)} is VALID [2022-04-27 14:23:32,351 INFO L290 TraceCheckUtils]: 305: Hoare triple {8621#(<= ~counter~0 32)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8649#(<= ~counter~0 33)} is VALID [2022-04-27 14:23:32,351 INFO L290 TraceCheckUtils]: 306: Hoare triple {8649#(<= ~counter~0 33)} assume !!(#t~post6 < 50);havoc #t~post6; {8649#(<= ~counter~0 33)} is VALID [2022-04-27 14:23:32,352 INFO L272 TraceCheckUtils]: 307: Hoare triple {8649#(<= ~counter~0 33)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8649#(<= ~counter~0 33)} is VALID [2022-04-27 14:23:32,352 INFO L290 TraceCheckUtils]: 308: Hoare triple {8649#(<= ~counter~0 33)} ~cond := #in~cond; {8649#(<= ~counter~0 33)} is VALID [2022-04-27 14:23:32,353 INFO L290 TraceCheckUtils]: 309: Hoare triple {8649#(<= ~counter~0 33)} assume !(0 == ~cond); {8649#(<= ~counter~0 33)} is VALID [2022-04-27 14:23:32,353 INFO L290 TraceCheckUtils]: 310: Hoare triple {8649#(<= ~counter~0 33)} assume true; {8649#(<= ~counter~0 33)} is VALID [2022-04-27 14:23:32,353 INFO L284 TraceCheckUtils]: 311: Hoare quadruple {8649#(<= ~counter~0 33)} {8649#(<= ~counter~0 33)} #63#return; {8649#(<= ~counter~0 33)} is VALID [2022-04-27 14:23:32,354 INFO L290 TraceCheckUtils]: 312: Hoare triple {8649#(<= ~counter~0 33)} assume !!(0 != ~y3~0); {8649#(<= ~counter~0 33)} is VALID [2022-04-27 14:23:32,354 INFO L290 TraceCheckUtils]: 313: Hoare triple {8649#(<= ~counter~0 33)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8649#(<= ~counter~0 33)} is VALID [2022-04-27 14:23:32,357 INFO L290 TraceCheckUtils]: 314: Hoare triple {8649#(<= ~counter~0 33)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8677#(<= ~counter~0 34)} is VALID [2022-04-27 14:23:32,357 INFO L290 TraceCheckUtils]: 315: Hoare triple {8677#(<= ~counter~0 34)} assume !!(#t~post6 < 50);havoc #t~post6; {8677#(<= ~counter~0 34)} is VALID [2022-04-27 14:23:32,358 INFO L272 TraceCheckUtils]: 316: Hoare triple {8677#(<= ~counter~0 34)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8677#(<= ~counter~0 34)} is VALID [2022-04-27 14:23:32,358 INFO L290 TraceCheckUtils]: 317: Hoare triple {8677#(<= ~counter~0 34)} ~cond := #in~cond; {8677#(<= ~counter~0 34)} is VALID [2022-04-27 14:23:32,358 INFO L290 TraceCheckUtils]: 318: Hoare triple {8677#(<= ~counter~0 34)} assume !(0 == ~cond); {8677#(<= ~counter~0 34)} is VALID [2022-04-27 14:23:32,358 INFO L290 TraceCheckUtils]: 319: Hoare triple {8677#(<= ~counter~0 34)} assume true; {8677#(<= ~counter~0 34)} is VALID [2022-04-27 14:23:32,359 INFO L284 TraceCheckUtils]: 320: Hoare quadruple {8677#(<= ~counter~0 34)} {8677#(<= ~counter~0 34)} #63#return; {8677#(<= ~counter~0 34)} is VALID [2022-04-27 14:23:32,359 INFO L290 TraceCheckUtils]: 321: Hoare triple {8677#(<= ~counter~0 34)} assume !!(0 != ~y3~0); {8677#(<= ~counter~0 34)} is VALID [2022-04-27 14:23:32,359 INFO L290 TraceCheckUtils]: 322: Hoare triple {8677#(<= ~counter~0 34)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8677#(<= ~counter~0 34)} is VALID [2022-04-27 14:23:32,360 INFO L290 TraceCheckUtils]: 323: Hoare triple {8677#(<= ~counter~0 34)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8705#(<= ~counter~0 35)} is VALID [2022-04-27 14:23:32,360 INFO L290 TraceCheckUtils]: 324: Hoare triple {8705#(<= ~counter~0 35)} assume !!(#t~post6 < 50);havoc #t~post6; {8705#(<= ~counter~0 35)} is VALID [2022-04-27 14:23:32,360 INFO L272 TraceCheckUtils]: 325: Hoare triple {8705#(<= ~counter~0 35)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8705#(<= ~counter~0 35)} is VALID [2022-04-27 14:23:32,361 INFO L290 TraceCheckUtils]: 326: Hoare triple {8705#(<= ~counter~0 35)} ~cond := #in~cond; {8705#(<= ~counter~0 35)} is VALID [2022-04-27 14:23:32,361 INFO L290 TraceCheckUtils]: 327: Hoare triple {8705#(<= ~counter~0 35)} assume !(0 == ~cond); {8705#(<= ~counter~0 35)} is VALID [2022-04-27 14:23:32,361 INFO L290 TraceCheckUtils]: 328: Hoare triple {8705#(<= ~counter~0 35)} assume true; {8705#(<= ~counter~0 35)} is VALID [2022-04-27 14:23:32,362 INFO L284 TraceCheckUtils]: 329: Hoare quadruple {8705#(<= ~counter~0 35)} {8705#(<= ~counter~0 35)} #63#return; {8705#(<= ~counter~0 35)} is VALID [2022-04-27 14:23:32,362 INFO L290 TraceCheckUtils]: 330: Hoare triple {8705#(<= ~counter~0 35)} assume !!(0 != ~y3~0); {8705#(<= ~counter~0 35)} is VALID [2022-04-27 14:23:32,362 INFO L290 TraceCheckUtils]: 331: Hoare triple {8705#(<= ~counter~0 35)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8705#(<= ~counter~0 35)} is VALID [2022-04-27 14:23:32,362 INFO L290 TraceCheckUtils]: 332: Hoare triple {8705#(<= ~counter~0 35)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8733#(<= ~counter~0 36)} is VALID [2022-04-27 14:23:32,363 INFO L290 TraceCheckUtils]: 333: Hoare triple {8733#(<= ~counter~0 36)} assume !!(#t~post6 < 50);havoc #t~post6; {8733#(<= ~counter~0 36)} is VALID [2022-04-27 14:23:32,363 INFO L272 TraceCheckUtils]: 334: Hoare triple {8733#(<= ~counter~0 36)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8733#(<= ~counter~0 36)} is VALID [2022-04-27 14:23:32,363 INFO L290 TraceCheckUtils]: 335: Hoare triple {8733#(<= ~counter~0 36)} ~cond := #in~cond; {8733#(<= ~counter~0 36)} is VALID [2022-04-27 14:23:32,364 INFO L290 TraceCheckUtils]: 336: Hoare triple {8733#(<= ~counter~0 36)} assume !(0 == ~cond); {8733#(<= ~counter~0 36)} is VALID [2022-04-27 14:23:32,364 INFO L290 TraceCheckUtils]: 337: Hoare triple {8733#(<= ~counter~0 36)} assume true; {8733#(<= ~counter~0 36)} is VALID [2022-04-27 14:23:32,364 INFO L284 TraceCheckUtils]: 338: Hoare quadruple {8733#(<= ~counter~0 36)} {8733#(<= ~counter~0 36)} #63#return; {8733#(<= ~counter~0 36)} is VALID [2022-04-27 14:23:32,365 INFO L290 TraceCheckUtils]: 339: Hoare triple {8733#(<= ~counter~0 36)} assume !!(0 != ~y3~0); {8733#(<= ~counter~0 36)} is VALID [2022-04-27 14:23:32,365 INFO L290 TraceCheckUtils]: 340: Hoare triple {8733#(<= ~counter~0 36)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8733#(<= ~counter~0 36)} is VALID [2022-04-27 14:23:32,365 INFO L290 TraceCheckUtils]: 341: Hoare triple {8733#(<= ~counter~0 36)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8761#(<= ~counter~0 37)} is VALID [2022-04-27 14:23:32,366 INFO L290 TraceCheckUtils]: 342: Hoare triple {8761#(<= ~counter~0 37)} assume !!(#t~post6 < 50);havoc #t~post6; {8761#(<= ~counter~0 37)} is VALID [2022-04-27 14:23:32,366 INFO L272 TraceCheckUtils]: 343: Hoare triple {8761#(<= ~counter~0 37)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8761#(<= ~counter~0 37)} is VALID [2022-04-27 14:23:32,366 INFO L290 TraceCheckUtils]: 344: Hoare triple {8761#(<= ~counter~0 37)} ~cond := #in~cond; {8761#(<= ~counter~0 37)} is VALID [2022-04-27 14:23:32,367 INFO L290 TraceCheckUtils]: 345: Hoare triple {8761#(<= ~counter~0 37)} assume !(0 == ~cond); {8761#(<= ~counter~0 37)} is VALID [2022-04-27 14:23:32,367 INFO L290 TraceCheckUtils]: 346: Hoare triple {8761#(<= ~counter~0 37)} assume true; {8761#(<= ~counter~0 37)} is VALID [2022-04-27 14:23:32,367 INFO L284 TraceCheckUtils]: 347: Hoare quadruple {8761#(<= ~counter~0 37)} {8761#(<= ~counter~0 37)} #63#return; {8761#(<= ~counter~0 37)} is VALID [2022-04-27 14:23:32,368 INFO L290 TraceCheckUtils]: 348: Hoare triple {8761#(<= ~counter~0 37)} assume !!(0 != ~y3~0); {8761#(<= ~counter~0 37)} is VALID [2022-04-27 14:23:32,368 INFO L290 TraceCheckUtils]: 349: Hoare triple {8761#(<= ~counter~0 37)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8761#(<= ~counter~0 37)} is VALID [2022-04-27 14:23:32,368 INFO L290 TraceCheckUtils]: 350: Hoare triple {8761#(<= ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8789#(<= ~counter~0 38)} is VALID [2022-04-27 14:23:32,368 INFO L290 TraceCheckUtils]: 351: Hoare triple {8789#(<= ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {8789#(<= ~counter~0 38)} is VALID [2022-04-27 14:23:32,369 INFO L272 TraceCheckUtils]: 352: Hoare triple {8789#(<= ~counter~0 38)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8789#(<= ~counter~0 38)} is VALID [2022-04-27 14:23:32,369 INFO L290 TraceCheckUtils]: 353: Hoare triple {8789#(<= ~counter~0 38)} ~cond := #in~cond; {8789#(<= ~counter~0 38)} is VALID [2022-04-27 14:23:32,369 INFO L290 TraceCheckUtils]: 354: Hoare triple {8789#(<= ~counter~0 38)} assume !(0 == ~cond); {8789#(<= ~counter~0 38)} is VALID [2022-04-27 14:23:32,370 INFO L290 TraceCheckUtils]: 355: Hoare triple {8789#(<= ~counter~0 38)} assume true; {8789#(<= ~counter~0 38)} is VALID [2022-04-27 14:23:32,370 INFO L284 TraceCheckUtils]: 356: Hoare quadruple {8789#(<= ~counter~0 38)} {8789#(<= ~counter~0 38)} #63#return; {8789#(<= ~counter~0 38)} is VALID [2022-04-27 14:23:32,370 INFO L290 TraceCheckUtils]: 357: Hoare triple {8789#(<= ~counter~0 38)} assume !!(0 != ~y3~0); {8789#(<= ~counter~0 38)} is VALID [2022-04-27 14:23:32,371 INFO L290 TraceCheckUtils]: 358: Hoare triple {8789#(<= ~counter~0 38)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8789#(<= ~counter~0 38)} is VALID [2022-04-27 14:23:32,371 INFO L290 TraceCheckUtils]: 359: Hoare triple {8789#(<= ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8817#(<= ~counter~0 39)} is VALID [2022-04-27 14:23:32,371 INFO L290 TraceCheckUtils]: 360: Hoare triple {8817#(<= ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {8817#(<= ~counter~0 39)} is VALID [2022-04-27 14:23:32,372 INFO L272 TraceCheckUtils]: 361: Hoare triple {8817#(<= ~counter~0 39)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8817#(<= ~counter~0 39)} is VALID [2022-04-27 14:23:32,372 INFO L290 TraceCheckUtils]: 362: Hoare triple {8817#(<= ~counter~0 39)} ~cond := #in~cond; {8817#(<= ~counter~0 39)} is VALID [2022-04-27 14:23:32,372 INFO L290 TraceCheckUtils]: 363: Hoare triple {8817#(<= ~counter~0 39)} assume !(0 == ~cond); {8817#(<= ~counter~0 39)} is VALID [2022-04-27 14:23:32,373 INFO L290 TraceCheckUtils]: 364: Hoare triple {8817#(<= ~counter~0 39)} assume true; {8817#(<= ~counter~0 39)} is VALID [2022-04-27 14:23:32,373 INFO L284 TraceCheckUtils]: 365: Hoare quadruple {8817#(<= ~counter~0 39)} {8817#(<= ~counter~0 39)} #63#return; {8817#(<= ~counter~0 39)} is VALID [2022-04-27 14:23:32,373 INFO L290 TraceCheckUtils]: 366: Hoare triple {8817#(<= ~counter~0 39)} assume !!(0 != ~y3~0); {8817#(<= ~counter~0 39)} is VALID [2022-04-27 14:23:32,374 INFO L290 TraceCheckUtils]: 367: Hoare triple {8817#(<= ~counter~0 39)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8817#(<= ~counter~0 39)} is VALID [2022-04-27 14:23:32,374 INFO L290 TraceCheckUtils]: 368: Hoare triple {8817#(<= ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8845#(<= ~counter~0 40)} is VALID [2022-04-27 14:23:32,374 INFO L290 TraceCheckUtils]: 369: Hoare triple {8845#(<= ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {8845#(<= ~counter~0 40)} is VALID [2022-04-27 14:23:32,375 INFO L272 TraceCheckUtils]: 370: Hoare triple {8845#(<= ~counter~0 40)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8845#(<= ~counter~0 40)} is VALID [2022-04-27 14:23:32,375 INFO L290 TraceCheckUtils]: 371: Hoare triple {8845#(<= ~counter~0 40)} ~cond := #in~cond; {8845#(<= ~counter~0 40)} is VALID [2022-04-27 14:23:32,375 INFO L290 TraceCheckUtils]: 372: Hoare triple {8845#(<= ~counter~0 40)} assume !(0 == ~cond); {8845#(<= ~counter~0 40)} is VALID [2022-04-27 14:23:32,376 INFO L290 TraceCheckUtils]: 373: Hoare triple {8845#(<= ~counter~0 40)} assume true; {8845#(<= ~counter~0 40)} is VALID [2022-04-27 14:23:32,376 INFO L284 TraceCheckUtils]: 374: Hoare quadruple {8845#(<= ~counter~0 40)} {8845#(<= ~counter~0 40)} #63#return; {8845#(<= ~counter~0 40)} is VALID [2022-04-27 14:23:32,376 INFO L290 TraceCheckUtils]: 375: Hoare triple {8845#(<= ~counter~0 40)} assume !!(0 != ~y3~0); {8845#(<= ~counter~0 40)} is VALID [2022-04-27 14:23:32,377 INFO L290 TraceCheckUtils]: 376: Hoare triple {8845#(<= ~counter~0 40)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8845#(<= ~counter~0 40)} is VALID [2022-04-27 14:23:32,377 INFO L290 TraceCheckUtils]: 377: Hoare triple {8845#(<= ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8873#(<= ~counter~0 41)} is VALID [2022-04-27 14:23:32,377 INFO L290 TraceCheckUtils]: 378: Hoare triple {8873#(<= ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {8873#(<= ~counter~0 41)} is VALID [2022-04-27 14:23:32,378 INFO L272 TraceCheckUtils]: 379: Hoare triple {8873#(<= ~counter~0 41)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8873#(<= ~counter~0 41)} is VALID [2022-04-27 14:23:32,378 INFO L290 TraceCheckUtils]: 380: Hoare triple {8873#(<= ~counter~0 41)} ~cond := #in~cond; {8873#(<= ~counter~0 41)} is VALID [2022-04-27 14:23:32,378 INFO L290 TraceCheckUtils]: 381: Hoare triple {8873#(<= ~counter~0 41)} assume !(0 == ~cond); {8873#(<= ~counter~0 41)} is VALID [2022-04-27 14:23:32,378 INFO L290 TraceCheckUtils]: 382: Hoare triple {8873#(<= ~counter~0 41)} assume true; {8873#(<= ~counter~0 41)} is VALID [2022-04-27 14:23:32,379 INFO L284 TraceCheckUtils]: 383: Hoare quadruple {8873#(<= ~counter~0 41)} {8873#(<= ~counter~0 41)} #63#return; {8873#(<= ~counter~0 41)} is VALID [2022-04-27 14:23:32,379 INFO L290 TraceCheckUtils]: 384: Hoare triple {8873#(<= ~counter~0 41)} assume !!(0 != ~y3~0); {8873#(<= ~counter~0 41)} is VALID [2022-04-27 14:23:32,379 INFO L290 TraceCheckUtils]: 385: Hoare triple {8873#(<= ~counter~0 41)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8873#(<= ~counter~0 41)} is VALID [2022-04-27 14:23:32,380 INFO L290 TraceCheckUtils]: 386: Hoare triple {8873#(<= ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8901#(<= ~counter~0 42)} is VALID [2022-04-27 14:23:32,380 INFO L290 TraceCheckUtils]: 387: Hoare triple {8901#(<= ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {8901#(<= ~counter~0 42)} is VALID [2022-04-27 14:23:32,380 INFO L272 TraceCheckUtils]: 388: Hoare triple {8901#(<= ~counter~0 42)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8901#(<= ~counter~0 42)} is VALID [2022-04-27 14:23:32,381 INFO L290 TraceCheckUtils]: 389: Hoare triple {8901#(<= ~counter~0 42)} ~cond := #in~cond; {8901#(<= ~counter~0 42)} is VALID [2022-04-27 14:23:32,381 INFO L290 TraceCheckUtils]: 390: Hoare triple {8901#(<= ~counter~0 42)} assume !(0 == ~cond); {8901#(<= ~counter~0 42)} is VALID [2022-04-27 14:23:32,381 INFO L290 TraceCheckUtils]: 391: Hoare triple {8901#(<= ~counter~0 42)} assume true; {8901#(<= ~counter~0 42)} is VALID [2022-04-27 14:23:32,381 INFO L284 TraceCheckUtils]: 392: Hoare quadruple {8901#(<= ~counter~0 42)} {8901#(<= ~counter~0 42)} #63#return; {8901#(<= ~counter~0 42)} is VALID [2022-04-27 14:23:32,382 INFO L290 TraceCheckUtils]: 393: Hoare triple {8901#(<= ~counter~0 42)} assume !!(0 != ~y3~0); {8901#(<= ~counter~0 42)} is VALID [2022-04-27 14:23:32,382 INFO L290 TraceCheckUtils]: 394: Hoare triple {8901#(<= ~counter~0 42)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8901#(<= ~counter~0 42)} is VALID [2022-04-27 14:23:32,382 INFO L290 TraceCheckUtils]: 395: Hoare triple {8901#(<= ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8929#(<= ~counter~0 43)} is VALID [2022-04-27 14:23:32,382 INFO L290 TraceCheckUtils]: 396: Hoare triple {8929#(<= ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {8929#(<= ~counter~0 43)} is VALID [2022-04-27 14:23:32,383 INFO L272 TraceCheckUtils]: 397: Hoare triple {8929#(<= ~counter~0 43)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8929#(<= ~counter~0 43)} is VALID [2022-04-27 14:23:32,383 INFO L290 TraceCheckUtils]: 398: Hoare triple {8929#(<= ~counter~0 43)} ~cond := #in~cond; {8929#(<= ~counter~0 43)} is VALID [2022-04-27 14:23:32,383 INFO L290 TraceCheckUtils]: 399: Hoare triple {8929#(<= ~counter~0 43)} assume !(0 == ~cond); {8929#(<= ~counter~0 43)} is VALID [2022-04-27 14:23:32,384 INFO L290 TraceCheckUtils]: 400: Hoare triple {8929#(<= ~counter~0 43)} assume true; {8929#(<= ~counter~0 43)} is VALID [2022-04-27 14:23:32,384 INFO L284 TraceCheckUtils]: 401: Hoare quadruple {8929#(<= ~counter~0 43)} {8929#(<= ~counter~0 43)} #63#return; {8929#(<= ~counter~0 43)} is VALID [2022-04-27 14:23:32,384 INFO L290 TraceCheckUtils]: 402: Hoare triple {8929#(<= ~counter~0 43)} assume !!(0 != ~y3~0); {8929#(<= ~counter~0 43)} is VALID [2022-04-27 14:23:32,384 INFO L290 TraceCheckUtils]: 403: Hoare triple {8929#(<= ~counter~0 43)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8929#(<= ~counter~0 43)} is VALID [2022-04-27 14:23:32,385 INFO L290 TraceCheckUtils]: 404: Hoare triple {8929#(<= ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8957#(<= ~counter~0 44)} is VALID [2022-04-27 14:23:32,385 INFO L290 TraceCheckUtils]: 405: Hoare triple {8957#(<= ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {8957#(<= ~counter~0 44)} is VALID [2022-04-27 14:23:32,385 INFO L272 TraceCheckUtils]: 406: Hoare triple {8957#(<= ~counter~0 44)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8957#(<= ~counter~0 44)} is VALID [2022-04-27 14:23:32,386 INFO L290 TraceCheckUtils]: 407: Hoare triple {8957#(<= ~counter~0 44)} ~cond := #in~cond; {8957#(<= ~counter~0 44)} is VALID [2022-04-27 14:23:32,386 INFO L290 TraceCheckUtils]: 408: Hoare triple {8957#(<= ~counter~0 44)} assume !(0 == ~cond); {8957#(<= ~counter~0 44)} is VALID [2022-04-27 14:23:32,386 INFO L290 TraceCheckUtils]: 409: Hoare triple {8957#(<= ~counter~0 44)} assume true; {8957#(<= ~counter~0 44)} is VALID [2022-04-27 14:23:32,386 INFO L284 TraceCheckUtils]: 410: Hoare quadruple {8957#(<= ~counter~0 44)} {8957#(<= ~counter~0 44)} #63#return; {8957#(<= ~counter~0 44)} is VALID [2022-04-27 14:23:32,387 INFO L290 TraceCheckUtils]: 411: Hoare triple {8957#(<= ~counter~0 44)} assume !!(0 != ~y3~0); {8957#(<= ~counter~0 44)} is VALID [2022-04-27 14:23:32,387 INFO L290 TraceCheckUtils]: 412: Hoare triple {8957#(<= ~counter~0 44)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8957#(<= ~counter~0 44)} is VALID [2022-04-27 14:23:32,387 INFO L290 TraceCheckUtils]: 413: Hoare triple {8957#(<= ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8985#(<= ~counter~0 45)} is VALID [2022-04-27 14:23:32,388 INFO L290 TraceCheckUtils]: 414: Hoare triple {8985#(<= ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {8985#(<= ~counter~0 45)} is VALID [2022-04-27 14:23:32,388 INFO L272 TraceCheckUtils]: 415: Hoare triple {8985#(<= ~counter~0 45)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8985#(<= ~counter~0 45)} is VALID [2022-04-27 14:23:32,388 INFO L290 TraceCheckUtils]: 416: Hoare triple {8985#(<= ~counter~0 45)} ~cond := #in~cond; {8985#(<= ~counter~0 45)} is VALID [2022-04-27 14:23:32,388 INFO L290 TraceCheckUtils]: 417: Hoare triple {8985#(<= ~counter~0 45)} assume !(0 == ~cond); {8985#(<= ~counter~0 45)} is VALID [2022-04-27 14:23:32,389 INFO L290 TraceCheckUtils]: 418: Hoare triple {8985#(<= ~counter~0 45)} assume true; {8985#(<= ~counter~0 45)} is VALID [2022-04-27 14:23:32,389 INFO L284 TraceCheckUtils]: 419: Hoare quadruple {8985#(<= ~counter~0 45)} {8985#(<= ~counter~0 45)} #63#return; {8985#(<= ~counter~0 45)} is VALID [2022-04-27 14:23:32,389 INFO L290 TraceCheckUtils]: 420: Hoare triple {8985#(<= ~counter~0 45)} assume !!(0 != ~y3~0); {8985#(<= ~counter~0 45)} is VALID [2022-04-27 14:23:32,389 INFO L290 TraceCheckUtils]: 421: Hoare triple {8985#(<= ~counter~0 45)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8985#(<= ~counter~0 45)} is VALID [2022-04-27 14:23:32,390 INFO L290 TraceCheckUtils]: 422: Hoare triple {8985#(<= ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9013#(<= ~counter~0 46)} is VALID [2022-04-27 14:23:32,390 INFO L290 TraceCheckUtils]: 423: Hoare triple {9013#(<= ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {9013#(<= ~counter~0 46)} is VALID [2022-04-27 14:23:32,390 INFO L272 TraceCheckUtils]: 424: Hoare triple {9013#(<= ~counter~0 46)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {9013#(<= ~counter~0 46)} is VALID [2022-04-27 14:23:32,391 INFO L290 TraceCheckUtils]: 425: Hoare triple {9013#(<= ~counter~0 46)} ~cond := #in~cond; {9013#(<= ~counter~0 46)} is VALID [2022-04-27 14:23:32,391 INFO L290 TraceCheckUtils]: 426: Hoare triple {9013#(<= ~counter~0 46)} assume !(0 == ~cond); {9013#(<= ~counter~0 46)} is VALID [2022-04-27 14:23:32,391 INFO L290 TraceCheckUtils]: 427: Hoare triple {9013#(<= ~counter~0 46)} assume true; {9013#(<= ~counter~0 46)} is VALID [2022-04-27 14:23:32,392 INFO L284 TraceCheckUtils]: 428: Hoare quadruple {9013#(<= ~counter~0 46)} {9013#(<= ~counter~0 46)} #63#return; {9013#(<= ~counter~0 46)} is VALID [2022-04-27 14:23:32,392 INFO L290 TraceCheckUtils]: 429: Hoare triple {9013#(<= ~counter~0 46)} assume !!(0 != ~y3~0); {9013#(<= ~counter~0 46)} is VALID [2022-04-27 14:23:32,392 INFO L290 TraceCheckUtils]: 430: Hoare triple {9013#(<= ~counter~0 46)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {9013#(<= ~counter~0 46)} is VALID [2022-04-27 14:23:32,392 INFO L290 TraceCheckUtils]: 431: Hoare triple {9013#(<= ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9041#(<= |main_#t~post6| 46)} is VALID [2022-04-27 14:23:32,393 INFO L290 TraceCheckUtils]: 432: Hoare triple {9041#(<= |main_#t~post6| 46)} assume !(#t~post6 < 50);havoc #t~post6; {7697#false} is VALID [2022-04-27 14:23:32,393 INFO L272 TraceCheckUtils]: 433: Hoare triple {7697#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {7697#false} is VALID [2022-04-27 14:23:32,393 INFO L290 TraceCheckUtils]: 434: Hoare triple {7697#false} ~cond := #in~cond; {7697#false} is VALID [2022-04-27 14:23:32,393 INFO L290 TraceCheckUtils]: 435: Hoare triple {7697#false} assume 0 == ~cond; {7697#false} is VALID [2022-04-27 14:23:32,393 INFO L290 TraceCheckUtils]: 436: Hoare triple {7697#false} assume !false; {7697#false} is VALID [2022-04-27 14:23:32,396 INFO L134 CoverageAnalysis]: Checked inductivity of 9503 backedges. 92 proven. 9407 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:23:32,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:23:34,164 INFO L290 TraceCheckUtils]: 436: Hoare triple {7697#false} assume !false; {7697#false} is VALID [2022-04-27 14:23:34,165 INFO L290 TraceCheckUtils]: 435: Hoare triple {7697#false} assume 0 == ~cond; {7697#false} is VALID [2022-04-27 14:23:34,165 INFO L290 TraceCheckUtils]: 434: Hoare triple {7697#false} ~cond := #in~cond; {7697#false} is VALID [2022-04-27 14:23:34,165 INFO L272 TraceCheckUtils]: 433: Hoare triple {7697#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {7697#false} is VALID [2022-04-27 14:23:34,165 INFO L290 TraceCheckUtils]: 432: Hoare triple {9069#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {7697#false} is VALID [2022-04-27 14:23:34,169 INFO L290 TraceCheckUtils]: 431: Hoare triple {9073#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9069#(< |main_#t~post6| 50)} is VALID [2022-04-27 14:23:34,170 INFO L290 TraceCheckUtils]: 430: Hoare triple {9073#(< ~counter~0 50)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {9073#(< ~counter~0 50)} is VALID [2022-04-27 14:23:34,170 INFO L290 TraceCheckUtils]: 429: Hoare triple {9073#(< ~counter~0 50)} assume !!(0 != ~y3~0); {9073#(< ~counter~0 50)} is VALID [2022-04-27 14:23:34,170 INFO L284 TraceCheckUtils]: 428: Hoare quadruple {7696#true} {9073#(< ~counter~0 50)} #63#return; {9073#(< ~counter~0 50)} is VALID [2022-04-27 14:23:34,170 INFO L290 TraceCheckUtils]: 427: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,170 INFO L290 TraceCheckUtils]: 426: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,171 INFO L290 TraceCheckUtils]: 425: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,171 INFO L272 TraceCheckUtils]: 424: Hoare triple {9073#(< ~counter~0 50)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,171 INFO L290 TraceCheckUtils]: 423: Hoare triple {9073#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {9073#(< ~counter~0 50)} is VALID [2022-04-27 14:23:34,171 INFO L290 TraceCheckUtils]: 422: Hoare triple {9101#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9073#(< ~counter~0 50)} is VALID [2022-04-27 14:23:34,172 INFO L290 TraceCheckUtils]: 421: Hoare triple {9101#(< ~counter~0 49)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {9101#(< ~counter~0 49)} is VALID [2022-04-27 14:23:34,172 INFO L290 TraceCheckUtils]: 420: Hoare triple {9101#(< ~counter~0 49)} assume !!(0 != ~y3~0); {9101#(< ~counter~0 49)} is VALID [2022-04-27 14:23:34,172 INFO L284 TraceCheckUtils]: 419: Hoare quadruple {7696#true} {9101#(< ~counter~0 49)} #63#return; {9101#(< ~counter~0 49)} is VALID [2022-04-27 14:23:34,172 INFO L290 TraceCheckUtils]: 418: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,172 INFO L290 TraceCheckUtils]: 417: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,173 INFO L290 TraceCheckUtils]: 416: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,173 INFO L272 TraceCheckUtils]: 415: Hoare triple {9101#(< ~counter~0 49)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,173 INFO L290 TraceCheckUtils]: 414: Hoare triple {9101#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {9101#(< ~counter~0 49)} is VALID [2022-04-27 14:23:34,173 INFO L290 TraceCheckUtils]: 413: Hoare triple {9129#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9101#(< ~counter~0 49)} is VALID [2022-04-27 14:23:34,173 INFO L290 TraceCheckUtils]: 412: Hoare triple {9129#(< ~counter~0 48)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {9129#(< ~counter~0 48)} is VALID [2022-04-27 14:23:34,174 INFO L290 TraceCheckUtils]: 411: Hoare triple {9129#(< ~counter~0 48)} assume !!(0 != ~y3~0); {9129#(< ~counter~0 48)} is VALID [2022-04-27 14:23:34,174 INFO L284 TraceCheckUtils]: 410: Hoare quadruple {7696#true} {9129#(< ~counter~0 48)} #63#return; {9129#(< ~counter~0 48)} is VALID [2022-04-27 14:23:34,174 INFO L290 TraceCheckUtils]: 409: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,174 INFO L290 TraceCheckUtils]: 408: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,174 INFO L290 TraceCheckUtils]: 407: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,174 INFO L272 TraceCheckUtils]: 406: Hoare triple {9129#(< ~counter~0 48)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,175 INFO L290 TraceCheckUtils]: 405: Hoare triple {9129#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {9129#(< ~counter~0 48)} is VALID [2022-04-27 14:23:34,175 INFO L290 TraceCheckUtils]: 404: Hoare triple {9013#(<= ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9129#(< ~counter~0 48)} is VALID [2022-04-27 14:23:34,176 INFO L290 TraceCheckUtils]: 403: Hoare triple {9013#(<= ~counter~0 46)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {9013#(<= ~counter~0 46)} is VALID [2022-04-27 14:23:34,176 INFO L290 TraceCheckUtils]: 402: Hoare triple {9013#(<= ~counter~0 46)} assume !!(0 != ~y3~0); {9013#(<= ~counter~0 46)} is VALID [2022-04-27 14:23:34,179 INFO L284 TraceCheckUtils]: 401: Hoare quadruple {7696#true} {9013#(<= ~counter~0 46)} #63#return; {9013#(<= ~counter~0 46)} is VALID [2022-04-27 14:23:34,179 INFO L290 TraceCheckUtils]: 400: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,179 INFO L290 TraceCheckUtils]: 399: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,179 INFO L290 TraceCheckUtils]: 398: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,179 INFO L272 TraceCheckUtils]: 397: Hoare triple {9013#(<= ~counter~0 46)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,179 INFO L290 TraceCheckUtils]: 396: Hoare triple {9013#(<= ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {9013#(<= ~counter~0 46)} is VALID [2022-04-27 14:23:34,180 INFO L290 TraceCheckUtils]: 395: Hoare triple {8985#(<= ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9013#(<= ~counter~0 46)} is VALID [2022-04-27 14:23:34,180 INFO L290 TraceCheckUtils]: 394: Hoare triple {8985#(<= ~counter~0 45)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8985#(<= ~counter~0 45)} is VALID [2022-04-27 14:23:34,180 INFO L290 TraceCheckUtils]: 393: Hoare triple {8985#(<= ~counter~0 45)} assume !!(0 != ~y3~0); {8985#(<= ~counter~0 45)} is VALID [2022-04-27 14:23:34,181 INFO L284 TraceCheckUtils]: 392: Hoare quadruple {7696#true} {8985#(<= ~counter~0 45)} #63#return; {8985#(<= ~counter~0 45)} is VALID [2022-04-27 14:23:34,181 INFO L290 TraceCheckUtils]: 391: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,181 INFO L290 TraceCheckUtils]: 390: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,181 INFO L290 TraceCheckUtils]: 389: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,181 INFO L272 TraceCheckUtils]: 388: Hoare triple {8985#(<= ~counter~0 45)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,181 INFO L290 TraceCheckUtils]: 387: Hoare triple {8985#(<= ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {8985#(<= ~counter~0 45)} is VALID [2022-04-27 14:23:34,182 INFO L290 TraceCheckUtils]: 386: Hoare triple {8957#(<= ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8985#(<= ~counter~0 45)} is VALID [2022-04-27 14:23:34,182 INFO L290 TraceCheckUtils]: 385: Hoare triple {8957#(<= ~counter~0 44)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8957#(<= ~counter~0 44)} is VALID [2022-04-27 14:23:34,182 INFO L290 TraceCheckUtils]: 384: Hoare triple {8957#(<= ~counter~0 44)} assume !!(0 != ~y3~0); {8957#(<= ~counter~0 44)} is VALID [2022-04-27 14:23:34,183 INFO L284 TraceCheckUtils]: 383: Hoare quadruple {7696#true} {8957#(<= ~counter~0 44)} #63#return; {8957#(<= ~counter~0 44)} is VALID [2022-04-27 14:23:34,183 INFO L290 TraceCheckUtils]: 382: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,183 INFO L290 TraceCheckUtils]: 381: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,183 INFO L290 TraceCheckUtils]: 380: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,183 INFO L272 TraceCheckUtils]: 379: Hoare triple {8957#(<= ~counter~0 44)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,185 INFO L290 TraceCheckUtils]: 378: Hoare triple {8957#(<= ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {8957#(<= ~counter~0 44)} is VALID [2022-04-27 14:23:34,186 INFO L290 TraceCheckUtils]: 377: Hoare triple {8929#(<= ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8957#(<= ~counter~0 44)} is VALID [2022-04-27 14:23:34,186 INFO L290 TraceCheckUtils]: 376: Hoare triple {8929#(<= ~counter~0 43)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8929#(<= ~counter~0 43)} is VALID [2022-04-27 14:23:34,186 INFO L290 TraceCheckUtils]: 375: Hoare triple {8929#(<= ~counter~0 43)} assume !!(0 != ~y3~0); {8929#(<= ~counter~0 43)} is VALID [2022-04-27 14:23:34,187 INFO L284 TraceCheckUtils]: 374: Hoare quadruple {7696#true} {8929#(<= ~counter~0 43)} #63#return; {8929#(<= ~counter~0 43)} is VALID [2022-04-27 14:23:34,187 INFO L290 TraceCheckUtils]: 373: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,187 INFO L290 TraceCheckUtils]: 372: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,187 INFO L290 TraceCheckUtils]: 371: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,187 INFO L272 TraceCheckUtils]: 370: Hoare triple {8929#(<= ~counter~0 43)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,187 INFO L290 TraceCheckUtils]: 369: Hoare triple {8929#(<= ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {8929#(<= ~counter~0 43)} is VALID [2022-04-27 14:23:34,187 INFO L290 TraceCheckUtils]: 368: Hoare triple {8901#(<= ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8929#(<= ~counter~0 43)} is VALID [2022-04-27 14:23:34,188 INFO L290 TraceCheckUtils]: 367: Hoare triple {8901#(<= ~counter~0 42)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8901#(<= ~counter~0 42)} is VALID [2022-04-27 14:23:34,188 INFO L290 TraceCheckUtils]: 366: Hoare triple {8901#(<= ~counter~0 42)} assume !!(0 != ~y3~0); {8901#(<= ~counter~0 42)} is VALID [2022-04-27 14:23:34,188 INFO L284 TraceCheckUtils]: 365: Hoare quadruple {7696#true} {8901#(<= ~counter~0 42)} #63#return; {8901#(<= ~counter~0 42)} is VALID [2022-04-27 14:23:34,189 INFO L290 TraceCheckUtils]: 364: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,189 INFO L290 TraceCheckUtils]: 363: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,189 INFO L290 TraceCheckUtils]: 362: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,189 INFO L272 TraceCheckUtils]: 361: Hoare triple {8901#(<= ~counter~0 42)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,189 INFO L290 TraceCheckUtils]: 360: Hoare triple {8901#(<= ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {8901#(<= ~counter~0 42)} is VALID [2022-04-27 14:23:34,190 INFO L290 TraceCheckUtils]: 359: Hoare triple {8873#(<= ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8901#(<= ~counter~0 42)} is VALID [2022-04-27 14:23:34,190 INFO L290 TraceCheckUtils]: 358: Hoare triple {8873#(<= ~counter~0 41)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8873#(<= ~counter~0 41)} is VALID [2022-04-27 14:23:34,190 INFO L290 TraceCheckUtils]: 357: Hoare triple {8873#(<= ~counter~0 41)} assume !!(0 != ~y3~0); {8873#(<= ~counter~0 41)} is VALID [2022-04-27 14:23:34,191 INFO L284 TraceCheckUtils]: 356: Hoare quadruple {7696#true} {8873#(<= ~counter~0 41)} #63#return; {8873#(<= ~counter~0 41)} is VALID [2022-04-27 14:23:34,191 INFO L290 TraceCheckUtils]: 355: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,191 INFO L290 TraceCheckUtils]: 354: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,191 INFO L290 TraceCheckUtils]: 353: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,191 INFO L272 TraceCheckUtils]: 352: Hoare triple {8873#(<= ~counter~0 41)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,191 INFO L290 TraceCheckUtils]: 351: Hoare triple {8873#(<= ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {8873#(<= ~counter~0 41)} is VALID [2022-04-27 14:23:34,192 INFO L290 TraceCheckUtils]: 350: Hoare triple {8845#(<= ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8873#(<= ~counter~0 41)} is VALID [2022-04-27 14:23:34,195 INFO L290 TraceCheckUtils]: 349: Hoare triple {8845#(<= ~counter~0 40)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8845#(<= ~counter~0 40)} is VALID [2022-04-27 14:23:34,195 INFO L290 TraceCheckUtils]: 348: Hoare triple {8845#(<= ~counter~0 40)} assume !!(0 != ~y3~0); {8845#(<= ~counter~0 40)} is VALID [2022-04-27 14:23:34,196 INFO L284 TraceCheckUtils]: 347: Hoare quadruple {7696#true} {8845#(<= ~counter~0 40)} #63#return; {8845#(<= ~counter~0 40)} is VALID [2022-04-27 14:23:34,196 INFO L290 TraceCheckUtils]: 346: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,196 INFO L290 TraceCheckUtils]: 345: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,196 INFO L290 TraceCheckUtils]: 344: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,196 INFO L272 TraceCheckUtils]: 343: Hoare triple {8845#(<= ~counter~0 40)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,196 INFO L290 TraceCheckUtils]: 342: Hoare triple {8845#(<= ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {8845#(<= ~counter~0 40)} is VALID [2022-04-27 14:23:34,197 INFO L290 TraceCheckUtils]: 341: Hoare triple {8817#(<= ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8845#(<= ~counter~0 40)} is VALID [2022-04-27 14:23:34,197 INFO L290 TraceCheckUtils]: 340: Hoare triple {8817#(<= ~counter~0 39)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8817#(<= ~counter~0 39)} is VALID [2022-04-27 14:23:34,197 INFO L290 TraceCheckUtils]: 339: Hoare triple {8817#(<= ~counter~0 39)} assume !!(0 != ~y3~0); {8817#(<= ~counter~0 39)} is VALID [2022-04-27 14:23:34,198 INFO L284 TraceCheckUtils]: 338: Hoare quadruple {7696#true} {8817#(<= ~counter~0 39)} #63#return; {8817#(<= ~counter~0 39)} is VALID [2022-04-27 14:23:34,198 INFO L290 TraceCheckUtils]: 337: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,198 INFO L290 TraceCheckUtils]: 336: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,198 INFO L290 TraceCheckUtils]: 335: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,198 INFO L272 TraceCheckUtils]: 334: Hoare triple {8817#(<= ~counter~0 39)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,198 INFO L290 TraceCheckUtils]: 333: Hoare triple {8817#(<= ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {8817#(<= ~counter~0 39)} is VALID [2022-04-27 14:23:34,199 INFO L290 TraceCheckUtils]: 332: Hoare triple {8789#(<= ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8817#(<= ~counter~0 39)} is VALID [2022-04-27 14:23:34,199 INFO L290 TraceCheckUtils]: 331: Hoare triple {8789#(<= ~counter~0 38)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8789#(<= ~counter~0 38)} is VALID [2022-04-27 14:23:34,199 INFO L290 TraceCheckUtils]: 330: Hoare triple {8789#(<= ~counter~0 38)} assume !!(0 != ~y3~0); {8789#(<= ~counter~0 38)} is VALID [2022-04-27 14:23:34,200 INFO L284 TraceCheckUtils]: 329: Hoare quadruple {7696#true} {8789#(<= ~counter~0 38)} #63#return; {8789#(<= ~counter~0 38)} is VALID [2022-04-27 14:23:34,200 INFO L290 TraceCheckUtils]: 328: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,200 INFO L290 TraceCheckUtils]: 327: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,200 INFO L290 TraceCheckUtils]: 326: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,200 INFO L272 TraceCheckUtils]: 325: Hoare triple {8789#(<= ~counter~0 38)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,201 INFO L290 TraceCheckUtils]: 324: Hoare triple {8789#(<= ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {8789#(<= ~counter~0 38)} is VALID [2022-04-27 14:23:34,203 INFO L290 TraceCheckUtils]: 323: Hoare triple {8761#(<= ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8789#(<= ~counter~0 38)} is VALID [2022-04-27 14:23:34,203 INFO L290 TraceCheckUtils]: 322: Hoare triple {8761#(<= ~counter~0 37)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8761#(<= ~counter~0 37)} is VALID [2022-04-27 14:23:34,204 INFO L290 TraceCheckUtils]: 321: Hoare triple {8761#(<= ~counter~0 37)} assume !!(0 != ~y3~0); {8761#(<= ~counter~0 37)} is VALID [2022-04-27 14:23:34,204 INFO L284 TraceCheckUtils]: 320: Hoare quadruple {7696#true} {8761#(<= ~counter~0 37)} #63#return; {8761#(<= ~counter~0 37)} is VALID [2022-04-27 14:23:34,204 INFO L290 TraceCheckUtils]: 319: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,204 INFO L290 TraceCheckUtils]: 318: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,204 INFO L290 TraceCheckUtils]: 317: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,204 INFO L272 TraceCheckUtils]: 316: Hoare triple {8761#(<= ~counter~0 37)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,205 INFO L290 TraceCheckUtils]: 315: Hoare triple {8761#(<= ~counter~0 37)} assume !!(#t~post6 < 50);havoc #t~post6; {8761#(<= ~counter~0 37)} is VALID [2022-04-27 14:23:34,205 INFO L290 TraceCheckUtils]: 314: Hoare triple {8733#(<= ~counter~0 36)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8761#(<= ~counter~0 37)} is VALID [2022-04-27 14:23:34,208 INFO L290 TraceCheckUtils]: 313: Hoare triple {8733#(<= ~counter~0 36)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8733#(<= ~counter~0 36)} is VALID [2022-04-27 14:23:34,209 INFO L290 TraceCheckUtils]: 312: Hoare triple {8733#(<= ~counter~0 36)} assume !!(0 != ~y3~0); {8733#(<= ~counter~0 36)} is VALID [2022-04-27 14:23:34,209 INFO L284 TraceCheckUtils]: 311: Hoare quadruple {7696#true} {8733#(<= ~counter~0 36)} #63#return; {8733#(<= ~counter~0 36)} is VALID [2022-04-27 14:23:34,209 INFO L290 TraceCheckUtils]: 310: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,209 INFO L290 TraceCheckUtils]: 309: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,209 INFO L290 TraceCheckUtils]: 308: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,209 INFO L272 TraceCheckUtils]: 307: Hoare triple {8733#(<= ~counter~0 36)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,210 INFO L290 TraceCheckUtils]: 306: Hoare triple {8733#(<= ~counter~0 36)} assume !!(#t~post6 < 50);havoc #t~post6; {8733#(<= ~counter~0 36)} is VALID [2022-04-27 14:23:34,210 INFO L290 TraceCheckUtils]: 305: Hoare triple {8705#(<= ~counter~0 35)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8733#(<= ~counter~0 36)} is VALID [2022-04-27 14:23:34,210 INFO L290 TraceCheckUtils]: 304: Hoare triple {8705#(<= ~counter~0 35)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8705#(<= ~counter~0 35)} is VALID [2022-04-27 14:23:34,211 INFO L290 TraceCheckUtils]: 303: Hoare triple {8705#(<= ~counter~0 35)} assume !!(0 != ~y3~0); {8705#(<= ~counter~0 35)} is VALID [2022-04-27 14:23:34,211 INFO L284 TraceCheckUtils]: 302: Hoare quadruple {7696#true} {8705#(<= ~counter~0 35)} #63#return; {8705#(<= ~counter~0 35)} is VALID [2022-04-27 14:23:34,211 INFO L290 TraceCheckUtils]: 301: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,211 INFO L290 TraceCheckUtils]: 300: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,211 INFO L290 TraceCheckUtils]: 299: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,211 INFO L272 TraceCheckUtils]: 298: Hoare triple {8705#(<= ~counter~0 35)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,211 INFO L290 TraceCheckUtils]: 297: Hoare triple {8705#(<= ~counter~0 35)} assume !!(#t~post6 < 50);havoc #t~post6; {8705#(<= ~counter~0 35)} is VALID [2022-04-27 14:23:34,212 INFO L290 TraceCheckUtils]: 296: Hoare triple {8677#(<= ~counter~0 34)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8705#(<= ~counter~0 35)} is VALID [2022-04-27 14:23:34,213 INFO L290 TraceCheckUtils]: 295: Hoare triple {8677#(<= ~counter~0 34)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8677#(<= ~counter~0 34)} is VALID [2022-04-27 14:23:34,213 INFO L290 TraceCheckUtils]: 294: Hoare triple {8677#(<= ~counter~0 34)} assume !!(0 != ~y3~0); {8677#(<= ~counter~0 34)} is VALID [2022-04-27 14:23:34,213 INFO L284 TraceCheckUtils]: 293: Hoare quadruple {7696#true} {8677#(<= ~counter~0 34)} #63#return; {8677#(<= ~counter~0 34)} is VALID [2022-04-27 14:23:34,213 INFO L290 TraceCheckUtils]: 292: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,213 INFO L290 TraceCheckUtils]: 291: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,213 INFO L290 TraceCheckUtils]: 290: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,214 INFO L272 TraceCheckUtils]: 289: Hoare triple {8677#(<= ~counter~0 34)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,214 INFO L290 TraceCheckUtils]: 288: Hoare triple {8677#(<= ~counter~0 34)} assume !!(#t~post6 < 50);havoc #t~post6; {8677#(<= ~counter~0 34)} is VALID [2022-04-27 14:23:34,214 INFO L290 TraceCheckUtils]: 287: Hoare triple {8649#(<= ~counter~0 33)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8677#(<= ~counter~0 34)} is VALID [2022-04-27 14:23:34,214 INFO L290 TraceCheckUtils]: 286: Hoare triple {8649#(<= ~counter~0 33)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8649#(<= ~counter~0 33)} is VALID [2022-04-27 14:23:34,215 INFO L290 TraceCheckUtils]: 285: Hoare triple {8649#(<= ~counter~0 33)} assume !!(0 != ~y3~0); {8649#(<= ~counter~0 33)} is VALID [2022-04-27 14:23:34,215 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {7696#true} {8649#(<= ~counter~0 33)} #63#return; {8649#(<= ~counter~0 33)} is VALID [2022-04-27 14:23:34,215 INFO L290 TraceCheckUtils]: 283: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,215 INFO L290 TraceCheckUtils]: 282: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,215 INFO L290 TraceCheckUtils]: 281: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,227 INFO L272 TraceCheckUtils]: 280: Hoare triple {8649#(<= ~counter~0 33)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,227 INFO L290 TraceCheckUtils]: 279: Hoare triple {8649#(<= ~counter~0 33)} assume !!(#t~post6 < 50);havoc #t~post6; {8649#(<= ~counter~0 33)} is VALID [2022-04-27 14:23:34,228 INFO L290 TraceCheckUtils]: 278: Hoare triple {8621#(<= ~counter~0 32)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8649#(<= ~counter~0 33)} is VALID [2022-04-27 14:23:34,228 INFO L290 TraceCheckUtils]: 277: Hoare triple {8621#(<= ~counter~0 32)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8621#(<= ~counter~0 32)} is VALID [2022-04-27 14:23:34,229 INFO L290 TraceCheckUtils]: 276: Hoare triple {8621#(<= ~counter~0 32)} assume !!(0 != ~y3~0); {8621#(<= ~counter~0 32)} is VALID [2022-04-27 14:23:34,229 INFO L284 TraceCheckUtils]: 275: Hoare quadruple {7696#true} {8621#(<= ~counter~0 32)} #63#return; {8621#(<= ~counter~0 32)} is VALID [2022-04-27 14:23:34,229 INFO L290 TraceCheckUtils]: 274: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,229 INFO L290 TraceCheckUtils]: 273: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,229 INFO L290 TraceCheckUtils]: 272: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,229 INFO L272 TraceCheckUtils]: 271: Hoare triple {8621#(<= ~counter~0 32)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,229 INFO L290 TraceCheckUtils]: 270: Hoare triple {8621#(<= ~counter~0 32)} assume !!(#t~post6 < 50);havoc #t~post6; {8621#(<= ~counter~0 32)} is VALID [2022-04-27 14:23:34,230 INFO L290 TraceCheckUtils]: 269: Hoare triple {8593#(<= ~counter~0 31)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8621#(<= ~counter~0 32)} is VALID [2022-04-27 14:23:34,230 INFO L290 TraceCheckUtils]: 268: Hoare triple {8593#(<= ~counter~0 31)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8593#(<= ~counter~0 31)} is VALID [2022-04-27 14:23:34,230 INFO L290 TraceCheckUtils]: 267: Hoare triple {8593#(<= ~counter~0 31)} assume !!(0 != ~y3~0); {8593#(<= ~counter~0 31)} is VALID [2022-04-27 14:23:34,231 INFO L284 TraceCheckUtils]: 266: Hoare quadruple {7696#true} {8593#(<= ~counter~0 31)} #63#return; {8593#(<= ~counter~0 31)} is VALID [2022-04-27 14:23:34,231 INFO L290 TraceCheckUtils]: 265: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,231 INFO L290 TraceCheckUtils]: 264: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,231 INFO L290 TraceCheckUtils]: 263: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,231 INFO L272 TraceCheckUtils]: 262: Hoare triple {8593#(<= ~counter~0 31)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,231 INFO L290 TraceCheckUtils]: 261: Hoare triple {8593#(<= ~counter~0 31)} assume !!(#t~post6 < 50);havoc #t~post6; {8593#(<= ~counter~0 31)} is VALID [2022-04-27 14:23:34,232 INFO L290 TraceCheckUtils]: 260: Hoare triple {8565#(<= ~counter~0 30)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8593#(<= ~counter~0 31)} is VALID [2022-04-27 14:23:34,232 INFO L290 TraceCheckUtils]: 259: Hoare triple {8565#(<= ~counter~0 30)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8565#(<= ~counter~0 30)} is VALID [2022-04-27 14:23:34,232 INFO L290 TraceCheckUtils]: 258: Hoare triple {8565#(<= ~counter~0 30)} assume !!(0 != ~y3~0); {8565#(<= ~counter~0 30)} is VALID [2022-04-27 14:23:34,232 INFO L284 TraceCheckUtils]: 257: Hoare quadruple {7696#true} {8565#(<= ~counter~0 30)} #63#return; {8565#(<= ~counter~0 30)} is VALID [2022-04-27 14:23:34,232 INFO L290 TraceCheckUtils]: 256: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,232 INFO L290 TraceCheckUtils]: 255: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,233 INFO L290 TraceCheckUtils]: 254: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,233 INFO L272 TraceCheckUtils]: 253: Hoare triple {8565#(<= ~counter~0 30)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,235 INFO L290 TraceCheckUtils]: 252: Hoare triple {8565#(<= ~counter~0 30)} assume !!(#t~post6 < 50);havoc #t~post6; {8565#(<= ~counter~0 30)} is VALID [2022-04-27 14:23:34,235 INFO L290 TraceCheckUtils]: 251: Hoare triple {8537#(<= ~counter~0 29)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8565#(<= ~counter~0 30)} is VALID [2022-04-27 14:23:34,235 INFO L290 TraceCheckUtils]: 250: Hoare triple {8537#(<= ~counter~0 29)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8537#(<= ~counter~0 29)} is VALID [2022-04-27 14:23:34,235 INFO L290 TraceCheckUtils]: 249: Hoare triple {8537#(<= ~counter~0 29)} assume !!(0 != ~y3~0); {8537#(<= ~counter~0 29)} is VALID [2022-04-27 14:23:34,236 INFO L284 TraceCheckUtils]: 248: Hoare quadruple {7696#true} {8537#(<= ~counter~0 29)} #63#return; {8537#(<= ~counter~0 29)} is VALID [2022-04-27 14:23:34,236 INFO L290 TraceCheckUtils]: 247: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,236 INFO L290 TraceCheckUtils]: 246: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,236 INFO L290 TraceCheckUtils]: 245: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,236 INFO L272 TraceCheckUtils]: 244: Hoare triple {8537#(<= ~counter~0 29)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,236 INFO L290 TraceCheckUtils]: 243: Hoare triple {8537#(<= ~counter~0 29)} assume !!(#t~post6 < 50);havoc #t~post6; {8537#(<= ~counter~0 29)} is VALID [2022-04-27 14:23:34,237 INFO L290 TraceCheckUtils]: 242: Hoare triple {8509#(<= ~counter~0 28)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8537#(<= ~counter~0 29)} is VALID [2022-04-27 14:23:34,237 INFO L290 TraceCheckUtils]: 241: Hoare triple {8509#(<= ~counter~0 28)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8509#(<= ~counter~0 28)} is VALID [2022-04-27 14:23:34,237 INFO L290 TraceCheckUtils]: 240: Hoare triple {8509#(<= ~counter~0 28)} assume !!(0 != ~y3~0); {8509#(<= ~counter~0 28)} is VALID [2022-04-27 14:23:34,237 INFO L284 TraceCheckUtils]: 239: Hoare quadruple {7696#true} {8509#(<= ~counter~0 28)} #63#return; {8509#(<= ~counter~0 28)} is VALID [2022-04-27 14:23:34,237 INFO L290 TraceCheckUtils]: 238: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,238 INFO L290 TraceCheckUtils]: 237: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,238 INFO L290 TraceCheckUtils]: 236: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,238 INFO L272 TraceCheckUtils]: 235: Hoare triple {8509#(<= ~counter~0 28)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,238 INFO L290 TraceCheckUtils]: 234: Hoare triple {8509#(<= ~counter~0 28)} assume !!(#t~post6 < 50);havoc #t~post6; {8509#(<= ~counter~0 28)} is VALID [2022-04-27 14:23:34,238 INFO L290 TraceCheckUtils]: 233: Hoare triple {8481#(<= ~counter~0 27)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8509#(<= ~counter~0 28)} is VALID [2022-04-27 14:23:34,238 INFO L290 TraceCheckUtils]: 232: Hoare triple {8481#(<= ~counter~0 27)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8481#(<= ~counter~0 27)} is VALID [2022-04-27 14:23:34,239 INFO L290 TraceCheckUtils]: 231: Hoare triple {8481#(<= ~counter~0 27)} assume !!(0 != ~y3~0); {8481#(<= ~counter~0 27)} is VALID [2022-04-27 14:23:34,239 INFO L284 TraceCheckUtils]: 230: Hoare quadruple {7696#true} {8481#(<= ~counter~0 27)} #63#return; {8481#(<= ~counter~0 27)} is VALID [2022-04-27 14:23:34,239 INFO L290 TraceCheckUtils]: 229: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,239 INFO L290 TraceCheckUtils]: 228: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,239 INFO L290 TraceCheckUtils]: 227: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,239 INFO L272 TraceCheckUtils]: 226: Hoare triple {8481#(<= ~counter~0 27)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,240 INFO L290 TraceCheckUtils]: 225: Hoare triple {8481#(<= ~counter~0 27)} assume !!(#t~post6 < 50);havoc #t~post6; {8481#(<= ~counter~0 27)} is VALID [2022-04-27 14:23:34,240 INFO L290 TraceCheckUtils]: 224: Hoare triple {8453#(<= ~counter~0 26)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8481#(<= ~counter~0 27)} is VALID [2022-04-27 14:23:34,240 INFO L290 TraceCheckUtils]: 223: Hoare triple {8453#(<= ~counter~0 26)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8453#(<= ~counter~0 26)} is VALID [2022-04-27 14:23:34,240 INFO L290 TraceCheckUtils]: 222: Hoare triple {8453#(<= ~counter~0 26)} assume !!(0 != ~y3~0); {8453#(<= ~counter~0 26)} is VALID [2022-04-27 14:23:34,241 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {7696#true} {8453#(<= ~counter~0 26)} #63#return; {8453#(<= ~counter~0 26)} is VALID [2022-04-27 14:23:34,241 INFO L290 TraceCheckUtils]: 220: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,241 INFO L290 TraceCheckUtils]: 219: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,241 INFO L290 TraceCheckUtils]: 218: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,241 INFO L272 TraceCheckUtils]: 217: Hoare triple {8453#(<= ~counter~0 26)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,241 INFO L290 TraceCheckUtils]: 216: Hoare triple {8453#(<= ~counter~0 26)} assume !!(#t~post6 < 50);havoc #t~post6; {8453#(<= ~counter~0 26)} is VALID [2022-04-27 14:23:34,242 INFO L290 TraceCheckUtils]: 215: Hoare triple {8425#(<= ~counter~0 25)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8453#(<= ~counter~0 26)} is VALID [2022-04-27 14:23:34,242 INFO L290 TraceCheckUtils]: 214: Hoare triple {8425#(<= ~counter~0 25)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8425#(<= ~counter~0 25)} is VALID [2022-04-27 14:23:34,242 INFO L290 TraceCheckUtils]: 213: Hoare triple {8425#(<= ~counter~0 25)} assume !!(0 != ~y3~0); {8425#(<= ~counter~0 25)} is VALID [2022-04-27 14:23:34,242 INFO L284 TraceCheckUtils]: 212: Hoare quadruple {7696#true} {8425#(<= ~counter~0 25)} #63#return; {8425#(<= ~counter~0 25)} is VALID [2022-04-27 14:23:34,242 INFO L290 TraceCheckUtils]: 211: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,242 INFO L290 TraceCheckUtils]: 210: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,243 INFO L290 TraceCheckUtils]: 209: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,243 INFO L272 TraceCheckUtils]: 208: Hoare triple {8425#(<= ~counter~0 25)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,243 INFO L290 TraceCheckUtils]: 207: Hoare triple {8425#(<= ~counter~0 25)} assume !!(#t~post6 < 50);havoc #t~post6; {8425#(<= ~counter~0 25)} is VALID [2022-04-27 14:23:34,243 INFO L290 TraceCheckUtils]: 206: Hoare triple {8397#(<= ~counter~0 24)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8425#(<= ~counter~0 25)} is VALID [2022-04-27 14:23:34,243 INFO L290 TraceCheckUtils]: 205: Hoare triple {8397#(<= ~counter~0 24)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8397#(<= ~counter~0 24)} is VALID [2022-04-27 14:23:34,244 INFO L290 TraceCheckUtils]: 204: Hoare triple {8397#(<= ~counter~0 24)} assume !!(0 != ~y3~0); {8397#(<= ~counter~0 24)} is VALID [2022-04-27 14:23:34,244 INFO L284 TraceCheckUtils]: 203: Hoare quadruple {7696#true} {8397#(<= ~counter~0 24)} #63#return; {8397#(<= ~counter~0 24)} is VALID [2022-04-27 14:23:34,244 INFO L290 TraceCheckUtils]: 202: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,244 INFO L290 TraceCheckUtils]: 201: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,244 INFO L290 TraceCheckUtils]: 200: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,244 INFO L272 TraceCheckUtils]: 199: Hoare triple {8397#(<= ~counter~0 24)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,244 INFO L290 TraceCheckUtils]: 198: Hoare triple {8397#(<= ~counter~0 24)} assume !!(#t~post6 < 50);havoc #t~post6; {8397#(<= ~counter~0 24)} is VALID [2022-04-27 14:23:34,245 INFO L290 TraceCheckUtils]: 197: Hoare triple {8369#(<= ~counter~0 23)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8397#(<= ~counter~0 24)} is VALID [2022-04-27 14:23:34,245 INFO L290 TraceCheckUtils]: 196: Hoare triple {8369#(<= ~counter~0 23)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8369#(<= ~counter~0 23)} is VALID [2022-04-27 14:23:34,245 INFO L290 TraceCheckUtils]: 195: Hoare triple {8369#(<= ~counter~0 23)} assume !!(0 != ~y3~0); {8369#(<= ~counter~0 23)} is VALID [2022-04-27 14:23:34,246 INFO L284 TraceCheckUtils]: 194: Hoare quadruple {7696#true} {8369#(<= ~counter~0 23)} #63#return; {8369#(<= ~counter~0 23)} is VALID [2022-04-27 14:23:34,246 INFO L290 TraceCheckUtils]: 193: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,246 INFO L290 TraceCheckUtils]: 192: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,246 INFO L290 TraceCheckUtils]: 191: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,246 INFO L272 TraceCheckUtils]: 190: Hoare triple {8369#(<= ~counter~0 23)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,246 INFO L290 TraceCheckUtils]: 189: Hoare triple {8369#(<= ~counter~0 23)} assume !!(#t~post6 < 50);havoc #t~post6; {8369#(<= ~counter~0 23)} is VALID [2022-04-27 14:23:34,247 INFO L290 TraceCheckUtils]: 188: Hoare triple {8341#(<= ~counter~0 22)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8369#(<= ~counter~0 23)} is VALID [2022-04-27 14:23:34,247 INFO L290 TraceCheckUtils]: 187: Hoare triple {8341#(<= ~counter~0 22)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8341#(<= ~counter~0 22)} is VALID [2022-04-27 14:23:34,247 INFO L290 TraceCheckUtils]: 186: Hoare triple {8341#(<= ~counter~0 22)} assume !!(0 != ~y3~0); {8341#(<= ~counter~0 22)} is VALID [2022-04-27 14:23:34,247 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {7696#true} {8341#(<= ~counter~0 22)} #63#return; {8341#(<= ~counter~0 22)} is VALID [2022-04-27 14:23:34,247 INFO L290 TraceCheckUtils]: 184: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,248 INFO L290 TraceCheckUtils]: 183: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,248 INFO L290 TraceCheckUtils]: 182: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,248 INFO L272 TraceCheckUtils]: 181: Hoare triple {8341#(<= ~counter~0 22)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,248 INFO L290 TraceCheckUtils]: 180: Hoare triple {8341#(<= ~counter~0 22)} assume !!(#t~post6 < 50);havoc #t~post6; {8341#(<= ~counter~0 22)} is VALID [2022-04-27 14:23:34,248 INFO L290 TraceCheckUtils]: 179: Hoare triple {8313#(<= ~counter~0 21)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8341#(<= ~counter~0 22)} is VALID [2022-04-27 14:23:34,248 INFO L290 TraceCheckUtils]: 178: Hoare triple {8313#(<= ~counter~0 21)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8313#(<= ~counter~0 21)} is VALID [2022-04-27 14:23:34,249 INFO L290 TraceCheckUtils]: 177: Hoare triple {8313#(<= ~counter~0 21)} assume !!(0 != ~y3~0); {8313#(<= ~counter~0 21)} is VALID [2022-04-27 14:23:34,249 INFO L284 TraceCheckUtils]: 176: Hoare quadruple {7696#true} {8313#(<= ~counter~0 21)} #63#return; {8313#(<= ~counter~0 21)} is VALID [2022-04-27 14:23:34,249 INFO L290 TraceCheckUtils]: 175: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,249 INFO L290 TraceCheckUtils]: 174: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,249 INFO L290 TraceCheckUtils]: 173: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,249 INFO L272 TraceCheckUtils]: 172: Hoare triple {8313#(<= ~counter~0 21)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,250 INFO L290 TraceCheckUtils]: 171: Hoare triple {8313#(<= ~counter~0 21)} assume !!(#t~post6 < 50);havoc #t~post6; {8313#(<= ~counter~0 21)} is VALID [2022-04-27 14:23:34,250 INFO L290 TraceCheckUtils]: 170: Hoare triple {8285#(<= ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8313#(<= ~counter~0 21)} is VALID [2022-04-27 14:23:34,250 INFO L290 TraceCheckUtils]: 169: Hoare triple {8285#(<= ~counter~0 20)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8285#(<= ~counter~0 20)} is VALID [2022-04-27 14:23:34,250 INFO L290 TraceCheckUtils]: 168: Hoare triple {8285#(<= ~counter~0 20)} assume !!(0 != ~y3~0); {8285#(<= ~counter~0 20)} is VALID [2022-04-27 14:23:34,251 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {7696#true} {8285#(<= ~counter~0 20)} #63#return; {8285#(<= ~counter~0 20)} is VALID [2022-04-27 14:23:34,251 INFO L290 TraceCheckUtils]: 166: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,251 INFO L290 TraceCheckUtils]: 165: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,251 INFO L290 TraceCheckUtils]: 164: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,251 INFO L272 TraceCheckUtils]: 163: Hoare triple {8285#(<= ~counter~0 20)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,251 INFO L290 TraceCheckUtils]: 162: Hoare triple {8285#(<= ~counter~0 20)} assume !!(#t~post6 < 50);havoc #t~post6; {8285#(<= ~counter~0 20)} is VALID [2022-04-27 14:23:34,252 INFO L290 TraceCheckUtils]: 161: Hoare triple {8257#(<= ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8285#(<= ~counter~0 20)} is VALID [2022-04-27 14:23:34,252 INFO L290 TraceCheckUtils]: 160: Hoare triple {8257#(<= ~counter~0 19)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8257#(<= ~counter~0 19)} is VALID [2022-04-27 14:23:34,252 INFO L290 TraceCheckUtils]: 159: Hoare triple {8257#(<= ~counter~0 19)} assume !!(0 != ~y3~0); {8257#(<= ~counter~0 19)} is VALID [2022-04-27 14:23:34,252 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {7696#true} {8257#(<= ~counter~0 19)} #63#return; {8257#(<= ~counter~0 19)} is VALID [2022-04-27 14:23:34,253 INFO L290 TraceCheckUtils]: 157: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,253 INFO L290 TraceCheckUtils]: 156: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,253 INFO L290 TraceCheckUtils]: 155: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,253 INFO L272 TraceCheckUtils]: 154: Hoare triple {8257#(<= ~counter~0 19)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,253 INFO L290 TraceCheckUtils]: 153: Hoare triple {8257#(<= ~counter~0 19)} assume !!(#t~post6 < 50);havoc #t~post6; {8257#(<= ~counter~0 19)} is VALID [2022-04-27 14:23:34,253 INFO L290 TraceCheckUtils]: 152: Hoare triple {8229#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8257#(<= ~counter~0 19)} is VALID [2022-04-27 14:23:34,254 INFO L290 TraceCheckUtils]: 151: Hoare triple {8229#(<= ~counter~0 18)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8229#(<= ~counter~0 18)} is VALID [2022-04-27 14:23:34,254 INFO L290 TraceCheckUtils]: 150: Hoare triple {8229#(<= ~counter~0 18)} assume !!(0 != ~y3~0); {8229#(<= ~counter~0 18)} is VALID [2022-04-27 14:23:34,254 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {7696#true} {8229#(<= ~counter~0 18)} #63#return; {8229#(<= ~counter~0 18)} is VALID [2022-04-27 14:23:34,254 INFO L290 TraceCheckUtils]: 148: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,254 INFO L290 TraceCheckUtils]: 147: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,254 INFO L290 TraceCheckUtils]: 146: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,254 INFO L272 TraceCheckUtils]: 145: Hoare triple {8229#(<= ~counter~0 18)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,255 INFO L290 TraceCheckUtils]: 144: Hoare triple {8229#(<= ~counter~0 18)} assume !!(#t~post6 < 50);havoc #t~post6; {8229#(<= ~counter~0 18)} is VALID [2022-04-27 14:23:34,255 INFO L290 TraceCheckUtils]: 143: Hoare triple {8201#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8229#(<= ~counter~0 18)} is VALID [2022-04-27 14:23:34,255 INFO L290 TraceCheckUtils]: 142: Hoare triple {8201#(<= ~counter~0 17)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8201#(<= ~counter~0 17)} is VALID [2022-04-27 14:23:34,255 INFO L290 TraceCheckUtils]: 141: Hoare triple {8201#(<= ~counter~0 17)} assume !!(0 != ~y3~0); {8201#(<= ~counter~0 17)} is VALID [2022-04-27 14:23:34,256 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {7696#true} {8201#(<= ~counter~0 17)} #63#return; {8201#(<= ~counter~0 17)} is VALID [2022-04-27 14:23:34,256 INFO L290 TraceCheckUtils]: 139: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,256 INFO L290 TraceCheckUtils]: 138: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,256 INFO L290 TraceCheckUtils]: 137: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,256 INFO L272 TraceCheckUtils]: 136: Hoare triple {8201#(<= ~counter~0 17)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,256 INFO L290 TraceCheckUtils]: 135: Hoare triple {8201#(<= ~counter~0 17)} assume !!(#t~post6 < 50);havoc #t~post6; {8201#(<= ~counter~0 17)} is VALID [2022-04-27 14:23:34,257 INFO L290 TraceCheckUtils]: 134: Hoare triple {8173#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8201#(<= ~counter~0 17)} is VALID [2022-04-27 14:23:34,257 INFO L290 TraceCheckUtils]: 133: Hoare triple {8173#(<= ~counter~0 16)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8173#(<= ~counter~0 16)} is VALID [2022-04-27 14:23:34,257 INFO L290 TraceCheckUtils]: 132: Hoare triple {8173#(<= ~counter~0 16)} assume !!(0 != ~y3~0); {8173#(<= ~counter~0 16)} is VALID [2022-04-27 14:23:34,258 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {7696#true} {8173#(<= ~counter~0 16)} #63#return; {8173#(<= ~counter~0 16)} is VALID [2022-04-27 14:23:34,258 INFO L290 TraceCheckUtils]: 130: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,258 INFO L290 TraceCheckUtils]: 129: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,258 INFO L290 TraceCheckUtils]: 128: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,258 INFO L272 TraceCheckUtils]: 127: Hoare triple {8173#(<= ~counter~0 16)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,258 INFO L290 TraceCheckUtils]: 126: Hoare triple {8173#(<= ~counter~0 16)} assume !!(#t~post6 < 50);havoc #t~post6; {8173#(<= ~counter~0 16)} is VALID [2022-04-27 14:23:34,258 INFO L290 TraceCheckUtils]: 125: Hoare triple {8145#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8173#(<= ~counter~0 16)} is VALID [2022-04-27 14:23:34,259 INFO L290 TraceCheckUtils]: 124: Hoare triple {8145#(<= ~counter~0 15)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8145#(<= ~counter~0 15)} is VALID [2022-04-27 14:23:34,259 INFO L290 TraceCheckUtils]: 123: Hoare triple {8145#(<= ~counter~0 15)} assume !!(0 != ~y3~0); {8145#(<= ~counter~0 15)} is VALID [2022-04-27 14:23:34,259 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {7696#true} {8145#(<= ~counter~0 15)} #63#return; {8145#(<= ~counter~0 15)} is VALID [2022-04-27 14:23:34,259 INFO L290 TraceCheckUtils]: 121: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,259 INFO L290 TraceCheckUtils]: 120: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,259 INFO L290 TraceCheckUtils]: 119: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,260 INFO L272 TraceCheckUtils]: 118: Hoare triple {8145#(<= ~counter~0 15)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,260 INFO L290 TraceCheckUtils]: 117: Hoare triple {8145#(<= ~counter~0 15)} assume !!(#t~post6 < 50);havoc #t~post6; {8145#(<= ~counter~0 15)} is VALID [2022-04-27 14:23:34,260 INFO L290 TraceCheckUtils]: 116: Hoare triple {8117#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8145#(<= ~counter~0 15)} is VALID [2022-04-27 14:23:34,260 INFO L290 TraceCheckUtils]: 115: Hoare triple {8117#(<= ~counter~0 14)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8117#(<= ~counter~0 14)} is VALID [2022-04-27 14:23:34,261 INFO L290 TraceCheckUtils]: 114: Hoare triple {8117#(<= ~counter~0 14)} assume !!(0 != ~y3~0); {8117#(<= ~counter~0 14)} is VALID [2022-04-27 14:23:34,261 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {7696#true} {8117#(<= ~counter~0 14)} #63#return; {8117#(<= ~counter~0 14)} is VALID [2022-04-27 14:23:34,261 INFO L290 TraceCheckUtils]: 112: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,261 INFO L290 TraceCheckUtils]: 111: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,261 INFO L290 TraceCheckUtils]: 110: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,261 INFO L272 TraceCheckUtils]: 109: Hoare triple {8117#(<= ~counter~0 14)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,261 INFO L290 TraceCheckUtils]: 108: Hoare triple {8117#(<= ~counter~0 14)} assume !!(#t~post6 < 50);havoc #t~post6; {8117#(<= ~counter~0 14)} is VALID [2022-04-27 14:23:34,262 INFO L290 TraceCheckUtils]: 107: Hoare triple {8089#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8117#(<= ~counter~0 14)} is VALID [2022-04-27 14:23:34,262 INFO L290 TraceCheckUtils]: 106: Hoare triple {8089#(<= ~counter~0 13)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8089#(<= ~counter~0 13)} is VALID [2022-04-27 14:23:34,262 INFO L290 TraceCheckUtils]: 105: Hoare triple {8089#(<= ~counter~0 13)} assume !!(0 != ~y3~0); {8089#(<= ~counter~0 13)} is VALID [2022-04-27 14:23:34,263 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {7696#true} {8089#(<= ~counter~0 13)} #63#return; {8089#(<= ~counter~0 13)} is VALID [2022-04-27 14:23:34,263 INFO L290 TraceCheckUtils]: 103: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,263 INFO L290 TraceCheckUtils]: 102: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,263 INFO L290 TraceCheckUtils]: 101: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,263 INFO L272 TraceCheckUtils]: 100: Hoare triple {8089#(<= ~counter~0 13)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,263 INFO L290 TraceCheckUtils]: 99: Hoare triple {8089#(<= ~counter~0 13)} assume !!(#t~post6 < 50);havoc #t~post6; {8089#(<= ~counter~0 13)} is VALID [2022-04-27 14:23:34,264 INFO L290 TraceCheckUtils]: 98: Hoare triple {8061#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8089#(<= ~counter~0 13)} is VALID [2022-04-27 14:23:34,264 INFO L290 TraceCheckUtils]: 97: Hoare triple {8061#(<= ~counter~0 12)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8061#(<= ~counter~0 12)} is VALID [2022-04-27 14:23:34,264 INFO L290 TraceCheckUtils]: 96: Hoare triple {8061#(<= ~counter~0 12)} assume !!(0 != ~y3~0); {8061#(<= ~counter~0 12)} is VALID [2022-04-27 14:23:34,264 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {7696#true} {8061#(<= ~counter~0 12)} #63#return; {8061#(<= ~counter~0 12)} is VALID [2022-04-27 14:23:34,264 INFO L290 TraceCheckUtils]: 94: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,264 INFO L290 TraceCheckUtils]: 93: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,265 INFO L290 TraceCheckUtils]: 92: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,265 INFO L272 TraceCheckUtils]: 91: Hoare triple {8061#(<= ~counter~0 12)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,265 INFO L290 TraceCheckUtils]: 90: Hoare triple {8061#(<= ~counter~0 12)} assume !!(#t~post6 < 50);havoc #t~post6; {8061#(<= ~counter~0 12)} is VALID [2022-04-27 14:23:34,265 INFO L290 TraceCheckUtils]: 89: Hoare triple {8033#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8061#(<= ~counter~0 12)} is VALID [2022-04-27 14:23:34,265 INFO L290 TraceCheckUtils]: 88: Hoare triple {8033#(<= ~counter~0 11)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8033#(<= ~counter~0 11)} is VALID [2022-04-27 14:23:34,266 INFO L290 TraceCheckUtils]: 87: Hoare triple {8033#(<= ~counter~0 11)} assume !!(0 != ~y3~0); {8033#(<= ~counter~0 11)} is VALID [2022-04-27 14:23:34,266 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {7696#true} {8033#(<= ~counter~0 11)} #63#return; {8033#(<= ~counter~0 11)} is VALID [2022-04-27 14:23:34,266 INFO L290 TraceCheckUtils]: 85: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,266 INFO L290 TraceCheckUtils]: 84: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,266 INFO L290 TraceCheckUtils]: 83: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,266 INFO L272 TraceCheckUtils]: 82: Hoare triple {8033#(<= ~counter~0 11)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,266 INFO L290 TraceCheckUtils]: 81: Hoare triple {8033#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {8033#(<= ~counter~0 11)} is VALID [2022-04-27 14:23:34,267 INFO L290 TraceCheckUtils]: 80: Hoare triple {8005#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8033#(<= ~counter~0 11)} is VALID [2022-04-27 14:23:34,267 INFO L290 TraceCheckUtils]: 79: Hoare triple {8005#(<= ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8005#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:34,267 INFO L290 TraceCheckUtils]: 78: Hoare triple {8005#(<= ~counter~0 10)} assume !!(0 != ~y3~0); {8005#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:34,268 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {7696#true} {8005#(<= ~counter~0 10)} #63#return; {8005#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:34,268 INFO L290 TraceCheckUtils]: 76: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,268 INFO L290 TraceCheckUtils]: 75: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,268 INFO L290 TraceCheckUtils]: 74: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,268 INFO L272 TraceCheckUtils]: 73: Hoare triple {8005#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,268 INFO L290 TraceCheckUtils]: 72: Hoare triple {8005#(<= ~counter~0 10)} assume !!(#t~post6 < 50);havoc #t~post6; {8005#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:34,269 INFO L290 TraceCheckUtils]: 71: Hoare triple {7977#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8005#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:34,269 INFO L290 TraceCheckUtils]: 70: Hoare triple {7977#(<= ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7977#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:34,269 INFO L290 TraceCheckUtils]: 69: Hoare triple {7977#(<= ~counter~0 9)} assume !!(0 != ~y3~0); {7977#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:34,269 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7696#true} {7977#(<= ~counter~0 9)} #63#return; {7977#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:34,269 INFO L290 TraceCheckUtils]: 67: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,270 INFO L290 TraceCheckUtils]: 66: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,270 INFO L290 TraceCheckUtils]: 65: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,270 INFO L272 TraceCheckUtils]: 64: Hoare triple {7977#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,270 INFO L290 TraceCheckUtils]: 63: Hoare triple {7977#(<= ~counter~0 9)} assume !!(#t~post6 < 50);havoc #t~post6; {7977#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:34,270 INFO L290 TraceCheckUtils]: 62: Hoare triple {7949#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7977#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:34,270 INFO L290 TraceCheckUtils]: 61: Hoare triple {7949#(<= ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7949#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:34,271 INFO L290 TraceCheckUtils]: 60: Hoare triple {7949#(<= ~counter~0 8)} assume !!(0 != ~y3~0); {7949#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:34,271 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7696#true} {7949#(<= ~counter~0 8)} #63#return; {7949#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:34,271 INFO L290 TraceCheckUtils]: 58: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,271 INFO L290 TraceCheckUtils]: 57: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,271 INFO L290 TraceCheckUtils]: 56: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,271 INFO L272 TraceCheckUtils]: 55: Hoare triple {7949#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,272 INFO L290 TraceCheckUtils]: 54: Hoare triple {7949#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {7949#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:34,272 INFO L290 TraceCheckUtils]: 53: Hoare triple {7921#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7949#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:34,272 INFO L290 TraceCheckUtils]: 52: Hoare triple {7921#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7921#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:34,272 INFO L290 TraceCheckUtils]: 51: Hoare triple {7921#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {7921#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:34,273 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7696#true} {7921#(<= ~counter~0 7)} #63#return; {7921#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:34,273 INFO L290 TraceCheckUtils]: 49: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,273 INFO L290 TraceCheckUtils]: 48: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,273 INFO L290 TraceCheckUtils]: 47: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,273 INFO L272 TraceCheckUtils]: 46: Hoare triple {7921#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,273 INFO L290 TraceCheckUtils]: 45: Hoare triple {7921#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {7921#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:34,274 INFO L290 TraceCheckUtils]: 44: Hoare triple {7893#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7921#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:34,274 INFO L290 TraceCheckUtils]: 43: Hoare triple {7893#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7893#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:34,274 INFO L290 TraceCheckUtils]: 42: Hoare triple {7893#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {7893#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:34,274 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7696#true} {7893#(<= ~counter~0 6)} #63#return; {7893#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:34,275 INFO L290 TraceCheckUtils]: 40: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,275 INFO L290 TraceCheckUtils]: 39: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,275 INFO L290 TraceCheckUtils]: 38: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,275 INFO L272 TraceCheckUtils]: 37: Hoare triple {7893#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,275 INFO L290 TraceCheckUtils]: 36: Hoare triple {7893#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {7893#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:34,275 INFO L290 TraceCheckUtils]: 35: Hoare triple {7865#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7893#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:34,276 INFO L290 TraceCheckUtils]: 34: Hoare triple {7865#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7865#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:34,276 INFO L290 TraceCheckUtils]: 33: Hoare triple {7865#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {7865#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:34,276 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7696#true} {7865#(<= ~counter~0 5)} #63#return; {7865#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:34,276 INFO L290 TraceCheckUtils]: 31: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,276 INFO L290 TraceCheckUtils]: 30: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,276 INFO L290 TraceCheckUtils]: 29: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,276 INFO L272 TraceCheckUtils]: 28: Hoare triple {7865#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,277 INFO L290 TraceCheckUtils]: 27: Hoare triple {7865#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {7865#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:34,277 INFO L290 TraceCheckUtils]: 26: Hoare triple {7837#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7865#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:34,277 INFO L290 TraceCheckUtils]: 25: Hoare triple {7837#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7837#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:34,278 INFO L290 TraceCheckUtils]: 24: Hoare triple {7837#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {7837#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:34,278 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7696#true} {7837#(<= ~counter~0 4)} #63#return; {7837#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:34,278 INFO L290 TraceCheckUtils]: 22: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,278 INFO L290 TraceCheckUtils]: 21: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,278 INFO L290 TraceCheckUtils]: 20: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,278 INFO L272 TraceCheckUtils]: 19: Hoare triple {7837#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,278 INFO L290 TraceCheckUtils]: 18: Hoare triple {7837#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {7837#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:34,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {7809#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7837#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:34,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {7809#(<= ~counter~0 3)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {7809#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:34,279 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7696#true} {7809#(<= ~counter~0 3)} #61#return; {7809#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:34,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,280 INFO L272 TraceCheckUtils]: 11: Hoare triple {7809#(<= ~counter~0 3)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,280 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7696#true} {7809#(<= ~counter~0 3)} #59#return; {7809#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:34,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {7696#true} assume true; {7696#true} is VALID [2022-04-27 14:23:34,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {7696#true} assume !(0 == ~cond); {7696#true} is VALID [2022-04-27 14:23:34,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {7696#true} ~cond := #in~cond; {7696#true} is VALID [2022-04-27 14:23:34,280 INFO L272 TraceCheckUtils]: 6: Hoare triple {7809#(<= ~counter~0 3)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {7696#true} is VALID [2022-04-27 14:23:34,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {7809#(<= ~counter~0 3)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {7809#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:34,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {7809#(<= ~counter~0 3)} call #t~ret7 := main(); {7809#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:34,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7809#(<= ~counter~0 3)} {7696#true} #67#return; {7809#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:34,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {7809#(<= ~counter~0 3)} assume true; {7809#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:34,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {7696#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; {7809#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:34,282 INFO L272 TraceCheckUtils]: 0: Hoare triple {7696#true} call ULTIMATE.init(); {7696#true} is VALID [2022-04-27 14:23:34,285 INFO L134 CoverageAnalysis]: Checked inductivity of 9503 backedges. 92 proven. 5267 refuted. 0 times theorem prover too weak. 4144 trivial. 0 not checked. [2022-04-27 14:23:34,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:23:34,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549030628] [2022-04-27 14:23:34,285 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:23:34,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967471399] [2022-04-27 14:23:34,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967471399] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:23:34,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:23:34,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 54 [2022-04-27 14:23:34,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666365340] [2022-04-27 14:23:34,285 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:23:34,287 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 6.62962962962963) internal successors, (358), 54 states have internal predecessors, (358), 52 states have call successors, (100), 49 states have call predecessors, (100), 48 states have return successors, (98), 50 states have call predecessors, (98), 51 states have call successors, (98) Word has length 437