/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/cohendiv-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 13:01:42,895 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 13:01:42,897 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 13:01:42,927 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 13:01:42,927 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 13:01:42,928 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 13:01:42,929 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 13:01:42,930 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 13:01:42,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 13:01:42,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 13:01:42,933 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 13:01:42,934 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 13:01:42,934 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 13:01:42,935 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 13:01:42,936 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 13:01:42,937 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 13:01:42,938 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 13:01:42,938 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 13:01:42,940 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 13:01:42,941 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 13:01:42,942 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 13:01:42,944 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 13:01:42,945 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 13:01:42,946 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 13:01:42,947 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 13:01:42,949 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 13:01:42,949 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 13:01:42,949 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 13:01:42,950 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 13:01:42,951 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 13:01:42,951 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 13:01:42,952 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 13:01:42,952 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 13:01:42,953 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 13:01:42,953 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 13:01:42,954 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 13:01:42,954 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 13:01:42,955 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 13:01:42,955 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 13:01:42,955 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 13:01:42,956 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 13:01:42,965 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 13:01:42,966 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-07 13:01:42,997 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 13:01:42,997 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 13:01:42,998 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 13:01:42,998 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 13:01:42,998 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 13:01:42,999 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 13:01:42,999 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 13:01:42,999 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 13:01:42,999 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 13:01:43,000 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 13:01:43,000 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 13:01:43,000 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 13:01:43,000 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 13:01:43,001 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 13:01:43,001 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 13:01:43,001 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 13:01:43,001 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 13:01:43,002 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 13:01:43,002 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 13:01:43,002 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 13:01:43,002 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 13:01:43,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 13:01:43,003 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 13:01:43,003 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 13:01:43,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 13:01:43,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 13:01:43,003 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 13:01:43,003 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 13:01:43,003 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 13:01:43,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 13:01:43,004 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 13:01:43,004 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 13:01:43,004 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 13:01:43,004 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-07 13:01:43,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 13:01:43,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 13:01:43,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 13:01:43,262 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 13:01:43,264 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 13:01:43,265 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_valuebound10.c [2022-04-07 13:01:43,316 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e85969a6/c6b0717576c743a6a54ce06737653a64/FLAG0b1267772 [2022-04-07 13:01:43,714 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 13:01:43,715 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_valuebound10.c [2022-04-07 13:01:43,722 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e85969a6/c6b0717576c743a6a54ce06737653a64/FLAG0b1267772 [2022-04-07 13:01:44,115 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e85969a6/c6b0717576c743a6a54ce06737653a64 [2022-04-07 13:01:44,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 13:01:44,119 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 13:01:44,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 13:01:44,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 13:01:44,126 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 13:01:44,128 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 01:01:44" (1/1) ... [2022-04-07 13:01:44,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42859eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:01:44, skipping insertion in model container [2022-04-07 13:01:44,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 01:01:44" (1/1) ... [2022-04-07 13:01:44,134 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 13:01:44,149 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 13:01:44,286 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/cohendiv-ll_valuebound10.c[576,589] [2022-04-07 13:01:44,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 13:01:44,309 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 13:01:44,328 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/cohendiv-ll_valuebound10.c[576,589] [2022-04-07 13:01:44,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 13:01:44,367 INFO L208 MainTranslator]: Completed translation [2022-04-07 13:01:44,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:01:44 WrapperNode [2022-04-07 13:01:44,367 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 13:01:44,368 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 13:01:44,368 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 13:01:44,369 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 13:01:44,378 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:01:44" (1/1) ... [2022-04-07 13:01:44,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:01:44" (1/1) ... [2022-04-07 13:01:44,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:01:44" (1/1) ... [2022-04-07 13:01:44,383 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:01:44" (1/1) ... [2022-04-07 13:01:44,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:01:44" (1/1) ... [2022-04-07 13:01:44,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:01:44" (1/1) ... [2022-04-07 13:01:44,393 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:01:44" (1/1) ... [2022-04-07 13:01:44,395 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 13:01:44,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 13:01:44,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 13:01:44,396 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 13:01:44,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:01:44" (1/1) ... [2022-04-07 13:01:44,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 13:01:44,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:01:44,425 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-07 13:01:44,428 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-07 13:01:44,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 13:01:44,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 13:01:44,455 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 13:01:44,455 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 13:01:44,457 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 13:01:44,457 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 13:01:44,458 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 13:01:44,458 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 13:01:44,458 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 13:01:44,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 13:01:44,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 13:01:44,459 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 13:01:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 13:01:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 13:01:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 13:01:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 13:01:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 13:01:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 13:01:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 13:01:44,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 13:01:44,511 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 13:01:44,513 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 13:01:44,715 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 13:01:44,724 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 13:01:44,725 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-07 13:01:44,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 01:01:44 BoogieIcfgContainer [2022-04-07 13:01:44,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 13:01:44,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 13:01:44,728 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 13:01:44,743 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 13:01:44,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 01:01:44" (1/3) ... [2022-04-07 13:01:44,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b67db86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 01:01:44, skipping insertion in model container [2022-04-07 13:01:44,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:01:44" (2/3) ... [2022-04-07 13:01:44,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b67db86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 01:01:44, skipping insertion in model container [2022-04-07 13:01:44,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 01:01:44" (3/3) ... [2022-04-07 13:01:44,745 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_valuebound10.c [2022-04-07 13:01:44,751 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 13:01:44,751 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 13:01:44,798 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 13:01:44,813 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 13:01:44,814 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 13:01:44,833 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 13:01:44,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 13:01:44,838 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:01:44,838 INFO L499 BasicCegarLoop]: 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-07 13:01:44,839 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:01:44,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:01:44,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1768835633, now seen corresponding path program 1 times [2022-04-07 13:01:44,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:01:44,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892011778] [2022-04-07 13:01:44,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:01:44,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:01:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:01:45,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 13:01:45,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:01:45,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {59#(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(14, 2);call #Ultimate.allocInit(12, 3); {42#true} is VALID [2022-04-07 13:01:45,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-07 13:01:45,066 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-07 13:01:45,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 13:01:45,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:01:45,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-07 13:01:45,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-07 13:01:45,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-07 13:01:45,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-07 13:01:45,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 13:01:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:01:45,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-07 13:01:45,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-07 13:01:45,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-07 13:01:45,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-07 13:01:45,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-07 13:01:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:01:45,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-07 13:01:45,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-07 13:01:45,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-07 13:01:45,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-07 13:01:45,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {59#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 13:01:45,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {59#(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(14, 2);call #Ultimate.allocInit(12, 3); {42#true} is VALID [2022-04-07 13:01:45,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-07 13:01:45,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-07 13:01:45,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret6 := main(); {42#true} is VALID [2022-04-07 13:01:45,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {42#true} is VALID [2022-04-07 13:01:45,121 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {42#true} is VALID [2022-04-07 13:01:45,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-07 13:01:45,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-07 13:01:45,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-07 13:01:45,122 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-07 13:01:45,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {43#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {43#false} is VALID [2022-04-07 13:01:45,123 INFO L272 TraceCheckUtils]: 12: Hoare triple {43#false} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {42#true} is VALID [2022-04-07 13:01:45,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-07 13:01:45,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-07 13:01:45,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-07 13:01:45,125 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-07 13:01:45,126 INFO L272 TraceCheckUtils]: 17: Hoare triple {43#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {42#true} is VALID [2022-04-07 13:01:45,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-07 13:01:45,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-07 13:01:45,127 INFO L290 TraceCheckUtils]: 20: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-07 13:01:45,127 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-07 13:01:45,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {43#false} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {43#false} is VALID [2022-04-07 13:01:45,128 INFO L290 TraceCheckUtils]: 23: Hoare triple {43#false} assume false; {43#false} is VALID [2022-04-07 13:01:45,128 INFO L272 TraceCheckUtils]: 24: Hoare triple {43#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {43#false} is VALID [2022-04-07 13:01:45,129 INFO L290 TraceCheckUtils]: 25: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-07 13:01:45,130 INFO L290 TraceCheckUtils]: 26: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-07 13:01:45,130 INFO L290 TraceCheckUtils]: 27: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-07 13:01:45,131 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-07 13:01:45,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:01:45,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892011778] [2022-04-07 13:01:45,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892011778] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:01:45,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:01:45,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 13:01:45,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293999348] [2022-04-07 13:01:45,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:01:45,141 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-07 13:01:45,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:01:45,146 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-07 13:01:45,181 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-07 13:01:45,181 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 13:01:45,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:01:45,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 13:01:45,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 13:01:45,206 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 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-07 13:01:45,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:01:45,411 INFO L93 Difference]: Finished difference Result 71 states and 110 transitions. [2022-04-07 13:01:45,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 13:01:45,411 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-07 13:01:45,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:01:45,413 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-07 13:01:45,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-04-07 13:01:45,432 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-07 13:01:45,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-04-07 13:01:45,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2022-04-07 13:01:45,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:01:45,604 INFO L225 Difference]: With dead ends: 71 [2022-04-07 13:01:45,605 INFO L226 Difference]: Without dead ends: 34 [2022-04-07 13:01:45,608 INFO L912 BasicCegarLoop]: 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-07 13:01:45,612 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 13:01:45,613 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 41 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 13:01:45,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-07 13:01:45,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-07 13:01:45,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:01:45,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:01:45,650 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:01:45,652 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:01:45,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:01:45,659 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-07 13:01:45,659 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-07 13:01:45,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:01:45,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:01:45,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-07 13:01:45,661 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-07 13:01:45,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:01:45,667 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-07 13:01:45,667 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-07 13:01:45,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:01:45,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:01:45,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:01:45,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:01:45,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:01:45,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-07 13:01:45,673 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 28 [2022-04-07 13:01:45,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:01:45,673 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-07 13:01:45,674 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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-07 13:01:45,674 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-07 13:01:45,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 13:01:45,675 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:01:45,675 INFO L499 BasicCegarLoop]: 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-07 13:01:45,675 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 13:01:45,676 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:01:45,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:01:45,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1378913883, now seen corresponding path program 1 times [2022-04-07 13:01:45,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:01:45,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894075437] [2022-04-07 13:01:45,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:01:45,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:01:45,728 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:01:45,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [274925550] [2022-04-07 13:01:45,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:01:45,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:01:45,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:01:45,734 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-07 13:01:45,763 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-07 13:01:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:01:45,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-07 13:01:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:01:45,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:01:46,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {284#true} call ULTIMATE.init(); {284#true} is VALID [2022-04-07 13:01:46,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {284#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(14, 2);call #Ultimate.allocInit(12, 3); {284#true} is VALID [2022-04-07 13:01:46,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {284#true} assume true; {284#true} is VALID [2022-04-07 13:01:46,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {284#true} {284#true} #98#return; {284#true} is VALID [2022-04-07 13:01:46,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {284#true} call #t~ret6 := main(); {284#true} is VALID [2022-04-07 13:01:46,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {284#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {284#true} is VALID [2022-04-07 13:01:46,136 INFO L272 TraceCheckUtils]: 6: Hoare triple {284#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {284#true} is VALID [2022-04-07 13:01:46,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {284#true} ~cond := #in~cond; {284#true} is VALID [2022-04-07 13:01:46,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {284#true} assume !(0 == ~cond); {284#true} is VALID [2022-04-07 13:01:46,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {284#true} assume true; {284#true} is VALID [2022-04-07 13:01:46,137 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {284#true} {284#true} #78#return; {284#true} is VALID [2022-04-07 13:01:46,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {284#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {284#true} is VALID [2022-04-07 13:01:46,137 INFO L272 TraceCheckUtils]: 12: Hoare triple {284#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {284#true} is VALID [2022-04-07 13:01:46,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {284#true} ~cond := #in~cond; {328#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 13:01:46,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {328#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {332#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 13:01:46,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {332#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {332#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 13:01:46,139 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {332#(not (= |assume_abort_if_not_#in~cond| 0))} {284#true} #80#return; {339#(and (<= 0 main_~y~0) (<= main_~y~0 10))} is VALID [2022-04-07 13:01:46,139 INFO L272 TraceCheckUtils]: 17: Hoare triple {339#(and (<= 0 main_~y~0) (<= main_~y~0 10))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {284#true} is VALID [2022-04-07 13:01:46,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {284#true} ~cond := #in~cond; {328#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 13:01:46,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {328#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {332#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 13:01:46,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {332#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {332#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 13:01:46,142 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {332#(not (= |assume_abort_if_not_#in~cond| 0))} {339#(and (<= 0 main_~y~0) (<= main_~y~0 10))} #82#return; {355#(and (<= main_~y~0 10) (<= 1 main_~y~0))} is VALID [2022-04-07 13:01:46,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {355#(and (<= main_~y~0 10) (<= 1 main_~y~0))} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {359#(and (= main_~a~0 0) (<= main_~y~0 10) (= main_~b~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 13:01:46,143 INFO L290 TraceCheckUtils]: 23: Hoare triple {359#(and (= main_~a~0 0) (<= main_~y~0 10) (= main_~b~0 0) (<= 1 main_~y~0))} assume !false; {359#(and (= main_~a~0 0) (<= main_~y~0 10) (= main_~b~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 13:01:46,143 INFO L272 TraceCheckUtils]: 24: Hoare triple {359#(and (= main_~a~0 0) (<= main_~y~0 10) (= main_~b~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {366#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:01:46,144 INFO L290 TraceCheckUtils]: 25: Hoare triple {366#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {370#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:01:46,144 INFO L290 TraceCheckUtils]: 26: Hoare triple {370#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {285#false} is VALID [2022-04-07 13:01:46,145 INFO L290 TraceCheckUtils]: 27: Hoare triple {285#false} assume !false; {285#false} is VALID [2022-04-07 13:01:46,145 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-07 13:01:46,145 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 13:01:46,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:01:46,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894075437] [2022-04-07 13:01:46,146 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:01:46,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274925550] [2022-04-07 13:01:46,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274925550] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:01:46,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:01:46,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-07 13:01:46,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30926065] [2022-04-07 13:01:46,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:01:46,148 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-07 13:01:46,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:01:46,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:01:46,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:01:46,169 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 13:01:46,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:01:46,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 13:01:46,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-07 13:01:46,170 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:01:46,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:01:46,564 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-07 13:01:46,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 13:01:46,564 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-07 13:01:46,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:01:46,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:01:46,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-07 13:01:46,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:01:46,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-07 13:01:46,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 56 transitions. [2022-04-07 13:01:46,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:01:46,620 INFO L225 Difference]: With dead ends: 45 [2022-04-07 13:01:46,620 INFO L226 Difference]: Without dead ends: 43 [2022-04-07 13:01:46,621 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-07 13:01:46,622 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 28 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 13:01:46,622 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 169 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 13:01:46,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-07 13:01:46,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-04-07 13:01:46,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:01:46,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 13:01:46,642 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 13:01:46,642 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 13:01:46,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:01:46,645 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-07 13:01:46,645 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-07 13:01:46,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:01:46,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:01:46,646 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 43 states. [2022-04-07 13:01:46,646 INFO L87 Difference]: Start difference. First operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 43 states. [2022-04-07 13:01:46,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:01:46,649 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-07 13:01:46,649 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-07 13:01:46,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:01:46,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:01:46,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:01:46,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:01:46,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 13:01:46,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-04-07 13:01:46,652 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 28 [2022-04-07 13:01:46,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:01:46,653 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-04-07 13:01:46,653 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:01:46,653 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-07 13:01:46,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-07 13:01:46,654 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:01:46,654 INFO L499 BasicCegarLoop]: 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] [2022-04-07 13:01:46,679 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-07 13:01:46,867 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:01:46,867 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:01:46,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:01:46,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1928335320, now seen corresponding path program 1 times [2022-04-07 13:01:46,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:01:46,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423292084] [2022-04-07 13:01:46,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:01:46,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:01:46,889 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:01:46,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2027360336] [2022-04-07 13:01:46,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:01:46,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:01:46,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:01:46,895 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-07 13:01:46,896 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-07 13:01:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:01:46,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-07 13:01:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:01:46,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:01:47,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {595#true} call ULTIMATE.init(); {595#true} is VALID [2022-04-07 13:01:47,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {595#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(14, 2);call #Ultimate.allocInit(12, 3); {595#true} is VALID [2022-04-07 13:01:47,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {595#true} assume true; {595#true} is VALID [2022-04-07 13:01:47,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {595#true} {595#true} #98#return; {595#true} is VALID [2022-04-07 13:01:47,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {595#true} call #t~ret6 := main(); {595#true} is VALID [2022-04-07 13:01:47,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {595#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {595#true} is VALID [2022-04-07 13:01:47,192 INFO L272 TraceCheckUtils]: 6: Hoare triple {595#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {595#true} is VALID [2022-04-07 13:01:47,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {595#true} ~cond := #in~cond; {595#true} is VALID [2022-04-07 13:01:47,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {595#true} assume !(0 == ~cond); {595#true} is VALID [2022-04-07 13:01:47,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {595#true} assume true; {595#true} is VALID [2022-04-07 13:01:47,193 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {595#true} {595#true} #78#return; {595#true} is VALID [2022-04-07 13:01:47,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {595#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {595#true} is VALID [2022-04-07 13:01:47,193 INFO L272 TraceCheckUtils]: 12: Hoare triple {595#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {595#true} is VALID [2022-04-07 13:01:47,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {595#true} ~cond := #in~cond; {639#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 13:01:47,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {639#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {643#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 13:01:47,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {643#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {643#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 13:01:47,195 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {643#(not (= |assume_abort_if_not_#in~cond| 0))} {595#true} #80#return; {650#(and (<= 0 main_~y~0) (<= main_~y~0 10))} is VALID [2022-04-07 13:01:47,196 INFO L272 TraceCheckUtils]: 17: Hoare triple {650#(and (<= 0 main_~y~0) (<= main_~y~0 10))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {595#true} is VALID [2022-04-07 13:01:47,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {595#true} ~cond := #in~cond; {639#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 13:01:47,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {639#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {643#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 13:01:47,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {643#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {643#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 13:01:47,203 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {643#(not (= |assume_abort_if_not_#in~cond| 0))} {650#(and (<= 0 main_~y~0) (<= main_~y~0 10))} #82#return; {666#(and (<= main_~y~0 10) (<= 1 main_~y~0))} is VALID [2022-04-07 13:01:47,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {666#(and (<= main_~y~0 10) (<= 1 main_~y~0))} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {670#(and (= main_~x~0 main_~r~0) (<= main_~y~0 10) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 13:01:47,204 INFO L290 TraceCheckUtils]: 23: Hoare triple {670#(and (= main_~x~0 main_~r~0) (<= main_~y~0 10) (= main_~q~0 0) (<= 1 main_~y~0))} assume !false; {670#(and (= main_~x~0 main_~r~0) (<= main_~y~0 10) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 13:01:47,204 INFO L272 TraceCheckUtils]: 24: Hoare triple {670#(and (= main_~x~0 main_~r~0) (<= main_~y~0 10) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {595#true} is VALID [2022-04-07 13:01:47,204 INFO L290 TraceCheckUtils]: 25: Hoare triple {595#true} ~cond := #in~cond; {595#true} is VALID [2022-04-07 13:01:47,205 INFO L290 TraceCheckUtils]: 26: Hoare triple {595#true} assume !(0 == ~cond); {595#true} is VALID [2022-04-07 13:01:47,205 INFO L290 TraceCheckUtils]: 27: Hoare triple {595#true} assume true; {595#true} is VALID [2022-04-07 13:01:47,206 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {595#true} {670#(and (= main_~x~0 main_~r~0) (<= main_~y~0 10) (= main_~q~0 0) (<= 1 main_~y~0))} #84#return; {670#(and (= main_~x~0 main_~r~0) (<= main_~y~0 10) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 13:01:47,206 INFO L272 TraceCheckUtils]: 29: Hoare triple {670#(and (= main_~x~0 main_~r~0) (<= main_~y~0 10) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {692#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:01:47,209 INFO L290 TraceCheckUtils]: 30: Hoare triple {692#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {696#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:01:47,210 INFO L290 TraceCheckUtils]: 31: Hoare triple {696#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {596#false} is VALID [2022-04-07 13:01:47,210 INFO L290 TraceCheckUtils]: 32: Hoare triple {596#false} assume !false; {596#false} is VALID [2022-04-07 13:01:47,210 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-07 13:01:47,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 13:01:47,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:01:47,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423292084] [2022-04-07 13:01:47,213 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:01:47,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027360336] [2022-04-07 13:01:47,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027360336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:01:47,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:01:47,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-07 13:01:47,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599448393] [2022-04-07 13:01:47,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:01:47,216 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 33 [2022-04-07 13:01:47,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:01:47,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 13:01:47,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:01:47,247 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 13:01:47,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:01:47,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 13:01:47,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-07 13:01:47,248 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 13:01:47,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:01:47,764 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-04-07 13:01:47,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 13:01:47,766 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 33 [2022-04-07 13:01:47,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:01:47,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 13:01:47,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-04-07 13:01:47,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 13:01:47,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-04-07 13:01:47,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 69 transitions. [2022-04-07 13:01:47,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:01:47,835 INFO L225 Difference]: With dead ends: 57 [2022-04-07 13:01:47,835 INFO L226 Difference]: Without dead ends: 54 [2022-04-07 13:01:47,835 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-07 13:01:47,836 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 29 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 13:01:47,837 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 180 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 13:01:47,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-07 13:01:47,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-04-07 13:01:47,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:01:47,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 53 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:01:47,882 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 53 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:01:47,882 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 53 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:01:47,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:01:47,885 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2022-04-07 13:01:47,885 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2022-04-07 13:01:47,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:01:47,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:01:47,886 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 54 states. [2022-04-07 13:01:47,887 INFO L87 Difference]: Start difference. First operand has 53 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 54 states. [2022-04-07 13:01:47,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:01:47,890 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2022-04-07 13:01:47,890 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2022-04-07 13:01:47,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:01:47,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:01:47,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:01:47,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:01:47,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:01:47,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-04-07 13:01:47,893 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 33 [2022-04-07 13:01:47,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:01:47,894 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2022-04-07 13:01:47,894 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 13:01:47,894 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2022-04-07 13:01:47,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-07 13:01:47,895 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:01:47,895 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:01:47,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-07 13:01:48,115 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-07 13:01:48,116 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:01:48,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:01:48,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1297647068, now seen corresponding path program 1 times [2022-04-07 13:01:48,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:01:48,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065660607] [2022-04-07 13:01:48,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:01:48,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:01:48,152 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:01:48,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [806880142] [2022-04-07 13:01:48,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:01:48,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:01:48,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:01:48,159 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-07 13:01:48,162 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-07 13:01:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:01:48,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 13:01:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:01:48,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:01:48,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {981#true} call ULTIMATE.init(); {981#true} is VALID [2022-04-07 13:01:48,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {981#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(14, 2);call #Ultimate.allocInit(12, 3); {981#true} is VALID [2022-04-07 13:01:48,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {981#true} assume true; {981#true} is VALID [2022-04-07 13:01:48,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {981#true} {981#true} #98#return; {981#true} is VALID [2022-04-07 13:01:48,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {981#true} call #t~ret6 := main(); {981#true} is VALID [2022-04-07 13:01:48,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {981#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {981#true} is VALID [2022-04-07 13:01:48,340 INFO L272 TraceCheckUtils]: 6: Hoare triple {981#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {981#true} is VALID [2022-04-07 13:01:48,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {981#true} ~cond := #in~cond; {981#true} is VALID [2022-04-07 13:01:48,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {981#true} assume !(0 == ~cond); {981#true} is VALID [2022-04-07 13:01:48,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {981#true} assume true; {981#true} is VALID [2022-04-07 13:01:48,341 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {981#true} {981#true} #78#return; {981#true} is VALID [2022-04-07 13:01:48,341 INFO L290 TraceCheckUtils]: 11: Hoare triple {981#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {981#true} is VALID [2022-04-07 13:01:48,341 INFO L272 TraceCheckUtils]: 12: Hoare triple {981#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {981#true} is VALID [2022-04-07 13:01:48,342 INFO L290 TraceCheckUtils]: 13: Hoare triple {981#true} ~cond := #in~cond; {981#true} is VALID [2022-04-07 13:01:48,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {981#true} assume !(0 == ~cond); {981#true} is VALID [2022-04-07 13:01:48,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {981#true} assume true; {981#true} is VALID [2022-04-07 13:01:48,342 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {981#true} {981#true} #80#return; {981#true} is VALID [2022-04-07 13:01:48,342 INFO L272 TraceCheckUtils]: 17: Hoare triple {981#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {981#true} is VALID [2022-04-07 13:01:48,342 INFO L290 TraceCheckUtils]: 18: Hoare triple {981#true} ~cond := #in~cond; {981#true} is VALID [2022-04-07 13:01:48,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {981#true} assume !(0 == ~cond); {981#true} is VALID [2022-04-07 13:01:48,343 INFO L290 TraceCheckUtils]: 20: Hoare triple {981#true} assume true; {981#true} is VALID [2022-04-07 13:01:48,343 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {981#true} {981#true} #82#return; {981#true} is VALID [2022-04-07 13:01:48,343 INFO L290 TraceCheckUtils]: 22: Hoare triple {981#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {981#true} is VALID [2022-04-07 13:01:48,343 INFO L290 TraceCheckUtils]: 23: Hoare triple {981#true} assume !false; {981#true} is VALID [2022-04-07 13:01:48,343 INFO L272 TraceCheckUtils]: 24: Hoare triple {981#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {981#true} is VALID [2022-04-07 13:01:48,344 INFO L290 TraceCheckUtils]: 25: Hoare triple {981#true} ~cond := #in~cond; {981#true} is VALID [2022-04-07 13:01:48,344 INFO L290 TraceCheckUtils]: 26: Hoare triple {981#true} assume !(0 == ~cond); {981#true} is VALID [2022-04-07 13:01:48,344 INFO L290 TraceCheckUtils]: 27: Hoare triple {981#true} assume true; {981#true} is VALID [2022-04-07 13:01:48,344 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {981#true} {981#true} #84#return; {981#true} is VALID [2022-04-07 13:01:48,344 INFO L272 TraceCheckUtils]: 29: Hoare triple {981#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {981#true} is VALID [2022-04-07 13:01:48,344 INFO L290 TraceCheckUtils]: 30: Hoare triple {981#true} ~cond := #in~cond; {981#true} is VALID [2022-04-07 13:01:48,345 INFO L290 TraceCheckUtils]: 31: Hoare triple {981#true} assume !(0 == ~cond); {981#true} is VALID [2022-04-07 13:01:48,345 INFO L290 TraceCheckUtils]: 32: Hoare triple {981#true} assume true; {981#true} is VALID [2022-04-07 13:01:48,345 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {981#true} {981#true} #86#return; {981#true} is VALID [2022-04-07 13:01:48,357 INFO L290 TraceCheckUtils]: 34: Hoare triple {981#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1088#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-07 13:01:48,358 INFO L290 TraceCheckUtils]: 35: Hoare triple {1088#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} assume !false; {1088#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-07 13:01:48,358 INFO L272 TraceCheckUtils]: 36: Hoare triple {1088#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1095#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:01:48,359 INFO L290 TraceCheckUtils]: 37: Hoare triple {1095#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1099#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:01:48,359 INFO L290 TraceCheckUtils]: 38: Hoare triple {1099#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {982#false} is VALID [2022-04-07 13:01:48,359 INFO L290 TraceCheckUtils]: 39: Hoare triple {982#false} assume !false; {982#false} is VALID [2022-04-07 13:01:48,360 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-07 13:01:48,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 13:01:48,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:01:48,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065660607] [2022-04-07 13:01:48,360 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:01:48,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806880142] [2022-04-07 13:01:48,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806880142] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:01:48,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:01:48,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 13:01:48,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944952580] [2022-04-07 13:01:48,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:01:48,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 40 [2022-04-07 13:01:48,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:01:48,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-07 13:01:48,385 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-07 13:01:48,385 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 13:01:48,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:01:48,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 13:01:48,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 13:01:48,386 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-07 13:01:48,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:01:48,634 INFO L93 Difference]: Finished difference Result 79 states and 105 transitions. [2022-04-07 13:01:48,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 13:01:48,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 40 [2022-04-07 13:01:48,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:01:48,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-07 13:01:48,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-07 13:01:48,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-07 13:01:48,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-07 13:01:48,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-07 13:01:48,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:01:48,695 INFO L225 Difference]: With dead ends: 79 [2022-04-07 13:01:48,695 INFO L226 Difference]: Without dead ends: 77 [2022-04-07 13:01:48,695 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 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-07 13:01:48,696 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 10 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 13:01:48,696 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 144 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 13:01:48,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-07 13:01:48,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2022-04-07 13:01:48,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:01:48,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 70 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 13:01:48,736 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 70 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 13:01:48,736 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 70 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 13:01:48,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:01:48,741 INFO L93 Difference]: Finished difference Result 77 states and 103 transitions. [2022-04-07 13:01:48,741 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 103 transitions. [2022-04-07 13:01:48,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:01:48,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:01:48,743 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 77 states. [2022-04-07 13:01:48,743 INFO L87 Difference]: Start difference. First operand has 70 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 77 states. [2022-04-07 13:01:48,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:01:48,747 INFO L93 Difference]: Finished difference Result 77 states and 103 transitions. [2022-04-07 13:01:48,748 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 103 transitions. [2022-04-07 13:01:48,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:01:48,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:01:48,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:01:48,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:01:48,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 13:01:48,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2022-04-07 13:01:48,753 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 40 [2022-04-07 13:01:48,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:01:48,753 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2022-04-07 13:01:48,753 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-07 13:01:48,753 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2022-04-07 13:01:48,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-07 13:01:48,754 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:01:48,754 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:01:48,782 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-07 13:01:48,979 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:01:48,980 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:01:48,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:01:48,980 INFO L85 PathProgramCache]: Analyzing trace with hash -391974204, now seen corresponding path program 1 times [2022-04-07 13:01:48,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:01:48,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498169274] [2022-04-07 13:01:48,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:01:48,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:01:48,998 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:01:48,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [145412837] [2022-04-07 13:01:48,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:01:48,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:01:48,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:01:49,000 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-07 13:01:49,012 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-07 13:01:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:01:49,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 13:01:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:01:49,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:01:49,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {1492#true} call ULTIMATE.init(); {1492#true} is VALID [2022-04-07 13:01:49,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {1492#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(14, 2);call #Ultimate.allocInit(12, 3); {1492#true} is VALID [2022-04-07 13:01:49,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {1492#true} assume true; {1492#true} is VALID [2022-04-07 13:01:49,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1492#true} {1492#true} #98#return; {1492#true} is VALID [2022-04-07 13:01:49,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {1492#true} call #t~ret6 := main(); {1492#true} is VALID [2022-04-07 13:01:49,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {1492#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1492#true} is VALID [2022-04-07 13:01:49,260 INFO L272 TraceCheckUtils]: 6: Hoare triple {1492#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {1492#true} is VALID [2022-04-07 13:01:49,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {1492#true} ~cond := #in~cond; {1492#true} is VALID [2022-04-07 13:01:49,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {1492#true} assume !(0 == ~cond); {1492#true} is VALID [2022-04-07 13:01:49,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {1492#true} assume true; {1492#true} is VALID [2022-04-07 13:01:49,260 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1492#true} {1492#true} #78#return; {1492#true} is VALID [2022-04-07 13:01:49,260 INFO L290 TraceCheckUtils]: 11: Hoare triple {1492#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1492#true} is VALID [2022-04-07 13:01:49,261 INFO L272 TraceCheckUtils]: 12: Hoare triple {1492#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {1492#true} is VALID [2022-04-07 13:01:49,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {1492#true} ~cond := #in~cond; {1492#true} is VALID [2022-04-07 13:01:49,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {1492#true} assume !(0 == ~cond); {1492#true} is VALID [2022-04-07 13:01:49,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {1492#true} assume true; {1492#true} is VALID [2022-04-07 13:01:49,261 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1492#true} {1492#true} #80#return; {1492#true} is VALID [2022-04-07 13:01:49,261 INFO L272 TraceCheckUtils]: 17: Hoare triple {1492#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1492#true} is VALID [2022-04-07 13:01:49,262 INFO L290 TraceCheckUtils]: 18: Hoare triple {1492#true} ~cond := #in~cond; {1551#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 13:01:49,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {1551#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1555#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 13:01:49,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {1555#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1555#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 13:01:49,263 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1555#(not (= |assume_abort_if_not_#in~cond| 0))} {1492#true} #82#return; {1562#(<= 1 main_~y~0)} is VALID [2022-04-07 13:01:49,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {1562#(<= 1 main_~y~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1562#(<= 1 main_~y~0)} is VALID [2022-04-07 13:01:49,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {1562#(<= 1 main_~y~0)} assume !false; {1562#(<= 1 main_~y~0)} is VALID [2022-04-07 13:01:49,264 INFO L272 TraceCheckUtils]: 24: Hoare triple {1562#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1492#true} is VALID [2022-04-07 13:01:49,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {1492#true} ~cond := #in~cond; {1492#true} is VALID [2022-04-07 13:01:49,264 INFO L290 TraceCheckUtils]: 26: Hoare triple {1492#true} assume !(0 == ~cond); {1492#true} is VALID [2022-04-07 13:01:49,264 INFO L290 TraceCheckUtils]: 27: Hoare triple {1492#true} assume true; {1492#true} is VALID [2022-04-07 13:01:49,265 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1492#true} {1562#(<= 1 main_~y~0)} #84#return; {1562#(<= 1 main_~y~0)} is VALID [2022-04-07 13:01:49,265 INFO L272 TraceCheckUtils]: 29: Hoare triple {1562#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1492#true} is VALID [2022-04-07 13:01:49,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {1492#true} ~cond := #in~cond; {1492#true} is VALID [2022-04-07 13:01:49,265 INFO L290 TraceCheckUtils]: 31: Hoare triple {1492#true} assume !(0 == ~cond); {1492#true} is VALID [2022-04-07 13:01:49,266 INFO L290 TraceCheckUtils]: 32: Hoare triple {1492#true} assume true; {1492#true} is VALID [2022-04-07 13:01:49,278 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1492#true} {1562#(<= 1 main_~y~0)} #86#return; {1562#(<= 1 main_~y~0)} is VALID [2022-04-07 13:01:49,279 INFO L290 TraceCheckUtils]: 34: Hoare triple {1562#(<= 1 main_~y~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1602#(<= 1 main_~r~0)} is VALID [2022-04-07 13:01:49,279 INFO L290 TraceCheckUtils]: 35: Hoare triple {1602#(<= 1 main_~r~0)} assume !false; {1602#(<= 1 main_~r~0)} is VALID [2022-04-07 13:01:49,279 INFO L272 TraceCheckUtils]: 36: Hoare triple {1602#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1492#true} is VALID [2022-04-07 13:01:49,279 INFO L290 TraceCheckUtils]: 37: Hoare triple {1492#true} ~cond := #in~cond; {1492#true} is VALID [2022-04-07 13:01:49,279 INFO L290 TraceCheckUtils]: 38: Hoare triple {1492#true} assume !(0 == ~cond); {1492#true} is VALID [2022-04-07 13:01:49,279 INFO L290 TraceCheckUtils]: 39: Hoare triple {1492#true} assume true; {1492#true} is VALID [2022-04-07 13:01:49,280 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1492#true} {1602#(<= 1 main_~r~0)} #88#return; {1602#(<= 1 main_~r~0)} is VALID [2022-04-07 13:01:49,280 INFO L272 TraceCheckUtils]: 41: Hoare triple {1602#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1492#true} is VALID [2022-04-07 13:01:49,280 INFO L290 TraceCheckUtils]: 42: Hoare triple {1492#true} ~cond := #in~cond; {1492#true} is VALID [2022-04-07 13:01:49,281 INFO L290 TraceCheckUtils]: 43: Hoare triple {1492#true} assume !(0 == ~cond); {1492#true} is VALID [2022-04-07 13:01:49,281 INFO L290 TraceCheckUtils]: 44: Hoare triple {1492#true} assume true; {1492#true} is VALID [2022-04-07 13:01:49,281 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1492#true} {1602#(<= 1 main_~r~0)} #90#return; {1602#(<= 1 main_~r~0)} is VALID [2022-04-07 13:01:49,282 INFO L272 TraceCheckUtils]: 46: Hoare triple {1602#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {1639#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:01:49,283 INFO L290 TraceCheckUtils]: 47: Hoare triple {1639#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1643#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:01:49,283 INFO L290 TraceCheckUtils]: 48: Hoare triple {1643#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1493#false} is VALID [2022-04-07 13:01:49,283 INFO L290 TraceCheckUtils]: 49: Hoare triple {1493#false} assume !false; {1493#false} is VALID [2022-04-07 13:01:49,283 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-07 13:01:49,284 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 13:01:49,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:01:49,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498169274] [2022-04-07 13:01:49,284 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:01:49,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145412837] [2022-04-07 13:01:49,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145412837] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:01:49,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:01:49,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-07 13:01:49,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180231776] [2022-04-07 13:01:49,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:01:49,285 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 50 [2022-04-07 13:01:49,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:01:49,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-07 13:01:49,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:01:49,314 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 13:01:49,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:01:49,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 13:01:49,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-07 13:01:49,315 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-07 13:01:49,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:01:49,678 INFO L93 Difference]: Finished difference Result 76 states and 97 transitions. [2022-04-07 13:01:49,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 13:01:49,678 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 50 [2022-04-07 13:01:49,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:01:49,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-07 13:01:49,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-07 13:01:49,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-07 13:01:49,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-07 13:01:49,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 48 transitions. [2022-04-07 13:01:49,719 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-07 13:01:49,721 INFO L225 Difference]: With dead ends: 76 [2022-04-07 13:01:49,721 INFO L226 Difference]: Without dead ends: 74 [2022-04-07 13:01:49,722 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-07 13:01:49,722 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 13:01:49,723 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 160 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 13:01:49,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-07 13:01:49,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-04-07 13:01:49,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:01:49,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 74 states, 41 states have (on average 1.146341463414634) internal successors, (47), 43 states have internal predecessors, (47), 25 states have call successors, (25), 8 states have call predecessors, (25), 7 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 13:01:49,785 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 74 states, 41 states have (on average 1.146341463414634) internal successors, (47), 43 states have internal predecessors, (47), 25 states have call successors, (25), 8 states have call predecessors, (25), 7 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 13:01:49,785 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 74 states, 41 states have (on average 1.146341463414634) internal successors, (47), 43 states have internal predecessors, (47), 25 states have call successors, (25), 8 states have call predecessors, (25), 7 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 13:01:49,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:01:49,789 INFO L93 Difference]: Finished difference Result 74 states and 95 transitions. [2022-04-07 13:01:49,789 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 95 transitions. [2022-04-07 13:01:49,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:01:49,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:01:49,790 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 41 states have (on average 1.146341463414634) internal successors, (47), 43 states have internal predecessors, (47), 25 states have call successors, (25), 8 states have call predecessors, (25), 7 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 74 states. [2022-04-07 13:01:49,790 INFO L87 Difference]: Start difference. First operand has 74 states, 41 states have (on average 1.146341463414634) internal successors, (47), 43 states have internal predecessors, (47), 25 states have call successors, (25), 8 states have call predecessors, (25), 7 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 74 states. [2022-04-07 13:01:49,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:01:49,794 INFO L93 Difference]: Finished difference Result 74 states and 95 transitions. [2022-04-07 13:01:49,794 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 95 transitions. [2022-04-07 13:01:49,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:01:49,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:01:49,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:01:49,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:01:49,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 41 states have (on average 1.146341463414634) internal successors, (47), 43 states have internal predecessors, (47), 25 states have call successors, (25), 8 states have call predecessors, (25), 7 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 13:01:49,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 95 transitions. [2022-04-07 13:01:49,798 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 95 transitions. Word has length 50 [2022-04-07 13:01:49,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:01:49,798 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 95 transitions. [2022-04-07 13:01:49,798 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-07 13:01:49,798 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 95 transitions. [2022-04-07 13:01:49,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-07 13:01:49,799 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:01:49,799 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:01:49,824 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-07 13:01:50,015 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:01:50,015 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:01:50,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:01:50,016 INFO L85 PathProgramCache]: Analyzing trace with hash 991781023, now seen corresponding path program 1 times [2022-04-07 13:01:50,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:01:50,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119667584] [2022-04-07 13:01:50,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:01:50,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:01:50,033 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:01:50,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1401586066] [2022-04-07 13:01:50,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:01:50,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:01:50,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:01:50,035 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-07 13:01:50,064 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-07 13:01:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:01:50,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 13:01:50,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:01:50,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:01:50,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {2033#true} call ULTIMATE.init(); {2033#true} is VALID [2022-04-07 13:01:50,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {2033#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(14, 2);call #Ultimate.allocInit(12, 3); {2033#true} is VALID [2022-04-07 13:01:50,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {2033#true} assume true; {2033#true} is VALID [2022-04-07 13:01:50,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2033#true} {2033#true} #98#return; {2033#true} is VALID [2022-04-07 13:01:50,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {2033#true} call #t~ret6 := main(); {2033#true} is VALID [2022-04-07 13:01:50,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {2033#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2033#true} is VALID [2022-04-07 13:01:50,441 INFO L272 TraceCheckUtils]: 6: Hoare triple {2033#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {2033#true} is VALID [2022-04-07 13:01:50,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {2033#true} ~cond := #in~cond; {2033#true} is VALID [2022-04-07 13:01:50,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {2033#true} assume !(0 == ~cond); {2033#true} is VALID [2022-04-07 13:01:50,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {2033#true} assume true; {2033#true} is VALID [2022-04-07 13:01:50,442 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2033#true} {2033#true} #78#return; {2033#true} is VALID [2022-04-07 13:01:50,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {2033#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2033#true} is VALID [2022-04-07 13:01:50,442 INFO L272 TraceCheckUtils]: 12: Hoare triple {2033#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {2033#true} is VALID [2022-04-07 13:01:50,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {2033#true} ~cond := #in~cond; {2033#true} is VALID [2022-04-07 13:01:50,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {2033#true} assume !(0 == ~cond); {2033#true} is VALID [2022-04-07 13:01:50,443 INFO L290 TraceCheckUtils]: 15: Hoare triple {2033#true} assume true; {2033#true} is VALID [2022-04-07 13:01:50,443 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2033#true} {2033#true} #80#return; {2033#true} is VALID [2022-04-07 13:01:50,443 INFO L272 TraceCheckUtils]: 17: Hoare triple {2033#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2033#true} is VALID [2022-04-07 13:01:50,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {2033#true} ~cond := #in~cond; {2033#true} is VALID [2022-04-07 13:01:50,443 INFO L290 TraceCheckUtils]: 19: Hoare triple {2033#true} assume !(0 == ~cond); {2033#true} is VALID [2022-04-07 13:01:50,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {2033#true} assume true; {2033#true} is VALID [2022-04-07 13:01:50,443 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2033#true} {2033#true} #82#return; {2033#true} is VALID [2022-04-07 13:01:50,443 INFO L290 TraceCheckUtils]: 22: Hoare triple {2033#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {2033#true} is VALID [2022-04-07 13:01:50,444 INFO L290 TraceCheckUtils]: 23: Hoare triple {2033#true} assume !false; {2033#true} is VALID [2022-04-07 13:01:50,444 INFO L272 TraceCheckUtils]: 24: Hoare triple {2033#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2033#true} is VALID [2022-04-07 13:01:50,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {2033#true} ~cond := #in~cond; {2033#true} is VALID [2022-04-07 13:01:50,444 INFO L290 TraceCheckUtils]: 26: Hoare triple {2033#true} assume !(0 == ~cond); {2033#true} is VALID [2022-04-07 13:01:50,444 INFO L290 TraceCheckUtils]: 27: Hoare triple {2033#true} assume true; {2033#true} is VALID [2022-04-07 13:01:50,444 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2033#true} {2033#true} #84#return; {2033#true} is VALID [2022-04-07 13:01:50,444 INFO L272 TraceCheckUtils]: 29: Hoare triple {2033#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2033#true} is VALID [2022-04-07 13:01:50,444 INFO L290 TraceCheckUtils]: 30: Hoare triple {2033#true} ~cond := #in~cond; {2033#true} is VALID [2022-04-07 13:01:50,445 INFO L290 TraceCheckUtils]: 31: Hoare triple {2033#true} assume !(0 == ~cond); {2033#true} is VALID [2022-04-07 13:01:50,445 INFO L290 TraceCheckUtils]: 32: Hoare triple {2033#true} assume true; {2033#true} is VALID [2022-04-07 13:01:50,445 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2033#true} {2033#true} #86#return; {2033#true} is VALID [2022-04-07 13:01:50,445 INFO L290 TraceCheckUtils]: 34: Hoare triple {2033#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {2033#true} is VALID [2022-04-07 13:01:50,445 INFO L290 TraceCheckUtils]: 35: Hoare triple {2033#true} assume !false; {2033#true} is VALID [2022-04-07 13:01:50,445 INFO L272 TraceCheckUtils]: 36: Hoare triple {2033#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2033#true} is VALID [2022-04-07 13:01:50,455 INFO L290 TraceCheckUtils]: 37: Hoare triple {2033#true} ~cond := #in~cond; {2149#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:01:50,456 INFO L290 TraceCheckUtils]: 38: Hoare triple {2149#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2153#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:01:50,456 INFO L290 TraceCheckUtils]: 39: Hoare triple {2153#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2153#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:01:50,457 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2153#(not (= |__VERIFIER_assert_#in~cond| 0))} {2033#true} #88#return; {2160#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-07 13:01:50,457 INFO L272 TraceCheckUtils]: 41: Hoare triple {2160#(= main_~b~0 (* main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2033#true} is VALID [2022-04-07 13:01:50,457 INFO L290 TraceCheckUtils]: 42: Hoare triple {2033#true} ~cond := #in~cond; {2033#true} is VALID [2022-04-07 13:01:50,458 INFO L290 TraceCheckUtils]: 43: Hoare triple {2033#true} assume !(0 == ~cond); {2033#true} is VALID [2022-04-07 13:01:50,458 INFO L290 TraceCheckUtils]: 44: Hoare triple {2033#true} assume true; {2033#true} is VALID [2022-04-07 13:01:50,459 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2033#true} {2160#(= main_~b~0 (* main_~a~0 main_~y~0))} #90#return; {2160#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-07 13:01:50,459 INFO L272 TraceCheckUtils]: 46: Hoare triple {2160#(= main_~b~0 (* main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {2033#true} is VALID [2022-04-07 13:01:50,459 INFO L290 TraceCheckUtils]: 47: Hoare triple {2033#true} ~cond := #in~cond; {2033#true} is VALID [2022-04-07 13:01:50,459 INFO L290 TraceCheckUtils]: 48: Hoare triple {2033#true} assume !(0 == ~cond); {2033#true} is VALID [2022-04-07 13:01:50,459 INFO L290 TraceCheckUtils]: 49: Hoare triple {2033#true} assume true; {2033#true} is VALID [2022-04-07 13:01:50,460 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2033#true} {2160#(= main_~b~0 (* main_~a~0 main_~y~0))} #92#return; {2160#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-07 13:01:50,461 INFO L290 TraceCheckUtils]: 51: Hoare triple {2160#(= main_~b~0 (* main_~a~0 main_~y~0))} assume !!(~r~0 >= 2 * ~b~0); {2194#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-07 13:01:50,461 INFO L272 TraceCheckUtils]: 52: Hoare triple {2194#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {2198#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:01:50,462 INFO L290 TraceCheckUtils]: 53: Hoare triple {2198#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2202#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:01:50,463 INFO L290 TraceCheckUtils]: 54: Hoare triple {2202#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2034#false} is VALID [2022-04-07 13:01:50,466 INFO L290 TraceCheckUtils]: 55: Hoare triple {2034#false} assume !false; {2034#false} is VALID [2022-04-07 13:01:50,467 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-07 13:01:50,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:01:55,098 INFO L290 TraceCheckUtils]: 55: Hoare triple {2034#false} assume !false; {2034#false} is VALID [2022-04-07 13:01:55,106 INFO L290 TraceCheckUtils]: 54: Hoare triple {2202#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2034#false} is VALID [2022-04-07 13:01:55,108 INFO L290 TraceCheckUtils]: 53: Hoare triple {2198#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2202#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:01:55,109 INFO L272 TraceCheckUtils]: 52: Hoare triple {2194#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {2198#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:01:55,113 INFO L290 TraceCheckUtils]: 51: Hoare triple {2221#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} assume !!(~r~0 >= 2 * ~b~0); {2194#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-07 13:01:55,117 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2033#true} {2221#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} #92#return; {2221#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-07 13:01:55,118 INFO L290 TraceCheckUtils]: 49: Hoare triple {2033#true} assume true; {2033#true} is VALID [2022-04-07 13:01:55,118 INFO L290 TraceCheckUtils]: 48: Hoare triple {2033#true} assume !(0 == ~cond); {2033#true} is VALID [2022-04-07 13:01:55,118 INFO L290 TraceCheckUtils]: 47: Hoare triple {2033#true} ~cond := #in~cond; {2033#true} is VALID [2022-04-07 13:01:55,118 INFO L272 TraceCheckUtils]: 46: Hoare triple {2221#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {2033#true} is VALID [2022-04-07 13:01:55,119 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2033#true} {2221#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} #90#return; {2221#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-07 13:01:55,119 INFO L290 TraceCheckUtils]: 44: Hoare triple {2033#true} assume true; {2033#true} is VALID [2022-04-07 13:01:55,119 INFO L290 TraceCheckUtils]: 43: Hoare triple {2033#true} assume !(0 == ~cond); {2033#true} is VALID [2022-04-07 13:01:55,119 INFO L290 TraceCheckUtils]: 42: Hoare triple {2033#true} ~cond := #in~cond; {2033#true} is VALID [2022-04-07 13:01:55,119 INFO L272 TraceCheckUtils]: 41: Hoare triple {2221#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2033#true} is VALID [2022-04-07 13:01:55,120 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2153#(not (= |__VERIFIER_assert_#in~cond| 0))} {2033#true} #88#return; {2221#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-07 13:01:55,120 INFO L290 TraceCheckUtils]: 39: Hoare triple {2153#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2153#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:01:55,121 INFO L290 TraceCheckUtils]: 38: Hoare triple {2264#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2153#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:01:55,121 INFO L290 TraceCheckUtils]: 37: Hoare triple {2033#true} ~cond := #in~cond; {2264#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 13:01:55,122 INFO L272 TraceCheckUtils]: 36: Hoare triple {2033#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2033#true} is VALID [2022-04-07 13:01:55,122 INFO L290 TraceCheckUtils]: 35: Hoare triple {2033#true} assume !false; {2033#true} is VALID [2022-04-07 13:01:55,122 INFO L290 TraceCheckUtils]: 34: Hoare triple {2033#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {2033#true} is VALID [2022-04-07 13:01:55,122 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2033#true} {2033#true} #86#return; {2033#true} is VALID [2022-04-07 13:01:55,122 INFO L290 TraceCheckUtils]: 32: Hoare triple {2033#true} assume true; {2033#true} is VALID [2022-04-07 13:01:55,122 INFO L290 TraceCheckUtils]: 31: Hoare triple {2033#true} assume !(0 == ~cond); {2033#true} is VALID [2022-04-07 13:01:55,122 INFO L290 TraceCheckUtils]: 30: Hoare triple {2033#true} ~cond := #in~cond; {2033#true} is VALID [2022-04-07 13:01:55,122 INFO L272 TraceCheckUtils]: 29: Hoare triple {2033#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2033#true} is VALID [2022-04-07 13:01:55,122 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2033#true} {2033#true} #84#return; {2033#true} is VALID [2022-04-07 13:01:55,122 INFO L290 TraceCheckUtils]: 27: Hoare triple {2033#true} assume true; {2033#true} is VALID [2022-04-07 13:01:55,123 INFO L290 TraceCheckUtils]: 26: Hoare triple {2033#true} assume !(0 == ~cond); {2033#true} is VALID [2022-04-07 13:01:55,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {2033#true} ~cond := #in~cond; {2033#true} is VALID [2022-04-07 13:01:55,123 INFO L272 TraceCheckUtils]: 24: Hoare triple {2033#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2033#true} is VALID [2022-04-07 13:01:55,123 INFO L290 TraceCheckUtils]: 23: Hoare triple {2033#true} assume !false; {2033#true} is VALID [2022-04-07 13:01:55,123 INFO L290 TraceCheckUtils]: 22: Hoare triple {2033#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {2033#true} is VALID [2022-04-07 13:01:55,123 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2033#true} {2033#true} #82#return; {2033#true} is VALID [2022-04-07 13:01:55,123 INFO L290 TraceCheckUtils]: 20: Hoare triple {2033#true} assume true; {2033#true} is VALID [2022-04-07 13:01:55,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {2033#true} assume !(0 == ~cond); {2033#true} is VALID [2022-04-07 13:01:55,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {2033#true} ~cond := #in~cond; {2033#true} is VALID [2022-04-07 13:01:55,123 INFO L272 TraceCheckUtils]: 17: Hoare triple {2033#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2033#true} is VALID [2022-04-07 13:01:55,124 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2033#true} {2033#true} #80#return; {2033#true} is VALID [2022-04-07 13:01:55,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {2033#true} assume true; {2033#true} is VALID [2022-04-07 13:01:55,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {2033#true} assume !(0 == ~cond); {2033#true} is VALID [2022-04-07 13:01:55,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {2033#true} ~cond := #in~cond; {2033#true} is VALID [2022-04-07 13:01:55,124 INFO L272 TraceCheckUtils]: 12: Hoare triple {2033#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {2033#true} is VALID [2022-04-07 13:01:55,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {2033#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2033#true} is VALID [2022-04-07 13:01:55,124 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2033#true} {2033#true} #78#return; {2033#true} is VALID [2022-04-07 13:01:55,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {2033#true} assume true; {2033#true} is VALID [2022-04-07 13:01:55,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {2033#true} assume !(0 == ~cond); {2033#true} is VALID [2022-04-07 13:01:55,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {2033#true} ~cond := #in~cond; {2033#true} is VALID [2022-04-07 13:01:55,124 INFO L272 TraceCheckUtils]: 6: Hoare triple {2033#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {2033#true} is VALID [2022-04-07 13:01:55,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {2033#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2033#true} is VALID [2022-04-07 13:01:55,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {2033#true} call #t~ret6 := main(); {2033#true} is VALID [2022-04-07 13:01:55,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2033#true} {2033#true} #98#return; {2033#true} is VALID [2022-04-07 13:01:55,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {2033#true} assume true; {2033#true} is VALID [2022-04-07 13:01:55,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {2033#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(14, 2);call #Ultimate.allocInit(12, 3); {2033#true} is VALID [2022-04-07 13:01:55,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {2033#true} call ULTIMATE.init(); {2033#true} is VALID [2022-04-07 13:01:55,125 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-07 13:01:55,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:01:55,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119667584] [2022-04-07 13:01:55,126 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:01:55,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401586066] [2022-04-07 13:01:55,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401586066] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 13:01:55,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 13:01:55,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-07 13:01:55,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533997118] [2022-04-07 13:01:55,126 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 13:01:55,127 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 56 [2022-04-07 13:01:55,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:01:55,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-07 13:01:55,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:01:55,172 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 13:01:55,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:01:55,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 13:01:55,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-07 13:01:55,174 INFO L87 Difference]: Start difference. First operand 74 states and 95 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-07 13:01:55,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:01:55,578 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2022-04-07 13:01:55,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 13:01:55,579 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 56 [2022-04-07 13:01:55,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:01:55,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-07 13:01:55,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-07 13:01:55,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-07 13:01:55,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-07 13:01:55,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 48 transitions. [2022-04-07 13:01:55,625 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-07 13:01:55,627 INFO L225 Difference]: With dead ends: 80 [2022-04-07 13:01:55,627 INFO L226 Difference]: Without dead ends: 78 [2022-04-07 13:01:55,627 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-07 13:01:55,628 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 21 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 13:01:55,628 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 137 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 13:01:55,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-07 13:01:55,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-07 13:01:55,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:01:55,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 46 states have internal predecessors, (50), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 13:01:55,688 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 46 states have internal predecessors, (50), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 13:01:55,688 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 46 states have internal predecessors, (50), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 13:01:55,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:01:55,693 INFO L93 Difference]: Finished difference Result 78 states and 98 transitions. [2022-04-07 13:01:55,693 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 98 transitions. [2022-04-07 13:01:55,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:01:55,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:01:55,695 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 46 states have internal predecessors, (50), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 78 states. [2022-04-07 13:01:55,695 INFO L87 Difference]: Start difference. First operand has 78 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 46 states have internal predecessors, (50), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 78 states. [2022-04-07 13:01:55,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:01:55,698 INFO L93 Difference]: Finished difference Result 78 states and 98 transitions. [2022-04-07 13:01:55,698 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 98 transitions. [2022-04-07 13:01:55,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:01:55,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:01:55,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:01:55,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:01:55,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 46 states have internal predecessors, (50), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 13:01:55,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 98 transitions. [2022-04-07 13:01:55,711 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 98 transitions. Word has length 56 [2022-04-07 13:01:55,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:01:55,711 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 98 transitions. [2022-04-07 13:01:55,711 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-07 13:01:55,712 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 98 transitions. [2022-04-07 13:01:55,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-07 13:01:55,712 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:01:55,712 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:01:55,737 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-07 13:01:55,934 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:01:55,935 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:01:55,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:01:55,935 INFO L85 PathProgramCache]: Analyzing trace with hash -2096667334, now seen corresponding path program 1 times [2022-04-07 13:01:55,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:01:55,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714066736] [2022-04-07 13:01:55,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:01:55,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:01:55,965 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:01:55,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1170069342] [2022-04-07 13:01:55,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:01:55,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:01:55,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:01:55,973 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-07 13:01:55,982 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-07 13:01:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:01:56,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-07 13:01:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:01:56,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:01:56,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {2780#true} call ULTIMATE.init(); {2780#true} is VALID [2022-04-07 13:01:56,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {2780#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(14, 2);call #Ultimate.allocInit(12, 3); {2780#true} is VALID [2022-04-07 13:01:56,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-07 13:01:56,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2780#true} {2780#true} #98#return; {2780#true} is VALID [2022-04-07 13:01:56,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {2780#true} call #t~ret6 := main(); {2780#true} is VALID [2022-04-07 13:01:56,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {2780#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2780#true} is VALID [2022-04-07 13:01:56,480 INFO L272 TraceCheckUtils]: 6: Hoare triple {2780#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {2780#true} is VALID [2022-04-07 13:01:56,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-07 13:01:56,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-07 13:01:56,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-07 13:01:56,481 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2780#true} {2780#true} #78#return; {2780#true} is VALID [2022-04-07 13:01:56,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {2780#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2780#true} is VALID [2022-04-07 13:01:56,481 INFO L272 TraceCheckUtils]: 12: Hoare triple {2780#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {2780#true} is VALID [2022-04-07 13:01:56,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-07 13:01:56,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-07 13:01:56,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-07 13:01:56,482 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2780#true} {2780#true} #80#return; {2780#true} is VALID [2022-04-07 13:01:56,482 INFO L272 TraceCheckUtils]: 17: Hoare triple {2780#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2780#true} is VALID [2022-04-07 13:01:56,482 INFO L290 TraceCheckUtils]: 18: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-07 13:01:56,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-07 13:01:56,482 INFO L290 TraceCheckUtils]: 20: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-07 13:01:56,482 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2780#true} {2780#true} #82#return; {2780#true} is VALID [2022-04-07 13:01:56,482 INFO L290 TraceCheckUtils]: 22: Hoare triple {2780#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {2851#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 13:01:56,483 INFO L290 TraceCheckUtils]: 23: Hoare triple {2851#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !false; {2851#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 13:01:56,483 INFO L272 TraceCheckUtils]: 24: Hoare triple {2851#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2780#true} is VALID [2022-04-07 13:01:56,483 INFO L290 TraceCheckUtils]: 25: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-07 13:01:56,483 INFO L290 TraceCheckUtils]: 26: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-07 13:01:56,483 INFO L290 TraceCheckUtils]: 27: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-07 13:01:56,484 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2780#true} {2851#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #84#return; {2851#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 13:01:56,484 INFO L272 TraceCheckUtils]: 29: Hoare triple {2851#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2780#true} is VALID [2022-04-07 13:01:56,484 INFO L290 TraceCheckUtils]: 30: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-07 13:01:56,484 INFO L290 TraceCheckUtils]: 31: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-07 13:01:56,484 INFO L290 TraceCheckUtils]: 32: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-07 13:01:56,485 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2780#true} {2851#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #86#return; {2851#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 13:01:56,486 INFO L290 TraceCheckUtils]: 34: Hoare triple {2851#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {2888#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 13:01:56,486 INFO L290 TraceCheckUtils]: 35: Hoare triple {2888#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {2888#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 13:01:56,486 INFO L272 TraceCheckUtils]: 36: Hoare triple {2888#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2780#true} is VALID [2022-04-07 13:01:56,486 INFO L290 TraceCheckUtils]: 37: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-07 13:01:56,486 INFO L290 TraceCheckUtils]: 38: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-07 13:01:56,486 INFO L290 TraceCheckUtils]: 39: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-07 13:01:56,487 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2780#true} {2888#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #88#return; {2888#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 13:01:56,487 INFO L272 TraceCheckUtils]: 41: Hoare triple {2888#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2780#true} is VALID [2022-04-07 13:01:56,487 INFO L290 TraceCheckUtils]: 42: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-07 13:01:56,487 INFO L290 TraceCheckUtils]: 43: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-07 13:01:56,487 INFO L290 TraceCheckUtils]: 44: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-07 13:01:56,488 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2780#true} {2888#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #90#return; {2888#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 13:01:56,488 INFO L272 TraceCheckUtils]: 46: Hoare triple {2888#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {2780#true} is VALID [2022-04-07 13:01:56,488 INFO L290 TraceCheckUtils]: 47: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-07 13:01:56,488 INFO L290 TraceCheckUtils]: 48: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-07 13:01:56,488 INFO L290 TraceCheckUtils]: 49: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-07 13:01:56,489 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2780#true} {2888#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #92#return; {2888#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 13:01:56,490 INFO L290 TraceCheckUtils]: 51: Hoare triple {2888#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !(~r~0 >= 2 * ~b~0); {2940#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (not (<= (* main_~b~0 2) main_~r~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 13:01:56,491 INFO L290 TraceCheckUtils]: 52: Hoare triple {2940#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (not (<= (* main_~b~0 2) main_~r~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {2944#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1) (<= main_~y~0 main_~x~0))} is VALID [2022-04-07 13:01:56,491 INFO L290 TraceCheckUtils]: 53: Hoare triple {2944#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1) (<= main_~y~0 main_~x~0))} assume !false; {2944#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1) (<= main_~y~0 main_~x~0))} is VALID [2022-04-07 13:01:56,491 INFO L272 TraceCheckUtils]: 54: Hoare triple {2944#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2780#true} is VALID [2022-04-07 13:01:56,491 INFO L290 TraceCheckUtils]: 55: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-07 13:01:56,491 INFO L290 TraceCheckUtils]: 56: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-07 13:01:56,491 INFO L290 TraceCheckUtils]: 57: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-07 13:01:56,492 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {2780#true} {2944#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1) (<= main_~y~0 main_~x~0))} #84#return; {2944#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1) (<= main_~y~0 main_~x~0))} is VALID [2022-04-07 13:01:56,493 INFO L272 TraceCheckUtils]: 59: Hoare triple {2944#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2966#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:01:56,493 INFO L290 TraceCheckUtils]: 60: Hoare triple {2966#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2970#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:01:56,494 INFO L290 TraceCheckUtils]: 61: Hoare triple {2970#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2781#false} is VALID [2022-04-07 13:01:56,494 INFO L290 TraceCheckUtils]: 62: Hoare triple {2781#false} assume !false; {2781#false} is VALID [2022-04-07 13:01:56,494 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-07 13:01:56,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:01:56,855 INFO L290 TraceCheckUtils]: 62: Hoare triple {2781#false} assume !false; {2781#false} is VALID [2022-04-07 13:01:56,856 INFO L290 TraceCheckUtils]: 61: Hoare triple {2970#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2781#false} is VALID [2022-04-07 13:01:56,856 INFO L290 TraceCheckUtils]: 60: Hoare triple {2966#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2970#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:01:56,857 INFO L272 TraceCheckUtils]: 59: Hoare triple {2986#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2966#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:01:56,857 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {2780#true} {2986#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #84#return; {2986#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-07 13:01:56,858 INFO L290 TraceCheckUtils]: 57: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-07 13:01:56,858 INFO L290 TraceCheckUtils]: 56: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-07 13:01:56,858 INFO L290 TraceCheckUtils]: 55: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-07 13:01:56,858 INFO L272 TraceCheckUtils]: 54: Hoare triple {2986#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2780#true} is VALID [2022-04-07 13:01:56,864 INFO L290 TraceCheckUtils]: 53: Hoare triple {2986#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !false; {2986#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-07 13:01:56,874 INFO L290 TraceCheckUtils]: 52: Hoare triple {3008#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {2986#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-07 13:01:56,874 INFO L290 TraceCheckUtils]: 51: Hoare triple {3012#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} assume !(~r~0 >= 2 * ~b~0); {3008#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-07 13:01:56,875 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2780#true} {3012#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} #92#return; {3012#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-07 13:01:56,875 INFO L290 TraceCheckUtils]: 49: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-07 13:01:56,875 INFO L290 TraceCheckUtils]: 48: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-07 13:01:56,876 INFO L290 TraceCheckUtils]: 47: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-07 13:01:56,876 INFO L272 TraceCheckUtils]: 46: Hoare triple {3012#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {2780#true} is VALID [2022-04-07 13:01:56,876 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2780#true} {3012#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} #90#return; {3012#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-07 13:01:56,876 INFO L290 TraceCheckUtils]: 44: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-07 13:01:56,877 INFO L290 TraceCheckUtils]: 43: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-07 13:01:56,877 INFO L290 TraceCheckUtils]: 42: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-07 13:01:56,877 INFO L272 TraceCheckUtils]: 41: Hoare triple {3012#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2780#true} is VALID [2022-04-07 13:01:56,877 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2780#true} {3012#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} #88#return; {3012#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-07 13:01:56,878 INFO L290 TraceCheckUtils]: 39: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-07 13:01:56,878 INFO L290 TraceCheckUtils]: 38: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-07 13:01:56,878 INFO L290 TraceCheckUtils]: 37: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-07 13:01:56,878 INFO L272 TraceCheckUtils]: 36: Hoare triple {3012#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2780#true} is VALID [2022-04-07 13:01:56,879 INFO L290 TraceCheckUtils]: 35: Hoare triple {3012#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} assume !false; {3012#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-07 13:01:56,879 INFO L290 TraceCheckUtils]: 34: Hoare triple {3064#(or (not (<= main_~y~0 main_~r~0)) (<= (* main_~y~0 2) main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 (+ main_~q~0 1)) (* (- 1) main_~y~0))))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {3012#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-07 13:01:56,880 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2780#true} {3064#(or (not (<= main_~y~0 main_~r~0)) (<= (* main_~y~0 2) main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 (+ main_~q~0 1)) (* (- 1) main_~y~0))))} #86#return; {3064#(or (not (<= main_~y~0 main_~r~0)) (<= (* main_~y~0 2) main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 (+ main_~q~0 1)) (* (- 1) main_~y~0))))} is VALID [2022-04-07 13:01:56,880 INFO L290 TraceCheckUtils]: 32: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-07 13:01:56,880 INFO L290 TraceCheckUtils]: 31: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-07 13:01:56,880 INFO L290 TraceCheckUtils]: 30: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-07 13:01:56,880 INFO L272 TraceCheckUtils]: 29: Hoare triple {3064#(or (not (<= main_~y~0 main_~r~0)) (<= (* main_~y~0 2) main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 (+ main_~q~0 1)) (* (- 1) main_~y~0))))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2780#true} is VALID [2022-04-07 13:01:56,881 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2780#true} {3064#(or (not (<= main_~y~0 main_~r~0)) (<= (* main_~y~0 2) main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 (+ main_~q~0 1)) (* (- 1) main_~y~0))))} #84#return; {3064#(or (not (<= main_~y~0 main_~r~0)) (<= (* main_~y~0 2) main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 (+ main_~q~0 1)) (* (- 1) main_~y~0))))} is VALID [2022-04-07 13:01:56,881 INFO L290 TraceCheckUtils]: 27: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-07 13:01:56,881 INFO L290 TraceCheckUtils]: 26: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-07 13:01:56,881 INFO L290 TraceCheckUtils]: 25: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-07 13:01:56,882 INFO L272 TraceCheckUtils]: 24: Hoare triple {3064#(or (not (<= main_~y~0 main_~r~0)) (<= (* main_~y~0 2) main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 (+ main_~q~0 1)) (* (- 1) main_~y~0))))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2780#true} is VALID [2022-04-07 13:01:56,882 INFO L290 TraceCheckUtils]: 23: Hoare triple {3064#(or (not (<= main_~y~0 main_~r~0)) (<= (* main_~y~0 2) main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 (+ main_~q~0 1)) (* (- 1) main_~y~0))))} assume !false; {3064#(or (not (<= main_~y~0 main_~r~0)) (<= (* main_~y~0 2) main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 (+ main_~q~0 1)) (* (- 1) main_~y~0))))} is VALID [2022-04-07 13:01:56,883 INFO L290 TraceCheckUtils]: 22: Hoare triple {2780#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {3064#(or (not (<= main_~y~0 main_~r~0)) (<= (* main_~y~0 2) main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 (+ main_~q~0 1)) (* (- 1) main_~y~0))))} is VALID [2022-04-07 13:01:56,883 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2780#true} {2780#true} #82#return; {2780#true} is VALID [2022-04-07 13:01:56,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-07 13:01:56,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-07 13:01:56,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-07 13:01:56,883 INFO L272 TraceCheckUtils]: 17: Hoare triple {2780#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2780#true} is VALID [2022-04-07 13:01:56,883 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2780#true} {2780#true} #80#return; {2780#true} is VALID [2022-04-07 13:01:56,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-07 13:01:56,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-07 13:01:56,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-07 13:01:56,884 INFO L272 TraceCheckUtils]: 12: Hoare triple {2780#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {2780#true} is VALID [2022-04-07 13:01:56,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {2780#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2780#true} is VALID [2022-04-07 13:01:56,884 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2780#true} {2780#true} #78#return; {2780#true} is VALID [2022-04-07 13:01:56,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-07 13:01:56,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-07 13:01:56,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-07 13:01:56,884 INFO L272 TraceCheckUtils]: 6: Hoare triple {2780#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {2780#true} is VALID [2022-04-07 13:01:56,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {2780#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2780#true} is VALID [2022-04-07 13:01:56,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {2780#true} call #t~ret6 := main(); {2780#true} is VALID [2022-04-07 13:01:56,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2780#true} {2780#true} #98#return; {2780#true} is VALID [2022-04-07 13:01:56,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-07 13:01:56,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {2780#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(14, 2);call #Ultimate.allocInit(12, 3); {2780#true} is VALID [2022-04-07 13:01:56,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {2780#true} call ULTIMATE.init(); {2780#true} is VALID [2022-04-07 13:01:56,885 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-07 13:01:56,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:01:56,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714066736] [2022-04-07 13:01:56,885 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:01:56,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170069342] [2022-04-07 13:01:56,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170069342] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 13:01:56,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 13:01:56,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 12 [2022-04-07 13:01:56,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571430781] [2022-04-07 13:01:56,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:01:56,887 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 63 [2022-04-07 13:01:56,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:01:56,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-07 13:01:56,935 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-07 13:01:56,936 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 13:01:56,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:01:56,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 13:01:56,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-04-07 13:01:56,937 INFO L87 Difference]: Start difference. First operand 78 states and 98 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-07 13:01:57,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:01:57,505 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-07 13:01:57,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 13:01:57,506 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 63 [2022-04-07 13:01:57,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:01:57,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-07 13:01:57,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-04-07 13:01:57,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-07 13:01:57,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-04-07 13:01:57,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2022-04-07 13:01:57,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:01:57,565 INFO L225 Difference]: With dead ends: 82 [2022-04-07 13:01:57,566 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 13:01:57,566 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-04-07 13:01:57,567 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 17 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 13:01:57,567 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 110 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 13:01:57,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 13:01:57,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 13:01:57,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:01:57,568 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-07 13:01:57,568 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-07 13:01:57,568 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-07 13:01:57,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:01:57,569 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 13:01:57,569 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 13:01:57,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:01:57,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:01:57,569 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-07 13:01:57,569 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-07 13:01:57,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:01:57,569 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 13:01:57,569 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 13:01:57,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:01:57,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:01:57,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:01:57,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:01:57,570 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-07 13:01:57,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 13:01:57,570 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2022-04-07 13:01:57,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:01:57,570 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 13:01:57,571 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-07 13:01:57,571 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 13:01:57,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:01:57,573 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 13:01:57,596 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-07 13:01:57,783 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:01:57,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 13:01:58,639 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-07 13:01:58,639 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-07 13:01:58,639 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-07 13:01:58,639 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-07 13:01:58,639 INFO L882 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-07 13:01:58,639 INFO L882 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-04-07 13:01:58,639 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-04-07 13:01:58,640 INFO L882 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2022-04-07 13:01:58,640 INFO L882 garLoopResultBuilder]: For program point L31(line 31) no Hoare annotation was computed. [2022-04-07 13:01:58,640 INFO L885 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-04-07 13:01:58,640 INFO L878 garLoopResultBuilder]: At program point L29-1(line 29) the Hoare annotation is: (and (<= 0 main_~y~0) (<= main_~y~0 10)) [2022-04-07 13:01:58,640 INFO L885 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-04-07 13:01:58,640 INFO L882 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-04-07 13:01:58,640 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 22 66) no Hoare annotation was computed. [2022-04-07 13:01:58,640 INFO L882 garLoopResultBuilder]: For program point L50(lines 47 59) no Hoare annotation was computed. [2022-04-07 13:01:58,640 INFO L878 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 10) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-07 13:01:58,640 INFO L878 garLoopResultBuilder]: At program point L48-1(line 48) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 10) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-07 13:01:58,640 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 22 66) no Hoare annotation was computed. [2022-04-07 13:01:58,640 INFO L882 garLoopResultBuilder]: For program point L40(lines 38 62) no Hoare annotation was computed. [2022-04-07 13:01:58,641 INFO L878 garLoopResultBuilder]: At program point L38-2(lines 38 62) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 10) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-07 13:01:58,641 INFO L878 garLoopResultBuilder]: At program point L38-3(lines 38 62) the Hoare annotation is: (let ((.cse0 (<= main_~y~0 10)) (.cse1 (<= 1 main_~y~0))) (or (and (= main_~x~0 main_~r~0) .cse0 (= main_~q~0 0) .cse1) (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) .cse0 .cse1 (= main_~b~0 (* main_~a~0 main_~y~0))))) [2022-04-07 13:01:58,641 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 22 66) the Hoare annotation is: true [2022-04-07 13:01:58,641 INFO L878 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~y~0))) (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 10) (<= (* 2 .cse0) main_~r~0) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 .cse0))) [2022-04-07 13:01:58,641 INFO L882 garLoopResultBuilder]: For program point L55-1(line 55) no Hoare annotation was computed. [2022-04-07 13:01:58,641 INFO L878 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 10) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-07 13:01:58,641 INFO L878 garLoopResultBuilder]: At program point L47-2(lines 47 59) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 10) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-07 13:01:58,641 INFO L882 garLoopResultBuilder]: For program point L47-3(lines 47 59) no Hoare annotation was computed. [2022-04-07 13:01:58,641 INFO L878 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 10) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-07 13:01:58,641 INFO L878 garLoopResultBuilder]: At program point L39-1(line 39) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 10) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-07 13:01:58,641 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 13:01:58,641 INFO L878 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-07 13:01:58,641 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 13:01:58,641 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 13:01:58,641 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 13:01:58,641 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 13:01:58,642 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 13:01:58,642 INFO L882 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2022-04-07 13:01:58,642 INFO L882 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2022-04-07 13:01:58,642 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-07 13:01:58,642 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2022-04-07 13:01:58,642 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2022-04-07 13:01:58,642 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-04-07 13:01:58,644 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:01:58,645 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 13:01:58,648 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-07 13:01:58,648 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 13:01:58,652 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-07 13:01:58,652 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 13:01:58,652 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-07 13:01:58,652 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 13:01:58,652 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 13:01:58,652 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-07 13:01:58,652 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-07 13:01:58,652 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-07 13:01:58,652 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 13:01:58,652 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 13:01:58,652 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 13:01:58,652 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 13:01:58,652 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-07 13:01:58,652 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-07 13:01:58,652 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 13:01:58,653 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 13:01:58,653 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-07 13:01:58,653 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-07 13:01:58,653 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-07 13:01:58,653 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-07 13:01:58,653 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 13:01:58,653 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 13:01:58,653 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 13:01:58,653 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 13:01:58,653 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 13:01:58,653 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 13:01:58,653 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 13:01:58,653 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-07 13:01:58,653 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-07 13:01:58,653 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-07 13:01:58,653 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-07 13:01:58,653 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-07 13:01:58,653 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-07 13:01:58,654 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-07 13:01:58,654 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-07 13:01:58,654 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2022-04-07 13:01:58,654 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-04-07 13:01:58,657 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-04-07 13:01:58,657 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-07 13:01:58,657 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-07 13:01:58,658 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-07 13:01:58,658 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2022-04-07 13:01:58,658 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 13:01:58,659 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 13:01:58,659 INFO L163 areAnnotationChecker]: CFG has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-07 13:01:58,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 01:01:58 BoogieIcfgContainer [2022-04-07 13:01:58,666 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 13:01:58,667 INFO L158 Benchmark]: Toolchain (without parser) took 14547.56ms. Allocated memory was 198.2MB in the beginning and 338.7MB in the end (delta: 140.5MB). Free memory was 140.7MB in the beginning and 243.9MB in the end (delta: -103.1MB). Peak memory consumption was 38.3MB. Max. memory is 8.0GB. [2022-04-07 13:01:58,667 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 198.2MB. Free memory was 157.0MB in the beginning and 156.9MB in the end (delta: 89.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 13:01:58,667 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.50ms. Allocated memory was 198.2MB in the beginning and 282.1MB in the end (delta: 83.9MB). Free memory was 140.5MB in the beginning and 254.2MB in the end (delta: -113.7MB). Peak memory consumption was 16.6MB. Max. memory is 8.0GB. [2022-04-07 13:01:58,668 INFO L158 Benchmark]: Boogie Preprocessor took 26.49ms. Allocated memory is still 282.1MB. Free memory was 254.2MB in the beginning and 252.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 13:01:58,668 INFO L158 Benchmark]: RCFGBuilder took 331.05ms. Allocated memory is still 282.1MB. Free memory was 252.6MB in the beginning and 240.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 13:01:58,668 INFO L158 Benchmark]: TraceAbstraction took 13938.01ms. Allocated memory was 282.1MB in the beginning and 338.7MB in the end (delta: 56.6MB). Free memory was 239.5MB in the beginning and 244.4MB in the end (delta: -4.9MB). Peak memory consumption was 52.8MB. Max. memory is 8.0GB. [2022-04-07 13:01:58,669 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.11ms. Allocated memory is still 198.2MB. Free memory was 157.0MB in the beginning and 156.9MB in the end (delta: 89.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 244.50ms. Allocated memory was 198.2MB in the beginning and 282.1MB in the end (delta: 83.9MB). Free memory was 140.5MB in the beginning and 254.2MB in the end (delta: -113.7MB). Peak memory consumption was 16.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.49ms. Allocated memory is still 282.1MB. Free memory was 254.2MB in the beginning and 252.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 331.05ms. Allocated memory is still 282.1MB. Free memory was 252.6MB in the beginning and 240.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 13938.01ms. Allocated memory was 282.1MB in the beginning and 338.7MB in the end (delta: 56.6MB). Free memory was 239.5MB in the beginning and 244.4MB in the end (delta: -4.9MB). Peak memory consumption was 52.8MB. 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: 17]: 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, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.8s, OverallIterations: 7, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 181 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 142 mSDsluCounter, 941 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 691 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 677 IncrementalHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 250 mSDtfsCounter, 677 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 409 GetRequests, 352 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=6, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 49 PreInvPairs, 79 NumberOfFragments, 228 HoareAnnotationTreeSize, 49 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 1068 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 1044 SizeOfPredicates, 20 NumberOfNonLiveVariables, 745 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 383/400 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: 47]: Loop Invariant Derived loop invariant: (((q * y + r == x && y <= 10) && 1 <= r) && 1 <= y) && b == a * y - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((q * y + r == x && y <= 10) && 1 <= y) && b == a * y RESULT: Ultimate proved your program to be correct! [2022-04-07 13:01:58,691 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...