/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/bresenham-ll_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:05:28,781 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:05:28,782 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:05:28,827 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:05:28,828 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:05:28,829 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:05:28,831 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:05:28,832 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:05:28,834 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:05:28,837 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:05:28,838 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:05:28,839 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:05:28,839 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:05:28,840 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:05:28,841 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:05:28,843 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:05:28,843 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:05:28,844 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:05:28,845 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:05:28,849 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:05:28,850 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:05:28,851 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:05:28,851 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:05:28,852 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:05:28,853 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:05:28,872 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:05:28,872 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:05:28,873 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:05:28,873 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:05:28,873 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:05:28,874 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:05:28,874 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:05:28,875 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:05:28,876 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:05:28,876 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:05:28,876 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:05:28,877 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:05:28,877 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:05:28,877 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:05:28,877 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:05:28,878 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:05:28,879 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:05:28,879 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 12:05:28,917 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:05:28,917 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:05:28,917 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:05:28,917 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:05:28,918 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:05:28,918 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:05:28,918 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:05:28,918 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:05:28,918 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:05:28,919 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:05:28,919 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:05:28,919 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:05:28,919 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:05:28,919 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:05:28,920 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:05:28,920 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:05:28,920 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:05:28,920 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:05:28,920 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:05:28,920 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:05:28,920 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:05:28,920 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:05:28,920 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:05:28,920 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:05:28,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:05:28,921 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:05:28,921 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:05:28,921 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:05:28,921 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:05:28,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:05:28,921 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:05:28,921 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:05:28,921 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:05:28,922 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 12:05:29,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:05:29,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:05:29,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:05:29,296 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:05:29,296 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:05:29,297 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound1.c [2022-04-27 12:05:29,370 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a97adb27/0df19eaf28ca4a5fb7d6f4f7a2e47d0b/FLAG718fcd0e8 [2022-04-27 12:05:29,951 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:05:29,952 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound1.c [2022-04-27 12:05:29,965 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a97adb27/0df19eaf28ca4a5fb7d6f4f7a2e47d0b/FLAG718fcd0e8 [2022-04-27 12:05:30,387 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a97adb27/0df19eaf28ca4a5fb7d6f4f7a2e47d0b [2022-04-27 12:05:30,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:05:30,389 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:05:30,390 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:05:30,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:05:30,397 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:05:30,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:05:30" (1/1) ... [2022-04-27 12:05:30,399 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56ecd6b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:05:30, skipping insertion in model container [2022-04-27 12:05:30,399 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:05:30" (1/1) ... [2022-04-27 12:05:30,419 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:05:30,430 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:05:30,670 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/bresenham-ll_valuebound1.c[597,610] [2022-04-27 12:05:30,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:05:30,724 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:05:30,750 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/bresenham-ll_valuebound1.c[597,610] [2022-04-27 12:05:30,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:05:30,796 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:05:30,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:05:30 WrapperNode [2022-04-27 12:05:30,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:05:30,797 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:05:30,797 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:05:30,797 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:05:30,807 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:05:30" (1/1) ... [2022-04-27 12:05:30,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:05:30" (1/1) ... [2022-04-27 12:05:30,826 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:05:30" (1/1) ... [2022-04-27 12:05:30,826 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:05:30" (1/1) ... [2022-04-27 12:05:30,851 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:05:30" (1/1) ... [2022-04-27 12:05:30,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:05:30" (1/1) ... [2022-04-27 12:05:30,859 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:05:30" (1/1) ... [2022-04-27 12:05:30,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:05:30,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:05:30,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:05:30,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:05:30,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:05:30" (1/1) ... [2022-04-27 12:05:30,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:05:30,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:05:30,905 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 12:05:30,968 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 12:05:30,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:05:30,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:05:30,991 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:05:30,991 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:05:30,992 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:05:30,992 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:05:30,992 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:05:30,993 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:05:30,993 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:05:30,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:05:30,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 12:05:30,993 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:05:30,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:05:30,993 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:05:30,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:05:30,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:05:30,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:05:30,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:05:30,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:05:30,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:05:31,063 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:05:31,064 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:05:31,314 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:05:31,321 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:05:31,321 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 12:05:31,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:05:31 BoogieIcfgContainer [2022-04-27 12:05:31,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:05:31,327 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:05:31,328 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:05:31,330 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:05:31,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:05:30" (1/3) ... [2022-04-27 12:05:31,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739924dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:05:31, skipping insertion in model container [2022-04-27 12:05:31,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:05:30" (2/3) ... [2022-04-27 12:05:31,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739924dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:05:31, skipping insertion in model container [2022-04-27 12:05:31,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:05:31" (3/3) ... [2022-04-27 12:05:31,332 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll_valuebound1.c [2022-04-27 12:05:31,341 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:05:31,341 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:05:31,391 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:05:31,397 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@570c2cd3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@20160f8a [2022-04-27 12:05:31,397 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:05:31,402 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 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 12:05:31,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 12:05:31,407 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:05:31,408 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 12:05:31,408 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:05:31,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:05:31,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1867489771, now seen corresponding path program 1 times [2022-04-27 12:05:31,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:05:31,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413108221] [2022-04-27 12:05:31,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:05:31,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:05:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:05:31,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:05:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:05:31,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-27 12:05:31,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-27 12:05:31,661 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #69#return; {35#true} is VALID [2022-04-27 12:05:31,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:05:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:05:31,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 12:05:31,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 12:05:31,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 12:05:31,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-27 12:05:31,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 12:05:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:05:31,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 12:05:31,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 12:05:31,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 12:05:31,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-27 12:05:31,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:05:31,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-27 12:05:31,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-27 12:05:31,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #69#return; {35#true} is VALID [2022-04-27 12:05:31,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret8 := main(); {35#true} is VALID [2022-04-27 12:05:31,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {35#true} is VALID [2022-04-27 12:05:31,711 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {35#true} is VALID [2022-04-27 12:05:31,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 12:05:31,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 12:05:31,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 12:05:31,713 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-27 12:05:31,713 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {36#false} is VALID [2022-04-27 12:05:31,714 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {35#true} is VALID [2022-04-27 12:05:31,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 12:05:31,715 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 12:05:31,715 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 12:05:31,715 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-27 12:05:31,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {36#false} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {36#false} is VALID [2022-04-27 12:05:31,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {36#false} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {36#false} is VALID [2022-04-27 12:05:31,715 INFO L272 TraceCheckUtils]: 19: Hoare triple {36#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {36#false} is VALID [2022-04-27 12:05:31,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-27 12:05:31,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-27 12:05:31,716 INFO L290 TraceCheckUtils]: 22: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-27 12:05:31,716 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 12:05:31,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:05:31,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413108221] [2022-04-27 12:05:31,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413108221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:05:31,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:05:31,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:05:31,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017350259] [2022-04-27 12:05:31,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:05:31,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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 23 [2022-04-27 12:05:31,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:05:31,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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 12:05:31,776 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 12:05:31,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:05:31,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:05:31,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:05:31,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:05:31,816 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 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 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12:05:31,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:05:31,978 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2022-04-27 12:05:31,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:05:31,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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 23 [2022-04-27 12:05:31,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:05:31,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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 12:05:32,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-04-27 12:05:32,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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 12:05:32,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-04-27 12:05:32,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2022-04-27 12:05:32,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:05:32,148 INFO L225 Difference]: With dead ends: 57 [2022-04-27 12:05:32,148 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 12:05:32,150 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 12:05:32,161 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:05:32,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:05:32,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 12:05:32,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-27 12:05:32,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:05:32,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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 12:05:32,218 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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 12:05:32,219 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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 12:05:32,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:05:32,227 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-27 12:05:32,227 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-27 12:05:32,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:05:32,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:05:32,229 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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 12:05:32,229 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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 12:05:32,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:05:32,246 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-27 12:05:32,246 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-27 12:05:32,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:05:32,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:05:32,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:05:32,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:05:32,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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 12:05:32,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-27 12:05:32,251 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2022-04-27 12:05:32,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:05:32,251 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-27 12:05:32,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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 12:05:32,252 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-27 12:05:32,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 12:05:32,253 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:05:32,253 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 12:05:32,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:05:32,254 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:05:32,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:05:32,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1827672217, now seen corresponding path program 1 times [2022-04-27 12:05:32,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:05:32,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806736613] [2022-04-27 12:05:32,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:05:32,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:05:32,316 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:05:32,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1267255423] [2022-04-27 12:05:32,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:05:32,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:05:32,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:05:32,326 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 12:05:32,383 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 12:05:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:05:32,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 12:05:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:05:32,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:05:32,718 INFO L272 TraceCheckUtils]: 0: Hoare triple {217#true} call ULTIMATE.init(); {217#true} is VALID [2022-04-27 12:05:32,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {217#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(15, 2);call #Ultimate.allocInit(12, 3); {217#true} is VALID [2022-04-27 12:05:32,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {217#true} assume true; {217#true} is VALID [2022-04-27 12:05:32,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {217#true} {217#true} #69#return; {217#true} is VALID [2022-04-27 12:05:32,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {217#true} call #t~ret8 := main(); {217#true} is VALID [2022-04-27 12:05:32,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {217#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {217#true} is VALID [2022-04-27 12:05:32,719 INFO L272 TraceCheckUtils]: 6: Hoare triple {217#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {217#true} is VALID [2022-04-27 12:05:32,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {217#true} ~cond := #in~cond; {217#true} is VALID [2022-04-27 12:05:32,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {217#true} assume !(0 == ~cond); {217#true} is VALID [2022-04-27 12:05:32,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {217#true} assume true; {217#true} is VALID [2022-04-27 12:05:32,720 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {217#true} {217#true} #61#return; {217#true} is VALID [2022-04-27 12:05:32,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {217#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {217#true} is VALID [2022-04-27 12:05:32,720 INFO L272 TraceCheckUtils]: 12: Hoare triple {217#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {217#true} is VALID [2022-04-27 12:05:32,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {217#true} ~cond := #in~cond; {217#true} is VALID [2022-04-27 12:05:32,723 INFO L290 TraceCheckUtils]: 14: Hoare triple {217#true} assume !(0 == ~cond); {217#true} is VALID [2022-04-27 12:05:32,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {217#true} assume true; {217#true} is VALID [2022-04-27 12:05:32,724 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {217#true} {217#true} #63#return; {217#true} is VALID [2022-04-27 12:05:32,726 INFO L290 TraceCheckUtils]: 17: Hoare triple {217#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {273#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-27 12:05:32,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {273#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {277#(and (= main_~xy~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~yx~0 0))} is VALID [2022-04-27 12:05:32,728 INFO L272 TraceCheckUtils]: 19: Hoare triple {277#(and (= main_~xy~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~yx~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {281#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:05:32,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {281#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {285#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:05:32,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {285#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {218#false} is VALID [2022-04-27 12:05:32,729 INFO L290 TraceCheckUtils]: 22: Hoare triple {218#false} assume !false; {218#false} is VALID [2022-04-27 12:05:32,729 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 12:05:32,729 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:05:32,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:05:32,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806736613] [2022-04-27 12:05:32,730 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:05:32,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267255423] [2022-04-27 12:05:32,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267255423] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:05:32,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:05:32,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 12:05:32,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947472104] [2022-04-27 12:05:32,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:05:32,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-27 12:05:32,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:05:32,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:05:32,770 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 12:05:32,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:05:32,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:05:32,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:05:32,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:05:32,772 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:05:33,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:05:33,067 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-27 12:05:33,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:05:33,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-27 12:05:33,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:05:33,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:05:33,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-27 12:05:33,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:05:33,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-27 12:05:33,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-27 12:05:33,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:05:33,127 INFO L225 Difference]: With dead ends: 39 [2022-04-27 12:05:33,127 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 12:05:33,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:05:33,129 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:05:33,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 91 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:05:33,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 12:05:33,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-27 12:05:33,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:05:33,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:05:33,138 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:05:33,140 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:05:33,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:05:33,142 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-27 12:05:33,142 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-27 12:05:33,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:05:33,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:05:33,144 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-27 12:05:33,144 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-27 12:05:33,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:05:33,165 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-27 12:05:33,165 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-27 12:05:33,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:05:33,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:05:33,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:05:33,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:05:33,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:05:33,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-27 12:05:33,169 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 23 [2022-04-27 12:05:33,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:05:33,171 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-27 12:05:33,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:05:33,172 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-27 12:05:33,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 12:05:33,173 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:05:33,174 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:05:33,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 12:05:33,387 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 12:05:33,388 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:05:33,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:05:33,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1419291471, now seen corresponding path program 1 times [2022-04-27 12:05:33,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:05:33,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092770512] [2022-04-27 12:05:33,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:05:33,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:05:33,404 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:05:33,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [725682603] [2022-04-27 12:05:33,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:05:33,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:05:33,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:05:33,418 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 12:05:33,509 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 12:05:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:05:33,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 12:05:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:05:33,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:05:41,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {467#true} call ULTIMATE.init(); {467#true} is VALID [2022-04-27 12:05:41,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {467#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(15, 2);call #Ultimate.allocInit(12, 3); {467#true} is VALID [2022-04-27 12:05:41,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {467#true} assume true; {467#true} is VALID [2022-04-27 12:05:41,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {467#true} {467#true} #69#return; {467#true} is VALID [2022-04-27 12:05:41,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {467#true} call #t~ret8 := main(); {467#true} is VALID [2022-04-27 12:05:41,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {467#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {467#true} is VALID [2022-04-27 12:05:41,601 INFO L272 TraceCheckUtils]: 6: Hoare triple {467#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {467#true} is VALID [2022-04-27 12:05:41,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {467#true} ~cond := #in~cond; {493#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:05:41,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {493#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {497#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:05:41,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {497#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {497#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:05:41,603 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {497#(not (= |assume_abort_if_not_#in~cond| 0))} {467#true} #61#return; {504#(and (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:05:41,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {504#(and (<= 0 main_~X~0) (<= main_~X~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {504#(and (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:05:41,604 INFO L272 TraceCheckUtils]: 12: Hoare triple {504#(and (<= 0 main_~X~0) (<= main_~X~0 1))} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {467#true} is VALID [2022-04-27 12:05:41,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {467#true} ~cond := #in~cond; {493#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:05:41,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {493#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {497#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:05:41,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {497#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {497#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:05:41,605 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {497#(not (= |assume_abort_if_not_#in~cond| 0))} {504#(and (<= 0 main_~X~0) (<= main_~X~0 1))} #63#return; {523#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:05:41,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {523#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {527#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} is VALID [2022-04-27 12:05:41,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {527#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {527#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} is VALID [2022-04-27 12:05:41,607 INFO L272 TraceCheckUtils]: 19: Hoare triple {527#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {467#true} is VALID [2022-04-27 12:05:41,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {467#true} ~cond := #in~cond; {467#true} is VALID [2022-04-27 12:05:41,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {467#true} assume !(0 == ~cond); {467#true} is VALID [2022-04-27 12:05:41,607 INFO L290 TraceCheckUtils]: 22: Hoare triple {467#true} assume true; {467#true} is VALID [2022-04-27 12:05:41,608 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {467#true} {527#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} #65#return; {527#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} is VALID [2022-04-27 12:05:41,608 INFO L290 TraceCheckUtils]: 24: Hoare triple {527#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {527#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} is VALID [2022-04-27 12:05:41,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {527#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {552#(and (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 4)) (<= main_~X~0 1) (= main_~y~0 0))} is VALID [2022-04-27 12:05:41,623 INFO L290 TraceCheckUtils]: 26: Hoare triple {552#(and (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 4)) (<= main_~X~0 1) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {552#(and (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 4)) (<= main_~X~0 1) (= main_~y~0 0))} is VALID [2022-04-27 12:05:41,625 INFO L290 TraceCheckUtils]: 27: Hoare triple {552#(and (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 4)) (<= main_~X~0 1) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {559#(and (= main_~xy~0 0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 4)) (<= main_~X~0 1) (= main_~yx~0 0))} is VALID [2022-04-27 12:05:41,626 INFO L272 TraceCheckUtils]: 28: Hoare triple {559#(and (= main_~xy~0 0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 4)) (<= main_~X~0 1) (= main_~yx~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {563#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:05:41,626 INFO L290 TraceCheckUtils]: 29: Hoare triple {563#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {567#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:05:41,627 INFO L290 TraceCheckUtils]: 30: Hoare triple {567#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {468#false} is VALID [2022-04-27 12:05:41,627 INFO L290 TraceCheckUtils]: 31: Hoare triple {468#false} assume !false; {468#false} is VALID [2022-04-27 12:05:41,628 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:05:41,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:08:01,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:08:01,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092770512] [2022-04-27 12:08:01,719 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:08:01,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725682603] [2022-04-27 12:08:01,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725682603] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:08:01,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:08:01,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 12:08:01,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774268475] [2022-04-27 12:08:01,719 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:08:01,720 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2022-04-27 12:08:01,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:08:01,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:08:01,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:08:01,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 12:08:01,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:08:01,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 12:08:01,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-04-27 12:08:01,771 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:08:02,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:08:02,148 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-04-27 12:08:02,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 12:08:02,149 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2022-04-27 12:08:02,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:08:02,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:08:02,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 67 transitions. [2022-04-27 12:08:02,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:08:02,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 67 transitions. [2022-04-27 12:08:02,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 67 transitions. [2022-04-27 12:08:02,205 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 12:08:02,206 INFO L225 Difference]: With dead ends: 61 [2022-04-27 12:08:02,206 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 12:08:02,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-04-27 12:08:02,207 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 26 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:08:02,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 124 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:08:02,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 12:08:02,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-27 12:08:02,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:08:02,221 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:08:02,221 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:08:02,222 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:08:02,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:08:02,223 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-04-27 12:08:02,223 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-27 12:08:02,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:08:02,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:08:02,224 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-27 12:08:02,224 INFO L87 Difference]: Start difference. First operand has 35 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-27 12:08:02,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:08:02,225 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-04-27 12:08:02,225 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-27 12:08:02,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:08:02,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:08:02,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:08:02,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:08:02,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:08:02,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-04-27 12:08:02,227 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2022-04-27 12:08:02,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:08:02,227 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-04-27 12:08:02,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:08:02,227 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-27 12:08:02,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 12:08:02,228 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:08:02,228 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:08:02,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 12:08:02,428 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 12:08:02,429 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:08:02,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:08:02,429 INFO L85 PathProgramCache]: Analyzing trace with hash 355715891, now seen corresponding path program 1 times [2022-04-27 12:08:02,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:08:02,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807500633] [2022-04-27 12:08:02,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:08:02,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:08:02,450 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:08:02,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1743331611] [2022-04-27 12:08:02,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:08:02,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:08:02,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:08:02,456 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 12:08:02,458 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 12:08:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:08:02,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-27 12:08:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:08:02,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:08:03,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {812#true} call ULTIMATE.init(); {812#true} is VALID [2022-04-27 12:08:03,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {812#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(15, 2);call #Ultimate.allocInit(12, 3); {812#true} is VALID [2022-04-27 12:08:03,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {812#true} assume true; {812#true} is VALID [2022-04-27 12:08:03,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {812#true} {812#true} #69#return; {812#true} is VALID [2022-04-27 12:08:03,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {812#true} call #t~ret8 := main(); {812#true} is VALID [2022-04-27 12:08:03,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {812#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {812#true} is VALID [2022-04-27 12:08:03,004 INFO L272 TraceCheckUtils]: 6: Hoare triple {812#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {812#true} is VALID [2022-04-27 12:08:03,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {812#true} ~cond := #in~cond; {838#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:08:03,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {838#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {842#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:08:03,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {842#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {842#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:08:03,006 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {842#(not (= |assume_abort_if_not_#in~cond| 0))} {812#true} #61#return; {849#(and (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:08:03,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {849#(and (<= 0 main_~X~0) (<= main_~X~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {849#(and (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:08:03,008 INFO L272 TraceCheckUtils]: 12: Hoare triple {849#(and (<= 0 main_~X~0) (<= main_~X~0 1))} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {812#true} is VALID [2022-04-27 12:08:03,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {812#true} ~cond := #in~cond; {838#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:08:03,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {838#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {842#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:08:03,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {842#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {842#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:08:03,009 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {842#(not (= |assume_abort_if_not_#in~cond| 0))} {849#(and (<= 0 main_~X~0) (<= main_~X~0 1))} #63#return; {868#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:08:03,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {868#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {872#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} is VALID [2022-04-27 12:08:03,010 INFO L290 TraceCheckUtils]: 18: Hoare triple {872#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {872#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} is VALID [2022-04-27 12:08:03,011 INFO L272 TraceCheckUtils]: 19: Hoare triple {872#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {812#true} is VALID [2022-04-27 12:08:03,011 INFO L290 TraceCheckUtils]: 20: Hoare triple {812#true} ~cond := #in~cond; {812#true} is VALID [2022-04-27 12:08:03,012 INFO L290 TraceCheckUtils]: 21: Hoare triple {812#true} assume !(0 == ~cond); {812#true} is VALID [2022-04-27 12:08:03,013 INFO L290 TraceCheckUtils]: 22: Hoare triple {812#true} assume true; {812#true} is VALID [2022-04-27 12:08:03,013 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {812#true} {872#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} #65#return; {872#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} is VALID [2022-04-27 12:08:03,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {872#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {872#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} is VALID [2022-04-27 12:08:03,021 INFO L290 TraceCheckUtils]: 25: Hoare triple {872#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {897#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 4)) (= main_~x~0 0) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:08:03,023 INFO L290 TraceCheckUtils]: 26: Hoare triple {897#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 4)) (= main_~x~0 0) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~X~0) (<= main_~X~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {901#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 4)) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 2)) (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:08:03,024 INFO L290 TraceCheckUtils]: 27: Hoare triple {901#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 4)) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 2)) (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~X~0) (<= main_~X~0 1))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {905#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 4)) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (= main_~X~0 main_~xy~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~Y~0 main_~yx~0))} is VALID [2022-04-27 12:08:03,025 INFO L272 TraceCheckUtils]: 28: Hoare triple {905#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 4)) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (= main_~X~0 main_~xy~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~Y~0 main_~yx~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {909#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:08:03,025 INFO L290 TraceCheckUtils]: 29: Hoare triple {909#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {913#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:08:03,026 INFO L290 TraceCheckUtils]: 30: Hoare triple {913#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {813#false} is VALID [2022-04-27 12:08:03,026 INFO L290 TraceCheckUtils]: 31: Hoare triple {813#false} assume !false; {813#false} is VALID [2022-04-27 12:08:03,026 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 12:08:03,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:08:03,415 INFO L290 TraceCheckUtils]: 31: Hoare triple {813#false} assume !false; {813#false} is VALID [2022-04-27 12:08:03,415 INFO L290 TraceCheckUtils]: 30: Hoare triple {913#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {813#false} is VALID [2022-04-27 12:08:03,416 INFO L290 TraceCheckUtils]: 29: Hoare triple {909#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {913#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:08:03,416 INFO L272 TraceCheckUtils]: 28: Hoare triple {929#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {909#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:08:03,417 INFO L290 TraceCheckUtils]: 27: Hoare triple {933#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {929#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-27 12:08:03,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {937#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {933#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-27 12:08:03,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {941#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {937#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-27 12:08:03,421 INFO L290 TraceCheckUtils]: 24: Hoare triple {945#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} assume !!(~x~0 <= ~X~0); {941#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-27 12:08:03,421 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {812#true} {945#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} #65#return; {945#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-27 12:08:03,421 INFO L290 TraceCheckUtils]: 22: Hoare triple {812#true} assume true; {812#true} is VALID [2022-04-27 12:08:03,422 INFO L290 TraceCheckUtils]: 21: Hoare triple {812#true} assume !(0 == ~cond); {812#true} is VALID [2022-04-27 12:08:03,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {812#true} ~cond := #in~cond; {812#true} is VALID [2022-04-27 12:08:03,422 INFO L272 TraceCheckUtils]: 19: Hoare triple {945#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {812#true} is VALID [2022-04-27 12:08:03,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {945#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {945#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-27 12:08:03,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {812#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {945#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-27 12:08:03,423 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {812#true} {812#true} #63#return; {812#true} is VALID [2022-04-27 12:08:03,423 INFO L290 TraceCheckUtils]: 15: Hoare triple {812#true} assume true; {812#true} is VALID [2022-04-27 12:08:03,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {812#true} assume !(0 == ~cond); {812#true} is VALID [2022-04-27 12:08:03,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {812#true} ~cond := #in~cond; {812#true} is VALID [2022-04-27 12:08:03,423 INFO L272 TraceCheckUtils]: 12: Hoare triple {812#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {812#true} is VALID [2022-04-27 12:08:03,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {812#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {812#true} is VALID [2022-04-27 12:08:03,423 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {812#true} {812#true} #61#return; {812#true} is VALID [2022-04-27 12:08:03,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {812#true} assume true; {812#true} is VALID [2022-04-27 12:08:03,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {812#true} assume !(0 == ~cond); {812#true} is VALID [2022-04-27 12:08:03,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {812#true} ~cond := #in~cond; {812#true} is VALID [2022-04-27 12:08:03,424 INFO L272 TraceCheckUtils]: 6: Hoare triple {812#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {812#true} is VALID [2022-04-27 12:08:03,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {812#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {812#true} is VALID [2022-04-27 12:08:03,424 INFO L272 TraceCheckUtils]: 4: Hoare triple {812#true} call #t~ret8 := main(); {812#true} is VALID [2022-04-27 12:08:03,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {812#true} {812#true} #69#return; {812#true} is VALID [2022-04-27 12:08:03,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {812#true} assume true; {812#true} is VALID [2022-04-27 12:08:03,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {812#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(15, 2);call #Ultimate.allocInit(12, 3); {812#true} is VALID [2022-04-27 12:08:03,424 INFO L272 TraceCheckUtils]: 0: Hoare triple {812#true} call ULTIMATE.init(); {812#true} is VALID [2022-04-27 12:08:03,425 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:08:03,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:08:03,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807500633] [2022-04-27 12:08:03,425 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:08:03,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743331611] [2022-04-27 12:08:03,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743331611] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:08:03,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:08:03,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2022-04-27 12:08:03,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047522302] [2022-04-27 12:08:03,425 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:08:03,426 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 32 [2022-04-27 12:08:03,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:08:03,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-27 12:08:03,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:08:03,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 12:08:03,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:08:03,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 12:08:03,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-04-27 12:08:03,467 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-27 12:08:04,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:08:04,427 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-27 12:08:04,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 12:08:04,427 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 32 [2022-04-27 12:08:04,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:08:04,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-27 12:08:04,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 64 transitions. [2022-04-27 12:08:04,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-27 12:08:04,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 64 transitions. [2022-04-27 12:08:04,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 64 transitions. [2022-04-27 12:08:04,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:08:04,488 INFO L225 Difference]: With dead ends: 59 [2022-04-27 12:08:04,488 INFO L226 Difference]: Without dead ends: 44 [2022-04-27 12:08:04,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2022-04-27 12:08:04,489 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 41 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 12:08:04,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 116 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 12:08:04,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-27 12:08:04,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2022-04-27 12:08:04,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:08:04,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 42 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:08:04,509 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 42 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:08:04,509 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 42 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:08:04,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:08:04,510 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-27 12:08:04,510 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-04-27 12:08:04,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:08:04,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:08:04,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-27 12:08:04,511 INFO L87 Difference]: Start difference. First operand has 42 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-27 12:08:04,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:08:04,513 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-27 12:08:04,513 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-04-27 12:08:04,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:08:04,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:08:04,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:08:04,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:08:04,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:08:04,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-04-27 12:08:04,514 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 32 [2022-04-27 12:08:04,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:08:04,515 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-04-27 12:08:04,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-27 12:08:04,515 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-27 12:08:04,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 12:08:04,515 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:08:04,516 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:08:04,539 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 12:08:04,729 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 12:08:04,729 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:08:04,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:08:04,729 INFO L85 PathProgramCache]: Analyzing trace with hash 125050924, now seen corresponding path program 1 times [2022-04-27 12:08:04,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:08:04,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214375774] [2022-04-27 12:08:04,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:08:04,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:08:04,747 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:08:04,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [49624524] [2022-04-27 12:08:04,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:08:04,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:08:04,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:08:04,749 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 12:08:04,750 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 12:08:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:08:04,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-27 12:08:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:08:04,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:08:05,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {1262#true} call ULTIMATE.init(); {1262#true} is VALID [2022-04-27 12:08:05,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {1262#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(15, 2);call #Ultimate.allocInit(12, 3); {1262#true} is VALID [2022-04-27 12:08:05,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {1262#true} assume true; {1262#true} is VALID [2022-04-27 12:08:05,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1262#true} {1262#true} #69#return; {1262#true} is VALID [2022-04-27 12:08:05,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {1262#true} call #t~ret8 := main(); {1262#true} is VALID [2022-04-27 12:08:05,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {1262#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {1262#true} is VALID [2022-04-27 12:08:05,191 INFO L272 TraceCheckUtils]: 6: Hoare triple {1262#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {1262#true} is VALID [2022-04-27 12:08:05,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {1262#true} ~cond := #in~cond; {1262#true} is VALID [2022-04-27 12:08:05,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {1262#true} assume !(0 == ~cond); {1262#true} is VALID [2022-04-27 12:08:05,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {1262#true} assume true; {1262#true} is VALID [2022-04-27 12:08:05,192 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1262#true} {1262#true} #61#return; {1262#true} is VALID [2022-04-27 12:08:05,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {1262#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {1262#true} is VALID [2022-04-27 12:08:05,192 INFO L272 TraceCheckUtils]: 12: Hoare triple {1262#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {1262#true} is VALID [2022-04-27 12:08:05,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {1262#true} ~cond := #in~cond; {1262#true} is VALID [2022-04-27 12:08:05,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {1262#true} assume !(0 == ~cond); {1262#true} is VALID [2022-04-27 12:08:05,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {1262#true} assume true; {1262#true} is VALID [2022-04-27 12:08:05,192 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1262#true} {1262#true} #63#return; {1262#true} is VALID [2022-04-27 12:08:05,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {1262#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1318#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:08:05,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {1318#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1318#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:08:05,193 INFO L272 TraceCheckUtils]: 19: Hoare triple {1318#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1262#true} is VALID [2022-04-27 12:08:05,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {1262#true} ~cond := #in~cond; {1262#true} is VALID [2022-04-27 12:08:05,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {1262#true} assume !(0 == ~cond); {1262#true} is VALID [2022-04-27 12:08:05,193 INFO L290 TraceCheckUtils]: 22: Hoare triple {1262#true} assume true; {1262#true} is VALID [2022-04-27 12:08:05,194 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1262#true} {1318#(and (= main_~x~0 0) (= main_~y~0 0))} #65#return; {1318#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:08:05,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {1318#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {1340#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 12:08:05,195 INFO L290 TraceCheckUtils]: 25: Hoare triple {1340#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1344#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:08:05,195 INFO L290 TraceCheckUtils]: 26: Hoare triple {1344#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1348#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-27 12:08:05,196 INFO L290 TraceCheckUtils]: 27: Hoare triple {1348#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (<= main_~x~0 (+ main_~X~0 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1352#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-27 12:08:05,196 INFO L272 TraceCheckUtils]: 28: Hoare triple {1352#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1262#true} is VALID [2022-04-27 12:08:05,196 INFO L290 TraceCheckUtils]: 29: Hoare triple {1262#true} ~cond := #in~cond; {1359#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:08:05,197 INFO L290 TraceCheckUtils]: 30: Hoare triple {1359#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1363#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:08:05,197 INFO L290 TraceCheckUtils]: 31: Hoare triple {1363#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1363#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:08:05,198 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1363#(not (= |__VERIFIER_assert_#in~cond| 0))} {1352#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} #65#return; {1370#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-27 12:08:05,199 INFO L290 TraceCheckUtils]: 33: Hoare triple {1370#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~x~0 (+ main_~X~0 1)))} assume !(~x~0 <= ~X~0); {1374#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-27 12:08:05,200 INFO L290 TraceCheckUtils]: 34: Hoare triple {1374#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1378#(and (not (<= 1 main_~X~0)) (= main_~y~0 main_~xy~0) (= main_~y~0 1) (<= 0 main_~X~0) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (* main_~Y~0 4)) (= main_~Y~0 main_~yx~0))} is VALID [2022-04-27 12:08:05,201 INFO L272 TraceCheckUtils]: 35: Hoare triple {1378#(and (not (<= 1 main_~X~0)) (= main_~y~0 main_~xy~0) (= main_~y~0 1) (<= 0 main_~X~0) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (* main_~Y~0 4)) (= main_~Y~0 main_~yx~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {1382#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:08:05,202 INFO L290 TraceCheckUtils]: 36: Hoare triple {1382#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1386#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:08:05,202 INFO L290 TraceCheckUtils]: 37: Hoare triple {1386#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1263#false} is VALID [2022-04-27 12:08:05,202 INFO L290 TraceCheckUtils]: 38: Hoare triple {1263#false} assume !false; {1263#false} is VALID [2022-04-27 12:08:05,202 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 12:08:05,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:08:05,803 INFO L290 TraceCheckUtils]: 38: Hoare triple {1263#false} assume !false; {1263#false} is VALID [2022-04-27 12:08:05,803 INFO L290 TraceCheckUtils]: 37: Hoare triple {1386#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1263#false} is VALID [2022-04-27 12:08:05,803 INFO L290 TraceCheckUtils]: 36: Hoare triple {1382#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1386#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:08:05,804 INFO L272 TraceCheckUtils]: 35: Hoare triple {1402#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {1382#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:08:05,805 INFO L290 TraceCheckUtils]: 34: Hoare triple {1406#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1402#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} is VALID [2022-04-27 12:08:05,805 INFO L290 TraceCheckUtils]: 33: Hoare triple {1410#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !(~x~0 <= ~X~0); {1406#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-27 12:08:05,809 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1363#(not (= |__VERIFIER_assert_#in~cond| 0))} {1414#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #65#return; {1410#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-27 12:08:05,809 INFO L290 TraceCheckUtils]: 31: Hoare triple {1363#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1363#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:08:05,810 INFO L290 TraceCheckUtils]: 30: Hoare triple {1424#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1363#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:08:05,810 INFO L290 TraceCheckUtils]: 29: Hoare triple {1262#true} ~cond := #in~cond; {1424#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:08:05,810 INFO L272 TraceCheckUtils]: 28: Hoare triple {1414#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1262#true} is VALID [2022-04-27 12:08:05,811 INFO L290 TraceCheckUtils]: 27: Hoare triple {1431#(or (<= main_~x~0 main_~X~0) (forall ((main_~Y~0 Int)) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1414#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-27 12:08:05,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {1435#(or (<= (+ main_~x~0 1) main_~X~0) (forall ((main_~Y~0 Int)) (= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* (+ main_~x~0 1) main_~Y~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1431#(or (<= main_~x~0 main_~X~0) (forall ((main_~Y~0 Int)) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))))} is VALID [2022-04-27 12:08:05,814 INFO L290 TraceCheckUtils]: 25: Hoare triple {1439#(or (forall ((main_~Y~0 Int)) (= (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1))) (* (* main_~X~0 (+ main_~y~0 1)) (- 2))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))) (<= (+ main_~x~0 1) main_~X~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1435#(or (<= (+ main_~x~0 1) main_~X~0) (forall ((main_~Y~0 Int)) (= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* (+ main_~x~0 1) main_~Y~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))))} is VALID [2022-04-27 12:08:05,815 INFO L290 TraceCheckUtils]: 24: Hoare triple {1262#true} assume !!(~x~0 <= ~X~0); {1439#(or (forall ((main_~Y~0 Int)) (= (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1))) (* (* main_~X~0 (+ main_~y~0 1)) (- 2))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-27 12:08:05,815 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1262#true} {1262#true} #65#return; {1262#true} is VALID [2022-04-27 12:08:05,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {1262#true} assume true; {1262#true} is VALID [2022-04-27 12:08:05,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {1262#true} assume !(0 == ~cond); {1262#true} is VALID [2022-04-27 12:08:05,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {1262#true} ~cond := #in~cond; {1262#true} is VALID [2022-04-27 12:08:05,816 INFO L272 TraceCheckUtils]: 19: Hoare triple {1262#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1262#true} is VALID [2022-04-27 12:08:05,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {1262#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1262#true} is VALID [2022-04-27 12:08:05,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {1262#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1262#true} is VALID [2022-04-27 12:08:05,816 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1262#true} {1262#true} #63#return; {1262#true} is VALID [2022-04-27 12:08:05,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {1262#true} assume true; {1262#true} is VALID [2022-04-27 12:08:05,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {1262#true} assume !(0 == ~cond); {1262#true} is VALID [2022-04-27 12:08:05,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {1262#true} ~cond := #in~cond; {1262#true} is VALID [2022-04-27 12:08:05,816 INFO L272 TraceCheckUtils]: 12: Hoare triple {1262#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {1262#true} is VALID [2022-04-27 12:08:05,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {1262#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {1262#true} is VALID [2022-04-27 12:08:05,816 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1262#true} {1262#true} #61#return; {1262#true} is VALID [2022-04-27 12:08:05,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {1262#true} assume true; {1262#true} is VALID [2022-04-27 12:08:05,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {1262#true} assume !(0 == ~cond); {1262#true} is VALID [2022-04-27 12:08:05,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {1262#true} ~cond := #in~cond; {1262#true} is VALID [2022-04-27 12:08:05,817 INFO L272 TraceCheckUtils]: 6: Hoare triple {1262#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {1262#true} is VALID [2022-04-27 12:08:05,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {1262#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {1262#true} is VALID [2022-04-27 12:08:05,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {1262#true} call #t~ret8 := main(); {1262#true} is VALID [2022-04-27 12:08:05,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1262#true} {1262#true} #69#return; {1262#true} is VALID [2022-04-27 12:08:05,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {1262#true} assume true; {1262#true} is VALID [2022-04-27 12:08:05,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {1262#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(15, 2);call #Ultimate.allocInit(12, 3); {1262#true} is VALID [2022-04-27 12:08:05,817 INFO L272 TraceCheckUtils]: 0: Hoare triple {1262#true} call ULTIMATE.init(); {1262#true} is VALID [2022-04-27 12:08:05,817 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 12:08:05,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:08:05,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214375774] [2022-04-27 12:08:05,818 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:08:05,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49624524] [2022-04-27 12:08:05,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49624524] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:08:05,818 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:08:05,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2022-04-27 12:08:05,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766441193] [2022-04-27 12:08:05,818 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:08:05,818 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 19 states have internal predecessors, (34), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 39 [2022-04-27 12:08:05,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:08:05,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 19 states have internal predecessors, (34), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-27 12:08:05,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:08:05,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-27 12:08:05,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:08:05,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-27 12:08:05,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-04-27 12:08:05,865 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 19 states have internal predecessors, (34), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-27 12:08:06,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:08:06,869 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2022-04-27 12:08:06,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-27 12:08:06,869 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 19 states have internal predecessors, (34), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 39 [2022-04-27 12:08:06,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:08:06,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 19 states have internal predecessors, (34), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-27 12:08:06,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 58 transitions. [2022-04-27 12:08:06,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 19 states have internal predecessors, (34), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-27 12:08:06,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 58 transitions. [2022-04-27 12:08:06,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 58 transitions. [2022-04-27 12:08:06,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:08:06,928 INFO L225 Difference]: With dead ends: 55 [2022-04-27 12:08:06,929 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 12:08:06,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=194, Invalid=996, Unknown=0, NotChecked=0, Total=1190 [2022-04-27 12:08:06,930 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 40 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:08:06,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 160 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 191 Invalid, 0 Unknown, 62 Unchecked, 0.2s Time] [2022-04-27 12:08:06,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 12:08:06,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-04-27 12:08:06,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:08:06,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 46 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:08:06,954 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 46 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:08:06,954 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 46 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:08:06,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:08:06,955 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-27 12:08:06,955 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-27 12:08:06,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:08:06,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:08:06,956 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 47 states. [2022-04-27 12:08:06,956 INFO L87 Difference]: Start difference. First operand has 46 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 47 states. [2022-04-27 12:08:06,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:08:06,957 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-27 12:08:06,957 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-27 12:08:06,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:08:06,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:08:06,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:08:06,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:08:06,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:08:06,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-04-27 12:08:06,959 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 39 [2022-04-27 12:08:06,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:08:06,959 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-04-27 12:08:06,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 19 states have internal predecessors, (34), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-27 12:08:06,960 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-04-27 12:08:06,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-27 12:08:06,960 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:08:06,960 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:08:06,979 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 12:08:07,161 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 12:08:07,161 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:08:07,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:08:07,161 INFO L85 PathProgramCache]: Analyzing trace with hash 330652206, now seen corresponding path program 1 times [2022-04-27 12:08:07,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:08:07,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090630372] [2022-04-27 12:08:07,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:08:07,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:08:07,174 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:08:07,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2024754244] [2022-04-27 12:08:07,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:08:07,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:08:07,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:08:07,178 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 12:08:07,183 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 12:08:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:08:07,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 12:08:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:08:07,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:08:07,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {1780#true} call ULTIMATE.init(); {1780#true} is VALID [2022-04-27 12:08:07,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {1780#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(15, 2);call #Ultimate.allocInit(12, 3); {1780#true} is VALID [2022-04-27 12:08:07,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {1780#true} assume true; {1780#true} is VALID [2022-04-27 12:08:07,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1780#true} {1780#true} #69#return; {1780#true} is VALID [2022-04-27 12:08:07,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {1780#true} call #t~ret8 := main(); {1780#true} is VALID [2022-04-27 12:08:07,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {1780#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {1780#true} is VALID [2022-04-27 12:08:07,983 INFO L272 TraceCheckUtils]: 6: Hoare triple {1780#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {1780#true} is VALID [2022-04-27 12:08:07,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {1780#true} ~cond := #in~cond; {1780#true} is VALID [2022-04-27 12:08:07,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {1780#true} assume !(0 == ~cond); {1780#true} is VALID [2022-04-27 12:08:07,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {1780#true} assume true; {1780#true} is VALID [2022-04-27 12:08:07,983 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1780#true} {1780#true} #61#return; {1780#true} is VALID [2022-04-27 12:08:07,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {1780#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {1780#true} is VALID [2022-04-27 12:08:07,983 INFO L272 TraceCheckUtils]: 12: Hoare triple {1780#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {1780#true} is VALID [2022-04-27 12:08:07,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {1780#true} ~cond := #in~cond; {1780#true} is VALID [2022-04-27 12:08:07,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {1780#true} assume !(0 == ~cond); {1780#true} is VALID [2022-04-27 12:08:07,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {1780#true} assume true; {1780#true} is VALID [2022-04-27 12:08:07,984 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1780#true} {1780#true} #63#return; {1780#true} is VALID [2022-04-27 12:08:07,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {1780#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1836#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-27 12:08:07,997 INFO L290 TraceCheckUtils]: 18: Hoare triple {1836#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1836#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-27 12:08:07,997 INFO L272 TraceCheckUtils]: 19: Hoare triple {1836#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1780#true} is VALID [2022-04-27 12:08:07,998 INFO L290 TraceCheckUtils]: 20: Hoare triple {1780#true} ~cond := #in~cond; {1780#true} is VALID [2022-04-27 12:08:07,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {1780#true} assume !(0 == ~cond); {1780#true} is VALID [2022-04-27 12:08:07,998 INFO L290 TraceCheckUtils]: 22: Hoare triple {1780#true} assume true; {1780#true} is VALID [2022-04-27 12:08:08,001 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1780#true} {1836#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} #65#return; {1836#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-27 12:08:08,008 INFO L290 TraceCheckUtils]: 24: Hoare triple {1836#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} assume !!(~x~0 <= ~X~0); {1836#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-27 12:08:08,008 INFO L290 TraceCheckUtils]: 25: Hoare triple {1836#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1861#(and (<= main_~x~0 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-27 12:08:08,009 INFO L290 TraceCheckUtils]: 26: Hoare triple {1861#(and (<= main_~x~0 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1865#(and (<= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-27 12:08:08,009 INFO L290 TraceCheckUtils]: 27: Hoare triple {1865#(and (<= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1865#(and (<= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-27 12:08:08,009 INFO L272 TraceCheckUtils]: 28: Hoare triple {1865#(and (<= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1780#true} is VALID [2022-04-27 12:08:08,009 INFO L290 TraceCheckUtils]: 29: Hoare triple {1780#true} ~cond := #in~cond; {1780#true} is VALID [2022-04-27 12:08:08,009 INFO L290 TraceCheckUtils]: 30: Hoare triple {1780#true} assume !(0 == ~cond); {1780#true} is VALID [2022-04-27 12:08:08,009 INFO L290 TraceCheckUtils]: 31: Hoare triple {1780#true} assume true; {1780#true} is VALID [2022-04-27 12:08:08,010 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1780#true} {1865#(and (<= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} #65#return; {1865#(and (<= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-27 12:08:08,010 INFO L290 TraceCheckUtils]: 33: Hoare triple {1865#(and (<= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume !!(~x~0 <= ~X~0); {1865#(and (<= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-27 12:08:08,013 INFO L290 TraceCheckUtils]: 34: Hoare triple {1865#(and (<= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1890#(and (<= (+ (div (+ (- 1) (* main_~X~0 3)) 4) 1) (div (+ main_~v~0 (* 5 main_~X~0)) 6)) (<= main_~x~0 1))} is VALID [2022-04-27 12:08:08,013 INFO L290 TraceCheckUtils]: 35: Hoare triple {1890#(and (<= (+ (div (+ (- 1) (* main_~X~0 3)) 4) 1) (div (+ main_~v~0 (* 5 main_~X~0)) 6)) (<= main_~x~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1894#(and (<= (+ (div (+ (- 1) (* main_~X~0 3)) 4) 1) (div (+ main_~v~0 (* 5 main_~X~0)) 6)) (<= main_~x~0 2))} is VALID [2022-04-27 12:08:08,013 INFO L290 TraceCheckUtils]: 36: Hoare triple {1894#(and (<= (+ (div (+ (- 1) (* main_~X~0 3)) 4) 1) (div (+ main_~v~0 (* 5 main_~X~0)) 6)) (<= main_~x~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1894#(and (<= (+ (div (+ (- 1) (* main_~X~0 3)) 4) 1) (div (+ main_~v~0 (* 5 main_~X~0)) 6)) (<= main_~x~0 2))} is VALID [2022-04-27 12:08:08,014 INFO L272 TraceCheckUtils]: 37: Hoare triple {1894#(and (<= (+ (div (+ (- 1) (* main_~X~0 3)) 4) 1) (div (+ main_~v~0 (* 5 main_~X~0)) 6)) (<= main_~x~0 2))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1780#true} is VALID [2022-04-27 12:08:08,014 INFO L290 TraceCheckUtils]: 38: Hoare triple {1780#true} ~cond := #in~cond; {1780#true} is VALID [2022-04-27 12:08:08,014 INFO L290 TraceCheckUtils]: 39: Hoare triple {1780#true} assume !(0 == ~cond); {1780#true} is VALID [2022-04-27 12:08:08,014 INFO L290 TraceCheckUtils]: 40: Hoare triple {1780#true} assume true; {1780#true} is VALID [2022-04-27 12:08:08,015 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1780#true} {1894#(and (<= (+ (div (+ (- 1) (* main_~X~0 3)) 4) 1) (div (+ main_~v~0 (* 5 main_~X~0)) 6)) (<= main_~x~0 2))} #65#return; {1894#(and (<= (+ (div (+ (- 1) (* main_~X~0 3)) 4) 1) (div (+ main_~v~0 (* 5 main_~X~0)) 6)) (<= main_~x~0 2))} is VALID [2022-04-27 12:08:08,015 INFO L290 TraceCheckUtils]: 42: Hoare triple {1894#(and (<= (+ (div (+ (- 1) (* main_~X~0 3)) 4) 1) (div (+ main_~v~0 (* 5 main_~X~0)) 6)) (<= main_~x~0 2))} assume !!(~x~0 <= ~X~0); {1894#(and (<= (+ (div (+ (- 1) (* main_~X~0 3)) 4) 1) (div (+ main_~v~0 (* 5 main_~X~0)) 6)) (<= main_~x~0 2))} is VALID [2022-04-27 12:08:08,016 INFO L290 TraceCheckUtils]: 43: Hoare triple {1894#(and (<= (+ (div (+ (- 1) (* main_~X~0 3)) 4) 1) (div (+ main_~v~0 (* 5 main_~X~0)) 6)) (<= main_~x~0 2))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {1919#(and (< (div (+ (- 1) (* main_~X~0 3)) 4) (div (+ (- 1) (* 5 main_~X~0)) 6)) (<= main_~x~0 2))} is VALID [2022-04-27 12:08:08,016 INFO L290 TraceCheckUtils]: 44: Hoare triple {1919#(and (< (div (+ (- 1) (* main_~X~0 3)) 4) (div (+ (- 1) (* 5 main_~X~0)) 6)) (<= main_~x~0 2))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1923#(and (< (div (+ (- 1) (* main_~X~0 3)) 4) (div (+ (- 1) (* 5 main_~X~0)) 6)) (<= main_~x~0 3))} is VALID [2022-04-27 12:08:08,017 INFO L290 TraceCheckUtils]: 45: Hoare triple {1923#(and (< (div (+ (- 1) (* main_~X~0 3)) 4) (div (+ (- 1) (* 5 main_~X~0)) 6)) (<= main_~x~0 3))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1923#(and (< (div (+ (- 1) (* main_~X~0 3)) 4) (div (+ (- 1) (* 5 main_~X~0)) 6)) (<= main_~x~0 3))} is VALID [2022-04-27 12:08:08,017 INFO L272 TraceCheckUtils]: 46: Hoare triple {1923#(and (< (div (+ (- 1) (* main_~X~0 3)) 4) (div (+ (- 1) (* 5 main_~X~0)) 6)) (<= main_~x~0 3))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1780#true} is VALID [2022-04-27 12:08:08,017 INFO L290 TraceCheckUtils]: 47: Hoare triple {1780#true} ~cond := #in~cond; {1780#true} is VALID [2022-04-27 12:08:08,017 INFO L290 TraceCheckUtils]: 48: Hoare triple {1780#true} assume !(0 == ~cond); {1780#true} is VALID [2022-04-27 12:08:08,017 INFO L290 TraceCheckUtils]: 49: Hoare triple {1780#true} assume true; {1780#true} is VALID [2022-04-27 12:08:08,018 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1780#true} {1923#(and (< (div (+ (- 1) (* main_~X~0 3)) 4) (div (+ (- 1) (* 5 main_~X~0)) 6)) (<= main_~x~0 3))} #65#return; {1923#(and (< (div (+ (- 1) (* main_~X~0 3)) 4) (div (+ (- 1) (* 5 main_~X~0)) 6)) (<= main_~x~0 3))} is VALID [2022-04-27 12:08:08,019 INFO L290 TraceCheckUtils]: 51: Hoare triple {1923#(and (< (div (+ (- 1) (* main_~X~0 3)) 4) (div (+ (- 1) (* 5 main_~X~0)) 6)) (<= main_~x~0 3))} assume !(~x~0 <= ~X~0); {1781#false} is VALID [2022-04-27 12:08:08,019 INFO L290 TraceCheckUtils]: 52: Hoare triple {1781#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1781#false} is VALID [2022-04-27 12:08:08,019 INFO L272 TraceCheckUtils]: 53: Hoare triple {1781#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {1781#false} is VALID [2022-04-27 12:08:08,019 INFO L290 TraceCheckUtils]: 54: Hoare triple {1781#false} ~cond := #in~cond; {1781#false} is VALID [2022-04-27 12:08:08,019 INFO L290 TraceCheckUtils]: 55: Hoare triple {1781#false} assume 0 == ~cond; {1781#false} is VALID [2022-04-27 12:08:08,019 INFO L290 TraceCheckUtils]: 56: Hoare triple {1781#false} assume !false; {1781#false} is VALID [2022-04-27 12:08:08,019 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 12:08:08,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:08:08,453 INFO L290 TraceCheckUtils]: 56: Hoare triple {1781#false} assume !false; {1781#false} is VALID [2022-04-27 12:08:08,453 INFO L290 TraceCheckUtils]: 55: Hoare triple {1781#false} assume 0 == ~cond; {1781#false} is VALID [2022-04-27 12:08:08,453 INFO L290 TraceCheckUtils]: 54: Hoare triple {1781#false} ~cond := #in~cond; {1781#false} is VALID [2022-04-27 12:08:08,453 INFO L272 TraceCheckUtils]: 53: Hoare triple {1781#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {1781#false} is VALID [2022-04-27 12:08:08,453 INFO L290 TraceCheckUtils]: 52: Hoare triple {1781#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1781#false} is VALID [2022-04-27 12:08:08,453 INFO L290 TraceCheckUtils]: 51: Hoare triple {1975#(<= main_~x~0 main_~X~0)} assume !(~x~0 <= ~X~0); {1781#false} is VALID [2022-04-27 12:08:08,454 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1780#true} {1975#(<= main_~x~0 main_~X~0)} #65#return; {1975#(<= main_~x~0 main_~X~0)} is VALID [2022-04-27 12:08:08,454 INFO L290 TraceCheckUtils]: 49: Hoare triple {1780#true} assume true; {1780#true} is VALID [2022-04-27 12:08:08,454 INFO L290 TraceCheckUtils]: 48: Hoare triple {1780#true} assume !(0 == ~cond); {1780#true} is VALID [2022-04-27 12:08:08,454 INFO L290 TraceCheckUtils]: 47: Hoare triple {1780#true} ~cond := #in~cond; {1780#true} is VALID [2022-04-27 12:08:08,454 INFO L272 TraceCheckUtils]: 46: Hoare triple {1975#(<= main_~x~0 main_~X~0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1780#true} is VALID [2022-04-27 12:08:08,455 INFO L290 TraceCheckUtils]: 45: Hoare triple {1975#(<= main_~x~0 main_~X~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1975#(<= main_~x~0 main_~X~0)} is VALID [2022-04-27 12:08:08,455 INFO L290 TraceCheckUtils]: 44: Hoare triple {1997#(<= (+ main_~x~0 1) main_~X~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1975#(<= main_~x~0 main_~X~0)} is VALID [2022-04-27 12:08:08,456 INFO L290 TraceCheckUtils]: 43: Hoare triple {2001#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {1997#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-27 12:08:08,456 INFO L290 TraceCheckUtils]: 42: Hoare triple {2001#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} assume !!(~x~0 <= ~X~0); {2001#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-27 12:08:08,457 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1780#true} {2001#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} #65#return; {2001#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-27 12:08:08,457 INFO L290 TraceCheckUtils]: 40: Hoare triple {1780#true} assume true; {1780#true} is VALID [2022-04-27 12:08:08,457 INFO L290 TraceCheckUtils]: 39: Hoare triple {1780#true} assume !(0 == ~cond); {1780#true} is VALID [2022-04-27 12:08:08,457 INFO L290 TraceCheckUtils]: 38: Hoare triple {1780#true} ~cond := #in~cond; {1780#true} is VALID [2022-04-27 12:08:08,457 INFO L272 TraceCheckUtils]: 37: Hoare triple {2001#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1780#true} is VALID [2022-04-27 12:08:08,457 INFO L290 TraceCheckUtils]: 36: Hoare triple {2001#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2001#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-27 12:08:08,458 INFO L290 TraceCheckUtils]: 35: Hoare triple {2026#(or (<= (+ main_~x~0 2) main_~X~0) (not (< main_~v~0 0)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2001#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-27 12:08:08,459 INFO L290 TraceCheckUtils]: 34: Hoare triple {2030#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2026#(or (<= (+ main_~x~0 2) main_~X~0) (not (< main_~v~0 0)))} is VALID [2022-04-27 12:08:08,459 INFO L290 TraceCheckUtils]: 33: Hoare triple {2030#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0))} assume !!(~x~0 <= ~X~0); {2030#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0))} is VALID [2022-04-27 12:08:08,460 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1780#true} {2030#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0))} #65#return; {2030#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0))} is VALID [2022-04-27 12:08:08,460 INFO L290 TraceCheckUtils]: 31: Hoare triple {1780#true} assume true; {1780#true} is VALID [2022-04-27 12:08:08,460 INFO L290 TraceCheckUtils]: 30: Hoare triple {1780#true} assume !(0 == ~cond); {1780#true} is VALID [2022-04-27 12:08:08,460 INFO L290 TraceCheckUtils]: 29: Hoare triple {1780#true} ~cond := #in~cond; {1780#true} is VALID [2022-04-27 12:08:08,460 INFO L272 TraceCheckUtils]: 28: Hoare triple {2030#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1780#true} is VALID [2022-04-27 12:08:08,460 INFO L290 TraceCheckUtils]: 27: Hoare triple {2030#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2030#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0))} is VALID [2022-04-27 12:08:08,461 INFO L290 TraceCheckUtils]: 26: Hoare triple {2055#(or (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0) (<= (+ main_~x~0 3) main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2030#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0))} is VALID [2022-04-27 12:08:08,462 INFO L290 TraceCheckUtils]: 25: Hoare triple {2059#(or (<= (+ main_~x~0 3) main_~X~0) (<= (* main_~X~0 4) (+ main_~v~0 (* main_~Y~0 4))) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2055#(or (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0) (<= (+ main_~x~0 3) main_~X~0))} is VALID [2022-04-27 12:08:08,462 INFO L290 TraceCheckUtils]: 24: Hoare triple {2059#(or (<= (+ main_~x~0 3) main_~X~0) (<= (* main_~X~0 4) (+ main_~v~0 (* main_~Y~0 4))) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)))} assume !!(~x~0 <= ~X~0); {2059#(or (<= (+ main_~x~0 3) main_~X~0) (<= (* main_~X~0 4) (+ main_~v~0 (* main_~Y~0 4))) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)))} is VALID [2022-04-27 12:08:08,463 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1780#true} {2059#(or (<= (+ main_~x~0 3) main_~X~0) (<= (* main_~X~0 4) (+ main_~v~0 (* main_~Y~0 4))) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)))} #65#return; {2059#(or (<= (+ main_~x~0 3) main_~X~0) (<= (* main_~X~0 4) (+ main_~v~0 (* main_~Y~0 4))) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)))} is VALID [2022-04-27 12:08:08,463 INFO L290 TraceCheckUtils]: 22: Hoare triple {1780#true} assume true; {1780#true} is VALID [2022-04-27 12:08:08,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {1780#true} assume !(0 == ~cond); {1780#true} is VALID [2022-04-27 12:08:08,463 INFO L290 TraceCheckUtils]: 20: Hoare triple {1780#true} ~cond := #in~cond; {1780#true} is VALID [2022-04-27 12:08:08,463 INFO L272 TraceCheckUtils]: 19: Hoare triple {2059#(or (<= (+ main_~x~0 3) main_~X~0) (<= (* main_~X~0 4) (+ main_~v~0 (* main_~Y~0 4))) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1780#true} is VALID [2022-04-27 12:08:08,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {2059#(or (<= (+ main_~x~0 3) main_~X~0) (<= (* main_~X~0 4) (+ main_~v~0 (* main_~Y~0 4))) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2059#(or (<= (+ main_~x~0 3) main_~X~0) (<= (* main_~X~0 4) (+ main_~v~0 (* main_~Y~0 4))) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)))} is VALID [2022-04-27 12:08:08,464 INFO L290 TraceCheckUtils]: 17: Hoare triple {1780#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2059#(or (<= (+ main_~x~0 3) main_~X~0) (<= (* main_~X~0 4) (+ main_~v~0 (* main_~Y~0 4))) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)))} is VALID [2022-04-27 12:08:08,464 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1780#true} {1780#true} #63#return; {1780#true} is VALID [2022-04-27 12:08:08,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {1780#true} assume true; {1780#true} is VALID [2022-04-27 12:08:08,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {1780#true} assume !(0 == ~cond); {1780#true} is VALID [2022-04-27 12:08:08,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {1780#true} ~cond := #in~cond; {1780#true} is VALID [2022-04-27 12:08:08,464 INFO L272 TraceCheckUtils]: 12: Hoare triple {1780#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {1780#true} is VALID [2022-04-27 12:08:08,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {1780#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {1780#true} is VALID [2022-04-27 12:08:08,465 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1780#true} {1780#true} #61#return; {1780#true} is VALID [2022-04-27 12:08:08,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {1780#true} assume true; {1780#true} is VALID [2022-04-27 12:08:08,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {1780#true} assume !(0 == ~cond); {1780#true} is VALID [2022-04-27 12:08:08,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {1780#true} ~cond := #in~cond; {1780#true} is VALID [2022-04-27 12:08:08,465 INFO L272 TraceCheckUtils]: 6: Hoare triple {1780#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {1780#true} is VALID [2022-04-27 12:08:08,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {1780#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {1780#true} is VALID [2022-04-27 12:08:08,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {1780#true} call #t~ret8 := main(); {1780#true} is VALID [2022-04-27 12:08:08,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1780#true} {1780#true} #69#return; {1780#true} is VALID [2022-04-27 12:08:08,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {1780#true} assume true; {1780#true} is VALID [2022-04-27 12:08:08,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {1780#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(15, 2);call #Ultimate.allocInit(12, 3); {1780#true} is VALID [2022-04-27 12:08:08,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {1780#true} call ULTIMATE.init(); {1780#true} is VALID [2022-04-27 12:08:08,466 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 12:08:08,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:08:08,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090630372] [2022-04-27 12:08:08,466 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:08:08,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024754244] [2022-04-27 12:08:08,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024754244] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:08:08,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:08:08,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-27 12:08:08,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062700313] [2022-04-27 12:08:08,466 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:08:08,467 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 57 [2022-04-27 12:08:08,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:08:08,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-27 12:08:08,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:08:08,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 12:08:08,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:08:08,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 12:08:08,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-04-27 12:08:08,523 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-27 12:08:09,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:08:09,344 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2022-04-27 12:08:09,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 12:08:09,345 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 57 [2022-04-27 12:08:09,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:08:09,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-27 12:08:09,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 75 transitions. [2022-04-27 12:08:09,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-27 12:08:09,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 75 transitions. [2022-04-27 12:08:09,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 75 transitions. [2022-04-27 12:08:09,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:08:09,409 INFO L225 Difference]: With dead ends: 76 [2022-04-27 12:08:09,409 INFO L226 Difference]: Without dead ends: 70 [2022-04-27 12:08:09,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2022-04-27 12:08:09,410 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 12:08:09,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 120 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 12:08:09,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-27 12:08:09,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 56. [2022-04-27 12:08:09,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:08:09,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 56 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:08:09,461 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 56 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:08:09,462 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 56 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:08:09,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:08:09,463 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2022-04-27 12:08:09,463 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2022-04-27 12:08:09,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:08:09,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:08:09,464 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 70 states. [2022-04-27 12:08:09,464 INFO L87 Difference]: Start difference. First operand has 56 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 70 states. [2022-04-27 12:08:09,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:08:09,466 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2022-04-27 12:08:09,466 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2022-04-27 12:08:09,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:08:09,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:08:09,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:08:09,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:08:09,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:08:09,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2022-04-27 12:08:09,468 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 57 [2022-04-27 12:08:09,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:08:09,468 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2022-04-27 12:08:09,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-27 12:08:09,468 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2022-04-27 12:08:09,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-27 12:08:09,469 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:08:09,469 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:08:09,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 12:08:09,685 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 12:08:09,686 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:08:09,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:08:09,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1832016594, now seen corresponding path program 2 times [2022-04-27 12:08:09,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:08:09,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083176630] [2022-04-27 12:08:09,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:08:09,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:08:09,699 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:08:09,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [840705702] [2022-04-27 12:08:09,699 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:08:09,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:08:09,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:08:09,700 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 12:08:09,701 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 12:08:09,745 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 12:08:09,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:08:09,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 12:08:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:08:09,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:08:10,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {2483#true} call ULTIMATE.init(); {2483#true} is VALID [2022-04-27 12:08:10,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {2483#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(15, 2);call #Ultimate.allocInit(12, 3); {2483#true} is VALID [2022-04-27 12:08:10,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-27 12:08:10,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2483#true} {2483#true} #69#return; {2483#true} is VALID [2022-04-27 12:08:10,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {2483#true} call #t~ret8 := main(); {2483#true} is VALID [2022-04-27 12:08:10,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {2483#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {2483#true} is VALID [2022-04-27 12:08:10,212 INFO L272 TraceCheckUtils]: 6: Hoare triple {2483#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {2483#true} is VALID [2022-04-27 12:08:10,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-27 12:08:10,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-27 12:08:10,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-27 12:08:10,212 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2483#true} {2483#true} #61#return; {2483#true} is VALID [2022-04-27 12:08:10,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {2483#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2483#true} is VALID [2022-04-27 12:08:10,212 INFO L272 TraceCheckUtils]: 12: Hoare triple {2483#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {2483#true} is VALID [2022-04-27 12:08:10,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-27 12:08:10,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-27 12:08:10,213 INFO L290 TraceCheckUtils]: 15: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-27 12:08:10,213 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2483#true} {2483#true} #63#return; {2483#true} is VALID [2022-04-27 12:08:10,213 INFO L290 TraceCheckUtils]: 17: Hoare triple {2483#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2539#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-27 12:08:10,214 INFO L290 TraceCheckUtils]: 18: Hoare triple {2539#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2539#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-27 12:08:10,214 INFO L272 TraceCheckUtils]: 19: Hoare triple {2539#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2483#true} is VALID [2022-04-27 12:08:10,214 INFO L290 TraceCheckUtils]: 20: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-27 12:08:10,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-27 12:08:10,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-27 12:08:10,216 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2483#true} {2539#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} #65#return; {2539#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-27 12:08:10,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {2539#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} assume !!(~x~0 <= ~X~0); {2539#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-27 12:08:10,221 INFO L290 TraceCheckUtils]: 25: Hoare triple {2539#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2564#(<= main_~X~0 (* main_~Y~0 2))} is VALID [2022-04-27 12:08:10,221 INFO L290 TraceCheckUtils]: 26: Hoare triple {2564#(<= main_~X~0 (* main_~Y~0 2))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2564#(<= main_~X~0 (* main_~Y~0 2))} is VALID [2022-04-27 12:08:10,222 INFO L290 TraceCheckUtils]: 27: Hoare triple {2564#(<= main_~X~0 (* main_~Y~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2564#(<= main_~X~0 (* main_~Y~0 2))} is VALID [2022-04-27 12:08:10,222 INFO L272 TraceCheckUtils]: 28: Hoare triple {2564#(<= main_~X~0 (* main_~Y~0 2))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2483#true} is VALID [2022-04-27 12:08:10,222 INFO L290 TraceCheckUtils]: 29: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-27 12:08:10,222 INFO L290 TraceCheckUtils]: 30: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-27 12:08:10,222 INFO L290 TraceCheckUtils]: 31: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-27 12:08:10,223 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2483#true} {2564#(<= main_~X~0 (* main_~Y~0 2))} #65#return; {2564#(<= main_~X~0 (* main_~Y~0 2))} is VALID [2022-04-27 12:08:10,223 INFO L290 TraceCheckUtils]: 33: Hoare triple {2564#(<= main_~X~0 (* main_~Y~0 2))} assume !!(~x~0 <= ~X~0); {2564#(<= main_~X~0 (* main_~Y~0 2))} is VALID [2022-04-27 12:08:10,224 INFO L290 TraceCheckUtils]: 34: Hoare triple {2564#(<= main_~X~0 (* main_~Y~0 2))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-27 12:08:10,224 INFO L290 TraceCheckUtils]: 35: Hoare triple {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-27 12:08:10,224 INFO L290 TraceCheckUtils]: 36: Hoare triple {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-27 12:08:10,224 INFO L272 TraceCheckUtils]: 37: Hoare triple {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2483#true} is VALID [2022-04-27 12:08:10,224 INFO L290 TraceCheckUtils]: 38: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-27 12:08:10,224 INFO L290 TraceCheckUtils]: 39: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-27 12:08:10,224 INFO L290 TraceCheckUtils]: 40: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-27 12:08:10,225 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2483#true} {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} #65#return; {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-27 12:08:10,225 INFO L290 TraceCheckUtils]: 42: Hoare triple {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} assume !!(~x~0 <= ~X~0); {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-27 12:08:10,226 INFO L290 TraceCheckUtils]: 43: Hoare triple {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2620#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-27 12:08:10,226 INFO L290 TraceCheckUtils]: 44: Hoare triple {2620#(<= (div main_~v~0 (- 2)) 0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2620#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-27 12:08:10,226 INFO L290 TraceCheckUtils]: 45: Hoare triple {2620#(<= (div main_~v~0 (- 2)) 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2620#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-27 12:08:10,226 INFO L272 TraceCheckUtils]: 46: Hoare triple {2620#(<= (div main_~v~0 (- 2)) 0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2483#true} is VALID [2022-04-27 12:08:10,227 INFO L290 TraceCheckUtils]: 47: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-27 12:08:10,227 INFO L290 TraceCheckUtils]: 48: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-27 12:08:10,227 INFO L290 TraceCheckUtils]: 49: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-27 12:08:10,227 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2483#true} {2620#(<= (div main_~v~0 (- 2)) 0)} #65#return; {2620#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-27 12:08:10,228 INFO L290 TraceCheckUtils]: 51: Hoare triple {2620#(<= (div main_~v~0 (- 2)) 0)} assume !!(~x~0 <= ~X~0); {2620#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-27 12:08:10,228 INFO L290 TraceCheckUtils]: 52: Hoare triple {2620#(<= (div main_~v~0 (- 2)) 0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2484#false} is VALID [2022-04-27 12:08:10,228 INFO L290 TraceCheckUtils]: 53: Hoare triple {2484#false} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2484#false} is VALID [2022-04-27 12:08:10,228 INFO L290 TraceCheckUtils]: 54: Hoare triple {2484#false} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2484#false} is VALID [2022-04-27 12:08:10,228 INFO L272 TraceCheckUtils]: 55: Hoare triple {2484#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2484#false} is VALID [2022-04-27 12:08:10,228 INFO L290 TraceCheckUtils]: 56: Hoare triple {2484#false} ~cond := #in~cond; {2484#false} is VALID [2022-04-27 12:08:10,228 INFO L290 TraceCheckUtils]: 57: Hoare triple {2484#false} assume !(0 == ~cond); {2484#false} is VALID [2022-04-27 12:08:10,228 INFO L290 TraceCheckUtils]: 58: Hoare triple {2484#false} assume true; {2484#false} is VALID [2022-04-27 12:08:10,228 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2484#false} {2484#false} #65#return; {2484#false} is VALID [2022-04-27 12:08:10,229 INFO L290 TraceCheckUtils]: 60: Hoare triple {2484#false} assume !!(~x~0 <= ~X~0); {2484#false} is VALID [2022-04-27 12:08:10,229 INFO L290 TraceCheckUtils]: 61: Hoare triple {2484#false} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2484#false} is VALID [2022-04-27 12:08:10,229 INFO L290 TraceCheckUtils]: 62: Hoare triple {2484#false} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2484#false} is VALID [2022-04-27 12:08:10,229 INFO L290 TraceCheckUtils]: 63: Hoare triple {2484#false} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2484#false} is VALID [2022-04-27 12:08:10,229 INFO L272 TraceCheckUtils]: 64: Hoare triple {2484#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2484#false} is VALID [2022-04-27 12:08:10,229 INFO L290 TraceCheckUtils]: 65: Hoare triple {2484#false} ~cond := #in~cond; {2484#false} is VALID [2022-04-27 12:08:10,229 INFO L290 TraceCheckUtils]: 66: Hoare triple {2484#false} assume !(0 == ~cond); {2484#false} is VALID [2022-04-27 12:08:10,229 INFO L290 TraceCheckUtils]: 67: Hoare triple {2484#false} assume true; {2484#false} is VALID [2022-04-27 12:08:10,229 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {2484#false} {2484#false} #65#return; {2484#false} is VALID [2022-04-27 12:08:10,229 INFO L290 TraceCheckUtils]: 69: Hoare triple {2484#false} assume !(~x~0 <= ~X~0); {2484#false} is VALID [2022-04-27 12:08:10,229 INFO L290 TraceCheckUtils]: 70: Hoare triple {2484#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {2484#false} is VALID [2022-04-27 12:08:10,229 INFO L272 TraceCheckUtils]: 71: Hoare triple {2484#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {2484#false} is VALID [2022-04-27 12:08:10,229 INFO L290 TraceCheckUtils]: 72: Hoare triple {2484#false} ~cond := #in~cond; {2484#false} is VALID [2022-04-27 12:08:10,229 INFO L290 TraceCheckUtils]: 73: Hoare triple {2484#false} assume 0 == ~cond; {2484#false} is VALID [2022-04-27 12:08:10,229 INFO L290 TraceCheckUtils]: 74: Hoare triple {2484#false} assume !false; {2484#false} is VALID [2022-04-27 12:08:10,230 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 74 proven. 27 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 12:08:10,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:08:10,638 INFO L290 TraceCheckUtils]: 74: Hoare triple {2484#false} assume !false; {2484#false} is VALID [2022-04-27 12:08:10,638 INFO L290 TraceCheckUtils]: 73: Hoare triple {2484#false} assume 0 == ~cond; {2484#false} is VALID [2022-04-27 12:08:10,638 INFO L290 TraceCheckUtils]: 72: Hoare triple {2484#false} ~cond := #in~cond; {2484#false} is VALID [2022-04-27 12:08:10,638 INFO L272 TraceCheckUtils]: 71: Hoare triple {2484#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {2484#false} is VALID [2022-04-27 12:08:10,638 INFO L290 TraceCheckUtils]: 70: Hoare triple {2484#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {2484#false} is VALID [2022-04-27 12:08:10,638 INFO L290 TraceCheckUtils]: 69: Hoare triple {2484#false} assume !(~x~0 <= ~X~0); {2484#false} is VALID [2022-04-27 12:08:10,638 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {2483#true} {2484#false} #65#return; {2484#false} is VALID [2022-04-27 12:08:10,639 INFO L290 TraceCheckUtils]: 67: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-27 12:08:10,639 INFO L290 TraceCheckUtils]: 66: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-27 12:08:10,639 INFO L290 TraceCheckUtils]: 65: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-27 12:08:10,639 INFO L272 TraceCheckUtils]: 64: Hoare triple {2484#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2483#true} is VALID [2022-04-27 12:08:10,639 INFO L290 TraceCheckUtils]: 63: Hoare triple {2484#false} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2484#false} is VALID [2022-04-27 12:08:10,639 INFO L290 TraceCheckUtils]: 62: Hoare triple {2484#false} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2484#false} is VALID [2022-04-27 12:08:10,639 INFO L290 TraceCheckUtils]: 61: Hoare triple {2484#false} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2484#false} is VALID [2022-04-27 12:08:10,639 INFO L290 TraceCheckUtils]: 60: Hoare triple {2484#false} assume !!(~x~0 <= ~X~0); {2484#false} is VALID [2022-04-27 12:08:10,639 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2483#true} {2484#false} #65#return; {2484#false} is VALID [2022-04-27 12:08:10,639 INFO L290 TraceCheckUtils]: 58: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-27 12:08:10,639 INFO L290 TraceCheckUtils]: 57: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-27 12:08:10,639 INFO L290 TraceCheckUtils]: 56: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-27 12:08:10,639 INFO L272 TraceCheckUtils]: 55: Hoare triple {2484#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2483#true} is VALID [2022-04-27 12:08:10,639 INFO L290 TraceCheckUtils]: 54: Hoare triple {2484#false} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2484#false} is VALID [2022-04-27 12:08:10,639 INFO L290 TraceCheckUtils]: 53: Hoare triple {2484#false} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2484#false} is VALID [2022-04-27 12:08:10,640 INFO L290 TraceCheckUtils]: 52: Hoare triple {2620#(<= (div main_~v~0 (- 2)) 0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2484#false} is VALID [2022-04-27 12:08:10,641 INFO L290 TraceCheckUtils]: 51: Hoare triple {2620#(<= (div main_~v~0 (- 2)) 0)} assume !!(~x~0 <= ~X~0); {2620#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-27 12:08:10,641 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2483#true} {2620#(<= (div main_~v~0 (- 2)) 0)} #65#return; {2620#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-27 12:08:10,641 INFO L290 TraceCheckUtils]: 49: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-27 12:08:10,641 INFO L290 TraceCheckUtils]: 48: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-27 12:08:10,641 INFO L290 TraceCheckUtils]: 47: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-27 12:08:10,642 INFO L272 TraceCheckUtils]: 46: Hoare triple {2620#(<= (div main_~v~0 (- 2)) 0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2483#true} is VALID [2022-04-27 12:08:10,642 INFO L290 TraceCheckUtils]: 45: Hoare triple {2620#(<= (div main_~v~0 (- 2)) 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2620#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-27 12:08:10,642 INFO L290 TraceCheckUtils]: 44: Hoare triple {2620#(<= (div main_~v~0 (- 2)) 0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2620#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-27 12:08:10,642 INFO L290 TraceCheckUtils]: 43: Hoare triple {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2620#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-27 12:08:10,643 INFO L290 TraceCheckUtils]: 42: Hoare triple {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} assume !!(~x~0 <= ~X~0); {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-27 12:08:10,643 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2483#true} {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} #65#return; {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-27 12:08:10,643 INFO L290 TraceCheckUtils]: 40: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-27 12:08:10,643 INFO L290 TraceCheckUtils]: 39: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-27 12:08:10,643 INFO L290 TraceCheckUtils]: 38: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-27 12:08:10,643 INFO L272 TraceCheckUtils]: 37: Hoare triple {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2483#true} is VALID [2022-04-27 12:08:10,644 INFO L290 TraceCheckUtils]: 36: Hoare triple {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-27 12:08:10,644 INFO L290 TraceCheckUtils]: 35: Hoare triple {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-27 12:08:10,645 INFO L290 TraceCheckUtils]: 34: Hoare triple {2564#(<= main_~X~0 (* main_~Y~0 2))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-27 12:08:10,645 INFO L290 TraceCheckUtils]: 33: Hoare triple {2564#(<= main_~X~0 (* main_~Y~0 2))} assume !!(~x~0 <= ~X~0); {2564#(<= main_~X~0 (* main_~Y~0 2))} is VALID [2022-04-27 12:08:10,645 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2483#true} {2564#(<= main_~X~0 (* main_~Y~0 2))} #65#return; {2564#(<= main_~X~0 (* main_~Y~0 2))} is VALID [2022-04-27 12:08:10,645 INFO L290 TraceCheckUtils]: 31: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-27 12:08:10,645 INFO L290 TraceCheckUtils]: 30: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-27 12:08:10,645 INFO L290 TraceCheckUtils]: 29: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-27 12:08:10,646 INFO L272 TraceCheckUtils]: 28: Hoare triple {2564#(<= main_~X~0 (* main_~Y~0 2))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2483#true} is VALID [2022-04-27 12:08:10,646 INFO L290 TraceCheckUtils]: 27: Hoare triple {2564#(<= main_~X~0 (* main_~Y~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2564#(<= main_~X~0 (* main_~Y~0 2))} is VALID [2022-04-27 12:08:10,646 INFO L290 TraceCheckUtils]: 26: Hoare triple {2564#(<= main_~X~0 (* main_~Y~0 2))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2564#(<= main_~X~0 (* main_~Y~0 2))} is VALID [2022-04-27 12:08:10,646 INFO L290 TraceCheckUtils]: 25: Hoare triple {2861#(or (< main_~v~0 0) (<= main_~X~0 (* main_~Y~0 2)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2564#(<= main_~X~0 (* main_~Y~0 2))} is VALID [2022-04-27 12:08:10,647 INFO L290 TraceCheckUtils]: 24: Hoare triple {2861#(or (< main_~v~0 0) (<= main_~X~0 (* main_~Y~0 2)))} assume !!(~x~0 <= ~X~0); {2861#(or (< main_~v~0 0) (<= main_~X~0 (* main_~Y~0 2)))} is VALID [2022-04-27 12:08:10,647 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2483#true} {2861#(or (< main_~v~0 0) (<= main_~X~0 (* main_~Y~0 2)))} #65#return; {2861#(or (< main_~v~0 0) (<= main_~X~0 (* main_~Y~0 2)))} is VALID [2022-04-27 12:08:10,647 INFO L290 TraceCheckUtils]: 22: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-27 12:08:10,647 INFO L290 TraceCheckUtils]: 21: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-27 12:08:10,647 INFO L290 TraceCheckUtils]: 20: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-27 12:08:10,648 INFO L272 TraceCheckUtils]: 19: Hoare triple {2861#(or (< main_~v~0 0) (<= main_~X~0 (* main_~Y~0 2)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2483#true} is VALID [2022-04-27 12:08:10,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {2861#(or (< main_~v~0 0) (<= main_~X~0 (* main_~Y~0 2)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2861#(or (< main_~v~0 0) (<= main_~X~0 (* main_~Y~0 2)))} is VALID [2022-04-27 12:08:10,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {2483#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2861#(or (< main_~v~0 0) (<= main_~X~0 (* main_~Y~0 2)))} is VALID [2022-04-27 12:08:10,648 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2483#true} {2483#true} #63#return; {2483#true} is VALID [2022-04-27 12:08:10,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-27 12:08:10,663 INFO L290 TraceCheckUtils]: 14: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-27 12:08:10,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-27 12:08:10,664 INFO L272 TraceCheckUtils]: 12: Hoare triple {2483#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {2483#true} is VALID [2022-04-27 12:08:10,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {2483#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2483#true} is VALID [2022-04-27 12:08:10,664 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2483#true} {2483#true} #61#return; {2483#true} is VALID [2022-04-27 12:08:10,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-27 12:08:10,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-27 12:08:10,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-27 12:08:10,664 INFO L272 TraceCheckUtils]: 6: Hoare triple {2483#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {2483#true} is VALID [2022-04-27 12:08:10,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {2483#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {2483#true} is VALID [2022-04-27 12:08:10,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {2483#true} call #t~ret8 := main(); {2483#true} is VALID [2022-04-27 12:08:10,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2483#true} {2483#true} #69#return; {2483#true} is VALID [2022-04-27 12:08:10,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-27 12:08:10,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {2483#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(15, 2);call #Ultimate.allocInit(12, 3); {2483#true} is VALID [2022-04-27 12:08:10,665 INFO L272 TraceCheckUtils]: 0: Hoare triple {2483#true} call ULTIMATE.init(); {2483#true} is VALID [2022-04-27 12:08:10,665 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 50 proven. 23 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-04-27 12:08:10,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:08:10,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083176630] [2022-04-27 12:08:10,665 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:08:10,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840705702] [2022-04-27 12:08:10,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840705702] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:08:10,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:08:10,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-27 12:08:10,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66260797] [2022-04-27 12:08:10,666 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:08:10,666 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Word has length 75 [2022-04-27 12:08:10,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:08:10,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-27 12:08:10,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:08:10,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 12:08:10,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:08:10,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 12:08:10,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 12:08:10,706 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-27 12:08:10,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:08:10,938 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2022-04-27 12:08:10,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:08:10,938 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Word has length 75 [2022-04-27 12:08:10,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:08:10,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-27 12:08:10,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-04-27 12:08:10,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-27 12:08:10,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-04-27 12:08:10,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 57 transitions. [2022-04-27 12:08:10,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:08:10,984 INFO L225 Difference]: With dead ends: 85 [2022-04-27 12:08:10,984 INFO L226 Difference]: Without dead ends: 66 [2022-04-27 12:08:10,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 142 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:08:10,984 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:08:10,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 81 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:08:10,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-27 12:08:11,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2022-04-27 12:08:11,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:08:11,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 61 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:08:11,053 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 61 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:08:11,053 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 61 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:08:11,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:08:11,055 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-04-27 12:08:11,055 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2022-04-27 12:08:11,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:08:11,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:08:11,055 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 66 states. [2022-04-27 12:08:11,055 INFO L87 Difference]: Start difference. First operand has 61 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 66 states. [2022-04-27 12:08:11,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:08:11,057 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-04-27 12:08:11,057 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2022-04-27 12:08:11,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:08:11,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:08:11,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:08:11,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:08:11,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:08:11,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2022-04-27 12:08:11,059 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 75 [2022-04-27 12:08:11,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:08:11,059 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2022-04-27 12:08:11,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-27 12:08:11,059 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2022-04-27 12:08:11,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-27 12:08:11,060 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:08:11,060 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:08:11,076 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 12:08:11,276 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 12:08:11,276 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:08:11,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:08:11,277 INFO L85 PathProgramCache]: Analyzing trace with hash 657512368, now seen corresponding path program 3 times [2022-04-27 12:08:11,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:08:11,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16860593] [2022-04-27 12:08:11,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:08:11,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:08:11,292 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:08:11,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [596673966] [2022-04-27 12:08:11,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 12:08:11,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:08:11,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:08:11,293 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 12:08:11,294 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 12:08:11,345 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-27 12:08:11,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:08:11,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-27 12:08:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:08:11,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:08:31,791 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 12:08:36,725 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 12:08:42,754 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 12:09:18,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {3280#true} call ULTIMATE.init(); {3280#true} is VALID [2022-04-27 12:09:18,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {3280#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(15, 2);call #Ultimate.allocInit(12, 3); {3280#true} is VALID [2022-04-27 12:09:18,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-04-27 12:09:18,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3280#true} {3280#true} #69#return; {3280#true} is VALID [2022-04-27 12:09:18,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {3280#true} call #t~ret8 := main(); {3280#true} is VALID [2022-04-27 12:09:18,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {3280#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {3280#true} is VALID [2022-04-27 12:09:18,366 INFO L272 TraceCheckUtils]: 6: Hoare triple {3280#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {3280#true} is VALID [2022-04-27 12:09:18,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {3280#true} ~cond := #in~cond; {3306#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:09:18,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {3306#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3310#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:09:18,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {3310#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3310#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:09:18,367 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3310#(not (= |assume_abort_if_not_#in~cond| 0))} {3280#true} #61#return; {3317#(and (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:09:18,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {3317#(and (<= 0 main_~X~0) (<= main_~X~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {3317#(and (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:09:18,368 INFO L272 TraceCheckUtils]: 12: Hoare triple {3317#(and (<= 0 main_~X~0) (<= main_~X~0 1))} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {3280#true} is VALID [2022-04-27 12:09:18,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {3280#true} ~cond := #in~cond; {3306#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:09:18,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {3306#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3310#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:09:18,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {3310#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3310#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:09:18,369 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3310#(not (= |assume_abort_if_not_#in~cond| 0))} {3317#(and (<= 0 main_~X~0) (<= main_~X~0 1))} #63#return; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:09:18,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:09:18,370 INFO L290 TraceCheckUtils]: 18: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:09:18,370 INFO L272 TraceCheckUtils]: 19: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3280#true} is VALID [2022-04-27 12:09:18,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {3280#true} ~cond := #in~cond; {3280#true} is VALID [2022-04-27 12:09:18,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {3280#true} assume !(0 == ~cond); {3280#true} is VALID [2022-04-27 12:09:18,370 INFO L290 TraceCheckUtils]: 22: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-04-27 12:09:18,371 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3280#true} {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} #65#return; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:09:18,371 INFO L290 TraceCheckUtils]: 24: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} assume !!(~x~0 <= ~X~0); {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:09:18,371 INFO L290 TraceCheckUtils]: 25: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:09:18,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:09:18,374 INFO L290 TraceCheckUtils]: 27: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:09:18,374 INFO L272 TraceCheckUtils]: 28: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3280#true} is VALID [2022-04-27 12:09:18,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {3280#true} ~cond := #in~cond; {3280#true} is VALID [2022-04-27 12:09:18,374 INFO L290 TraceCheckUtils]: 30: Hoare triple {3280#true} assume !(0 == ~cond); {3280#true} is VALID [2022-04-27 12:09:18,374 INFO L290 TraceCheckUtils]: 31: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-04-27 12:09:18,375 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3280#true} {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} #65#return; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:09:18,375 INFO L290 TraceCheckUtils]: 33: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} assume !!(~x~0 <= ~X~0); {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:09:18,376 INFO L290 TraceCheckUtils]: 34: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:09:18,376 INFO L290 TraceCheckUtils]: 35: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:09:18,376 INFO L290 TraceCheckUtils]: 36: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:09:18,376 INFO L272 TraceCheckUtils]: 37: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3280#true} is VALID [2022-04-27 12:09:18,376 INFO L290 TraceCheckUtils]: 38: Hoare triple {3280#true} ~cond := #in~cond; {3280#true} is VALID [2022-04-27 12:09:18,377 INFO L290 TraceCheckUtils]: 39: Hoare triple {3280#true} assume !(0 == ~cond); {3280#true} is VALID [2022-04-27 12:09:18,377 INFO L290 TraceCheckUtils]: 40: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-04-27 12:09:18,377 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3280#true} {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} #65#return; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:09:18,377 INFO L290 TraceCheckUtils]: 42: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} assume !!(~x~0 <= ~X~0); {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:09:18,378 INFO L290 TraceCheckUtils]: 43: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:09:18,378 INFO L290 TraceCheckUtils]: 44: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:09:18,378 INFO L290 TraceCheckUtils]: 45: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:09:18,378 INFO L272 TraceCheckUtils]: 46: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3280#true} is VALID [2022-04-27 12:09:18,378 INFO L290 TraceCheckUtils]: 47: Hoare triple {3280#true} ~cond := #in~cond; {3280#true} is VALID [2022-04-27 12:09:18,379 INFO L290 TraceCheckUtils]: 48: Hoare triple {3280#true} assume !(0 == ~cond); {3280#true} is VALID [2022-04-27 12:09:18,379 INFO L290 TraceCheckUtils]: 49: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-04-27 12:09:18,379 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3280#true} {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} #65#return; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:09:18,379 INFO L290 TraceCheckUtils]: 51: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} assume !!(~x~0 <= ~X~0); {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:09:18,380 INFO L290 TraceCheckUtils]: 52: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:09:18,380 INFO L290 TraceCheckUtils]: 53: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:09:18,381 INFO L290 TraceCheckUtils]: 54: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:09:18,381 INFO L272 TraceCheckUtils]: 55: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3280#true} is VALID [2022-04-27 12:09:18,381 INFO L290 TraceCheckUtils]: 56: Hoare triple {3280#true} ~cond := #in~cond; {3280#true} is VALID [2022-04-27 12:09:18,381 INFO L290 TraceCheckUtils]: 57: Hoare triple {3280#true} assume !(0 == ~cond); {3280#true} is VALID [2022-04-27 12:09:18,382 INFO L290 TraceCheckUtils]: 58: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-04-27 12:09:18,382 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3280#true} {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} #65#return; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:09:18,382 INFO L290 TraceCheckUtils]: 60: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} assume !!(~x~0 <= ~X~0); {3469#(and (<= main_~x~0 main_~X~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:09:18,383 INFO L290 TraceCheckUtils]: 61: Hoare triple {3469#(and (<= main_~x~0 main_~X~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {3473#(and (<= main_~x~0 main_~X~0) (< main_~v~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:09:18,383 INFO L290 TraceCheckUtils]: 62: Hoare triple {3473#(and (<= main_~x~0 main_~X~0) (< main_~v~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3477#(and (< main_~v~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-27 12:09:18,384 INFO L290 TraceCheckUtils]: 63: Hoare triple {3477#(and (< main_~v~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (<= main_~x~0 (+ main_~X~0 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3481#(and (< main_~v~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-27 12:09:18,384 INFO L272 TraceCheckUtils]: 64: Hoare triple {3481#(and (< main_~v~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3280#true} is VALID [2022-04-27 12:09:18,384 INFO L290 TraceCheckUtils]: 65: Hoare triple {3280#true} ~cond := #in~cond; {3488#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:09:18,384 INFO L290 TraceCheckUtils]: 66: Hoare triple {3488#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3492#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:09:18,385 INFO L290 TraceCheckUtils]: 67: Hoare triple {3492#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3492#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:09:18,386 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {3492#(not (= |__VERIFIER_assert_#in~cond| 0))} {3481#(and (< main_~v~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} #65#return; {3499#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< main_~v~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-27 12:09:18,386 INFO L290 TraceCheckUtils]: 69: Hoare triple {3499#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< main_~v~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (<= main_~x~0 (+ main_~X~0 1)))} assume !(~x~0 <= ~X~0); {3503#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< main_~v~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-27 12:09:18,396 INFO L290 TraceCheckUtils]: 70: Hoare triple {3503#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< main_~v~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {3507#(and (or (and (or (and (= (mod main_~xy~0 main_~y~0) 0) (not (= main_~y~0 0)) (<= (div main_~xy~0 main_~y~0) (+ main_~X~0 1)) (< main_~X~0 (div main_~xy~0 main_~y~0))) (and (= main_~xy~0 0) (= main_~y~0 0))) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0))) (= main_~Y~0 0)) (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) (+ main_~X~0 1)) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (not (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) main_~X~0)) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0))))) (< main_~v~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-27 12:09:18,403 INFO L272 TraceCheckUtils]: 71: Hoare triple {3507#(and (or (and (or (and (= (mod main_~xy~0 main_~y~0) 0) (not (= main_~y~0 0)) (<= (div main_~xy~0 main_~y~0) (+ main_~X~0 1)) (< main_~X~0 (div main_~xy~0 main_~y~0))) (and (= main_~xy~0 0) (= main_~y~0 0))) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0))) (= main_~Y~0 0)) (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) (+ main_~X~0 1)) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (not (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) main_~X~0)) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0))))) (< main_~v~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {3511#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:09:18,404 INFO L290 TraceCheckUtils]: 72: Hoare triple {3511#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3515#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:09:18,404 INFO L290 TraceCheckUtils]: 73: Hoare triple {3515#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3281#false} is VALID [2022-04-27 12:09:18,404 INFO L290 TraceCheckUtils]: 74: Hoare triple {3281#false} assume !false; {3281#false} is VALID [2022-04-27 12:09:18,404 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 49 proven. 1 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-27 12:09:18,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:09:25,434 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 12:09:33,155 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 12:10:28,311 INFO L290 TraceCheckUtils]: 74: Hoare triple {3281#false} assume !false; {3281#false} is VALID [2022-04-27 12:10:28,311 INFO L290 TraceCheckUtils]: 73: Hoare triple {3515#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3281#false} is VALID [2022-04-27 12:10:28,312 INFO L290 TraceCheckUtils]: 72: Hoare triple {3511#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3515#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:10:28,312 INFO L272 TraceCheckUtils]: 71: Hoare triple {3531#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {3511#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:10:28,313 INFO L290 TraceCheckUtils]: 70: Hoare triple {3535#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {3531#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} is VALID [2022-04-27 12:10:28,314 INFO L290 TraceCheckUtils]: 69: Hoare triple {3539#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !(~x~0 <= ~X~0); {3535#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-27 12:10:28,315 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {3492#(not (= |__VERIFIER_assert_#in~cond| 0))} {3543#(or (<= main_~x~0 main_~X~0) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #65#return; {3539#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-27 12:10:28,315 INFO L290 TraceCheckUtils]: 67: Hoare triple {3492#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3492#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:10:28,315 INFO L290 TraceCheckUtils]: 66: Hoare triple {3553#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3492#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:10:28,315 INFO L290 TraceCheckUtils]: 65: Hoare triple {3280#true} ~cond := #in~cond; {3553#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:10:28,316 INFO L272 TraceCheckUtils]: 64: Hoare triple {3543#(or (<= main_~x~0 main_~X~0) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3280#true} is VALID [2022-04-27 12:10:30,318 WARN L290 TraceCheckUtils]: 63: Hoare triple {3560#(or (<= main_~x~0 main_~X~0) (and (or (= (+ main_~X~0 main_~v~0 (* (* (div (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* main_~Y~0 main_~x~0)) main_~X~0) main_~x~0) 2)) (+ (* main_~Y~0 2) (* (div (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* main_~Y~0 main_~x~0)) main_~X~0) 2) (* 2 (* main_~Y~0 main_~x~0)))) (not (= (mod (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* main_~Y~0 main_~x~0)) main_~X~0) 0)) (= main_~X~0 0) (not (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0 main_~x~0)) 2) 0))) (or (forall ((main_~y~0 Int)) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))) (not (= main_~X~0 0)) (not (= (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* main_~Y~0 main_~x~0)) 0)) (not (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0 main_~x~0)) 2) 0)))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3543#(or (<= main_~x~0 main_~X~0) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is UNKNOWN [2022-04-27 12:10:30,327 INFO L290 TraceCheckUtils]: 62: Hoare triple {3564#(forall ((v_main_~x~0_29 Int)) (or (and (or (not (= (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* v_main_~x~0_29 main_~Y~0)) 0)) (forall ((main_~y~0 Int)) (= (+ (* 2 (* v_main_~x~0_29 main_~Y~0)) (* main_~y~0 2) (* main_~Y~0 2)) (+ main_~X~0 main_~v~0 (* 2 (* v_main_~x~0_29 main_~y~0))))) (not (= main_~X~0 0)) (not (= (mod (+ main_~X~0 main_~v~0 (* v_main_~x~0_29 (- 2) main_~Y~0)) 2) 0))) (or (= main_~X~0 0) (not (= (mod (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* v_main_~x~0_29 main_~Y~0)) main_~X~0) 0)) (not (= (mod (+ main_~X~0 main_~v~0 (* v_main_~x~0_29 (- 2) main_~Y~0)) 2) 0)) (= (+ (* 2 (div (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* v_main_~x~0_29 main_~Y~0)) main_~X~0)) (* 2 (* v_main_~x~0_29 main_~Y~0)) (* main_~Y~0 2)) (+ main_~X~0 main_~v~0 (* (* v_main_~x~0_29 (div (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* v_main_~x~0_29 main_~Y~0)) main_~X~0)) 2))))) (not (<= v_main_~x~0_29 (+ main_~x~0 1))) (<= v_main_~x~0_29 main_~X~0)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3560#(or (<= main_~x~0 main_~X~0) (and (or (= (+ main_~X~0 main_~v~0 (* (* (div (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* main_~Y~0 main_~x~0)) main_~X~0) main_~x~0) 2)) (+ (* main_~Y~0 2) (* (div (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* main_~Y~0 main_~x~0)) main_~X~0) 2) (* 2 (* main_~Y~0 main_~x~0)))) (not (= (mod (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* main_~Y~0 main_~x~0)) main_~X~0) 0)) (= main_~X~0 0) (not (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0 main_~x~0)) 2) 0))) (or (forall ((main_~y~0 Int)) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))) (not (= main_~X~0 0)) (not (= (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* main_~Y~0 main_~x~0)) 0)) (not (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0 main_~x~0)) 2) 0)))))} is VALID [2022-04-27 12:10:32,317 INFO L290 TraceCheckUtils]: 61: Hoare triple {3568#(forall ((v_main_~x~0_29 Int)) (or (not (<= v_main_~x~0_29 (+ main_~x~0 1))) (and (or (not (= main_~X~0 0)) (and (or (<= (div (- main_~X~0) (- 2)) (* v_main_~x~0_29 main_~Y~0)) (forall ((main_~y~0 Int)) (<= (* v_main_~x~0_29 main_~y~0) main_~y~0))) (or (<= (div (- main_~X~0) (- 2)) (* v_main_~x~0_29 main_~Y~0)) (forall ((main_~y~0 Int)) (<= main_~y~0 (* v_main_~x~0_29 main_~y~0)))))) (or (forall ((aux_div_v_main_~v~0_36_40 Int) (aux_div_aux_mod_v_main_~v~0_36_40_77 Int)) (or (not (= (mod (+ aux_div_aux_mod_v_main_~v~0_36_40_77 main_~Y~0 (* v_main_~x~0_29 main_~Y~0)) main_~X~0) 0)) (and (or (<= (+ aux_div_v_main_~v~0_36_40 1) aux_div_aux_mod_v_main_~v~0_36_40_77) (<= (+ aux_div_aux_mod_v_main_~v~0_36_40_77 1) aux_div_v_main_~v~0_36_40) (<= (+ (div (* (- 1) main_~X~0) (- 2)) main_~Y~0 aux_div_v_main_~v~0_36_40) 0) (<= (+ aux_div_aux_mod_v_main_~v~0_36_40_77 main_~Y~0 (* v_main_~x~0_29 main_~Y~0) (div (+ main_~Y~0 (* v_main_~x~0_29 main_~Y~0) aux_div_v_main_~v~0_36_40) main_~X~0)) (* v_main_~x~0_29 (div (+ main_~Y~0 (* v_main_~x~0_29 main_~Y~0) aux_div_v_main_~v~0_36_40) main_~X~0)))) (or (<= (+ aux_div_v_main_~v~0_36_40 1) aux_div_aux_mod_v_main_~v~0_36_40_77) (<= (+ aux_div_aux_mod_v_main_~v~0_36_40_77 1) aux_div_v_main_~v~0_36_40) (<= (+ (div (* (- 1) main_~X~0) (- 2)) main_~Y~0 aux_div_v_main_~v~0_36_40) 0) (<= (* v_main_~x~0_29 (div (+ main_~Y~0 (* v_main_~x~0_29 main_~Y~0) aux_div_v_main_~v~0_36_40) main_~X~0)) (+ aux_div_aux_mod_v_main_~v~0_36_40_77 main_~Y~0 (* v_main_~x~0_29 main_~Y~0) (div (+ main_~Y~0 (* v_main_~x~0_29 main_~Y~0) aux_div_v_main_~v~0_36_40) main_~X~0))))))) (= main_~X~0 0))) (<= v_main_~x~0_29 main_~X~0)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {3564#(forall ((v_main_~x~0_29 Int)) (or (and (or (not (= (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* v_main_~x~0_29 main_~Y~0)) 0)) (forall ((main_~y~0 Int)) (= (+ (* 2 (* v_main_~x~0_29 main_~Y~0)) (* main_~y~0 2) (* main_~Y~0 2)) (+ main_~X~0 main_~v~0 (* 2 (* v_main_~x~0_29 main_~y~0))))) (not (= main_~X~0 0)) (not (= (mod (+ main_~X~0 main_~v~0 (* v_main_~x~0_29 (- 2) main_~Y~0)) 2) 0))) (or (= main_~X~0 0) (not (= (mod (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* v_main_~x~0_29 main_~Y~0)) main_~X~0) 0)) (not (= (mod (+ main_~X~0 main_~v~0 (* v_main_~x~0_29 (- 2) main_~Y~0)) 2) 0)) (= (+ (* 2 (div (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* v_main_~x~0_29 main_~Y~0)) main_~X~0)) (* 2 (* v_main_~x~0_29 main_~Y~0)) (* main_~Y~0 2)) (+ main_~X~0 main_~v~0 (* (* v_main_~x~0_29 (div (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* v_main_~x~0_29 main_~Y~0)) main_~X~0)) 2))))) (not (<= v_main_~x~0_29 (+ main_~x~0 1))) (<= v_main_~x~0_29 main_~X~0)))} is VALID [2022-04-27 12:10:32,506 INFO L290 TraceCheckUtils]: 60: Hoare triple {3280#true} assume !!(~x~0 <= ~X~0); {3568#(forall ((v_main_~x~0_29 Int)) (or (not (<= v_main_~x~0_29 (+ main_~x~0 1))) (and (or (not (= main_~X~0 0)) (and (or (<= (div (- main_~X~0) (- 2)) (* v_main_~x~0_29 main_~Y~0)) (forall ((main_~y~0 Int)) (<= (* v_main_~x~0_29 main_~y~0) main_~y~0))) (or (<= (div (- main_~X~0) (- 2)) (* v_main_~x~0_29 main_~Y~0)) (forall ((main_~y~0 Int)) (<= main_~y~0 (* v_main_~x~0_29 main_~y~0)))))) (or (forall ((aux_div_v_main_~v~0_36_40 Int) (aux_div_aux_mod_v_main_~v~0_36_40_77 Int)) (or (not (= (mod (+ aux_div_aux_mod_v_main_~v~0_36_40_77 main_~Y~0 (* v_main_~x~0_29 main_~Y~0)) main_~X~0) 0)) (and (or (<= (+ aux_div_v_main_~v~0_36_40 1) aux_div_aux_mod_v_main_~v~0_36_40_77) (<= (+ aux_div_aux_mod_v_main_~v~0_36_40_77 1) aux_div_v_main_~v~0_36_40) (<= (+ (div (* (- 1) main_~X~0) (- 2)) main_~Y~0 aux_div_v_main_~v~0_36_40) 0) (<= (+ aux_div_aux_mod_v_main_~v~0_36_40_77 main_~Y~0 (* v_main_~x~0_29 main_~Y~0) (div (+ main_~Y~0 (* v_main_~x~0_29 main_~Y~0) aux_div_v_main_~v~0_36_40) main_~X~0)) (* v_main_~x~0_29 (div (+ main_~Y~0 (* v_main_~x~0_29 main_~Y~0) aux_div_v_main_~v~0_36_40) main_~X~0)))) (or (<= (+ aux_div_v_main_~v~0_36_40 1) aux_div_aux_mod_v_main_~v~0_36_40_77) (<= (+ aux_div_aux_mod_v_main_~v~0_36_40_77 1) aux_div_v_main_~v~0_36_40) (<= (+ (div (* (- 1) main_~X~0) (- 2)) main_~Y~0 aux_div_v_main_~v~0_36_40) 0) (<= (* v_main_~x~0_29 (div (+ main_~Y~0 (* v_main_~x~0_29 main_~Y~0) aux_div_v_main_~v~0_36_40) main_~X~0)) (+ aux_div_aux_mod_v_main_~v~0_36_40_77 main_~Y~0 (* v_main_~x~0_29 main_~Y~0) (div (+ main_~Y~0 (* v_main_~x~0_29 main_~Y~0) aux_div_v_main_~v~0_36_40) main_~X~0))))))) (= main_~X~0 0))) (<= v_main_~x~0_29 main_~X~0)))} is VALID [2022-04-27 12:10:32,506 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3280#true} {3280#true} #65#return; {3280#true} is VALID [2022-04-27 12:10:32,506 INFO L290 TraceCheckUtils]: 58: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-04-27 12:10:32,506 INFO L290 TraceCheckUtils]: 57: Hoare triple {3280#true} assume !(0 == ~cond); {3280#true} is VALID [2022-04-27 12:10:32,506 INFO L290 TraceCheckUtils]: 56: Hoare triple {3280#true} ~cond := #in~cond; {3280#true} is VALID [2022-04-27 12:10:32,507 INFO L272 TraceCheckUtils]: 55: Hoare triple {3280#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3280#true} is VALID [2022-04-27 12:10:32,507 INFO L290 TraceCheckUtils]: 54: Hoare triple {3280#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3280#true} is VALID [2022-04-27 12:10:32,507 INFO L290 TraceCheckUtils]: 53: Hoare triple {3280#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3280#true} is VALID [2022-04-27 12:10:32,507 INFO L290 TraceCheckUtils]: 52: Hoare triple {3280#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3280#true} is VALID [2022-04-27 12:10:32,507 INFO L290 TraceCheckUtils]: 51: Hoare triple {3280#true} assume !!(~x~0 <= ~X~0); {3280#true} is VALID [2022-04-27 12:10:32,507 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3280#true} {3280#true} #65#return; {3280#true} is VALID [2022-04-27 12:10:32,507 INFO L290 TraceCheckUtils]: 49: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-04-27 12:10:32,507 INFO L290 TraceCheckUtils]: 48: Hoare triple {3280#true} assume !(0 == ~cond); {3280#true} is VALID [2022-04-27 12:10:32,507 INFO L290 TraceCheckUtils]: 47: Hoare triple {3280#true} ~cond := #in~cond; {3280#true} is VALID [2022-04-27 12:10:32,507 INFO L272 TraceCheckUtils]: 46: Hoare triple {3280#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3280#true} is VALID [2022-04-27 12:10:32,507 INFO L290 TraceCheckUtils]: 45: Hoare triple {3280#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3280#true} is VALID [2022-04-27 12:10:32,507 INFO L290 TraceCheckUtils]: 44: Hoare triple {3280#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3280#true} is VALID [2022-04-27 12:10:32,507 INFO L290 TraceCheckUtils]: 43: Hoare triple {3280#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {3280#true} is VALID [2022-04-27 12:10:32,507 INFO L290 TraceCheckUtils]: 42: Hoare triple {3280#true} assume !!(~x~0 <= ~X~0); {3280#true} is VALID [2022-04-27 12:10:32,507 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3280#true} {3280#true} #65#return; {3280#true} is VALID [2022-04-27 12:10:32,507 INFO L290 TraceCheckUtils]: 40: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-04-27 12:10:32,508 INFO L290 TraceCheckUtils]: 39: Hoare triple {3280#true} assume !(0 == ~cond); {3280#true} is VALID [2022-04-27 12:10:32,508 INFO L290 TraceCheckUtils]: 38: Hoare triple {3280#true} ~cond := #in~cond; {3280#true} is VALID [2022-04-27 12:10:32,508 INFO L272 TraceCheckUtils]: 37: Hoare triple {3280#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3280#true} is VALID [2022-04-27 12:10:32,508 INFO L290 TraceCheckUtils]: 36: Hoare triple {3280#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3280#true} is VALID [2022-04-27 12:10:32,508 INFO L290 TraceCheckUtils]: 35: Hoare triple {3280#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3280#true} is VALID [2022-04-27 12:10:32,508 INFO L290 TraceCheckUtils]: 34: Hoare triple {3280#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3280#true} is VALID [2022-04-27 12:10:32,508 INFO L290 TraceCheckUtils]: 33: Hoare triple {3280#true} assume !!(~x~0 <= ~X~0); {3280#true} is VALID [2022-04-27 12:10:32,508 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3280#true} {3280#true} #65#return; {3280#true} is VALID [2022-04-27 12:10:32,508 INFO L290 TraceCheckUtils]: 31: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-04-27 12:10:32,508 INFO L290 TraceCheckUtils]: 30: Hoare triple {3280#true} assume !(0 == ~cond); {3280#true} is VALID [2022-04-27 12:10:32,508 INFO L290 TraceCheckUtils]: 29: Hoare triple {3280#true} ~cond := #in~cond; {3280#true} is VALID [2022-04-27 12:10:32,508 INFO L272 TraceCheckUtils]: 28: Hoare triple {3280#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3280#true} is VALID [2022-04-27 12:10:32,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {3280#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3280#true} is VALID [2022-04-27 12:10:32,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {3280#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3280#true} is VALID [2022-04-27 12:10:32,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {3280#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3280#true} is VALID [2022-04-27 12:10:32,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {3280#true} assume !!(~x~0 <= ~X~0); {3280#true} is VALID [2022-04-27 12:10:32,509 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3280#true} {3280#true} #65#return; {3280#true} is VALID [2022-04-27 12:10:32,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-04-27 12:10:32,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {3280#true} assume !(0 == ~cond); {3280#true} is VALID [2022-04-27 12:10:32,509 INFO L290 TraceCheckUtils]: 20: Hoare triple {3280#true} ~cond := #in~cond; {3280#true} is VALID [2022-04-27 12:10:32,509 INFO L272 TraceCheckUtils]: 19: Hoare triple {3280#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3280#true} is VALID [2022-04-27 12:10:32,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {3280#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3280#true} is VALID [2022-04-27 12:10:32,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {3280#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {3280#true} is VALID [2022-04-27 12:10:32,516 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3280#true} {3280#true} #63#return; {3280#true} is VALID [2022-04-27 12:10:32,516 INFO L290 TraceCheckUtils]: 15: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-04-27 12:10:32,517 INFO L290 TraceCheckUtils]: 14: Hoare triple {3280#true} assume !(0 == ~cond); {3280#true} is VALID [2022-04-27 12:10:32,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {3280#true} ~cond := #in~cond; {3280#true} is VALID [2022-04-27 12:10:32,517 INFO L272 TraceCheckUtils]: 12: Hoare triple {3280#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {3280#true} is VALID [2022-04-27 12:10:32,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {3280#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {3280#true} is VALID [2022-04-27 12:10:32,517 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3280#true} {3280#true} #61#return; {3280#true} is VALID [2022-04-27 12:10:32,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-04-27 12:10:32,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {3280#true} assume !(0 == ~cond); {3280#true} is VALID [2022-04-27 12:10:32,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {3280#true} ~cond := #in~cond; {3280#true} is VALID [2022-04-27 12:10:32,517 INFO L272 TraceCheckUtils]: 6: Hoare triple {3280#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {3280#true} is VALID [2022-04-27 12:10:32,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {3280#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {3280#true} is VALID [2022-04-27 12:10:32,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {3280#true} call #t~ret8 := main(); {3280#true} is VALID [2022-04-27 12:10:32,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3280#true} {3280#true} #69#return; {3280#true} is VALID [2022-04-27 12:10:32,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-04-27 12:10:32,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {3280#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(15, 2);call #Ultimate.allocInit(12, 3); {3280#true} is VALID [2022-04-27 12:10:32,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {3280#true} call ULTIMATE.init(); {3280#true} is VALID [2022-04-27 12:10:32,518 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 49 proven. 1 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-27 12:10:32,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:10:32,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16860593] [2022-04-27 12:10:32,518 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:10:32,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596673966] [2022-04-27 12:10:32,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596673966] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:10:32,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:10:32,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 25 [2022-04-27 12:10:32,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960938110] [2022-04-27 12:10:32,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:10:32,519 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 7 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 75 [2022-04-27 12:10:32,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:10:32,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 7 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 12:10:34,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 65 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 12:10:34,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-27 12:10:34,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:10:34,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-27 12:10:34,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=499, Unknown=3, NotChecked=0, Total=600 [2022-04-27 12:10:34,896 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand has 25 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 7 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 12:10:52,021 WARN L232 SmtUtils]: Spent 10.82s on a formula simplification. DAG size of input: 63 DAG size of output: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 12:10:53,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:10:53,708 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-04-27 12:10:53,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 12:10:53,709 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 7 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 75 [2022-04-27 12:10:53,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:10:53,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 7 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 12:10:53,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 42 transitions. [2022-04-27 12:10:53,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 7 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 12:10:53,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 42 transitions. [2022-04-27 12:10:53,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 42 transitions. [2022-04-27 12:10:53,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:10:53,993 INFO L225 Difference]: With dead ends: 61 [2022-04-27 12:10:53,993 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 12:10:53,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 27.6s TimeCoverageRelationStatistics Valid=225, Invalid=1032, Unknown=3, NotChecked=0, Total=1260 [2022-04-27 12:10:53,994 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 12:10:53,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 171 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 303 Invalid, 0 Unknown, 41 Unchecked, 2.4s Time] [2022-04-27 12:10:53,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 12:10:53,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 12:10:53,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:10:53,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 12:10:53,995 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 12:10:53,995 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 12:10:53,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:10:53,995 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 12:10:53,995 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 12:10:53,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:10:53,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:10:53,995 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 12:10:53,995 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 12:10:53,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:10:53,996 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 12:10:53,996 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 12:10:53,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:10:53,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:10:53,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:10:53,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:10:53,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 12:10:53,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 12:10:53,997 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2022-04-27 12:10:53,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:10:53,997 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 12:10:53,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 7 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 12:10:53,997 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 12:10:53,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:10:53,999 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 12:10:54,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 12:10:54,200 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 12:10:54,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 12:10:59,132 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 7) no Hoare annotation was computed. [2022-04-27 12:10:59,132 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 7) no Hoare annotation was computed. [2022-04-27 12:10:59,132 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 7) no Hoare annotation was computed. [2022-04-27 12:10:59,132 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 10 12) the Hoare annotation is: true [2022-04-27 12:10:59,132 INFO L899 garLoopResultBuilder]: For program point L11(line 11) no Hoare annotation was computed. [2022-04-27 12:10:59,133 INFO L899 garLoopResultBuilder]: For program point L11-2(lines 10 12) no Hoare annotation was computed. [2022-04-27 12:10:59,133 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 10 12) no Hoare annotation was computed. [2022-04-27 12:10:59,133 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (and (<= 0 main_~X~0) (<= main_~X~0 1)) [2022-04-27 12:10:59,133 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-04-27 12:10:59,133 INFO L902 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2022-04-27 12:10:59,133 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 21 53) no Hoare annotation was computed. [2022-04-27 12:10:59,133 INFO L899 garLoopResultBuilder]: For program point L25-1(line 25) no Hoare annotation was computed. [2022-04-27 12:10:59,133 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse0 (* main_~Y~0 2))) (or (and (= main_~x~0 0) (= main_~xy~0 0) (= (+ main_~X~0 main_~v~0) .cse0) (= main_~y~0 0) (= main_~yx~0 0)) (let ((.cse2 (* main_~y~0 2)) (.cse1 (* 2 (* main_~Y~0 main_~x~0)))) (and (= (+ .cse0 .cse1) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= (+ .cse2 .cse0 (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (<= main_~X~0 1) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ .cse2 .cse0 .cse1)))))) [2022-04-27 12:10:59,133 INFO L899 garLoopResultBuilder]: For program point L50-1(line 50) no Hoare annotation was computed. [2022-04-27 12:10:59,133 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 21 53) no Hoare annotation was computed. [2022-04-27 12:10:59,133 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 45) no Hoare annotation was computed. [2022-04-27 12:10:59,133 INFO L899 garLoopResultBuilder]: For program point L40-2(lines 40 45) no Hoare annotation was computed. [2022-04-27 12:10:59,133 INFO L895 garLoopResultBuilder]: At program point L32-2(lines 32 47) the Hoare annotation is: (let ((.cse1 (* main_~Y~0 2)) (.cse3 (+ main_~X~0 main_~v~0)) (.cse5 (<= main_~X~0 1))) (or (let ((.cse4 (* main_~Y~0 main_~x~0))) (let ((.cse2 (* 2 .cse4))) (and (or (<= main_~x~0 main_~X~0) (and (let ((.cse0 (div (+ (div .cse3 (- 2)) main_~Y~0 .cse4) main_~X~0))) (= (+ main_~X~0 main_~v~0 (* (* .cse0 main_~x~0) 2)) (+ .cse1 (* .cse0 2) .cse2))) (or (forall ((main_~y~0 Int)) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))) (not (= main_~X~0 0))))) (<= main_~X~0 .cse1) (= (+ .cse1 .cse2) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~Y~0 1) (<= 0 main_~X~0) .cse5 (<= (div main_~v~0 (- 2)) main_~Y~0)))) (and (< main_~v~0 .cse1) (<= 0 main_~Y~0) (= .cse3 (* main_~Y~0 4)) .cse5 (= main_~y~0 0)))) [2022-04-27 12:10:59,133 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 21 53) the Hoare annotation is: true [2022-04-27 12:10:59,133 INFO L899 garLoopResultBuilder]: For program point L32-3(lines 32 47) no Hoare annotation was computed. [2022-04-27 12:10:59,134 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse1 (* main_~Y~0 2)) (.cse5 (<= main_~X~0 1))) (or (let ((.cse0 (* 2 main_~xy~0)) (.cse4 (* 2 (* main_~Y~0 main_~x~0))) (.cse2 (* 2 main_~yx~0)) (.cse3 (<= main_~x~0 main_~X~0))) (and (= (+ .cse0 main_~X~0 main_~v~0) (+ .cse1 .cse2)) (or .cse3 (forall ((main_~y~0 Int)) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))) (not (= main_~X~0 0))) (<= main_~X~0 .cse1) (= (+ .cse1 .cse4) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~Y~0 1) (<= 0 main_~X~0) .cse5 (<= (div main_~v~0 (- 2)) main_~Y~0) (or (= (+ .cse0 (* main_~y~0 2) .cse4) (+ (* 2 (* main_~y~0 main_~x~0)) .cse2)) .cse3))) (and (= main_~xy~0 0) (< main_~v~0 .cse1) (<= 0 main_~Y~0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 4)) .cse5 (= main_~y~0 0) (= main_~yx~0 0)))) [2022-04-27 12:10:59,134 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 32 47) no Hoare annotation was computed. [2022-04-27 12:10:59,134 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 12:10:59,134 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 12:10:59,134 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 12:10:59,134 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 12:10:59,134 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 12:10:59,134 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 12:10:59,134 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 12:10:59,134 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 16) no Hoare annotation was computed. [2022-04-27 12:10:59,134 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 13 19) the Hoare annotation is: true [2022-04-27 12:10:59,134 INFO L899 garLoopResultBuilder]: For program point L14(lines 14 17) no Hoare annotation was computed. [2022-04-27 12:10:59,134 INFO L899 garLoopResultBuilder]: For program point L14-2(lines 13 19) no Hoare annotation was computed. [2022-04-27 12:10:59,134 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 13 19) no Hoare annotation was computed. [2022-04-27 12:10:59,134 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-04-27 12:10:59,141 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-04-27 12:10:59,143 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 12:10:59,152 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 12:10:59,152 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 12:10:59,153 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 12:10:59,153 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-27 12:10:59,153 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 12:10:59,153 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 12:10:59,153 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 12:10:59,153 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 12:10:59,153 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 12:10:59,153 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-27 12:10:59,153 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-27 12:10:59,153 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-27 12:10:59,153 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 12:10:59,154 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 12:10:59,154 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-27 12:10:59,154 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-27 12:10:59,154 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 12:10:59,154 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 12:10:59,154 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2022-04-27 12:10:59,154 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 12:10:59,154 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 12:10:59,154 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-27 12:10:59,154 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:10:59,154 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:10:59,154 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-27 12:10:59,154 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 12:10:59,154 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 12:10:59,154 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-04-27 12:10:59,154 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-04-27 12:10:59,154 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-04-27 12:10:59,180 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-04-27 12:10:59,180 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 12:10:59,180 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 12:10:59,180 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 12:10:59,180 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 12:10:59,180 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-04-27 12:10:59,180 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-04-27 12:10:59,180 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 12:10:59,180 INFO L163 areAnnotationChecker]: CFG has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 12:10:59,184 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] [2022-04-27 12:10:59,184 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] [2022-04-27 12:10:59,194 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] [2022-04-27 12:10:59,194 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] [2022-04-27 12:10:59,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 12:10:59 BoogieIcfgContainer [2022-04-27 12:10:59,208 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 12:10:59,208 INFO L158 Benchmark]: Toolchain (without parser) took 328818.76ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 148.9MB in the beginning and 63.8MB in the end (delta: 85.1MB). Peak memory consumption was 120.3MB. Max. memory is 8.0GB. [2022-04-27 12:10:59,208 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 173.0MB. Free memory is still 135.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 12:10:59,209 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.54ms. Allocated memory is still 173.0MB. Free memory was 148.9MB in the beginning and 146.1MB in the end (delta: 2.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 12:10:59,209 INFO L158 Benchmark]: Boogie Preprocessor took 64.10ms. Allocated memory is still 173.0MB. Free memory was 146.1MB in the beginning and 144.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 12:10:59,209 INFO L158 Benchmark]: RCFGBuilder took 459.83ms. Allocated memory is still 173.0MB. Free memory was 144.7MB in the beginning and 132.4MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 12:10:59,209 INFO L158 Benchmark]: TraceAbstraction took 327880.27ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 132.1MB in the beginning and 63.8MB in the end (delta: 68.3MB). Peak memory consumption was 103.6MB. Max. memory is 8.0GB. [2022-04-27 12:10:59,210 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 173.0MB. Free memory is still 135.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 406.54ms. Allocated memory is still 173.0MB. Free memory was 148.9MB in the beginning and 146.1MB in the end (delta: 2.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 64.10ms. Allocated memory is still 173.0MB. Free memory was 146.1MB in the beginning and 144.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 459.83ms. Allocated memory is still 173.0MB. Free memory was 144.7MB in the beginning and 132.4MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 327880.27ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 132.1MB in the beginning and 63.8MB in the end (delta: 68.3MB). Peak memory consumption was 103.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 327.8s, OverallIterations: 8, TraceHistogramMax: 7, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 23.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 195 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 186 mSDsluCounter, 897 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 103 IncrementalHoareTripleChecker+Unchecked, 703 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1186 IncrementalHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 194 mSDtfsCounter, 1186 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 672 GetRequests, 523 SyntacticMatches, 7 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 29.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=7, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 23 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 35 PreInvPairs, 58 NumberOfFragments, 383 HoareAnnotationTreeSize, 35 FomulaSimplifications, 673 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 11 FomulaSimplificationsInter, 3093 FormulaSimplificationTreeSizeReductionInter, 4.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 294.0s InterpolantComputationTime, 356 NumberOfCodeBlocks, 320 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 621 ConstructedInterpolants, 6 QuantifiedInterpolants, 3602 SizeOfPredicates, 39 NumberOfNonLiveVariables, 884 ConjunctsInSsa, 143 ConjunctsInUnsatCore, 13 InterpolantComputations, 2 PerfectInterpolantSequences, 637/746 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant [2022-04-27 12:10:59,215 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] [2022-04-27 12:10:59,215 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] [2022-04-27 12:10:59,216 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] [2022-04-27 12:10:59,216 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] Derived loop invariant: (((((((x <= X || (X + v + ((X + v) / -2 + Y + Y * x) / X * x * 2 == Y * 2 + ((X + v) / -2 + Y + Y * x) / X * 2 + 2 * (Y * x) && ((forall main_~y~0 : int :: 2 * (main_~y~0 * x) + X + v == main_~y~0 * 2 + Y * 2 + 2 * (Y * x)) || !(X == 0)))) && X <= Y * 2) && Y * 2 + 2 * (Y * x) == X * y * 2 + X + v) && Y <= 1) && 0 <= X) && X <= 1) && v / -2 <= Y) || ((((v < Y * 2 && 0 <= Y) && X + v == Y * 4) && X <= 1) && y == 0) RESULT: Ultimate proved your program to be correct! [2022-04-27 12:10:59,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...