/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/prodbin-ll_valuebound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:28:07,869 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:28:07,870 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:28:07,909 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:28:07,909 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:28:07,910 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:28:07,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:28:07,912 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:28:07,912 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:28:07,913 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:28:07,914 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:28:07,914 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:28:07,914 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:28:07,915 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:28:07,916 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:28:07,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:28:07,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:28:07,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:28:07,918 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:28:07,920 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:28:07,920 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:28:07,921 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:28:07,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:28:07,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:28:07,923 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:28:07,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:28:07,925 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:28:07,926 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:28:07,926 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:28:07,926 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:28:07,927 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:28:07,927 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:28:07,928 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:28:07,928 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:28:07,929 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:28:07,929 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:28:07,930 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:28:07,930 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:28:07,930 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:28:07,930 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:28:07,931 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:28:07,931 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:28:07,932 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 14:28:07,944 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:28:07,944 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:28:07,944 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:28:07,945 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:28:07,945 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:28:07,945 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:28:07,945 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:28:07,945 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:28:07,946 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:28:07,946 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:28:07,946 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:28:07,946 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:28:07,946 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:28:07,946 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:28:07,946 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:28:07,946 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:28:07,946 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:28:07,946 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:28:07,947 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:28:07,947 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:28:07,947 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:28:07,947 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:28:07,947 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:28:07,947 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:28:07,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:28:07,947 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:28:07,948 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:28:07,948 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:28:07,948 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:28:07,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:28:07,948 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:28:07,948 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:28:07,948 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:28:07,948 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 14:28:08,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:28:08,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:28:08,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:28:08,087 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:28:08,088 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:28:08,088 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound50.c [2022-04-27 14:28:08,125 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c95caed3/d8cf76c5de894cf5ad6f747eaa654b8e/FLAG5f15a04bc [2022-04-27 14:28:08,479 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:28:08,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound50.c [2022-04-27 14:28:08,485 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c95caed3/d8cf76c5de894cf5ad6f747eaa654b8e/FLAG5f15a04bc [2022-04-27 14:28:08,495 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c95caed3/d8cf76c5de894cf5ad6f747eaa654b8e [2022-04-27 14:28:08,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:28:08,497 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:28:08,514 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:28:08,514 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:28:08,518 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:28:08,518 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:28:08" (1/1) ... [2022-04-27 14:28:08,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad656a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:28:08, skipping insertion in model container [2022-04-27 14:28:08,519 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:28:08" (1/1) ... [2022-04-27 14:28:08,523 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:28:08,542 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:28:08,707 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/prodbin-ll_valuebound50.c[537,550] [2022-04-27 14:28:08,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:28:08,751 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:28:08,761 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/prodbin-ll_valuebound50.c[537,550] [2022-04-27 14:28:08,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:28:08,794 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:28:08,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:28:08 WrapperNode [2022-04-27 14:28:08,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:28:08,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:28:08,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:28:08,795 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:28:08,803 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:28:08" (1/1) ... [2022-04-27 14:28:08,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:28:08" (1/1) ... [2022-04-27 14:28:08,815 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:28:08" (1/1) ... [2022-04-27 14:28:08,815 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:28:08" (1/1) ... [2022-04-27 14:28:08,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:28:08" (1/1) ... [2022-04-27 14:28:08,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:28:08" (1/1) ... [2022-04-27 14:28:08,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:28:08" (1/1) ... [2022-04-27 14:28:08,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:28:08,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:28:08,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:28:08,828 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:28:08,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:28:08" (1/1) ... [2022-04-27 14:28:08,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:28:08,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:28:08,866 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 14:28:08,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 14:28:08,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:28:08,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:28:08,898 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:28:08,898 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:28:08,898 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:28:08,898 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:28:08,898 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:28:08,898 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:28:08,899 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:28:08,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:28:08,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 14:28:08,899 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:28:08,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:28:08,899 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:28:08,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:28:08,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:28:08,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:28:08,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:28:08,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:28:08,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:28:08,937 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:28:08,938 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:28:09,055 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:28:09,060 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:28:09,060 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:28:09,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:28:09 BoogieIcfgContainer [2022-04-27 14:28:09,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:28:09,062 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:28:09,062 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:28:09,071 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:28:09,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:28:08" (1/3) ... [2022-04-27 14:28:09,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5973d1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:28:09, skipping insertion in model container [2022-04-27 14:28:09,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:28:08" (2/3) ... [2022-04-27 14:28:09,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5973d1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:28:09, skipping insertion in model container [2022-04-27 14:28:09,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:28:09" (3/3) ... [2022-04-27 14:28:09,073 INFO L111 eAbstractionObserver]: Analyzing ICFG prodbin-ll_valuebound50.c [2022-04-27 14:28:09,081 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:28:09,082 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:28:09,111 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:28:09,116 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@690f6aff, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@18f155f7 [2022-04-27 14:28:09,116 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:28:09,121 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:28:09,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 14:28:09,126 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:28:09,126 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:28:09,126 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:28:09,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:28:09,130 INFO L85 PathProgramCache]: Analyzing trace with hash -589322634, now seen corresponding path program 1 times [2022-04-27 14:28:09,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:28:09,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841157846] [2022-04-27 14:28:09,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:28:09,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:28:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:28:09,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:28:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:28:09,247 INFO L290 TraceCheckUtils]: 0: Hoare triple {52#(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(13, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-27 14:28:09,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-27 14:28:09,247 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #71#return; {35#true} is VALID [2022-04-27 14:28:09,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:28:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:28:09,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:28:09,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:28:09,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:28:09,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-27 14:28:09,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 14:28:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:28:09,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:28:09,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:28:09,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:28:09,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-27 14:28:09,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 14:28:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:28:09,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:28:09,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:28:09,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:28:09,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-27 14:28:09,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {52#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:28:09,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {52#(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(13, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-27 14:28:09,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-27 14:28:09,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #71#return; {35#true} is VALID [2022-04-27 14:28:09,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret6 := main(); {35#true} is VALID [2022-04-27 14:28:09,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {35#true} is VALID [2022-04-27 14:28:09,270 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {35#true} is VALID [2022-04-27 14:28:09,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:28:09,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:28:09,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:28:09,271 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-27 14:28:09,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {36#false} is VALID [2022-04-27 14:28:09,272 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 50 then 1 else 0)); {35#true} is VALID [2022-04-27 14:28:09,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:28:09,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:28:09,272 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:28:09,273 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-27 14:28:09,273 INFO L272 TraceCheckUtils]: 17: Hoare triple {36#false} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {35#true} is VALID [2022-04-27 14:28:09,273 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:28:09,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:28:09,274 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:28:09,274 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-27 14:28:09,274 INFO L290 TraceCheckUtils]: 22: Hoare triple {36#false} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {36#false} is VALID [2022-04-27 14:28:09,274 INFO L290 TraceCheckUtils]: 23: Hoare triple {36#false} assume false; {36#false} is VALID [2022-04-27 14:28:09,274 INFO L272 TraceCheckUtils]: 24: Hoare triple {36#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {36#false} is VALID [2022-04-27 14:28:09,274 INFO L290 TraceCheckUtils]: 25: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-27 14:28:09,275 INFO L290 TraceCheckUtils]: 26: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-27 14:28:09,275 INFO L290 TraceCheckUtils]: 27: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-27 14:28:09,275 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:28:09,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:28:09,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841157846] [2022-04-27 14:28:09,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841157846] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:28:09,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:28:09,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:28:09,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184008830] [2022-04-27 14:28:09,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:28:09,281 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-27 14:28:09,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:28:09,284 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:28:09,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:28:09,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:28:09,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:28:09,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:28:09,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:28:09,323 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:28:09,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:28:09,417 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2022-04-27 14:28:09,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:28:09,417 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-27 14:28:09,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:28:09,418 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:28:09,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-27 14:28:09,426 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:28:09,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-27 14:28:09,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2022-04-27 14:28:09,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:28:09,520 INFO L225 Difference]: With dead ends: 57 [2022-04-27 14:28:09,520 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 14:28:09,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:28:09,524 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:28:09,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:28:09,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 14:28:09,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-27 14:28:09,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:28:09,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:28:09,555 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:28:09,555 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:28:09,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:28:09,576 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 14:28:09,576 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 14:28:09,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:28:09,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:28:09,577 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 27 states. [2022-04-27 14:28:09,577 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 27 states. [2022-04-27 14:28:09,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:28:09,581 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 14:28:09,581 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 14:28:09,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:28:09,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:28:09,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:28:09,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:28:09,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:28:09,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-27 14:28:09,586 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 28 [2022-04-27 14:28:09,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:28:09,587 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-27 14:28:09,591 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:28:09,591 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 14:28:09,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 14:28:09,592 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:28:09,592 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:28:09,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:28:09,592 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:28:09,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:28:09,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1736242504, now seen corresponding path program 1 times [2022-04-27 14:28:09,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:28:09,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988673611] [2022-04-27 14:28:09,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:28:09,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:28:09,618 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:28:09,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [236187201] [2022-04-27 14:28:09,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:28:09,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:28:09,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:28:09,620 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:28:09,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 14:28:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:28:09,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:28:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:28:09,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:28:09,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {224#true} call ULTIMATE.init(); {224#true} is VALID [2022-04-27 14:28:09,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#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(13, 2);call #Ultimate.allocInit(12, 3); {224#true} is VALID [2022-04-27 14:28:09,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-27 14:28:09,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {224#true} {224#true} #71#return; {224#true} is VALID [2022-04-27 14:28:09,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {224#true} call #t~ret6 := main(); {224#true} is VALID [2022-04-27 14:28:09,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {224#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {224#true} is VALID [2022-04-27 14:28:09,872 INFO L272 TraceCheckUtils]: 6: Hoare triple {224#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {224#true} is VALID [2022-04-27 14:28:09,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-04-27 14:28:09,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-04-27 14:28:09,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-27 14:28:09,875 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {224#true} {224#true} #61#return; {224#true} is VALID [2022-04-27 14:28:09,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {224#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {224#true} is VALID [2022-04-27 14:28:09,877 INFO L272 TraceCheckUtils]: 12: Hoare triple {224#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 50 then 1 else 0)); {224#true} is VALID [2022-04-27 14:28:09,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-04-27 14:28:09,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-04-27 14:28:09,877 INFO L290 TraceCheckUtils]: 15: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-27 14:28:09,878 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {224#true} {224#true} #63#return; {224#true} is VALID [2022-04-27 14:28:09,878 INFO L272 TraceCheckUtils]: 17: Hoare triple {224#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {224#true} is VALID [2022-04-27 14:28:09,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-04-27 14:28:09,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-04-27 14:28:09,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-27 14:28:09,878 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {224#true} {224#true} #65#return; {224#true} is VALID [2022-04-27 14:28:09,879 INFO L290 TraceCheckUtils]: 22: Hoare triple {224#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {295#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:28:09,879 INFO L290 TraceCheckUtils]: 23: Hoare triple {295#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {295#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:28:09,884 INFO L272 TraceCheckUtils]: 24: Hoare triple {295#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {302#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:28:09,886 INFO L290 TraceCheckUtils]: 25: Hoare triple {302#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {306#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:28:09,887 INFO L290 TraceCheckUtils]: 26: Hoare triple {306#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {225#false} is VALID [2022-04-27 14:28:09,887 INFO L290 TraceCheckUtils]: 27: Hoare triple {225#false} assume !false; {225#false} is VALID [2022-04-27 14:28:09,887 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:28:09,887 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:28:09,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:28:09,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988673611] [2022-04-27 14:28:09,888 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:28:09,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236187201] [2022-04-27 14:28:09,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236187201] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:28:09,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:28:09,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:28:09,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146323638] [2022-04-27 14:28:09,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:28:09,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-27 14:28:09,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:28:09,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 14:28:09,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:28:09,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:28:09,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:28:09,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:28:09,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:28:09,929 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 14:28:10,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:28:10,082 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-27 14:28:10,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:28:10,083 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-27 14:28:10,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:28:10,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 14:28:10,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-27 14:28:10,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 14:28:10,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-27 14:28:10,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-04-27 14:28:10,123 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 14:28:10,126 INFO L225 Difference]: With dead ends: 39 [2022-04-27 14:28:10,126 INFO L226 Difference]: Without dead ends: 37 [2022-04-27 14:28:10,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:28:10,127 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:28:10,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 87 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:28:10,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-27 14:28:10,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-04-27 14:28:10,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:28:10,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:28:10,134 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:28:10,135 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:28:10,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:28:10,140 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-27 14:28:10,140 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-27 14:28:10,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:28:10,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:28:10,141 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-27 14:28:10,141 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-27 14:28:10,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:28:10,143 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-27 14:28:10,143 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-27 14:28:10,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:28:10,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:28:10,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:28:10,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:28:10,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:28:10,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-04-27 14:28:10,145 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 28 [2022-04-27 14:28:10,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:28:10,145 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-04-27 14:28:10,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 14:28:10,145 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-27 14:28:10,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 14:28:10,146 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:28:10,146 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:28:10,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 14:28:10,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:28:10,363 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:28:10,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:28:10,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1911690432, now seen corresponding path program 1 times [2022-04-27 14:28:10,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:28:10,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058200197] [2022-04-27 14:28:10,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:28:10,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:28:10,388 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:28:10,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1540102795] [2022-04-27 14:28:10,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:28:10,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:28:10,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:28:10,398 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:28:10,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 14:28:10,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:28:10,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:28:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:28:10,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:28:10,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {491#true} call ULTIMATE.init(); {491#true} is VALID [2022-04-27 14:28:10,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {491#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(13, 2);call #Ultimate.allocInit(12, 3); {491#true} is VALID [2022-04-27 14:28:10,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-27 14:28:10,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {491#true} {491#true} #71#return; {491#true} is VALID [2022-04-27 14:28:10,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {491#true} call #t~ret6 := main(); {491#true} is VALID [2022-04-27 14:28:10,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {491#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {491#true} is VALID [2022-04-27 14:28:10,569 INFO L272 TraceCheckUtils]: 6: Hoare triple {491#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {491#true} is VALID [2022-04-27 14:28:10,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {491#true} ~cond := #in~cond; {491#true} is VALID [2022-04-27 14:28:10,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {491#true} assume !(0 == ~cond); {491#true} is VALID [2022-04-27 14:28:10,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-27 14:28:10,569 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {491#true} {491#true} #61#return; {491#true} is VALID [2022-04-27 14:28:10,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {491#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {491#true} is VALID [2022-04-27 14:28:10,570 INFO L272 TraceCheckUtils]: 12: Hoare triple {491#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 50 then 1 else 0)); {491#true} is VALID [2022-04-27 14:28:10,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {491#true} ~cond := #in~cond; {491#true} is VALID [2022-04-27 14:28:10,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {491#true} assume !(0 == ~cond); {491#true} is VALID [2022-04-27 14:28:10,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-27 14:28:10,570 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {491#true} {491#true} #63#return; {491#true} is VALID [2022-04-27 14:28:10,570 INFO L272 TraceCheckUtils]: 17: Hoare triple {491#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {491#true} is VALID [2022-04-27 14:28:10,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {491#true} ~cond := #in~cond; {550#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:28:10,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {550#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {554#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:28:10,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {554#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {554#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:28:10,572 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {554#(not (= |assume_abort_if_not_#in~cond| 0))} {491#true} #65#return; {561#(<= 1 main_~b~0)} is VALID [2022-04-27 14:28:10,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {561#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {565#(<= 1 main_~y~0)} is VALID [2022-04-27 14:28:10,573 INFO L290 TraceCheckUtils]: 23: Hoare triple {565#(<= 1 main_~y~0)} assume !false; {565#(<= 1 main_~y~0)} is VALID [2022-04-27 14:28:10,573 INFO L272 TraceCheckUtils]: 24: Hoare triple {565#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {491#true} is VALID [2022-04-27 14:28:10,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {491#true} ~cond := #in~cond; {491#true} is VALID [2022-04-27 14:28:10,573 INFO L290 TraceCheckUtils]: 26: Hoare triple {491#true} assume !(0 == ~cond); {491#true} is VALID [2022-04-27 14:28:10,573 INFO L290 TraceCheckUtils]: 27: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-27 14:28:10,574 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {491#true} {565#(<= 1 main_~y~0)} #67#return; {565#(<= 1 main_~y~0)} is VALID [2022-04-27 14:28:10,574 INFO L290 TraceCheckUtils]: 29: Hoare triple {565#(<= 1 main_~y~0)} assume !(0 != ~y~0); {492#false} is VALID [2022-04-27 14:28:10,574 INFO L272 TraceCheckUtils]: 30: Hoare triple {492#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {492#false} is VALID [2022-04-27 14:28:10,574 INFO L290 TraceCheckUtils]: 31: Hoare triple {492#false} ~cond := #in~cond; {492#false} is VALID [2022-04-27 14:28:10,574 INFO L290 TraceCheckUtils]: 32: Hoare triple {492#false} assume 0 == ~cond; {492#false} is VALID [2022-04-27 14:28:10,575 INFO L290 TraceCheckUtils]: 33: Hoare triple {492#false} assume !false; {492#false} is VALID [2022-04-27 14:28:10,575 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 14:28:10,575 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:28:10,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:28:10,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058200197] [2022-04-27 14:28:10,575 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:28:10,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540102795] [2022-04-27 14:28:10,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540102795] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:28:10,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:28:10,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 14:28:10,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254683014] [2022-04-27 14:28:10,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:28:10,580 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 14:28:10,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:28:10,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:28:10,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:28:10,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 14:28:10,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:28:10,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 14:28:10,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:28:10,604 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:28:10,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:28:10,764 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-27 14:28:10,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 14:28:10,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 14:28:10,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:28:10,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:28:10,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-27 14:28:10,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:28:10,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-27 14:28:10,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-27 14:28:10,797 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 14:28:10,798 INFO L225 Difference]: With dead ends: 43 [2022-04-27 14:28:10,798 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 14:28:10,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:28:10,799 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:28:10,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 89 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:28:10,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 14:28:10,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2022-04-27 14:28:10,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:28:10,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 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 14:28:10,807 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 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 14:28:10,807 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 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 14:28:10,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:28:10,809 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-27 14:28:10,809 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-27 14:28:10,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:28:10,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:28:10,809 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 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 36 states. [2022-04-27 14:28:10,810 INFO L87 Difference]: Start difference. First operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 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 36 states. [2022-04-27 14:28:10,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:28:10,811 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-27 14:28:10,811 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-27 14:28:10,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:28:10,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:28:10,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:28:10,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:28:10,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 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 14:28:10,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-27 14:28:10,813 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 34 [2022-04-27 14:28:10,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:28:10,814 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-27 14:28:10,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:28:10,814 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 14:28:10,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 14:28:10,815 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:28:10,815 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:28:10,837 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 14:28:11,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 14:28:11,031 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:28:11,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:28:11,032 INFO L85 PathProgramCache]: Analyzing trace with hash 2022075506, now seen corresponding path program 1 times [2022-04-27 14:28:11,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:28:11,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235406941] [2022-04-27 14:28:11,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:28:11,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:28:11,047 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:28:11,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [726119912] [2022-04-27 14:28:11,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:28:11,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:28:11,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:28:11,068 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:28:11,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 14:28:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:28:11,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-27 14:28:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:28:11,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:28:12,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} call ULTIMATE.init(); {783#true} is VALID [2022-04-27 14:28:12,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#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(13, 2);call #Ultimate.allocInit(12, 3); {783#true} is VALID [2022-04-27 14:28:12,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:28:12,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} #71#return; {783#true} is VALID [2022-04-27 14:28:12,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} call #t~ret6 := main(); {783#true} is VALID [2022-04-27 14:28:12,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {783#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {783#true} is VALID [2022-04-27 14:28:12,039 INFO L272 TraceCheckUtils]: 6: Hoare triple {783#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {783#true} is VALID [2022-04-27 14:28:12,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-27 14:28:12,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-27 14:28:12,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:28:12,039 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {783#true} {783#true} #61#return; {783#true} is VALID [2022-04-27 14:28:12,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {783#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {783#true} is VALID [2022-04-27 14:28:12,040 INFO L272 TraceCheckUtils]: 12: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 50 then 1 else 0)); {783#true} is VALID [2022-04-27 14:28:12,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-27 14:28:12,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-27 14:28:12,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:28:12,040 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {783#true} {783#true} #63#return; {783#true} is VALID [2022-04-27 14:28:12,040 INFO L272 TraceCheckUtils]: 17: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {783#true} is VALID [2022-04-27 14:28:12,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-27 14:28:12,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-27 14:28:12,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:28:12,041 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {783#true} {783#true} #65#return; {783#true} is VALID [2022-04-27 14:28:12,047 INFO L290 TraceCheckUtils]: 22: Hoare triple {783#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {854#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:28:12,048 INFO L290 TraceCheckUtils]: 23: Hoare triple {854#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {854#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:28:12,048 INFO L272 TraceCheckUtils]: 24: Hoare triple {854#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {783#true} is VALID [2022-04-27 14:28:12,048 INFO L290 TraceCheckUtils]: 25: Hoare triple {783#true} ~cond := #in~cond; {864#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:28:12,048 INFO L290 TraceCheckUtils]: 26: Hoare triple {864#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {868#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:28:12,049 INFO L290 TraceCheckUtils]: 27: Hoare triple {868#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {868#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:28:12,049 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {868#(not (= |__VERIFIER_assert_#in~cond| 0))} {854#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #67#return; {875#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:28:12,050 INFO L290 TraceCheckUtils]: 29: Hoare triple {875#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {879#(and (not (= main_~y~0 0)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:28:12,052 INFO L290 TraceCheckUtils]: 30: Hoare triple {879#(and (not (= main_~y~0 0)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {883#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-27 14:28:12,054 INFO L290 TraceCheckUtils]: 31: Hoare triple {883#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {887#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-27 14:28:12,054 INFO L290 TraceCheckUtils]: 32: Hoare triple {887#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !false; {887#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-27 14:28:12,493 INFO L272 TraceCheckUtils]: 33: Hoare triple {887#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {894#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:28:12,494 INFO L290 TraceCheckUtils]: 34: Hoare triple {894#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {898#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:28:12,495 INFO L290 TraceCheckUtils]: 35: Hoare triple {898#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {784#false} is VALID [2022-04-27 14:28:12,495 INFO L290 TraceCheckUtils]: 36: Hoare triple {784#false} assume !false; {784#false} is VALID [2022-04-27 14:28:12,495 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:28:12,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:29:18,455 INFO L290 TraceCheckUtils]: 36: Hoare triple {784#false} assume !false; {784#false} is VALID [2022-04-27 14:29:18,455 INFO L290 TraceCheckUtils]: 35: Hoare triple {898#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {784#false} is VALID [2022-04-27 14:29:18,456 INFO L290 TraceCheckUtils]: 34: Hoare triple {894#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {898#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:29:18,456 INFO L272 TraceCheckUtils]: 33: Hoare triple {914#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {894#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:29:18,457 INFO L290 TraceCheckUtils]: 32: Hoare triple {914#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {914#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:29:18,467 INFO L290 TraceCheckUtils]: 31: Hoare triple {921#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {914#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:29:18,469 INFO L290 TraceCheckUtils]: 30: Hoare triple {925#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {921#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-27 14:29:18,469 INFO L290 TraceCheckUtils]: 29: Hoare triple {925#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume !!(0 != ~y~0); {925#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-27 14:29:18,678 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {868#(not (= |__VERIFIER_assert_#in~cond| 0))} {783#true} #67#return; {925#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-27 14:29:18,701 INFO L290 TraceCheckUtils]: 27: Hoare triple {868#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {868#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:29:18,702 INFO L290 TraceCheckUtils]: 26: Hoare triple {941#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {868#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:29:18,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {783#true} ~cond := #in~cond; {941#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 14:29:18,703 INFO L272 TraceCheckUtils]: 24: Hoare triple {783#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {783#true} is VALID [2022-04-27 14:29:18,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {783#true} assume !false; {783#true} is VALID [2022-04-27 14:29:18,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {783#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {783#true} is VALID [2022-04-27 14:29:18,703 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {783#true} {783#true} #65#return; {783#true} is VALID [2022-04-27 14:29:18,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:29:18,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-27 14:29:18,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-27 14:29:18,703 INFO L272 TraceCheckUtils]: 17: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {783#true} is VALID [2022-04-27 14:29:18,703 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {783#true} {783#true} #63#return; {783#true} is VALID [2022-04-27 14:29:18,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:29:18,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-27 14:29:18,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-27 14:29:18,704 INFO L272 TraceCheckUtils]: 12: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 50 then 1 else 0)); {783#true} is VALID [2022-04-27 14:29:18,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {783#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {783#true} is VALID [2022-04-27 14:29:18,704 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {783#true} {783#true} #61#return; {783#true} is VALID [2022-04-27 14:29:18,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:29:18,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-27 14:29:18,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-27 14:29:18,704 INFO L272 TraceCheckUtils]: 6: Hoare triple {783#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {783#true} is VALID [2022-04-27 14:29:18,704 INFO L290 TraceCheckUtils]: 5: Hoare triple {783#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {783#true} is VALID [2022-04-27 14:29:18,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} call #t~ret6 := main(); {783#true} is VALID [2022-04-27 14:29:18,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} #71#return; {783#true} is VALID [2022-04-27 14:29:18,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:29:18,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#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(13, 2);call #Ultimate.allocInit(12, 3); {783#true} is VALID [2022-04-27 14:29:18,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} call ULTIMATE.init(); {783#true} is VALID [2022-04-27 14:29:18,705 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:29:18,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:29:18,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235406941] [2022-04-27 14:29:18,705 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:29:18,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726119912] [2022-04-27 14:29:18,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726119912] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:29:18,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:29:18,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2022-04-27 14:29:18,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84330474] [2022-04-27 14:29:18,706 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:29:18,706 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2022-04-27 14:29:18,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:29:18,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 14:29:19,242 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 14:29:19,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 14:29:19,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:29:19,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 14:29:19,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=166, Unknown=1, NotChecked=0, Total=210 [2022-04-27 14:29:19,243 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 14:29:29,019 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:29:32,939 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:29:35,412 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:29:48,258 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:29:54,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:29:54,606 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-04-27 14:29:54,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 14:29:54,606 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2022-04-27 14:29:54,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:29:54,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 14:29:54,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 57 transitions. [2022-04-27 14:29:54,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 14:29:54,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 57 transitions. [2022-04-27 14:29:54,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 57 transitions. [2022-04-27 14:29:57,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 56 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 14:29:57,032 INFO L225 Difference]: With dead ends: 52 [2022-04-27 14:29:57,032 INFO L226 Difference]: Without dead ends: 50 [2022-04-27 14:29:57,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=79, Invalid=300, Unknown=1, NotChecked=0, Total=380 [2022-04-27 14:29:57,033 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 38 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 22 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-04-27 14:29:57,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 140 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 165 Invalid, 3 Unknown, 0 Unchecked, 10.4s Time] [2022-04-27 14:29:57,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-27 14:29:57,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2022-04-27 14:29:57,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:29:57,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 41 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 28 states have internal predecessors, (29), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:29:57,044 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 41 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 28 states have internal predecessors, (29), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:29:57,045 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 41 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 28 states have internal predecessors, (29), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:29:57,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:29:57,046 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-04-27 14:29:57,046 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-04-27 14:29:57,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:29:57,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:29:57,047 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 28 states have internal predecessors, (29), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 50 states. [2022-04-27 14:29:57,047 INFO L87 Difference]: Start difference. First operand has 41 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 28 states have internal predecessors, (29), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 50 states. [2022-04-27 14:29:57,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:29:57,049 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-04-27 14:29:57,049 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-04-27 14:29:57,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:29:57,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:29:57,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:29:57,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:29:57,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 28 states have internal predecessors, (29), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:29:57,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-04-27 14:29:57,051 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 37 [2022-04-27 14:29:57,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:29:57,051 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-04-27 14:29:57,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 14:29:57,051 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-27 14:29:57,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 14:29:57,067 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:29:57,067 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:29:57,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 14:29:57,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:29:57,285 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:29:57,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:29:57,286 INFO L85 PathProgramCache]: Analyzing trace with hash -497884428, now seen corresponding path program 1 times [2022-04-27 14:29:57,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:29:57,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221741817] [2022-04-27 14:29:57,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:29:57,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:29:57,299 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:29:57,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1740431149] [2022-04-27 14:29:57,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:29:57,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:29:57,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:29:57,316 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:29:57,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 14:29:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:29:57,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 14:29:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:29:57,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:29:58,347 INFO L272 TraceCheckUtils]: 0: Hoare triple {1262#true} call ULTIMATE.init(); {1262#true} is VALID [2022-04-27 14:29:58,347 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(13, 2);call #Ultimate.allocInit(12, 3); {1262#true} is VALID [2022-04-27 14:29:58,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {1262#true} assume true; {1262#true} is VALID [2022-04-27 14:29:58,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1262#true} {1262#true} #71#return; {1262#true} is VALID [2022-04-27 14:29:58,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {1262#true} call #t~ret6 := main(); {1262#true} is VALID [2022-04-27 14:29:58,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {1262#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {1262#true} is VALID [2022-04-27 14:29:58,347 INFO L272 TraceCheckUtils]: 6: Hoare triple {1262#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {1262#true} is VALID [2022-04-27 14:29:58,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {1262#true} ~cond := #in~cond; {1262#true} is VALID [2022-04-27 14:29:58,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {1262#true} assume !(0 == ~cond); {1262#true} is VALID [2022-04-27 14:29:58,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {1262#true} assume true; {1262#true} is VALID [2022-04-27 14:29:58,348 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1262#true} {1262#true} #61#return; {1262#true} is VALID [2022-04-27 14:29:58,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {1262#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1262#true} is VALID [2022-04-27 14:29:58,348 INFO L272 TraceCheckUtils]: 12: Hoare triple {1262#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 50 then 1 else 0)); {1262#true} is VALID [2022-04-27 14:29:58,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {1262#true} ~cond := #in~cond; {1262#true} is VALID [2022-04-27 14:29:58,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {1262#true} assume !(0 == ~cond); {1262#true} is VALID [2022-04-27 14:29:58,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {1262#true} assume true; {1262#true} is VALID [2022-04-27 14:29:58,348 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1262#true} {1262#true} #63#return; {1262#true} is VALID [2022-04-27 14:29:58,348 INFO L272 TraceCheckUtils]: 17: Hoare triple {1262#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1262#true} is VALID [2022-04-27 14:29:58,352 INFO L290 TraceCheckUtils]: 18: Hoare triple {1262#true} ~cond := #in~cond; {1321#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:29:58,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {1321#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1325#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:29:58,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {1325#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1325#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:29:58,353 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1325#(not (= |assume_abort_if_not_#in~cond| 0))} {1262#true} #65#return; {1332#(<= 1 main_~b~0)} is VALID [2022-04-27 14:29:58,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {1332#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1336#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:29:58,354 INFO L290 TraceCheckUtils]: 23: Hoare triple {1336#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !false; {1336#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:29:58,354 INFO L272 TraceCheckUtils]: 24: Hoare triple {1336#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1262#true} is VALID [2022-04-27 14:29:58,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {1262#true} ~cond := #in~cond; {1346#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:29:58,354 INFO L290 TraceCheckUtils]: 26: Hoare triple {1346#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1350#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:29:58,355 INFO L290 TraceCheckUtils]: 27: Hoare triple {1350#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1350#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:29:58,355 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1350#(not (= |__VERIFIER_assert_#in~cond| 0))} {1336#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #67#return; {1336#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:29:58,356 INFO L290 TraceCheckUtils]: 29: Hoare triple {1336#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {1336#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:29:58,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {1336#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {1363#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:29:58,357 INFO L290 TraceCheckUtils]: 31: Hoare triple {1363#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1367#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-27 14:29:58,357 INFO L290 TraceCheckUtils]: 32: Hoare triple {1367#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !false; {1367#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-27 14:29:58,359 INFO L272 TraceCheckUtils]: 33: Hoare triple {1367#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1374#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:29:58,359 INFO L290 TraceCheckUtils]: 34: Hoare triple {1374#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1378#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:29:58,360 INFO L290 TraceCheckUtils]: 35: Hoare triple {1378#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1263#false} is VALID [2022-04-27 14:29:58,360 INFO L290 TraceCheckUtils]: 36: Hoare triple {1263#false} assume !false; {1263#false} is VALID [2022-04-27 14:29:58,361 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 14:29:58,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:30:46,400 INFO L290 TraceCheckUtils]: 36: Hoare triple {1263#false} assume !false; {1263#false} is VALID [2022-04-27 14:30:46,400 INFO L290 TraceCheckUtils]: 35: Hoare triple {1378#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1263#false} is VALID [2022-04-27 14:30:46,400 INFO L290 TraceCheckUtils]: 34: Hoare triple {1374#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1378#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:30:46,401 INFO L272 TraceCheckUtils]: 33: Hoare triple {1394#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1374#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:30:46,401 INFO L290 TraceCheckUtils]: 32: Hoare triple {1394#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {1394#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:30:46,405 INFO L290 TraceCheckUtils]: 31: Hoare triple {1401#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1394#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:30:46,406 INFO L290 TraceCheckUtils]: 30: Hoare triple {1405#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {1401#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-27 14:30:46,407 INFO L290 TraceCheckUtils]: 29: Hoare triple {1405#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !!(0 != ~y~0); {1405#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-27 14:30:46,409 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1350#(not (= |__VERIFIER_assert_#in~cond| 0))} {1412#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} #67#return; {1405#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-27 14:30:46,409 INFO L290 TraceCheckUtils]: 27: Hoare triple {1350#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1350#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:30:46,410 INFO L290 TraceCheckUtils]: 26: Hoare triple {1422#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1350#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:30:46,410 INFO L290 TraceCheckUtils]: 25: Hoare triple {1262#true} ~cond := #in~cond; {1422#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 14:30:46,410 INFO L272 TraceCheckUtils]: 24: Hoare triple {1412#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1262#true} is VALID [2022-04-27 14:30:46,410 INFO L290 TraceCheckUtils]: 23: Hoare triple {1412#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} assume !false; {1412#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-27 14:30:46,411 INFO L290 TraceCheckUtils]: 22: Hoare triple {1432#(or (= (* main_~b~0 main_~a~0) (* (* main_~a~0 2) (+ (div main_~b~0 2) 1))) (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1412#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-27 14:30:46,411 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1325#(not (= |assume_abort_if_not_#in~cond| 0))} {1262#true} #65#return; {1432#(or (= (* main_~b~0 main_~a~0) (* (* main_~a~0 2) (+ (div main_~b~0 2) 1))) (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} is VALID [2022-04-27 14:30:46,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {1325#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1325#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:30:46,412 INFO L290 TraceCheckUtils]: 19: Hoare triple {1445#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1325#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:30:46,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {1262#true} ~cond := #in~cond; {1445#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 14:30:46,413 INFO L272 TraceCheckUtils]: 17: Hoare triple {1262#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1262#true} is VALID [2022-04-27 14:30:46,413 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1262#true} {1262#true} #63#return; {1262#true} is VALID [2022-04-27 14:30:46,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {1262#true} assume true; {1262#true} is VALID [2022-04-27 14:30:46,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {1262#true} assume !(0 == ~cond); {1262#true} is VALID [2022-04-27 14:30:46,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {1262#true} ~cond := #in~cond; {1262#true} is VALID [2022-04-27 14:30:46,413 INFO L272 TraceCheckUtils]: 12: Hoare triple {1262#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 50 then 1 else 0)); {1262#true} is VALID [2022-04-27 14:30:46,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {1262#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1262#true} is VALID [2022-04-27 14:30:46,413 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1262#true} {1262#true} #61#return; {1262#true} is VALID [2022-04-27 14:30:46,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {1262#true} assume true; {1262#true} is VALID [2022-04-27 14:30:46,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {1262#true} assume !(0 == ~cond); {1262#true} is VALID [2022-04-27 14:30:46,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {1262#true} ~cond := #in~cond; {1262#true} is VALID [2022-04-27 14:30:46,413 INFO L272 TraceCheckUtils]: 6: Hoare triple {1262#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {1262#true} is VALID [2022-04-27 14:30:46,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {1262#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {1262#true} is VALID [2022-04-27 14:30:46,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {1262#true} call #t~ret6 := main(); {1262#true} is VALID [2022-04-27 14:30:46,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1262#true} {1262#true} #71#return; {1262#true} is VALID [2022-04-27 14:30:46,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {1262#true} assume true; {1262#true} is VALID [2022-04-27 14:30:46,414 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(13, 2);call #Ultimate.allocInit(12, 3); {1262#true} is VALID [2022-04-27 14:30:46,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {1262#true} call ULTIMATE.init(); {1262#true} is VALID [2022-04-27 14:30:46,414 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 14:30:46,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:30:46,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221741817] [2022-04-27 14:30:46,414 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:30:46,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740431149] [2022-04-27 14:30:46,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740431149] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:30:46,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:30:46,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 19 [2022-04-27 14:30:46,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164432159] [2022-04-27 14:30:46,415 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:30:46,415 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 37 [2022-04-27 14:30:46,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:30:46,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 14:30:46,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:30:46,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 14:30:46,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:30:46,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 14:30:46,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-04-27 14:30:46,453 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 14:30:48,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:30:48,694 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-04-27 14:30:48,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 14:30:48,694 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 37 [2022-04-27 14:30:48,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:30:48,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 14:30:48,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 67 transitions. [2022-04-27 14:30:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 14:30:48,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 67 transitions. [2022-04-27 14:30:48,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 67 transitions. [2022-04-27 14:30:48,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:30:48,766 INFO L225 Difference]: With dead ends: 66 [2022-04-27 14:30:48,766 INFO L226 Difference]: Without dead ends: 59 [2022-04-27 14:30:48,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2022-04-27 14:30:48,767 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 44 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-27 14:30:48,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 116 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-27 14:30:48,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-27 14:30:48,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-27 14:30:48,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:30:48,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 40 states have (on average 1.175) internal successors, (47), 43 states have internal predecessors, (47), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:30:48,784 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 40 states have (on average 1.175) internal successors, (47), 43 states have internal predecessors, (47), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:30:48,784 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 40 states have (on average 1.175) internal successors, (47), 43 states have internal predecessors, (47), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:30:48,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:30:48,786 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-27 14:30:48,786 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-27 14:30:48,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:30:48,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:30:48,786 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 40 states have (on average 1.175) internal successors, (47), 43 states have internal predecessors, (47), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 59 states. [2022-04-27 14:30:48,786 INFO L87 Difference]: Start difference. First operand has 59 states, 40 states have (on average 1.175) internal successors, (47), 43 states have internal predecessors, (47), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 59 states. [2022-04-27 14:30:48,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:30:48,788 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-27 14:30:48,788 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-27 14:30:48,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:30:48,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:30:48,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:30:48,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:30:48,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.175) internal successors, (47), 43 states have internal predecessors, (47), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:30:48,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2022-04-27 14:30:48,790 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 37 [2022-04-27 14:30:48,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:30:48,790 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2022-04-27 14:30:48,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 14:30:48,791 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-27 14:30:48,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 14:30:48,791 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:30:48,791 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:30:48,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 14:30:49,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:30:49,023 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:30:49,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:30:49,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1351630086, now seen corresponding path program 1 times [2022-04-27 14:30:49,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:30:49,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788585679] [2022-04-27 14:30:49,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:30:49,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:30:49,043 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:30:49,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [717319405] [2022-04-27 14:30:49,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:30:49,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:30:49,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:30:49,044 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:30:49,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 14:30:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:30:49,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 14:30:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:30:49,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:30:59,252 INFO L272 TraceCheckUtils]: 0: Hoare triple {1811#true} call ULTIMATE.init(); {1811#true} is VALID [2022-04-27 14:30:59,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {1811#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(13, 2);call #Ultimate.allocInit(12, 3); {1811#true} is VALID [2022-04-27 14:30:59,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {1811#true} assume true; {1811#true} is VALID [2022-04-27 14:30:59,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1811#true} {1811#true} #71#return; {1811#true} is VALID [2022-04-27 14:30:59,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {1811#true} call #t~ret6 := main(); {1811#true} is VALID [2022-04-27 14:30:59,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {1811#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {1811#true} is VALID [2022-04-27 14:30:59,253 INFO L272 TraceCheckUtils]: 6: Hoare triple {1811#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {1811#true} is VALID [2022-04-27 14:30:59,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {1811#true} ~cond := #in~cond; {1811#true} is VALID [2022-04-27 14:30:59,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {1811#true} assume !(0 == ~cond); {1811#true} is VALID [2022-04-27 14:30:59,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {1811#true} assume true; {1811#true} is VALID [2022-04-27 14:30:59,253 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1811#true} {1811#true} #61#return; {1811#true} is VALID [2022-04-27 14:30:59,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {1811#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1811#true} is VALID [2022-04-27 14:30:59,253 INFO L272 TraceCheckUtils]: 12: Hoare triple {1811#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 50 then 1 else 0)); {1811#true} is VALID [2022-04-27 14:30:59,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {1811#true} ~cond := #in~cond; {1811#true} is VALID [2022-04-27 14:30:59,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {1811#true} assume !(0 == ~cond); {1811#true} is VALID [2022-04-27 14:30:59,254 INFO L290 TraceCheckUtils]: 15: Hoare triple {1811#true} assume true; {1811#true} is VALID [2022-04-27 14:30:59,254 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1811#true} {1811#true} #63#return; {1811#true} is VALID [2022-04-27 14:30:59,254 INFO L272 TraceCheckUtils]: 17: Hoare triple {1811#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1811#true} is VALID [2022-04-27 14:30:59,254 INFO L290 TraceCheckUtils]: 18: Hoare triple {1811#true} ~cond := #in~cond; {1811#true} is VALID [2022-04-27 14:30:59,254 INFO L290 TraceCheckUtils]: 19: Hoare triple {1811#true} assume !(0 == ~cond); {1811#true} is VALID [2022-04-27 14:30:59,254 INFO L290 TraceCheckUtils]: 20: Hoare triple {1811#true} assume true; {1811#true} is VALID [2022-04-27 14:30:59,254 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1811#true} {1811#true} #65#return; {1811#true} is VALID [2022-04-27 14:30:59,254 INFO L290 TraceCheckUtils]: 22: Hoare triple {1811#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1811#true} is VALID [2022-04-27 14:30:59,254 INFO L290 TraceCheckUtils]: 23: Hoare triple {1811#true} assume !false; {1811#true} is VALID [2022-04-27 14:30:59,254 INFO L272 TraceCheckUtils]: 24: Hoare triple {1811#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1811#true} is VALID [2022-04-27 14:30:59,254 INFO L290 TraceCheckUtils]: 25: Hoare triple {1811#true} ~cond := #in~cond; {1811#true} is VALID [2022-04-27 14:30:59,254 INFO L290 TraceCheckUtils]: 26: Hoare triple {1811#true} assume !(0 == ~cond); {1811#true} is VALID [2022-04-27 14:30:59,254 INFO L290 TraceCheckUtils]: 27: Hoare triple {1811#true} assume true; {1811#true} is VALID [2022-04-27 14:30:59,255 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1811#true} {1811#true} #67#return; {1811#true} is VALID [2022-04-27 14:30:59,255 INFO L290 TraceCheckUtils]: 29: Hoare triple {1811#true} assume !!(0 != ~y~0); {1811#true} is VALID [2022-04-27 14:30:59,255 INFO L290 TraceCheckUtils]: 30: Hoare triple {1811#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {1811#true} is VALID [2022-04-27 14:30:59,255 INFO L290 TraceCheckUtils]: 31: Hoare triple {1811#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1811#true} is VALID [2022-04-27 14:30:59,255 INFO L290 TraceCheckUtils]: 32: Hoare triple {1811#true} assume !false; {1811#true} is VALID [2022-04-27 14:30:59,255 INFO L272 TraceCheckUtils]: 33: Hoare triple {1811#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1811#true} is VALID [2022-04-27 14:30:59,255 INFO L290 TraceCheckUtils]: 34: Hoare triple {1811#true} ~cond := #in~cond; {1918#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:30:59,256 INFO L290 TraceCheckUtils]: 35: Hoare triple {1918#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:30:59,256 INFO L290 TraceCheckUtils]: 36: Hoare triple {1922#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:31:01,259 WARN L284 TraceCheckUtils]: 37: Hoare quadruple {1922#(not (= |__VERIFIER_assert_#in~cond| 0))} {1811#true} #67#return; {1929#(or (and (not (= main_~y~0 0)) (= (mod (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) main_~y~0) 0)) (= (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 0))} is UNKNOWN [2022-04-27 14:31:01,259 INFO L290 TraceCheckUtils]: 38: Hoare triple {1929#(or (and (not (= main_~y~0 0)) (= (mod (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) main_~y~0) 0)) (= (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 0))} assume !(0 != ~y~0); {1933#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:31:01,260 INFO L272 TraceCheckUtils]: 39: Hoare triple {1933#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {1937#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:31:01,260 INFO L290 TraceCheckUtils]: 40: Hoare triple {1937#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1941#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:31:01,261 INFO L290 TraceCheckUtils]: 41: Hoare triple {1941#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1812#false} is VALID [2022-04-27 14:31:01,261 INFO L290 TraceCheckUtils]: 42: Hoare triple {1812#false} assume !false; {1812#false} is VALID [2022-04-27 14:31:01,261 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 14:31:01,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:31:07,303 INFO L290 TraceCheckUtils]: 42: Hoare triple {1812#false} assume !false; {1812#false} is VALID [2022-04-27 14:31:07,304 INFO L290 TraceCheckUtils]: 41: Hoare triple {1941#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1812#false} is VALID [2022-04-27 14:31:07,304 INFO L290 TraceCheckUtils]: 40: Hoare triple {1937#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1941#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:31:07,304 INFO L272 TraceCheckUtils]: 39: Hoare triple {1933#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {1937#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:31:07,305 INFO L290 TraceCheckUtils]: 38: Hoare triple {1960#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} assume !(0 != ~y~0); {1933#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:31:07,305 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1922#(not (= |__VERIFIER_assert_#in~cond| 0))} {1811#true} #67#return; {1960#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} is VALID [2022-04-27 14:31:07,306 INFO L290 TraceCheckUtils]: 36: Hoare triple {1922#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:31:07,306 INFO L290 TraceCheckUtils]: 35: Hoare triple {1973#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:31:07,307 INFO L290 TraceCheckUtils]: 34: Hoare triple {1811#true} ~cond := #in~cond; {1973#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 14:31:07,307 INFO L272 TraceCheckUtils]: 33: Hoare triple {1811#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1811#true} is VALID [2022-04-27 14:31:07,307 INFO L290 TraceCheckUtils]: 32: Hoare triple {1811#true} assume !false; {1811#true} is VALID [2022-04-27 14:31:07,307 INFO L290 TraceCheckUtils]: 31: Hoare triple {1811#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1811#true} is VALID [2022-04-27 14:31:07,307 INFO L290 TraceCheckUtils]: 30: Hoare triple {1811#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {1811#true} is VALID [2022-04-27 14:31:07,307 INFO L290 TraceCheckUtils]: 29: Hoare triple {1811#true} assume !!(0 != ~y~0); {1811#true} is VALID [2022-04-27 14:31:07,307 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1811#true} {1811#true} #67#return; {1811#true} is VALID [2022-04-27 14:31:07,308 INFO L290 TraceCheckUtils]: 27: Hoare triple {1811#true} assume true; {1811#true} is VALID [2022-04-27 14:31:07,308 INFO L290 TraceCheckUtils]: 26: Hoare triple {1811#true} assume !(0 == ~cond); {1811#true} is VALID [2022-04-27 14:31:07,308 INFO L290 TraceCheckUtils]: 25: Hoare triple {1811#true} ~cond := #in~cond; {1811#true} is VALID [2022-04-27 14:31:07,308 INFO L272 TraceCheckUtils]: 24: Hoare triple {1811#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1811#true} is VALID [2022-04-27 14:31:07,308 INFO L290 TraceCheckUtils]: 23: Hoare triple {1811#true} assume !false; {1811#true} is VALID [2022-04-27 14:31:07,308 INFO L290 TraceCheckUtils]: 22: Hoare triple {1811#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1811#true} is VALID [2022-04-27 14:31:07,308 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1811#true} {1811#true} #65#return; {1811#true} is VALID [2022-04-27 14:31:07,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {1811#true} assume true; {1811#true} is VALID [2022-04-27 14:31:07,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {1811#true} assume !(0 == ~cond); {1811#true} is VALID [2022-04-27 14:31:07,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {1811#true} ~cond := #in~cond; {1811#true} is VALID [2022-04-27 14:31:07,308 INFO L272 TraceCheckUtils]: 17: Hoare triple {1811#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1811#true} is VALID [2022-04-27 14:31:07,308 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1811#true} {1811#true} #63#return; {1811#true} is VALID [2022-04-27 14:31:07,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {1811#true} assume true; {1811#true} is VALID [2022-04-27 14:31:07,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {1811#true} assume !(0 == ~cond); {1811#true} is VALID [2022-04-27 14:31:07,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {1811#true} ~cond := #in~cond; {1811#true} is VALID [2022-04-27 14:31:07,309 INFO L272 TraceCheckUtils]: 12: Hoare triple {1811#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 50 then 1 else 0)); {1811#true} is VALID [2022-04-27 14:31:07,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {1811#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1811#true} is VALID [2022-04-27 14:31:07,309 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1811#true} {1811#true} #61#return; {1811#true} is VALID [2022-04-27 14:31:07,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {1811#true} assume true; {1811#true} is VALID [2022-04-27 14:31:07,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {1811#true} assume !(0 == ~cond); {1811#true} is VALID [2022-04-27 14:31:07,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {1811#true} ~cond := #in~cond; {1811#true} is VALID [2022-04-27 14:31:07,309 INFO L272 TraceCheckUtils]: 6: Hoare triple {1811#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {1811#true} is VALID [2022-04-27 14:31:07,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {1811#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {1811#true} is VALID [2022-04-27 14:31:07,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {1811#true} call #t~ret6 := main(); {1811#true} is VALID [2022-04-27 14:31:07,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1811#true} {1811#true} #71#return; {1811#true} is VALID [2022-04-27 14:31:07,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {1811#true} assume true; {1811#true} is VALID [2022-04-27 14:31:07,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {1811#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(13, 2);call #Ultimate.allocInit(12, 3); {1811#true} is VALID [2022-04-27 14:31:07,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {1811#true} call ULTIMATE.init(); {1811#true} is VALID [2022-04-27 14:31:07,310 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 14:31:07,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:31:07,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788585679] [2022-04-27 14:31:07,310 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:31:07,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717319405] [2022-04-27 14:31:07,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717319405] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:31:07,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:31:07,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 14:31:07,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293872403] [2022-04-27 14:31:07,310 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:31:07,311 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) Word has length 43 [2022-04-27 14:31:07,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:31:07,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 14:31:09,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 38 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 14:31:09,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:31:09,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:31:09,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:31:09,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 14:31:09,340 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 14:31:11,403 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:31:11,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:31:11,791 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2022-04-27 14:31:11,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 14:31:11,791 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) Word has length 43 [2022-04-27 14:31:11,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:31:11,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 14:31:11,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-27 14:31:11,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 14:31:11,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-27 14:31:11,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 37 transitions. [2022-04-27 14:31:13,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 36 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 14:31:13,820 INFO L225 Difference]: With dead ends: 65 [2022-04-27 14:31:13,820 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 14:31:13,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:31:13,821 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:31:13,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 117 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 14:31:13,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 14:31:13,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-27 14:31:13,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:31:13,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 40 states have (on average 1.125) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:31:13,838 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 40 states have (on average 1.125) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:31:13,838 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 40 states have (on average 1.125) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:31:13,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:31:13,840 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2022-04-27 14:31:13,840 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-04-27 14:31:13,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:31:13,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:31:13,840 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 40 states have (on average 1.125) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 58 states. [2022-04-27 14:31:13,841 INFO L87 Difference]: Start difference. First operand has 58 states, 40 states have (on average 1.125) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 58 states. [2022-04-27 14:31:13,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:31:13,843 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2022-04-27 14:31:13,843 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-04-27 14:31:13,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:31:13,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:31:13,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:31:13,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:31:13,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.125) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:31:13,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2022-04-27 14:31:13,845 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 43 [2022-04-27 14:31:13,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:31:13,845 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2022-04-27 14:31:13,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 14:31:13,846 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-04-27 14:31:13,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-27 14:31:13,846 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:31:13,846 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:31:13,877 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 14:31:14,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:31:14,064 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:31:14,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:31:14,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1494691206, now seen corresponding path program 1 times [2022-04-27 14:31:14,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:31:14,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588407377] [2022-04-27 14:31:14,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:31:14,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:31:14,087 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:31:14,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1522424706] [2022-04-27 14:31:14,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:31:14,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:31:14,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:31:14,093 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:31:14,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 14:31:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:31:14,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 14:31:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:31:14,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:31:40,092 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 14:32:02,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {2371#true} call ULTIMATE.init(); {2371#true} is VALID [2022-04-27 14:32:02,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {2371#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(13, 2);call #Ultimate.allocInit(12, 3); {2371#true} is VALID [2022-04-27 14:32:02,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {2371#true} assume true; {2371#true} is VALID [2022-04-27 14:32:02,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2371#true} {2371#true} #71#return; {2371#true} is VALID [2022-04-27 14:32:02,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {2371#true} call #t~ret6 := main(); {2371#true} is VALID [2022-04-27 14:32:02,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {2371#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {2371#true} is VALID [2022-04-27 14:32:02,459 INFO L272 TraceCheckUtils]: 6: Hoare triple {2371#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {2371#true} is VALID [2022-04-27 14:32:02,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {2371#true} ~cond := #in~cond; {2371#true} is VALID [2022-04-27 14:32:02,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {2371#true} assume !(0 == ~cond); {2371#true} is VALID [2022-04-27 14:32:02,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {2371#true} assume true; {2371#true} is VALID [2022-04-27 14:32:02,459 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2371#true} {2371#true} #61#return; {2371#true} is VALID [2022-04-27 14:32:02,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {2371#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2371#true} is VALID [2022-04-27 14:32:02,459 INFO L272 TraceCheckUtils]: 12: Hoare triple {2371#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 50 then 1 else 0)); {2371#true} is VALID [2022-04-27 14:32:02,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {2371#true} ~cond := #in~cond; {2371#true} is VALID [2022-04-27 14:32:02,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {2371#true} assume !(0 == ~cond); {2371#true} is VALID [2022-04-27 14:32:02,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {2371#true} assume true; {2371#true} is VALID [2022-04-27 14:32:02,460 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2371#true} {2371#true} #63#return; {2371#true} is VALID [2022-04-27 14:32:02,460 INFO L272 TraceCheckUtils]: 17: Hoare triple {2371#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2371#true} is VALID [2022-04-27 14:32:02,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {2371#true} ~cond := #in~cond; {2371#true} is VALID [2022-04-27 14:32:02,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {2371#true} assume !(0 == ~cond); {2371#true} is VALID [2022-04-27 14:32:02,460 INFO L290 TraceCheckUtils]: 20: Hoare triple {2371#true} assume true; {2371#true} is VALID [2022-04-27 14:32:02,460 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2371#true} {2371#true} #65#return; {2371#true} is VALID [2022-04-27 14:32:02,460 INFO L290 TraceCheckUtils]: 22: Hoare triple {2371#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2442#(= main_~a~0 main_~x~0)} is VALID [2022-04-27 14:32:02,461 INFO L290 TraceCheckUtils]: 23: Hoare triple {2442#(= main_~a~0 main_~x~0)} assume !false; {2442#(= main_~a~0 main_~x~0)} is VALID [2022-04-27 14:32:02,461 INFO L272 TraceCheckUtils]: 24: Hoare triple {2442#(= main_~a~0 main_~x~0)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2371#true} is VALID [2022-04-27 14:32:02,461 INFO L290 TraceCheckUtils]: 25: Hoare triple {2371#true} ~cond := #in~cond; {2371#true} is VALID [2022-04-27 14:32:02,461 INFO L290 TraceCheckUtils]: 26: Hoare triple {2371#true} assume !(0 == ~cond); {2371#true} is VALID [2022-04-27 14:32:02,461 INFO L290 TraceCheckUtils]: 27: Hoare triple {2371#true} assume true; {2371#true} is VALID [2022-04-27 14:32:02,461 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2371#true} {2442#(= main_~a~0 main_~x~0)} #67#return; {2442#(= main_~a~0 main_~x~0)} is VALID [2022-04-27 14:32:02,462 INFO L290 TraceCheckUtils]: 29: Hoare triple {2442#(= main_~a~0 main_~x~0)} assume !!(0 != ~y~0); {2464#(and (not (= main_~y~0 0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:32:02,462 INFO L290 TraceCheckUtils]: 30: Hoare triple {2464#(and (not (= main_~y~0 0)) (= main_~a~0 main_~x~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {2468#(and (< 0 (+ main_~y~0 1)) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:32:02,463 INFO L290 TraceCheckUtils]: 31: Hoare triple {2468#(and (< 0 (+ main_~y~0 1)) (= main_~a~0 main_~x~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2472#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 14:32:02,463 INFO L290 TraceCheckUtils]: 32: Hoare triple {2472#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} assume !false; {2472#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 14:32:02,463 INFO L272 TraceCheckUtils]: 33: Hoare triple {2472#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2371#true} is VALID [2022-04-27 14:32:02,464 INFO L290 TraceCheckUtils]: 34: Hoare triple {2371#true} ~cond := #in~cond; {2482#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:32:02,464 INFO L290 TraceCheckUtils]: 35: Hoare triple {2482#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2486#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:32:02,464 INFO L290 TraceCheckUtils]: 36: Hoare triple {2486#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2486#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:32:02,465 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2486#(not (= |__VERIFIER_assert_#in~cond| 0))} {2472#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} #67#return; {2493#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 14:32:02,466 INFO L290 TraceCheckUtils]: 38: Hoare triple {2493#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} assume !!(0 != ~y~0); {2493#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 14:32:02,466 INFO L290 TraceCheckUtils]: 39: Hoare triple {2493#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {2500#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 14:32:02,630 INFO L290 TraceCheckUtils]: 40: Hoare triple {2500#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2504#(and (= (* main_~a~0 4) main_~x~0) (exists ((aux_mod_v_main_~y~0_27_22 Int) (aux_div_v_main_~y~0_27_22 Int)) (and (< 0 (+ (* aux_div_v_main_~y~0_27_22 2) aux_mod_v_main_~y~0_27_22 1)) (= (* main_~b~0 main_~a~0) (+ (* (* main_~a~0 2) (+ (* aux_div_v_main_~y~0_27_22 2) aux_mod_v_main_~y~0_27_22)) main_~z~0)) (= main_~y~0 (div (+ (* aux_div_v_main_~y~0_27_22 2) aux_mod_v_main_~y~0_27_22) 2)) (not (= aux_mod_v_main_~y~0_27_22 1)) (< aux_mod_v_main_~y~0_27_22 2) (<= 0 aux_mod_v_main_~y~0_27_22))))} is VALID [2022-04-27 14:32:04,633 WARN L290 TraceCheckUtils]: 41: Hoare triple {2504#(and (= (* main_~a~0 4) main_~x~0) (exists ((aux_mod_v_main_~y~0_27_22 Int) (aux_div_v_main_~y~0_27_22 Int)) (and (< 0 (+ (* aux_div_v_main_~y~0_27_22 2) aux_mod_v_main_~y~0_27_22 1)) (= (* main_~b~0 main_~a~0) (+ (* (* main_~a~0 2) (+ (* aux_div_v_main_~y~0_27_22 2) aux_mod_v_main_~y~0_27_22)) main_~z~0)) (= main_~y~0 (div (+ (* aux_div_v_main_~y~0_27_22 2) aux_mod_v_main_~y~0_27_22) 2)) (not (= aux_mod_v_main_~y~0_27_22 1)) (< aux_mod_v_main_~y~0_27_22 2) (<= 0 aux_mod_v_main_~y~0_27_22))))} assume !false; {2508#(and (= (mod (+ main_~z~0 (* main_~a~0 main_~y~0 (- 4)) (* main_~b~0 main_~a~0)) 2) 0) (= (* main_~a~0 4) main_~x~0) (= (div (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 2) (* 2 (* main_~a~0 main_~y~0))) (< 0 (+ main_~y~0 1)))} is UNKNOWN [2022-04-27 14:32:05,113 INFO L272 TraceCheckUtils]: 42: Hoare triple {2508#(and (= (mod (+ main_~z~0 (* main_~a~0 main_~y~0 (- 4)) (* main_~b~0 main_~a~0)) 2) 0) (= (* main_~a~0 4) main_~x~0) (= (div (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 2) (* 2 (* main_~a~0 main_~y~0))) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2512#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:32:05,113 INFO L290 TraceCheckUtils]: 43: Hoare triple {2512#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2516#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:32:05,114 INFO L290 TraceCheckUtils]: 44: Hoare triple {2516#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2372#false} is VALID [2022-04-27 14:32:05,114 INFO L290 TraceCheckUtils]: 45: Hoare triple {2372#false} assume !false; {2372#false} is VALID [2022-04-27 14:32:05,114 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-27 14:32:05,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:32:20,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:32:20,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588407377] [2022-04-27 14:32:20,232 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:32:20,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522424706] [2022-04-27 14:32:20,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522424706] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:32:20,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:32:20,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-27 14:32:20,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890131055] [2022-04-27 14:32:20,232 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:32:20,233 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2022-04-27 14:32:20,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:32:20,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 14:32:21,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:32:21,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 14:32:21,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:32:21,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 14:32:21,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-04-27 14:32:21,510 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 14:32:35,365 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:32:38,487 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:32:42,067 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:32:42,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:32:42,149 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2022-04-27 14:32:42,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 14:32:42,149 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2022-04-27 14:32:42,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:32:42,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 14:32:42,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 52 transitions. [2022-04-27 14:32:42,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 14:32:42,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 52 transitions. [2022-04-27 14:32:42,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 52 transitions. [2022-04-27 14:32:42,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:32:42,715 INFO L225 Difference]: With dead ends: 79 [2022-04-27 14:32:42,715 INFO L226 Difference]: Without dead ends: 77 [2022-04-27 14:32:42,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2022-04-27 14:32:42,715 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 14 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-04-27 14:32:42,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 234 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 183 Invalid, 1 Unknown, 26 Unchecked, 7.7s Time] [2022-04-27 14:32:42,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-27 14:32:42,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2022-04-27 14:32:42,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:32:42,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 70 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:32:42,746 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 70 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:32:42,746 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 70 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:32:42,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:32:42,748 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2022-04-27 14:32:42,748 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2022-04-27 14:32:42,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:32:42,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:32:42,748 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) Second operand 77 states. [2022-04-27 14:32:42,748 INFO L87 Difference]: Start difference. First operand has 70 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) Second operand 77 states. [2022-04-27 14:32:42,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:32:42,750 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2022-04-27 14:32:42,750 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2022-04-27 14:32:42,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:32:42,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:32:42,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:32:42,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:32:42,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:32:42,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2022-04-27 14:32:42,752 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 46 [2022-04-27 14:32:42,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:32:42,752 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2022-04-27 14:32:42,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 14:32:42,753 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2022-04-27 14:32:42,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-27 14:32:42,753 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:32:42,753 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:32:42,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 14:32:42,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:32:42,969 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:32:42,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:32:42,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1459553868, now seen corresponding path program 2 times [2022-04-27 14:32:42,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:32:42,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822384738] [2022-04-27 14:32:42,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:32:42,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:32:42,982 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:32:42,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [393803233] [2022-04-27 14:32:42,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:32:42,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:32:42,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:32:42,988 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:32:42,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 14:32:43,035 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:32:43,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:32:43,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-27 14:32:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:32:43,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:32:56,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {2922#true} call ULTIMATE.init(); {2922#true} is VALID [2022-04-27 14:32:56,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {2922#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(13, 2);call #Ultimate.allocInit(12, 3); {2922#true} is VALID [2022-04-27 14:32:56,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {2922#true} assume true; {2922#true} is VALID [2022-04-27 14:32:56,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2922#true} {2922#true} #71#return; {2922#true} is VALID [2022-04-27 14:32:56,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {2922#true} call #t~ret6 := main(); {2922#true} is VALID [2022-04-27 14:32:56,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {2922#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {2922#true} is VALID [2022-04-27 14:32:56,480 INFO L272 TraceCheckUtils]: 6: Hoare triple {2922#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {2922#true} is VALID [2022-04-27 14:32:56,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {2922#true} ~cond := #in~cond; {2922#true} is VALID [2022-04-27 14:32:56,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {2922#true} assume !(0 == ~cond); {2922#true} is VALID [2022-04-27 14:32:56,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {2922#true} assume true; {2922#true} is VALID [2022-04-27 14:32:56,481 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2922#true} {2922#true} #61#return; {2922#true} is VALID [2022-04-27 14:32:56,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {2922#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2922#true} is VALID [2022-04-27 14:32:56,481 INFO L272 TraceCheckUtils]: 12: Hoare triple {2922#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 50 then 1 else 0)); {2922#true} is VALID [2022-04-27 14:32:56,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {2922#true} ~cond := #in~cond; {2922#true} is VALID [2022-04-27 14:32:56,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {2922#true} assume !(0 == ~cond); {2922#true} is VALID [2022-04-27 14:32:56,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {2922#true} assume true; {2922#true} is VALID [2022-04-27 14:32:56,481 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2922#true} {2922#true} #63#return; {2922#true} is VALID [2022-04-27 14:32:56,481 INFO L272 TraceCheckUtils]: 17: Hoare triple {2922#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2922#true} is VALID [2022-04-27 14:32:56,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {2922#true} ~cond := #in~cond; {2922#true} is VALID [2022-04-27 14:32:56,481 INFO L290 TraceCheckUtils]: 19: Hoare triple {2922#true} assume !(0 == ~cond); {2922#true} is VALID [2022-04-27 14:32:56,481 INFO L290 TraceCheckUtils]: 20: Hoare triple {2922#true} assume true; {2922#true} is VALID [2022-04-27 14:32:56,481 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2922#true} {2922#true} #65#return; {2922#true} is VALID [2022-04-27 14:32:56,482 INFO L290 TraceCheckUtils]: 22: Hoare triple {2922#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2993#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:32:56,482 INFO L290 TraceCheckUtils]: 23: Hoare triple {2993#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {2993#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:32:56,482 INFO L272 TraceCheckUtils]: 24: Hoare triple {2993#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2922#true} is VALID [2022-04-27 14:32:56,482 INFO L290 TraceCheckUtils]: 25: Hoare triple {2922#true} ~cond := #in~cond; {2922#true} is VALID [2022-04-27 14:32:56,482 INFO L290 TraceCheckUtils]: 26: Hoare triple {2922#true} assume !(0 == ~cond); {2922#true} is VALID [2022-04-27 14:32:56,482 INFO L290 TraceCheckUtils]: 27: Hoare triple {2922#true} assume true; {2922#true} is VALID [2022-04-27 14:32:56,483 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2922#true} {2993#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #67#return; {2993#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:32:56,483 INFO L290 TraceCheckUtils]: 29: Hoare triple {2993#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {3015#(and (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:32:56,484 INFO L290 TraceCheckUtils]: 30: Hoare triple {3015#(and (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {3019#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-27 14:32:56,485 INFO L290 TraceCheckUtils]: 31: Hoare triple {3019#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3023#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-27 14:32:56,485 INFO L290 TraceCheckUtils]: 32: Hoare triple {3023#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !false; {3023#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-27 14:32:56,485 INFO L272 TraceCheckUtils]: 33: Hoare triple {3023#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2922#true} is VALID [2022-04-27 14:32:56,485 INFO L290 TraceCheckUtils]: 34: Hoare triple {2922#true} ~cond := #in~cond; {2922#true} is VALID [2022-04-27 14:32:56,485 INFO L290 TraceCheckUtils]: 35: Hoare triple {2922#true} assume !(0 == ~cond); {2922#true} is VALID [2022-04-27 14:32:56,485 INFO L290 TraceCheckUtils]: 36: Hoare triple {2922#true} assume true; {2922#true} is VALID [2022-04-27 14:32:56,486 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2922#true} {3023#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} #67#return; {3023#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-27 14:32:56,486 INFO L290 TraceCheckUtils]: 38: Hoare triple {3023#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !!(0 != ~y~0); {3045#(and (not (= main_~y~0 0)) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-27 14:32:56,487 INFO L290 TraceCheckUtils]: 39: Hoare triple {3045#(and (not (= main_~y~0 0)) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {3049#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (div (+ (- 1) main_~b~0) 2) (+ main_~y~0 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-27 14:32:56,489 INFO L290 TraceCheckUtils]: 40: Hoare triple {3049#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (div (+ (- 1) main_~b~0) 2) (+ main_~y~0 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3053#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-27 14:32:56,489 INFO L290 TraceCheckUtils]: 41: Hoare triple {3053#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} assume !false; {3053#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-27 14:32:56,489 INFO L272 TraceCheckUtils]: 42: Hoare triple {3053#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2922#true} is VALID [2022-04-27 14:32:56,489 INFO L290 TraceCheckUtils]: 43: Hoare triple {2922#true} ~cond := #in~cond; {3063#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:32:56,490 INFO L290 TraceCheckUtils]: 44: Hoare triple {3063#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3067#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:32:56,490 INFO L290 TraceCheckUtils]: 45: Hoare triple {3067#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3067#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:32:56,491 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3067#(not (= |__VERIFIER_assert_#in~cond| 0))} {3053#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} #67#return; {3074#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-27 14:32:56,491 INFO L290 TraceCheckUtils]: 47: Hoare triple {3074#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} assume !!(0 != ~y~0); {3074#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-27 14:32:56,492 INFO L290 TraceCheckUtils]: 48: Hoare triple {3074#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3081#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 4) main_~x~0) (not (= (mod main_~y~0 2) 1)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-27 14:32:56,496 INFO L290 TraceCheckUtils]: 49: Hoare triple {3081#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 4) main_~x~0) (not (= (mod main_~y~0 2) 1)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3085#(and (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) main_~y~0) (= main_~x~0 (* main_~a~0 8)) (not (= (mod (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0) (= (+ (* (* main_~a~0 4) (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2)) main_~z~0) (* main_~b~0 main_~a~0)))} is VALID [2022-04-27 14:32:56,497 INFO L290 TraceCheckUtils]: 50: Hoare triple {3085#(and (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) main_~y~0) (= main_~x~0 (* main_~a~0 8)) (not (= (mod (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0) (= (+ (* (* main_~a~0 4) (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2)) main_~z~0) (* main_~b~0 main_~a~0)))} assume !false; {3085#(and (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) main_~y~0) (= main_~x~0 (* main_~a~0 8)) (not (= (mod (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0) (= (+ (* (* main_~a~0 4) (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2)) main_~z~0) (* main_~b~0 main_~a~0)))} is VALID [2022-04-27 14:32:56,500 INFO L272 TraceCheckUtils]: 51: Hoare triple {3085#(and (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) main_~y~0) (= main_~x~0 (* main_~a~0 8)) (not (= (mod (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0) (= (+ (* (* main_~a~0 4) (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2)) main_~z~0) (* main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3092#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:32:56,500 INFO L290 TraceCheckUtils]: 52: Hoare triple {3092#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3096#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:32:56,501 INFO L290 TraceCheckUtils]: 53: Hoare triple {3096#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2923#false} is VALID [2022-04-27 14:32:56,501 INFO L290 TraceCheckUtils]: 54: Hoare triple {2923#false} assume !false; {2923#false} is VALID [2022-04-27 14:32:56,501 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-27 14:32:56,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:34:39,631 INFO L290 TraceCheckUtils]: 54: Hoare triple {2923#false} assume !false; {2923#false} is VALID [2022-04-27 14:34:39,632 INFO L290 TraceCheckUtils]: 53: Hoare triple {3096#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2923#false} is VALID [2022-04-27 14:34:39,632 INFO L290 TraceCheckUtils]: 52: Hoare triple {3092#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3096#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:34:39,633 INFO L272 TraceCheckUtils]: 51: Hoare triple {3112#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3092#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:34:39,633 INFO L290 TraceCheckUtils]: 50: Hoare triple {3112#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {3112#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:34:39,637 INFO L290 TraceCheckUtils]: 49: Hoare triple {3119#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3112#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:34:39,638 INFO L290 TraceCheckUtils]: 48: Hoare triple {3123#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3119#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-27 14:34:39,639 INFO L290 TraceCheckUtils]: 47: Hoare triple {3123#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !!(0 != ~y~0); {3123#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-27 14:34:39,641 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3067#(not (= |__VERIFIER_assert_#in~cond| 0))} {3130#(or (<= 0 main_~y~0) (= (+ (* (* main_~x~0 2) (+ (div main_~y~0 2) 1)) (* main_~b~0 main_~a~0) (* (- 1) main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (mod main_~y~0 2) 0))} #67#return; {3123#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-27 14:34:39,641 INFO L290 TraceCheckUtils]: 45: Hoare triple {3067#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3067#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:34:39,642 INFO L290 TraceCheckUtils]: 44: Hoare triple {3140#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3067#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:34:39,642 INFO L290 TraceCheckUtils]: 43: Hoare triple {2922#true} ~cond := #in~cond; {3140#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 14:34:39,642 INFO L272 TraceCheckUtils]: 42: Hoare triple {3130#(or (<= 0 main_~y~0) (= (+ (* (* main_~x~0 2) (+ (div main_~y~0 2) 1)) (* main_~b~0 main_~a~0) (* (- 1) main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2922#true} is VALID [2022-04-27 14:34:39,642 INFO L290 TraceCheckUtils]: 41: Hoare triple {3130#(or (<= 0 main_~y~0) (= (+ (* (* main_~x~0 2) (+ (div main_~y~0 2) 1)) (* main_~b~0 main_~a~0) (* (- 1) main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (mod main_~y~0 2) 0))} assume !false; {3130#(or (<= 0 main_~y~0) (= (+ (* (* main_~x~0 2) (+ (div main_~y~0 2) 1)) (* main_~b~0 main_~a~0) (* (- 1) main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (mod main_~y~0 2) 0))} is VALID [2022-04-27 14:34:39,840 INFO L290 TraceCheckUtils]: 40: Hoare triple {3150#(and (or (<= 0 (+ (div main_~y~0 2) 1)) (= (mod main_~y~0 2) 0) (forall ((aux_div_aux_mod_v_main_~y~0_39_22_69 Int) (aux_div_v_main_~y~0_39_22 Int)) (or (< (+ (div main_~y~0 2) 1) (* 2 aux_div_aux_mod_v_main_~y~0_39_22_69)) (<= (+ (* 2 aux_div_aux_mod_v_main_~y~0_39_22_69) 1) (div main_~y~0 2)) (= (+ (div main_~y~0 2) (* (- 2) aux_div_v_main_~y~0_39_22) 1) 0) (<= (+ (* aux_div_v_main_~y~0_39_22 2) 1) (div main_~y~0 2)) (< (+ (div main_~y~0 2) 1) (* aux_div_v_main_~y~0_39_22 2)) (= (+ (* main_~x~0 4) (* (* main_~x~0 aux_div_aux_mod_v_main_~y~0_39_22_69) 4)) (+ (* (* aux_div_v_main_~y~0_39_22 main_~x~0) 4) (* (* (+ (div main_~y~0 2) (* (- 2) aux_div_v_main_~y~0_39_22) 1) main_~x~0) 2)))))) (or (forall ((aux_div_aux_mod_v_main_~y~0_39_22_69 Int) (aux_div_v_main_~y~0_39_22 Int)) (or (<= (+ 2 (* aux_div_v_main_~y~0_39_22 2)) (div main_~y~0 2)) (= (+ (* (* aux_div_v_main_~y~0_39_22 main_~x~0) 4) (* (* (+ (div main_~y~0 2) (* (- 2) aux_div_v_main_~y~0_39_22)) main_~x~0) 2)) (+ (* main_~x~0 4) (* (* main_~x~0 aux_div_aux_mod_v_main_~y~0_39_22_69) 4))) (< (div main_~y~0 2) (* aux_div_v_main_~y~0_39_22 2)) (< (div main_~y~0 2) (* 2 aux_div_aux_mod_v_main_~y~0_39_22_69)) (<= (+ (* 2 aux_div_aux_mod_v_main_~y~0_39_22_69) 2) (div main_~y~0 2)) (= (+ (div main_~y~0 2) (* (- 2) aux_div_v_main_~y~0_39_22)) 0))) (not (= (mod main_~y~0 2) 0)) (<= 0 (div main_~y~0 2))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3130#(or (<= 0 main_~y~0) (= (+ (* (* main_~x~0 2) (+ (div main_~y~0 2) 1)) (* main_~b~0 main_~a~0) (* (- 1) main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (mod main_~y~0 2) 0))} is VALID [2022-04-27 14:34:39,842 INFO L290 TraceCheckUtils]: 39: Hoare triple {2922#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {3150#(and (or (<= 0 (+ (div main_~y~0 2) 1)) (= (mod main_~y~0 2) 0) (forall ((aux_div_aux_mod_v_main_~y~0_39_22_69 Int) (aux_div_v_main_~y~0_39_22 Int)) (or (< (+ (div main_~y~0 2) 1) (* 2 aux_div_aux_mod_v_main_~y~0_39_22_69)) (<= (+ (* 2 aux_div_aux_mod_v_main_~y~0_39_22_69) 1) (div main_~y~0 2)) (= (+ (div main_~y~0 2) (* (- 2) aux_div_v_main_~y~0_39_22) 1) 0) (<= (+ (* aux_div_v_main_~y~0_39_22 2) 1) (div main_~y~0 2)) (< (+ (div main_~y~0 2) 1) (* aux_div_v_main_~y~0_39_22 2)) (= (+ (* main_~x~0 4) (* (* main_~x~0 aux_div_aux_mod_v_main_~y~0_39_22_69) 4)) (+ (* (* aux_div_v_main_~y~0_39_22 main_~x~0) 4) (* (* (+ (div main_~y~0 2) (* (- 2) aux_div_v_main_~y~0_39_22) 1) main_~x~0) 2)))))) (or (forall ((aux_div_aux_mod_v_main_~y~0_39_22_69 Int) (aux_div_v_main_~y~0_39_22 Int)) (or (<= (+ 2 (* aux_div_v_main_~y~0_39_22 2)) (div main_~y~0 2)) (= (+ (* (* aux_div_v_main_~y~0_39_22 main_~x~0) 4) (* (* (+ (div main_~y~0 2) (* (- 2) aux_div_v_main_~y~0_39_22)) main_~x~0) 2)) (+ (* main_~x~0 4) (* (* main_~x~0 aux_div_aux_mod_v_main_~y~0_39_22_69) 4))) (< (div main_~y~0 2) (* aux_div_v_main_~y~0_39_22 2)) (< (div main_~y~0 2) (* 2 aux_div_aux_mod_v_main_~y~0_39_22_69)) (<= (+ (* 2 aux_div_aux_mod_v_main_~y~0_39_22_69) 2) (div main_~y~0 2)) (= (+ (div main_~y~0 2) (* (- 2) aux_div_v_main_~y~0_39_22)) 0))) (not (= (mod main_~y~0 2) 0)) (<= 0 (div main_~y~0 2))))} is VALID [2022-04-27 14:34:39,842 INFO L290 TraceCheckUtils]: 38: Hoare triple {2922#true} assume !!(0 != ~y~0); {2922#true} is VALID [2022-04-27 14:34:39,842 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2922#true} {2922#true} #67#return; {2922#true} is VALID [2022-04-27 14:34:39,842 INFO L290 TraceCheckUtils]: 36: Hoare triple {2922#true} assume true; {2922#true} is VALID [2022-04-27 14:34:39,842 INFO L290 TraceCheckUtils]: 35: Hoare triple {2922#true} assume !(0 == ~cond); {2922#true} is VALID [2022-04-27 14:34:39,843 INFO L290 TraceCheckUtils]: 34: Hoare triple {2922#true} ~cond := #in~cond; {2922#true} is VALID [2022-04-27 14:34:39,843 INFO L272 TraceCheckUtils]: 33: Hoare triple {2922#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2922#true} is VALID [2022-04-27 14:34:39,843 INFO L290 TraceCheckUtils]: 32: Hoare triple {2922#true} assume !false; {2922#true} is VALID [2022-04-27 14:34:39,843 INFO L290 TraceCheckUtils]: 31: Hoare triple {2922#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2922#true} is VALID [2022-04-27 14:34:39,843 INFO L290 TraceCheckUtils]: 30: Hoare triple {2922#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {2922#true} is VALID [2022-04-27 14:34:39,843 INFO L290 TraceCheckUtils]: 29: Hoare triple {2922#true} assume !!(0 != ~y~0); {2922#true} is VALID [2022-04-27 14:34:39,843 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2922#true} {2922#true} #67#return; {2922#true} is VALID [2022-04-27 14:34:39,843 INFO L290 TraceCheckUtils]: 27: Hoare triple {2922#true} assume true; {2922#true} is VALID [2022-04-27 14:34:39,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {2922#true} assume !(0 == ~cond); {2922#true} is VALID [2022-04-27 14:34:39,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {2922#true} ~cond := #in~cond; {2922#true} is VALID [2022-04-27 14:34:39,843 INFO L272 TraceCheckUtils]: 24: Hoare triple {2922#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2922#true} is VALID [2022-04-27 14:34:39,843 INFO L290 TraceCheckUtils]: 23: Hoare triple {2922#true} assume !false; {2922#true} is VALID [2022-04-27 14:34:39,843 INFO L290 TraceCheckUtils]: 22: Hoare triple {2922#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2922#true} is VALID [2022-04-27 14:34:39,843 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2922#true} {2922#true} #65#return; {2922#true} is VALID [2022-04-27 14:34:39,843 INFO L290 TraceCheckUtils]: 20: Hoare triple {2922#true} assume true; {2922#true} is VALID [2022-04-27 14:34:39,843 INFO L290 TraceCheckUtils]: 19: Hoare triple {2922#true} assume !(0 == ~cond); {2922#true} is VALID [2022-04-27 14:34:39,843 INFO L290 TraceCheckUtils]: 18: Hoare triple {2922#true} ~cond := #in~cond; {2922#true} is VALID [2022-04-27 14:34:39,843 INFO L272 TraceCheckUtils]: 17: Hoare triple {2922#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2922#true} is VALID [2022-04-27 14:34:39,844 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2922#true} {2922#true} #63#return; {2922#true} is VALID [2022-04-27 14:34:39,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {2922#true} assume true; {2922#true} is VALID [2022-04-27 14:34:39,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {2922#true} assume !(0 == ~cond); {2922#true} is VALID [2022-04-27 14:34:39,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {2922#true} ~cond := #in~cond; {2922#true} is VALID [2022-04-27 14:34:39,844 INFO L272 TraceCheckUtils]: 12: Hoare triple {2922#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 50 then 1 else 0)); {2922#true} is VALID [2022-04-27 14:34:39,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {2922#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2922#true} is VALID [2022-04-27 14:34:39,844 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2922#true} {2922#true} #61#return; {2922#true} is VALID [2022-04-27 14:34:39,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {2922#true} assume true; {2922#true} is VALID [2022-04-27 14:34:39,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {2922#true} assume !(0 == ~cond); {2922#true} is VALID [2022-04-27 14:34:39,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {2922#true} ~cond := #in~cond; {2922#true} is VALID [2022-04-27 14:34:39,844 INFO L272 TraceCheckUtils]: 6: Hoare triple {2922#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {2922#true} is VALID [2022-04-27 14:34:39,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {2922#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {2922#true} is VALID [2022-04-27 14:34:39,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {2922#true} call #t~ret6 := main(); {2922#true} is VALID [2022-04-27 14:34:39,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2922#true} {2922#true} #71#return; {2922#true} is VALID [2022-04-27 14:34:39,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {2922#true} assume true; {2922#true} is VALID [2022-04-27 14:34:39,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {2922#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(13, 2);call #Ultimate.allocInit(12, 3); {2922#true} is VALID [2022-04-27 14:34:39,844 INFO L272 TraceCheckUtils]: 0: Hoare triple {2922#true} call ULTIMATE.init(); {2922#true} is VALID [2022-04-27 14:34:39,845 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-27 14:34:39,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:34:39,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822384738] [2022-04-27 14:34:39,845 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:34:39,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393803233] [2022-04-27 14:34:39,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393803233] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:34:39,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:34:39,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 22 [2022-04-27 14:34:39,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867419934] [2022-04-27 14:34:39,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:34:39,846 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 55 [2022-04-27 14:34:39,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:34:39,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 14:34:39,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:34:39,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-27 14:34:39,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:34:39,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-27 14:34:39,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2022-04-27 14:34:39,911 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 14:34:43,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:43,332 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2022-04-27 14:34:43,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-27 14:34:43,332 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 55 [2022-04-27 14:34:43,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:34:43,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 14:34:43,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 75 transitions. [2022-04-27 14:34:43,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 14:34:43,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 75 transitions. [2022-04-27 14:34:43,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 75 transitions. [2022-04-27 14:34:43,661 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 14:34:43,663 INFO L225 Difference]: With dead ends: 100 [2022-04-27 14:34:43,664 INFO L226 Difference]: Without dead ends: 98 [2022-04-27 14:34:43,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2022-04-27 14:34:43,664 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 33 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:34:43,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 233 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 247 Invalid, 0 Unknown, 28 Unchecked, 1.1s Time] [2022-04-27 14:34:43,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-27 14:34:43,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2022-04-27 14:34:43,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:34:43,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 91 states, 65 states have (on average 1.123076923076923) internal successors, (73), 69 states have internal predecessors, (73), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:34:43,700 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 91 states, 65 states have (on average 1.123076923076923) internal successors, (73), 69 states have internal predecessors, (73), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:34:43,701 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 91 states, 65 states have (on average 1.123076923076923) internal successors, (73), 69 states have internal predecessors, (73), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:34:43,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:43,703 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2022-04-27 14:34:43,704 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2022-04-27 14:34:43,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:43,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:43,704 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 65 states have (on average 1.123076923076923) internal successors, (73), 69 states have internal predecessors, (73), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) Second operand 98 states. [2022-04-27 14:34:43,704 INFO L87 Difference]: Start difference. First operand has 91 states, 65 states have (on average 1.123076923076923) internal successors, (73), 69 states have internal predecessors, (73), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) Second operand 98 states. [2022-04-27 14:34:43,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:43,707 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2022-04-27 14:34:43,707 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2022-04-27 14:34:43,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:43,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:43,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:34:43,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:34:43,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.123076923076923) internal successors, (73), 69 states have internal predecessors, (73), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 14:34:43,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2022-04-27 14:34:43,710 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 55 [2022-04-27 14:34:43,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:34:43,710 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2022-04-27 14:34:43,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 14:34:43,711 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2022-04-27 14:34:43,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-27 14:34:43,712 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:34:43,712 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:34:43,746 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 14:34:43,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:34:43,912 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:34:43,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:34:43,913 INFO L85 PathProgramCache]: Analyzing trace with hash -699618950, now seen corresponding path program 3 times [2022-04-27 14:34:43,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:34:43,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37690454] [2022-04-27 14:34:43,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:34:43,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:34:43,926 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:34:43,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1747039341] [2022-04-27 14:34:43,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:34:43,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:34:43,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:34:43,927 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:34:43,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 14:34:43,992 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-04-27 14:34:43,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:34:43,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-27 14:34:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:34:44,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:35:06,179 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 14:35:09,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {3754#true} call ULTIMATE.init(); {3754#true} is VALID [2022-04-27 14:35:09,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {3754#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(13, 2);call #Ultimate.allocInit(12, 3); {3754#true} is VALID [2022-04-27 14:35:09,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {3754#true} assume true; {3754#true} is VALID [2022-04-27 14:35:09,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3754#true} {3754#true} #71#return; {3754#true} is VALID [2022-04-27 14:35:09,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {3754#true} call #t~ret6 := main(); {3754#true} is VALID [2022-04-27 14:35:09,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {3754#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {3754#true} is VALID [2022-04-27 14:35:09,726 INFO L272 TraceCheckUtils]: 6: Hoare triple {3754#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {3754#true} is VALID [2022-04-27 14:35:09,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {3754#true} ~cond := #in~cond; {3754#true} is VALID [2022-04-27 14:35:09,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {3754#true} assume !(0 == ~cond); {3754#true} is VALID [2022-04-27 14:35:09,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {3754#true} assume true; {3754#true} is VALID [2022-04-27 14:35:09,731 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3754#true} {3754#true} #61#return; {3754#true} is VALID [2022-04-27 14:35:09,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {3754#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3754#true} is VALID [2022-04-27 14:35:09,731 INFO L272 TraceCheckUtils]: 12: Hoare triple {3754#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 50 then 1 else 0)); {3754#true} is VALID [2022-04-27 14:35:09,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {3754#true} ~cond := #in~cond; {3798#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:35:09,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {3798#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3802#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:35:09,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {3802#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3802#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:35:09,733 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3802#(not (= |assume_abort_if_not_#in~cond| 0))} {3754#true} #63#return; {3809#(and (<= main_~b~0 50) (<= 0 main_~b~0))} is VALID [2022-04-27 14:35:09,733 INFO L272 TraceCheckUtils]: 17: Hoare triple {3809#(and (<= main_~b~0 50) (<= 0 main_~b~0))} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3754#true} is VALID [2022-04-27 14:35:09,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {3754#true} ~cond := #in~cond; {3754#true} is VALID [2022-04-27 14:35:09,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {3754#true} assume !(0 == ~cond); {3754#true} is VALID [2022-04-27 14:35:09,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {3754#true} assume true; {3754#true} is VALID [2022-04-27 14:35:09,733 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3754#true} {3809#(and (<= main_~b~0 50) (<= 0 main_~b~0))} #65#return; {3809#(and (<= main_~b~0 50) (<= 0 main_~b~0))} is VALID [2022-04-27 14:35:09,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {3809#(and (<= main_~b~0 50) (<= 0 main_~b~0))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3828#(and (= main_~b~0 main_~y~0) (<= main_~b~0 50) (<= 0 main_~b~0))} is VALID [2022-04-27 14:35:09,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {3828#(and (= main_~b~0 main_~y~0) (<= main_~b~0 50) (<= 0 main_~b~0))} assume !false; {3828#(and (= main_~b~0 main_~y~0) (<= main_~b~0 50) (<= 0 main_~b~0))} is VALID [2022-04-27 14:35:09,734 INFO L272 TraceCheckUtils]: 24: Hoare triple {3828#(and (= main_~b~0 main_~y~0) (<= main_~b~0 50) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3754#true} is VALID [2022-04-27 14:35:09,734 INFO L290 TraceCheckUtils]: 25: Hoare triple {3754#true} ~cond := #in~cond; {3754#true} is VALID [2022-04-27 14:35:09,734 INFO L290 TraceCheckUtils]: 26: Hoare triple {3754#true} assume !(0 == ~cond); {3754#true} is VALID [2022-04-27 14:35:09,734 INFO L290 TraceCheckUtils]: 27: Hoare triple {3754#true} assume true; {3754#true} is VALID [2022-04-27 14:35:09,734 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3754#true} {3828#(and (= main_~b~0 main_~y~0) (<= main_~b~0 50) (<= 0 main_~b~0))} #67#return; {3828#(and (= main_~b~0 main_~y~0) (<= main_~b~0 50) (<= 0 main_~b~0))} is VALID [2022-04-27 14:35:09,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {3828#(and (= main_~b~0 main_~y~0) (<= main_~b~0 50) (<= 0 main_~b~0))} assume !!(0 != ~y~0); {3850#(and (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (<= main_~b~0 50) (<= 0 main_~b~0))} is VALID [2022-04-27 14:35:09,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {3850#(and (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (<= main_~b~0 50) (<= 0 main_~b~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {3854#(and (<= main_~b~0 (+ main_~y~0 1)) (<= main_~b~0 50) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-27 14:35:09,736 INFO L290 TraceCheckUtils]: 31: Hoare triple {3854#(and (<= main_~b~0 (+ main_~y~0 1)) (<= main_~b~0 50) (not (= main_~b~0 0)) (<= 0 main_~b~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3858#(and (<= main_~b~0 50) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-27 14:35:09,736 INFO L290 TraceCheckUtils]: 32: Hoare triple {3858#(and (<= main_~b~0 50) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} assume !false; {3858#(and (<= main_~b~0 50) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-27 14:35:09,736 INFO L272 TraceCheckUtils]: 33: Hoare triple {3858#(and (<= main_~b~0 50) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3754#true} is VALID [2022-04-27 14:35:09,737 INFO L290 TraceCheckUtils]: 34: Hoare triple {3754#true} ~cond := #in~cond; {3754#true} is VALID [2022-04-27 14:35:09,737 INFO L290 TraceCheckUtils]: 35: Hoare triple {3754#true} assume !(0 == ~cond); {3754#true} is VALID [2022-04-27 14:35:09,737 INFO L290 TraceCheckUtils]: 36: Hoare triple {3754#true} assume true; {3754#true} is VALID [2022-04-27 14:35:09,737 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3754#true} {3858#(and (<= main_~b~0 50) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} #67#return; {3858#(and (<= main_~b~0 50) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-27 14:35:09,737 INFO L290 TraceCheckUtils]: 38: Hoare triple {3858#(and (<= main_~b~0 50) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} assume !!(0 != ~y~0); {3880#(and (not (= main_~y~0 0)) (<= main_~b~0 50) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-27 14:35:09,738 INFO L290 TraceCheckUtils]: 39: Hoare triple {3880#(and (not (= main_~y~0 0)) (<= main_~b~0 50) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3884#(and (not (= main_~y~0 0)) (not (= (mod main_~y~0 2) 1)) (<= main_~b~0 50) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-27 14:35:09,741 INFO L290 TraceCheckUtils]: 40: Hoare triple {3884#(and (not (= main_~y~0 0)) (not (= (mod main_~y~0 2) 1)) (<= main_~b~0 50) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3888#(and (<= main_~b~0 50) (not (= main_~b~0 0)) (<= 0 main_~b~0) (exists ((aux_mod_v_main_~y~0_43_22 Int) (aux_div_v_main_~y~0_43_22 Int)) (and (not (= aux_mod_v_main_~y~0_43_22 1)) (< aux_mod_v_main_~y~0_43_22 2) (<= (div (+ aux_mod_v_main_~y~0_43_22 (* aux_div_v_main_~y~0_43_22 2)) 2) main_~y~0) (<= 0 aux_mod_v_main_~y~0_43_22) (not (= (+ aux_mod_v_main_~y~0_43_22 (* aux_div_v_main_~y~0_43_22 2)) 0)) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ aux_mod_v_main_~y~0_43_22 (* aux_div_v_main_~y~0_43_22 2) 1)))))} is VALID [2022-04-27 14:35:09,743 INFO L290 TraceCheckUtils]: 41: Hoare triple {3888#(and (<= main_~b~0 50) (not (= main_~b~0 0)) (<= 0 main_~b~0) (exists ((aux_mod_v_main_~y~0_43_22 Int) (aux_div_v_main_~y~0_43_22 Int)) (and (not (= aux_mod_v_main_~y~0_43_22 1)) (< aux_mod_v_main_~y~0_43_22 2) (<= (div (+ aux_mod_v_main_~y~0_43_22 (* aux_div_v_main_~y~0_43_22 2)) 2) main_~y~0) (<= 0 aux_mod_v_main_~y~0_43_22) (not (= (+ aux_mod_v_main_~y~0_43_22 (* aux_div_v_main_~y~0_43_22 2)) 0)) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ aux_mod_v_main_~y~0_43_22 (* aux_div_v_main_~y~0_43_22 2) 1)))))} assume !false; {3892#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 50) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} is VALID [2022-04-27 14:35:09,743 INFO L272 TraceCheckUtils]: 42: Hoare triple {3892#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 50) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3754#true} is VALID [2022-04-27 14:35:09,743 INFO L290 TraceCheckUtils]: 43: Hoare triple {3754#true} ~cond := #in~cond; {3754#true} is VALID [2022-04-27 14:35:09,743 INFO L290 TraceCheckUtils]: 44: Hoare triple {3754#true} assume !(0 == ~cond); {3754#true} is VALID [2022-04-27 14:35:09,743 INFO L290 TraceCheckUtils]: 45: Hoare triple {3754#true} assume true; {3754#true} is VALID [2022-04-27 14:35:09,743 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3754#true} {3892#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 50) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} #67#return; {3892#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 50) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} is VALID [2022-04-27 14:35:09,743 INFO L290 TraceCheckUtils]: 47: Hoare triple {3892#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 50) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} assume !!(0 != ~y~0); {3892#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 50) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} is VALID [2022-04-27 14:35:09,744 INFO L290 TraceCheckUtils]: 48: Hoare triple {3892#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 50) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3892#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 50) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} is VALID [2022-04-27 14:35:09,745 INFO L290 TraceCheckUtils]: 49: Hoare triple {3892#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 50) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3917#(and (<= main_~b~0 50) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-27 14:35:09,745 INFO L290 TraceCheckUtils]: 50: Hoare triple {3917#(and (<= main_~b~0 50) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} assume !false; {3917#(and (<= main_~b~0 50) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-27 14:35:09,745 INFO L272 TraceCheckUtils]: 51: Hoare triple {3917#(and (<= main_~b~0 50) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3754#true} is VALID [2022-04-27 14:35:09,745 INFO L290 TraceCheckUtils]: 52: Hoare triple {3754#true} ~cond := #in~cond; {3927#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:35:09,746 INFO L290 TraceCheckUtils]: 53: Hoare triple {3927#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:35:09,746 INFO L290 TraceCheckUtils]: 54: Hoare triple {3931#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:35:09,746 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {3931#(not (= |__VERIFIER_assert_#in~cond| 0))} {3917#(and (<= main_~b~0 50) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} #67#return; {3938#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= main_~b~0 50) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-27 14:35:09,747 INFO L290 TraceCheckUtils]: 56: Hoare triple {3938#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= main_~b~0 50) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} assume !!(0 != ~y~0); {3938#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= main_~b~0 50) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-27 14:35:09,748 INFO L290 TraceCheckUtils]: 57: Hoare triple {3938#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= main_~b~0 50) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3945#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (<= main_~b~0 50) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-27 14:35:11,749 WARN L290 TraceCheckUtils]: 58: Hoare triple {3945#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (<= main_~b~0 50) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3949#(and (exists ((aux_mod_v_main_~y~0_45_22 Int) (aux_div_v_main_~y~0_45_22 Int)) (and (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ aux_mod_v_main_~y~0_45_22 (* aux_div_v_main_~y~0_45_22 2) 1)) (< aux_mod_v_main_~y~0_45_22 2) (= (+ (* (div (- main_~x~0) (- 2)) (+ aux_mod_v_main_~y~0_45_22 (* aux_div_v_main_~y~0_45_22 2))) main_~z~0) (* main_~b~0 main_~a~0)) (= main_~y~0 (div (+ aux_mod_v_main_~y~0_45_22 (* aux_div_v_main_~y~0_45_22 2)) 2)) (<= 0 aux_mod_v_main_~y~0_45_22) (not (= aux_mod_v_main_~y~0_45_22 1)))) (<= main_~b~0 50) (not (= main_~b~0 0)) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0))} is UNKNOWN [2022-04-27 14:35:11,919 INFO L290 TraceCheckUtils]: 59: Hoare triple {3949#(and (exists ((aux_mod_v_main_~y~0_45_22 Int) (aux_div_v_main_~y~0_45_22 Int)) (and (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ aux_mod_v_main_~y~0_45_22 (* aux_div_v_main_~y~0_45_22 2) 1)) (< aux_mod_v_main_~y~0_45_22 2) (= (+ (* (div (- main_~x~0) (- 2)) (+ aux_mod_v_main_~y~0_45_22 (* aux_div_v_main_~y~0_45_22 2))) main_~z~0) (* main_~b~0 main_~a~0)) (= main_~y~0 (div (+ aux_mod_v_main_~y~0_45_22 (* aux_div_v_main_~y~0_45_22 2)) 2)) (<= 0 aux_mod_v_main_~y~0_45_22) (not (= aux_mod_v_main_~y~0_45_22 1)))) (<= main_~b~0 50) (not (= main_~b~0 0)) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0))} assume !false; {3953#(and (< (div (* (- 1) (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2))) (- 2)) (+ main_~y~0 1)) (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) (* main_~b~0 main_~a~0)) (<= main_~b~0 50) (not (= main_~b~0 0)) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 14:35:12,189 INFO L272 TraceCheckUtils]: 60: Hoare triple {3953#(and (< (div (* (- 1) (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2))) (- 2)) (+ main_~y~0 1)) (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) (* main_~b~0 main_~a~0)) (<= main_~b~0 50) (not (= main_~b~0 0)) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3957#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:35:12,189 INFO L290 TraceCheckUtils]: 61: Hoare triple {3957#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3961#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:35:12,189 INFO L290 TraceCheckUtils]: 62: Hoare triple {3961#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3755#false} is VALID [2022-04-27 14:35:12,189 INFO L290 TraceCheckUtils]: 63: Hoare triple {3755#false} assume !false; {3755#false} is VALID [2022-04-27 14:35:12,190 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 14:35:12,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:35:47,130 INFO L290 TraceCheckUtils]: 63: Hoare triple {3755#false} assume !false; {3755#false} is VALID [2022-04-27 14:35:47,130 INFO L290 TraceCheckUtils]: 62: Hoare triple {3961#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3755#false} is VALID [2022-04-27 14:35:47,130 INFO L290 TraceCheckUtils]: 61: Hoare triple {3957#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3961#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:35:47,131 INFO L272 TraceCheckUtils]: 60: Hoare triple {3977#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3957#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:35:47,131 INFO L290 TraceCheckUtils]: 59: Hoare triple {3977#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {3977#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:35:47,136 INFO L290 TraceCheckUtils]: 58: Hoare triple {3984#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3977#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:35:47,137 INFO L290 TraceCheckUtils]: 57: Hoare triple {3988#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3984#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-27 14:35:47,137 INFO L290 TraceCheckUtils]: 56: Hoare triple {3988#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !!(0 != ~y~0); {3988#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-27 14:35:47,139 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {3931#(not (= |__VERIFIER_assert_#in~cond| 0))} {3995#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} #67#return; {3988#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-27 14:35:47,140 INFO L290 TraceCheckUtils]: 54: Hoare triple {3931#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:35:47,140 INFO L290 TraceCheckUtils]: 53: Hoare triple {4005#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3931#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:35:47,140 INFO L290 TraceCheckUtils]: 52: Hoare triple {3754#true} ~cond := #in~cond; {4005#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 14:35:47,140 INFO L272 TraceCheckUtils]: 51: Hoare triple {3995#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3754#true} is VALID [2022-04-27 14:35:47,141 INFO L290 TraceCheckUtils]: 50: Hoare triple {3995#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} assume !false; {3995#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} is VALID [2022-04-27 14:35:47,142 INFO L290 TraceCheckUtils]: 49: Hoare triple {4015#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3995#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} is VALID [2022-04-27 14:35:47,142 INFO L290 TraceCheckUtils]: 48: Hoare triple {4015#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4015#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-27 14:35:47,142 INFO L290 TraceCheckUtils]: 47: Hoare triple {4015#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} assume !!(0 != ~y~0); {4015#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-27 14:35:47,143 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3754#true} {4015#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} #67#return; {4015#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-27 14:35:47,143 INFO L290 TraceCheckUtils]: 45: Hoare triple {3754#true} assume true; {3754#true} is VALID [2022-04-27 14:35:47,143 INFO L290 TraceCheckUtils]: 44: Hoare triple {3754#true} assume !(0 == ~cond); {3754#true} is VALID [2022-04-27 14:35:47,143 INFO L290 TraceCheckUtils]: 43: Hoare triple {3754#true} ~cond := #in~cond; {3754#true} is VALID [2022-04-27 14:35:47,143 INFO L272 TraceCheckUtils]: 42: Hoare triple {4015#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3754#true} is VALID [2022-04-27 14:35:47,143 INFO L290 TraceCheckUtils]: 41: Hoare triple {4015#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} assume !false; {4015#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-27 14:35:47,145 INFO L290 TraceCheckUtils]: 40: Hoare triple {4043#(and (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ 2 (div (+ (- 2) (div (+ 4 (* (- 1) (div main_~y~0 2))) (- 2))) 2)))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4015#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-27 14:35:47,145 INFO L290 TraceCheckUtils]: 39: Hoare triple {4043#(and (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ 2 (div (+ (- 2) (div (+ 4 (* (- 1) (div main_~y~0 2))) (- 2))) 2)))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4043#(and (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ 2 (div (+ (- 2) (div (+ 4 (* (- 1) (div main_~y~0 2))) (- 2))) 2)))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} is VALID [2022-04-27 14:35:47,146 INFO L290 TraceCheckUtils]: 38: Hoare triple {4043#(and (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ 2 (div (+ (- 2) (div (+ 4 (* (- 1) (div main_~y~0 2))) (- 2))) 2)))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} assume !!(0 != ~y~0); {4043#(and (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ 2 (div (+ (- 2) (div (+ 4 (* (- 1) (div main_~y~0 2))) (- 2))) 2)))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} is VALID [2022-04-27 14:35:47,146 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3754#true} {4043#(and (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ 2 (div (+ (- 2) (div (+ 4 (* (- 1) (div main_~y~0 2))) (- 2))) 2)))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} #67#return; {4043#(and (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ 2 (div (+ (- 2) (div (+ 4 (* (- 1) (div main_~y~0 2))) (- 2))) 2)))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} is VALID [2022-04-27 14:35:47,146 INFO L290 TraceCheckUtils]: 36: Hoare triple {3754#true} assume true; {3754#true} is VALID [2022-04-27 14:35:47,146 INFO L290 TraceCheckUtils]: 35: Hoare triple {3754#true} assume !(0 == ~cond); {3754#true} is VALID [2022-04-27 14:35:47,147 INFO L290 TraceCheckUtils]: 34: Hoare triple {3754#true} ~cond := #in~cond; {3754#true} is VALID [2022-04-27 14:35:47,147 INFO L272 TraceCheckUtils]: 33: Hoare triple {4043#(and (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ 2 (div (+ (- 2) (div (+ 4 (* (- 1) (div main_~y~0 2))) (- 2))) 2)))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3754#true} is VALID [2022-04-27 14:35:47,147 INFO L290 TraceCheckUtils]: 32: Hoare triple {4043#(and (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ 2 (div (+ (- 2) (div (+ 4 (* (- 1) (div main_~y~0 2))) (- 2))) 2)))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} assume !false; {4043#(and (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ 2 (div (+ (- 2) (div (+ 4 (* (- 1) (div main_~y~0 2))) (- 2))) 2)))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} is VALID [2022-04-27 14:35:47,149 INFO L290 TraceCheckUtils]: 31: Hoare triple {4071#(and (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ 3 (div (+ (- 1) (div (+ (- 1) (div (+ 16 (* (- 1) (div main_~y~0 2))) (- 2))) 2)) 2)))) (<= 0 (+ 3 (div (+ (- 1) (div (div (+ (- 16) (div main_~y~0 2)) 2) 2)) 2))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4043#(and (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ 2 (div (+ (- 2) (div (+ 4 (* (- 1) (div main_~y~0 2))) (- 2))) 2)))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} is VALID [2022-04-27 14:35:47,151 INFO L290 TraceCheckUtils]: 30: Hoare triple {4075#(<= 0 (+ (div (+ (- 1) (div (+ (div (+ (- 2) (* (div (+ (- 34) main_~y~0) (- 2)) (- 1))) 2) (- 3)) 2)) 2) 4))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {4071#(and (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ 3 (div (+ (- 1) (div (+ (- 1) (div (+ 16 (* (- 1) (div main_~y~0 2))) (- 2))) 2)) 2)))) (<= 0 (+ 3 (div (+ (- 1) (div (div (+ (- 16) (div main_~y~0 2)) 2) 2)) 2))))} is VALID [2022-04-27 14:35:47,151 INFO L290 TraceCheckUtils]: 29: Hoare triple {4075#(<= 0 (+ (div (+ (- 1) (div (+ (div (+ (- 2) (* (div (+ (- 34) main_~y~0) (- 2)) (- 1))) 2) (- 3)) 2)) 2) 4))} assume !!(0 != ~y~0); {4075#(<= 0 (+ (div (+ (- 1) (div (+ (div (+ (- 2) (* (div (+ (- 34) main_~y~0) (- 2)) (- 1))) 2) (- 3)) 2)) 2) 4))} is VALID [2022-04-27 14:35:47,152 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3754#true} {4075#(<= 0 (+ (div (+ (- 1) (div (+ (div (+ (- 2) (* (div (+ (- 34) main_~y~0) (- 2)) (- 1))) 2) (- 3)) 2)) 2) 4))} #67#return; {4075#(<= 0 (+ (div (+ (- 1) (div (+ (div (+ (- 2) (* (div (+ (- 34) main_~y~0) (- 2)) (- 1))) 2) (- 3)) 2)) 2) 4))} is VALID [2022-04-27 14:35:47,152 INFO L290 TraceCheckUtils]: 27: Hoare triple {3754#true} assume true; {3754#true} is VALID [2022-04-27 14:35:47,152 INFO L290 TraceCheckUtils]: 26: Hoare triple {3754#true} assume !(0 == ~cond); {3754#true} is VALID [2022-04-27 14:35:47,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {3754#true} ~cond := #in~cond; {3754#true} is VALID [2022-04-27 14:35:47,152 INFO L272 TraceCheckUtils]: 24: Hoare triple {4075#(<= 0 (+ (div (+ (- 1) (div (+ (div (+ (- 2) (* (div (+ (- 34) main_~y~0) (- 2)) (- 1))) 2) (- 3)) 2)) 2) 4))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3754#true} is VALID [2022-04-27 14:35:47,152 INFO L290 TraceCheckUtils]: 23: Hoare triple {4075#(<= 0 (+ (div (+ (- 1) (div (+ (div (+ (- 2) (* (div (+ (- 34) main_~y~0) (- 2)) (- 1))) 2) (- 3)) 2)) 2) 4))} assume !false; {4075#(<= 0 (+ (div (+ (- 1) (div (+ (div (+ (- 2) (* (div (+ (- 34) main_~y~0) (- 2)) (- 1))) 2) (- 3)) 2)) 2) 4))} is VALID [2022-04-27 14:35:47,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {4100#(<= 0 (+ (div (+ (- 1) (div (+ (- 3) (div (+ (* (- 1) (div (+ (- 34) main_~b~0) (- 2))) (- 2)) 2)) 2)) 2) 4))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {4075#(<= 0 (+ (div (+ (- 1) (div (+ (div (+ (- 2) (* (div (+ (- 34) main_~y~0) (- 2)) (- 1))) 2) (- 3)) 2)) 2) 4))} is VALID [2022-04-27 14:35:47,153 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3754#true} {4100#(<= 0 (+ (div (+ (- 1) (div (+ (- 3) (div (+ (* (- 1) (div (+ (- 34) main_~b~0) (- 2))) (- 2)) 2)) 2)) 2) 4))} #65#return; {4100#(<= 0 (+ (div (+ (- 1) (div (+ (- 3) (div (+ (* (- 1) (div (+ (- 34) main_~b~0) (- 2))) (- 2)) 2)) 2)) 2) 4))} is VALID [2022-04-27 14:35:47,153 INFO L290 TraceCheckUtils]: 20: Hoare triple {3754#true} assume true; {3754#true} is VALID [2022-04-27 14:35:47,153 INFO L290 TraceCheckUtils]: 19: Hoare triple {3754#true} assume !(0 == ~cond); {3754#true} is VALID [2022-04-27 14:35:47,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {3754#true} ~cond := #in~cond; {3754#true} is VALID [2022-04-27 14:35:47,153 INFO L272 TraceCheckUtils]: 17: Hoare triple {4100#(<= 0 (+ (div (+ (- 1) (div (+ (- 3) (div (+ (* (- 1) (div (+ (- 34) main_~b~0) (- 2))) (- 2)) 2)) 2)) 2) 4))} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3754#true} is VALID [2022-04-27 14:35:47,154 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3802#(not (= |assume_abort_if_not_#in~cond| 0))} {3754#true} #63#return; {4100#(<= 0 (+ (div (+ (- 1) (div (+ (- 3) (div (+ (* (- 1) (div (+ (- 34) main_~b~0) (- 2))) (- 2)) 2)) 2)) 2) 4))} is VALID [2022-04-27 14:35:47,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {3802#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3802#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:35:47,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {4128#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {3802#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:35:47,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {3754#true} ~cond := #in~cond; {4128#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 14:35:47,155 INFO L272 TraceCheckUtils]: 12: Hoare triple {3754#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 50 then 1 else 0)); {3754#true} is VALID [2022-04-27 14:35:47,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {3754#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3754#true} is VALID [2022-04-27 14:35:47,155 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3754#true} {3754#true} #61#return; {3754#true} is VALID [2022-04-27 14:35:47,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {3754#true} assume true; {3754#true} is VALID [2022-04-27 14:35:47,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {3754#true} assume !(0 == ~cond); {3754#true} is VALID [2022-04-27 14:35:47,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {3754#true} ~cond := #in~cond; {3754#true} is VALID [2022-04-27 14:35:47,155 INFO L272 TraceCheckUtils]: 6: Hoare triple {3754#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {3754#true} is VALID [2022-04-27 14:35:47,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {3754#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {3754#true} is VALID [2022-04-27 14:35:47,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {3754#true} call #t~ret6 := main(); {3754#true} is VALID [2022-04-27 14:35:47,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3754#true} {3754#true} #71#return; {3754#true} is VALID [2022-04-27 14:35:47,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {3754#true} assume true; {3754#true} is VALID [2022-04-27 14:35:47,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {3754#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(13, 2);call #Ultimate.allocInit(12, 3); {3754#true} is VALID [2022-04-27 14:35:47,156 INFO L272 TraceCheckUtils]: 0: Hoare triple {3754#true} call ULTIMATE.init(); {3754#true} is VALID [2022-04-27 14:35:47,156 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 34 proven. 27 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 14:35:47,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:35:47,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37690454] [2022-04-27 14:35:47,156 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:35:47,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747039341] [2022-04-27 14:35:47,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747039341] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:35:47,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:35:47,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 33 [2022-04-27 14:35:47,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571209641] [2022-04-27 14:35:47,157 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:35:47,157 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 30 states have internal predecessors, (59), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) Word has length 64 [2022-04-27 14:35:47,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:35:47,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 32 states have (on average 1.84375) internal successors, (59), 30 states have internal predecessors, (59), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 14:35:51,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 88 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:51,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-27 14:35:51,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:35:51,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-27 14:35:51,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=851, Unknown=0, NotChecked=0, Total=1056 [2022-04-27 14:35:51,101 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 30 states have internal predecessors, (59), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 14:36:02,116 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:36:08,039 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:36:12,743 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:36:16,417 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:36:24,281 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:36:28,239 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:36:31,387 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:36:32,821 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:36:47,085 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:36:49,485 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:37:06,297 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:37:07,864 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:37:32,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:32,904 INFO L93 Difference]: Finished difference Result 115 states and 136 transitions. [2022-04-27 14:37:32,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-27 14:37:32,904 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 30 states have internal predecessors, (59), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) Word has length 64 [2022-04-27 14:37:32,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:37:32,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 30 states have internal predecessors, (59), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 14:37:32,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 71 transitions. [2022-04-27 14:37:32,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 30 states have internal predecessors, (59), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 14:37:32,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 71 transitions. [2022-04-27 14:37:32,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 71 transitions. [2022-04-27 14:37:48,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 68 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-27 14:37:48,589 INFO L225 Difference]: With dead ends: 115 [2022-04-27 14:37:48,589 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 14:37:48,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 95 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 29.7s TimeCoverageRelationStatistics Valid=514, Invalid=1936, Unknown=0, NotChecked=0, Total=2450 [2022-04-27 14:37:48,591 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 89 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 88 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 32.7s IncrementalHoareTripleChecker+Time [2022-04-27 14:37:48,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 196 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 397 Invalid, 3 Unknown, 6 Unchecked, 32.7s Time] [2022-04-27 14:37:48,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 14:37:48,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 14:37:48,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:37:48,592 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 14:37:48,592 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 14:37:48,592 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 14:37:48,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:48,592 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:37:48,592 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:37:48,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:48,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:48,592 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 14:37:48,592 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 14:37:48,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:48,592 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:37:48,592 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:37:48,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:48,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:48,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:37:48,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:37:48,592 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 14:37:48,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 14:37:48,593 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2022-04-27 14:37:48,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:37:48,593 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 14:37:48,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 30 states have internal predecessors, (59), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 14:37:48,593 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:37:48,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:48,595 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 14:37:48,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 14:37:48,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-27 14:37:48,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 14:37:58,856 WARN L232 SmtUtils]: Spent 9.85s on a formula simplification. DAG size of input: 144 DAG size of output: 17 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-27 14:38:10,633 WARN L232 SmtUtils]: Spent 11.70s on a formula simplification. DAG size of input: 164 DAG size of output: 17 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-27 14:38:10,641 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 6) no Hoare annotation was computed. [2022-04-27 14:38:10,641 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 6) no Hoare annotation was computed. [2022-04-27 14:38:10,641 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 6) no Hoare annotation was computed. [2022-04-27 14:38:10,641 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 9 11) the Hoare annotation is: true [2022-04-27 14:38:10,641 INFO L899 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2022-04-27 14:38:10,641 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 11) no Hoare annotation was computed. [2022-04-27 14:38:10,641 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 9 11) no Hoare annotation was computed. [2022-04-27 14:38:10,641 INFO L902 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-04-27 14:38:10,641 INFO L895 garLoopResultBuilder]: At program point L27-1(line 27) the Hoare annotation is: (and (<= main_~b~0 50) (<= 0 main_~b~0)) [2022-04-27 14:38:10,641 INFO L902 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2022-04-27 14:38:10,641 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 20 49) no Hoare annotation was computed. [2022-04-27 14:38:10,641 INFO L899 garLoopResultBuilder]: For program point L25-1(line 25) no Hoare annotation was computed. [2022-04-27 14:38:10,641 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-04-27 14:38:10,641 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 20 49) no Hoare annotation was computed. [2022-04-27 14:38:10,641 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 45) the Hoare annotation is: (and (<= 0 main_~y~0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= main_~b~0 50) (<= 1 main_~b~0)) [2022-04-27 14:38:10,641 INFO L895 garLoopResultBuilder]: At program point L34-3(lines 34 45) the Hoare annotation is: (let ((.cse0 (* main_~b~0 main_~a~0))) (and (= main_~z~0 .cse0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) .cse0) (<= 1 main_~b~0))) [2022-04-27 14:38:10,641 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 20 49) the Hoare annotation is: true [2022-04-27 14:38:10,642 INFO L899 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-04-27 14:38:10,642 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 42) no Hoare annotation was computed. [2022-04-27 14:38:10,642 INFO L899 garLoopResultBuilder]: For program point L39-2(lines 39 42) no Hoare annotation was computed. [2022-04-27 14:38:10,642 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (and (<= 0 main_~y~0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= main_~b~0 50) (<= 1 main_~b~0)) [2022-04-27 14:38:10,642 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 34 45) no Hoare annotation was computed. [2022-04-27 14:38:10,642 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:38:10,642 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 14:38:10,642 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:38:10,642 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:38:10,642 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 14:38:10,642 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 14:38:10,642 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:38:10,642 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 12 18) the Hoare annotation is: true [2022-04-27 14:38:10,642 INFO L899 garLoopResultBuilder]: For program point L14(lines 14 15) no Hoare annotation was computed. [2022-04-27 14:38:10,642 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 16) no Hoare annotation was computed. [2022-04-27 14:38:10,642 INFO L899 garLoopResultBuilder]: For program point L13-2(lines 12 18) no Hoare annotation was computed. [2022-04-27 14:38:10,642 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 12 18) no Hoare annotation was computed. [2022-04-27 14:38:10,642 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2022-04-27 14:38:10,645 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2022-04-27 14:38:10,646 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 14:38:10,648 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 14:38:10,648 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:38:10,649 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:38:10,649 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:38:10,649 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 14:38:10,649 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:38:10,649 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:38:10,649 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:38:10,649 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:38:10,649 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-27 14:38:10,649 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:38:10,649 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:38:10,649 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 14:38:10,649 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:38:10,649 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-27 14:38:10,649 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-27 14:38:10,649 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-27 14:38:10,649 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-27 14:38:10,649 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-27 14:38:10,649 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:38:10,649 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:38:10,649 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:38:10,649 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:38:10,649 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:38:10,649 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 14:38:10,649 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 14:38:10,649 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 14:38:10,649 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 14:38:10,649 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 14:38:10,652 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 14:38:10,652 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 14:38:10,652 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 14:38:10,652 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 14:38:10,652 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 14:38:10,653 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-04-27 14:38:10,653 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 14:38:10,653 INFO L163 areAnnotationChecker]: CFG has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 14:38:10,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 02:38:10 BoogieIcfgContainer [2022-04-27 14:38:10,658 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 14:38:10,659 INFO L158 Benchmark]: Toolchain (without parser) took 602161.88ms. Allocated memory was 209.7MB in the beginning and 302.0MB in the end (delta: 92.3MB). Free memory was 157.8MB in the beginning and 213.3MB in the end (delta: -55.6MB). Peak memory consumption was 154.1MB. Max. memory is 8.0GB. [2022-04-27 14:38:10,659 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 209.7MB. Free memory was 174.3MB in the beginning and 174.1MB in the end (delta: 129.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:38:10,659 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.38ms. Allocated memory was 209.7MB in the beginning and 302.0MB in the end (delta: 92.3MB). Free memory was 157.5MB in the beginning and 276.4MB in the end (delta: -118.9MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. [2022-04-27 14:38:10,659 INFO L158 Benchmark]: Boogie Preprocessor took 32.90ms. Allocated memory is still 302.0MB. Free memory was 276.4MB in the beginning and 275.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 14:38:10,659 INFO L158 Benchmark]: RCFGBuilder took 232.95ms. Allocated memory is still 302.0MB. Free memory was 275.0MB in the beginning and 263.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 14:38:10,660 INFO L158 Benchmark]: TraceAbstraction took 601595.99ms. Allocated memory is still 302.0MB. Free memory was 263.1MB in the beginning and 213.9MB in the end (delta: 49.3MB). Peak memory consumption was 167.2MB. Max. memory is 8.0GB. [2022-04-27 14:38:10,661 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.10ms. Allocated memory is still 209.7MB. Free memory was 174.3MB in the beginning and 174.1MB in the end (delta: 129.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 280.38ms. Allocated memory was 209.7MB in the beginning and 302.0MB in the end (delta: 92.3MB). Free memory was 157.5MB in the beginning and 276.4MB in the end (delta: -118.9MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.90ms. Allocated memory is still 302.0MB. Free memory was 276.4MB in the beginning and 275.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 232.95ms. Allocated memory is still 302.0MB. Free memory was 275.0MB in the beginning and 263.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 601595.99ms. Allocated memory is still 302.0MB. Free memory was 263.1MB in the beginning and 213.9MB in the end (delta: 49.3MB). Peak memory consumption was 167.2MB. Max. memory is 8.0GB. * 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: 15]: 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: 601.5s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 187.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 21.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 288 SdHoareTripleChecker+Valid, 55.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 276 mSDsluCounter, 1246 SdHoareTripleChecker+Invalid, 55.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 60 IncrementalHoareTripleChecker+Unchecked, 1020 mSDsCounter, 168 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1408 IncrementalHoareTripleChecker+Invalid, 1644 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 168 mSolverCounterUnsat, 226 mSDtfsCounter, 1408 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 645 GetRequests, 474 SyntacticMatches, 14 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 50.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=8, InterpolantAutomatonStates: 115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 29 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 35 PreInvPairs, 65 NumberOfFragments, 77 HoareAnnotationTreeSize, 35 FomulaSimplifications, 435 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 12 FomulaSimplificationsInter, 3195 FormulaSimplificationTreeSizeReductionInter, 21.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 381.3s InterpolantComputationTime, 372 NumberOfCodeBlocks, 372 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 594 ConstructedInterpolants, 4 QuantifiedInterpolants, 3931 SizeOfPredicates, 30 NumberOfNonLiveVariables, 964 ConjunctsInSsa, 168 ConjunctsInUnsatCore, 14 InterpolantComputations, 3 PerfectInterpolantSequences, 326/443 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: 34]: Loop Invariant Derived loop invariant: ((0 <= y && z + y * x == b * a) && b <= 50) && 1 <= b RESULT: Ultimate proved your program to be correct! [2022-04-27 14:38:10,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...