/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loop-invgen/half_2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:15:57,482 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:15:57,483 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:15:57,519 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:15:57,520 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:15:57,531 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:15:57,532 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:15:57,533 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:15:57,534 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:15:57,534 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:15:57,535 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:15:57,538 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:15:57,539 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:15:57,544 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:15:57,544 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:15:57,545 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:15:57,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:15:57,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:15:57,547 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:15:57,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:15:57,548 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:15:57,551 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:15:57,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:15:57,553 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:15:57,554 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:15:57,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:15:57,561 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:15:57,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:15:57,561 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:15:57,562 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:15:57,562 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:15:57,562 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:15:57,563 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:15:57,563 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:15:57,564 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:15:57,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:15:57,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:15:57,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:15:57,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:15:57,565 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:15:57,565 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:15:57,566 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:15:57,567 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:15:57,579 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:15:57,579 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:15:57,580 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:15:57,580 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:15:57,580 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:15:57,580 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:15:57,580 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:15:57,580 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:15:57,580 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:15:57,580 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:15:57,581 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:15:57,581 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:15:57,581 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:15:57,581 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:15:57,581 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:15:57,581 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:15:57,581 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:15:57,581 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:15:57,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:15:57,582 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:15:57,582 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:15:57,582 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:15:57,582 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 16:15:57,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:15:57,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:15:57,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:15:57,789 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:15:57,790 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:15:57,791 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/half_2.i [2022-04-27 16:15:57,834 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fec0c62d/1caa48cfe7aa40e79da2ca4ce25833d8/FLAG934df32a3 [2022-04-27 16:15:58,161 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:15:58,162 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/half_2.i [2022-04-27 16:15:58,165 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fec0c62d/1caa48cfe7aa40e79da2ca4ce25833d8/FLAG934df32a3 [2022-04-27 16:15:58,606 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fec0c62d/1caa48cfe7aa40e79da2ca4ce25833d8 [2022-04-27 16:15:58,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:15:58,612 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:15:58,613 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:15:58,614 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:15:58,617 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:15:58,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:15:58" (1/1) ... [2022-04-27 16:15:58,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b6fc35c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:15:58, skipping insertion in model container [2022-04-27 16:15:58,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:15:58" (1/1) ... [2022-04-27 16:15:58,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:15:58,637 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:15:58,753 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/half_2.i[893,906] [2022-04-27 16:15:58,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:15:58,771 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:15:58,779 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/half_2.i[893,906] [2022-04-27 16:15:58,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:15:58,789 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:15:58,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:15:58 WrapperNode [2022-04-27 16:15:58,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:15:58,790 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:15:58,790 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:15:58,790 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:15:58,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:15:58" (1/1) ... [2022-04-27 16:15:58,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:15:58" (1/1) ... [2022-04-27 16:15:58,804 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:15:58" (1/1) ... [2022-04-27 16:15:58,805 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:15:58" (1/1) ... [2022-04-27 16:15:58,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:15:58" (1/1) ... [2022-04-27 16:15:58,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:15:58" (1/1) ... [2022-04-27 16:15:58,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:15:58" (1/1) ... [2022-04-27 16:15:58,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:15:58,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:15:58,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:15:58,829 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:15:58,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:15:58" (1/1) ... [2022-04-27 16:15:58,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:15:58,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:15:58,851 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 16:15:58,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 16:15:58,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:15:58,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:15:58,879 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:15:58,880 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 16:15:58,880 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 16:15:58,880 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:15:58,880 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:15:58,880 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:15:58,880 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 16:15:58,880 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 16:15:58,880 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:15:58,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:15:58,891 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 16:15:58,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:15:58,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 16:15:58,891 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:15:58,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:15:58,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:15:58,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:15:58,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:15:58,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:15:58,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:15:58,936 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:15:58,937 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:15:59,055 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:15:59,068 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:15:59,068 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 16:15:59,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:15:59 BoogieIcfgContainer [2022-04-27 16:15:59,074 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:15:59,074 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:15:59,074 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:15:59,075 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:15:59,077 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:15:59" (1/1) ... [2022-04-27 16:15:59,079 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:16:03,303 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-27 16:16:03,429 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-27 16:16:03,429 INFO L91 elerationTransformer]: Accelerated Formula: (and (< v_main_~i~0_5 v_main_~n~0_9) (= (+ v_main_~k~0_6 1) v_main_~k~0_7) (= v_main_~i~0_4 (+ v_main_~i~0_5 2))) InVars {main_~k~0=v_main_~k~0_7, main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9} OutVars{main_~k~0=v_main_~k~0_6, main_~i~0=v_main_~i~0_4, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2] to Formula: (or (and (= v_main_~k~0_7 v_main_~k~0_6) (not (< v_main_~i~0_5 v_main_~n~0_9)) (= |v_main_#t~post2_3| |v_main_#t~post2_1|) (= v_main_~i~0_4 v_main_~i~0_5)) (and (< v_main_~k~0_6 v_main_~k~0_7) (< v_main_~k~0_7 (+ v_main_~k~0_6 2 (div (+ (- 1) v_main_~n~0_9 (* (- 1) v_main_~i~0_5)) 2))) (= (+ v_main_~i~0_5 (* v_main_~k~0_7 2)) (+ v_main_~i~0_4 (* v_main_~k~0_6 2))))) InVars {main_~i~0=v_main_~i~0_5, main_#t~post2=|v_main_#t~post2_3|, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_7} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2] [2022-04-27 16:16:03,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:16:03 BasicIcfg [2022-04-27 16:16:03,439 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:16:03,441 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:16:03,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:16:03,444 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:16:03,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:15:58" (1/4) ... [2022-04-27 16:16:03,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d3e21f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:16:03, skipping insertion in model container [2022-04-27 16:16:03,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:15:58" (2/4) ... [2022-04-27 16:16:03,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d3e21f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:16:03, skipping insertion in model container [2022-04-27 16:16:03,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:15:59" (3/4) ... [2022-04-27 16:16:03,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d3e21f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:16:03, skipping insertion in model container [2022-04-27 16:16:03,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:16:03" (4/4) ... [2022-04-27 16:16:03,448 INFO L111 eAbstractionObserver]: Analyzing ICFG half_2.iJordan [2022-04-27 16:16:03,458 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:16:03,458 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:16:03,492 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:16:03,498 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@426070dd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@16628643 [2022-04-27 16:16:03,498 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:16:03,504 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:16:03,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 16:16:03,509 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:16:03,509 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:16:03,509 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:16:03,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:16:03,515 INFO L85 PathProgramCache]: Analyzing trace with hash 101012931, now seen corresponding path program 1 times [2022-04-27 16:16:03,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:16:03,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117441224] [2022-04-27 16:16:03,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:16:03,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:16:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:03,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:16:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:03,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [73] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {26#true} is VALID [2022-04-27 16:16:03,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} [76] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 16:16:03,665 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 16:16:03,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} [71] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:16:03,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [73] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {26#true} is VALID [2022-04-27 16:16:03,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} [76] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 16:16:03,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 16:16:03,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} [72] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-27 16:16:03,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} [75] mainENTRY-->L27: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {26#true} is VALID [2022-04-27 16:16:03,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} [78] L27-->L30-2: Formula: (and (= v_main_~i~0_2 0) (<= v_main_~n~0_7 1000000) (= v_main_~k~0_5 v_main_~n~0_7)) InVars {main_~n~0=v_main_~n~0_7} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_7, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {26#true} is VALID [2022-04-27 16:16:03,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#true} [80] L30-2-->L30-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-27 16:16:03,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} [83] L30-3-->L35-2: Formula: (= v_main_~j~0_1 0) InVars {} OutVars{main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {27#false} is VALID [2022-04-27 16:16:03,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} [86] L35-2-->L36: Formula: (< v_main_~j~0_3 (let ((.cse0 (div v_main_~n~0_2 2))) (ite (and (< v_main_~n~0_2 0) (not (= (mod v_main_~n~0_2 2) 0))) (+ .cse0 1) .cse0))) InVars {main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-27 16:16:03,671 INFO L272 TraceCheckUtils]: 10: Hoare triple {27#false} [88] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {27#false} is VALID [2022-04-27 16:16:03,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#false} [90] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {27#false} is VALID [2022-04-27 16:16:03,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {27#false} [91] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-27 16:16:03,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {27#false} [93] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-27 16:16:03,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:16:03,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:16:03,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117441224] [2022-04-27 16:16:03,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117441224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:16:03,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:16:03,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 16:16:03,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216221903] [2022-04-27 16:16:03,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:16:03,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 16:16:03,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:16:03,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:16:03,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:16:03,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 16:16:03,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:16:03,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 16:16:03,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:16:03,737 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:16:03,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:03,793 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 16:16:03,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 16:16:03,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 16:16:03,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:16:03,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:16:03,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-04-27 16:16:03,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:16:03,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-04-27 16:16:03,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 28 transitions. [2022-04-27 16:16:03,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:16:03,840 INFO L225 Difference]: With dead ends: 23 [2022-04-27 16:16:03,840 INFO L226 Difference]: Without dead ends: 18 [2022-04-27 16:16:03,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:16:03,844 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:16:03,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 27 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:16:03,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-27 16:16:03,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-27 16:16:03,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:16:03,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:16:03,866 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:16:03,866 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:16:03,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:03,872 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-27 16:16:03,872 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-27 16:16:03,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:03,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:03,873 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-27 16:16:03,874 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-27 16:16:03,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:03,876 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-27 16:16:03,876 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-27 16:16:03,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:03,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:03,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:16:03,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:16:03,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:16:03,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-27 16:16:03,882 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2022-04-27 16:16:03,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:16:03,886 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-27 16:16:03,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:16:03,886 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-27 16:16:03,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 16:16:03,887 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:16:03,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:16:03,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:16:03,887 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:16:03,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:16:03,888 INFO L85 PathProgramCache]: Analyzing trace with hash 988516612, now seen corresponding path program 1 times [2022-04-27 16:16:03,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:16:03,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098297115] [2022-04-27 16:16:03,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:16:03,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:16:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:04,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:16:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:04,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [73] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {111#true} is VALID [2022-04-27 16:16:04,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {111#true} [76] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {111#true} is VALID [2022-04-27 16:16:04,018 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {111#true} {111#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {111#true} is VALID [2022-04-27 16:16:04,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {111#true} [71] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:16:04,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [73] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {111#true} is VALID [2022-04-27 16:16:04,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {111#true} [76] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {111#true} is VALID [2022-04-27 16:16:04,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111#true} {111#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {111#true} is VALID [2022-04-27 16:16:04,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {111#true} [72] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {111#true} is VALID [2022-04-27 16:16:04,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {111#true} [75] mainENTRY-->L27: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {111#true} is VALID [2022-04-27 16:16:04,021 INFO L290 TraceCheckUtils]: 6: Hoare triple {111#true} [78] L27-->L30-2: Formula: (and (= v_main_~i~0_2 0) (<= v_main_~n~0_7 1000000) (= v_main_~k~0_5 v_main_~n~0_7)) InVars {main_~n~0=v_main_~n~0_7} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_7, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {116#(<= main_~n~0 main_~k~0)} is VALID [2022-04-27 16:16:04,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {116#(<= main_~n~0 main_~k~0)} [81] L30-2-->L30-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {116#(<= main_~n~0 main_~k~0)} is VALID [2022-04-27 16:16:04,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {116#(<= main_~n~0 main_~k~0)} [83] L30-3-->L35-2: Formula: (= v_main_~j~0_1 0) InVars {} OutVars{main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {117#(and (= main_~j~0 0) (<= main_~n~0 main_~k~0))} is VALID [2022-04-27 16:16:04,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {117#(and (= main_~j~0 0) (<= main_~n~0 main_~k~0))} [86] L35-2-->L36: Formula: (< v_main_~j~0_3 (let ((.cse0 (div v_main_~n~0_2 2))) (ite (and (< v_main_~n~0_2 0) (not (= (mod v_main_~n~0_2 2) 0))) (+ .cse0 1) .cse0))) InVars {main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {118#(<= 1 main_~k~0)} is VALID [2022-04-27 16:16:04,023 INFO L272 TraceCheckUtils]: 10: Hoare triple {118#(<= 1 main_~k~0)} [88] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {119#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:16:04,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {119#(not (= |__VERIFIER_assert_#in~cond| 0))} [90] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {120#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:16:04,024 INFO L290 TraceCheckUtils]: 12: Hoare triple {120#(not (= __VERIFIER_assert_~cond 0))} [91] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {112#false} is VALID [2022-04-27 16:16:04,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {112#false} [93] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {112#false} is VALID [2022-04-27 16:16:04,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:16:04,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:16:04,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098297115] [2022-04-27 16:16:04,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098297115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:16:04,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:16:04,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 16:16:04,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95458139] [2022-04-27 16:16:04,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:16:04,026 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 16:16:04,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:16:04,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:16:04,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:16:04,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 16:16:04,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:16:04,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 16:16:04,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-27 16:16:04,041 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:16:04,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:04,265 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-27 16:16:04,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 16:16:04,265 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 16:16:04,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:16:04,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:16:04,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 30 transitions. [2022-04-27 16:16:04,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:16:04,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 30 transitions. [2022-04-27 16:16:04,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 30 transitions. [2022-04-27 16:16:04,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:16:04,297 INFO L225 Difference]: With dead ends: 27 [2022-04-27 16:16:04,297 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 16:16:04,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-27 16:16:04,298 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:16:04,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 34 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:16:04,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 16:16:04,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-27 16:16:04,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:16:04,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:16:04,301 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:16:04,301 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:16:04,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:04,303 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-27 16:16:04,303 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-27 16:16:04,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:04,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:04,303 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-27 16:16:04,304 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-27 16:16:04,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:04,305 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-27 16:16:04,305 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-27 16:16:04,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:04,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:04,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:16:04,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:16:04,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:16:04,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-27 16:16:04,307 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 14 [2022-04-27 16:16:04,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:16:04,307 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-27 16:16:04,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:16:04,307 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-27 16:16:04,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 16:16:04,307 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:16:04,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:16:04,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 16:16:04,308 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:16:04,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:16:04,308 INFO L85 PathProgramCache]: Analyzing trace with hash 459251866, now seen corresponding path program 1 times [2022-04-27 16:16:04,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:16:04,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776836776] [2022-04-27 16:16:04,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:16:04,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:16:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:04,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:16:04,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:04,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {254#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [73] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {243#true} is VALID [2022-04-27 16:16:04,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {243#true} [76] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-27 16:16:04,443 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {243#true} {243#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-27 16:16:04,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {243#true} [71] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {254#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:16:04,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {254#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [73] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {243#true} is VALID [2022-04-27 16:16:04,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {243#true} [76] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-27 16:16:04,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {243#true} {243#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-27 16:16:04,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {243#true} [72] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-27 16:16:04,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {243#true} [75] mainENTRY-->L27: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {243#true} is VALID [2022-04-27 16:16:04,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {243#true} [78] L27-->L30-2: Formula: (and (= v_main_~i~0_2 0) (<= v_main_~n~0_7 1000000) (= v_main_~k~0_5 v_main_~n~0_7)) InVars {main_~n~0=v_main_~n~0_7} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_7, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {248#(and (= main_~i~0 0) (<= main_~n~0 main_~k~0))} is VALID [2022-04-27 16:16:04,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {248#(and (= main_~i~0 0) (<= main_~n~0 main_~k~0))} [82] L30-2-->L30-2: Formula: (or (and (= v_main_~k~0_7 v_main_~k~0_6) (not (< v_main_~i~0_5 v_main_~n~0_9)) (= |v_main_#t~post2_3| |v_main_#t~post2_1|) (= v_main_~i~0_4 v_main_~i~0_5)) (and (< v_main_~k~0_6 v_main_~k~0_7) (< v_main_~k~0_7 (+ v_main_~k~0_6 2 (div (+ (- 1) v_main_~n~0_9 (* (- 1) v_main_~i~0_5)) 2))) (= (+ v_main_~i~0_5 (* v_main_~k~0_7 2)) (+ v_main_~i~0_4 (* v_main_~k~0_6 2))))) InVars {main_~i~0=v_main_~i~0_5, main_#t~post2=|v_main_#t~post2_3|, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_7} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2] {249#(or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 0))} is VALID [2022-04-27 16:16:04,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {249#(or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 0))} [81] L30-2-->L30-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {249#(or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 0))} is VALID [2022-04-27 16:16:04,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {249#(or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 0))} [83] L30-3-->L35-2: Formula: (= v_main_~j~0_1 0) InVars {} OutVars{main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {250#(and (= main_~j~0 0) (or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 0)))} is VALID [2022-04-27 16:16:04,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {250#(and (= main_~j~0 0) (or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 0)))} [86] L35-2-->L36: Formula: (< v_main_~j~0_3 (let ((.cse0 (div v_main_~n~0_2 2))) (ite (and (< v_main_~n~0_2 0) (not (= (mod v_main_~n~0_2 2) 0))) (+ .cse0 1) .cse0))) InVars {main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {251#(<= 1 main_~k~0)} is VALID [2022-04-27 16:16:04,449 INFO L272 TraceCheckUtils]: 11: Hoare triple {251#(<= 1 main_~k~0)} [88] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {252#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:16:04,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {252#(not (= |__VERIFIER_assert_#in~cond| 0))} [90] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {253#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:16:04,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {253#(not (= __VERIFIER_assert_~cond 0))} [91] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {244#false} is VALID [2022-04-27 16:16:04,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {244#false} [93] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {244#false} is VALID [2022-04-27 16:16:04,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:16:04,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:16:04,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776836776] [2022-04-27 16:16:04,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776836776] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:16:04,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306768833] [2022-04-27 16:16:04,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:16:04,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:16:04,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:16:04,472 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:16:04,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 16:16:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:04,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 16:16:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:04,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:16:05,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {243#true} [71] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-27 16:16:05,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {243#true} [73] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {243#true} is VALID [2022-04-27 16:16:05,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {243#true} [76] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-27 16:16:05,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {243#true} {243#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-27 16:16:05,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {243#true} [72] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-27 16:16:05,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {243#true} [75] mainENTRY-->L27: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {243#true} is VALID [2022-04-27 16:16:05,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {243#true} [78] L27-->L30-2: Formula: (and (= v_main_~i~0_2 0) (<= v_main_~n~0_7 1000000) (= v_main_~k~0_5 v_main_~n~0_7)) InVars {main_~n~0=v_main_~n~0_7} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_7, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {248#(and (= main_~i~0 0) (<= main_~n~0 main_~k~0))} is VALID [2022-04-27 16:16:05,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {248#(and (= main_~i~0 0) (<= main_~n~0 main_~k~0))} [82] L30-2-->L30-2: Formula: (or (and (= v_main_~k~0_7 v_main_~k~0_6) (not (< v_main_~i~0_5 v_main_~n~0_9)) (= |v_main_#t~post2_3| |v_main_#t~post2_1|) (= v_main_~i~0_4 v_main_~i~0_5)) (and (< v_main_~k~0_6 v_main_~k~0_7) (< v_main_~k~0_7 (+ v_main_~k~0_6 2 (div (+ (- 1) v_main_~n~0_9 (* (- 1) v_main_~i~0_5)) 2))) (= (+ v_main_~i~0_5 (* v_main_~k~0_7 2)) (+ v_main_~i~0_4 (* v_main_~k~0_6 2))))) InVars {main_~i~0=v_main_~i~0_5, main_#t~post2=|v_main_#t~post2_3|, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_7} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2] {279#(or (< main_~n~0 (+ (div (+ (- 1) main_~n~0) 2) main_~k~0 2)) (<= main_~n~0 main_~k~0))} is VALID [2022-04-27 16:16:05,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {279#(or (< main_~n~0 (+ (div (+ (- 1) main_~n~0) 2) main_~k~0 2)) (<= main_~n~0 main_~k~0))} [81] L30-2-->L30-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {279#(or (< main_~n~0 (+ (div (+ (- 1) main_~n~0) 2) main_~k~0 2)) (<= main_~n~0 main_~k~0))} is VALID [2022-04-27 16:16:05,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {279#(or (< main_~n~0 (+ (div (+ (- 1) main_~n~0) 2) main_~k~0 2)) (<= main_~n~0 main_~k~0))} [83] L30-3-->L35-2: Formula: (= v_main_~j~0_1 0) InVars {} OutVars{main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {286#(and (<= 0 main_~j~0) (or (< main_~n~0 (+ (div (+ (- 1) main_~n~0) 2) main_~k~0 2)) (<= main_~n~0 main_~k~0)))} is VALID [2022-04-27 16:16:05,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {286#(and (<= 0 main_~j~0) (or (< main_~n~0 (+ (div (+ (- 1) main_~n~0) 2) main_~k~0 2)) (<= main_~n~0 main_~k~0)))} [86] L35-2-->L36: Formula: (< v_main_~j~0_3 (let ((.cse0 (div v_main_~n~0_2 2))) (ite (and (< v_main_~n~0_2 0) (not (= (mod v_main_~n~0_2 2) 0))) (+ .cse0 1) .cse0))) InVars {main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {251#(<= 1 main_~k~0)} is VALID [2022-04-27 16:16:05,221 INFO L272 TraceCheckUtils]: 11: Hoare triple {251#(<= 1 main_~k~0)} [88] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {293#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:16:05,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {293#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {297#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:16:05,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {297#(<= 1 __VERIFIER_assert_~cond)} [91] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {244#false} is VALID [2022-04-27 16:16:05,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {244#false} [93] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {244#false} is VALID [2022-04-27 16:16:05,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:16:05,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:16:05,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {244#false} [93] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {244#false} is VALID [2022-04-27 16:16:05,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {297#(<= 1 __VERIFIER_assert_~cond)} [91] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {244#false} is VALID [2022-04-27 16:16:05,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {293#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {297#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:16:05,718 INFO L272 TraceCheckUtils]: 11: Hoare triple {251#(<= 1 main_~k~0)} [88] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {293#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:16:05,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {316#(or (<= 1 main_~k~0) (and (not (< main_~j~0 (div main_~n~0 2))) (or (not (< main_~j~0 (+ (div main_~n~0 2) 1))) (not (< main_~n~0 0)) (= (mod main_~n~0 2) 0))))} [86] L35-2-->L36: Formula: (< v_main_~j~0_3 (let ((.cse0 (div v_main_~n~0_2 2))) (ite (and (< v_main_~n~0_2 0) (not (= (mod v_main_~n~0_2 2) 0))) (+ .cse0 1) .cse0))) InVars {main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {251#(<= 1 main_~k~0)} is VALID [2022-04-27 16:16:05,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {320#(or (<= (div main_~n~0 2) 0) (<= 1 main_~k~0))} [83] L30-3-->L35-2: Formula: (= v_main_~j~0_1 0) InVars {} OutVars{main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {316#(or (<= 1 main_~k~0) (and (not (< main_~j~0 (div main_~n~0 2))) (or (not (< main_~j~0 (+ (div main_~n~0 2) 1))) (not (< main_~n~0 0)) (= (mod main_~n~0 2) 0))))} is VALID [2022-04-27 16:16:05,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {320#(or (<= (div main_~n~0 2) 0) (<= 1 main_~k~0))} [81] L30-2-->L30-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {320#(or (<= (div main_~n~0 2) 0) (<= 1 main_~k~0))} is VALID [2022-04-27 16:16:05,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {327#(or (<= (div main_~n~0 2) 0) (and (<= 1 main_~k~0) (<= (+ 2 (div (+ (- 1) (* (- 1) main_~i~0) main_~n~0) 2)) main_~k~0)))} [82] L30-2-->L30-2: Formula: (or (and (= v_main_~k~0_7 v_main_~k~0_6) (not (< v_main_~i~0_5 v_main_~n~0_9)) (= |v_main_#t~post2_3| |v_main_#t~post2_1|) (= v_main_~i~0_4 v_main_~i~0_5)) (and (< v_main_~k~0_6 v_main_~k~0_7) (< v_main_~k~0_7 (+ v_main_~k~0_6 2 (div (+ (- 1) v_main_~n~0_9 (* (- 1) v_main_~i~0_5)) 2))) (= (+ v_main_~i~0_5 (* v_main_~k~0_7 2)) (+ v_main_~i~0_4 (* v_main_~k~0_6 2))))) InVars {main_~i~0=v_main_~i~0_5, main_#t~post2=|v_main_#t~post2_3|, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_7} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2] {320#(or (<= (div main_~n~0 2) 0) (<= 1 main_~k~0))} is VALID [2022-04-27 16:16:05,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {243#true} [78] L27-->L30-2: Formula: (and (= v_main_~i~0_2 0) (<= v_main_~n~0_7 1000000) (= v_main_~k~0_5 v_main_~n~0_7)) InVars {main_~n~0=v_main_~n~0_7} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_7, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {327#(or (<= (div main_~n~0 2) 0) (and (<= 1 main_~k~0) (<= (+ 2 (div (+ (- 1) (* (- 1) main_~i~0) main_~n~0) 2)) main_~k~0)))} is VALID [2022-04-27 16:16:05,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {243#true} [75] mainENTRY-->L27: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {243#true} is VALID [2022-04-27 16:16:05,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {243#true} [72] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-27 16:16:05,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {243#true} {243#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-27 16:16:05,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {243#true} [76] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-27 16:16:05,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {243#true} [73] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {243#true} is VALID [2022-04-27 16:16:05,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {243#true} [71] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {243#true} is VALID [2022-04-27 16:16:05,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:16:05,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306768833] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:16:05,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:16:05,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-27 16:16:05,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855624217] [2022-04-27 16:16:05,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:16:05,727 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 16:16:05,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:16:05,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:16:05,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:16:05,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 16:16:05,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:16:05,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 16:16:05,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-04-27 16:16:05,748 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:16:06,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:06,472 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-27 16:16:06,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-27 16:16:06,472 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 16:16:06,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:16:06,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:16:06,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 49 transitions. [2022-04-27 16:16:06,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:16:06,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 49 transitions. [2022-04-27 16:16:06,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 49 transitions. [2022-04-27 16:16:06,529 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-27 16:16:06,530 INFO L225 Difference]: With dead ends: 45 [2022-04-27 16:16:06,530 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 16:16:06,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=217, Invalid=775, Unknown=0, NotChecked=0, Total=992 [2022-04-27 16:16:06,531 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 58 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 16:16:06,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 44 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 16:16:06,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 16:16:06,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2022-04-27 16:16:06,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:16:06,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 38 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 16:16:06,535 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 38 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 16:16:06,535 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 38 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 16:16:06,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:06,538 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-27 16:16:06,538 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-27 16:16:06,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:06,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:06,538 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-27 16:16:06,539 INFO L87 Difference]: Start difference. First operand has 38 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-27 16:16:06,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:06,540 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-27 16:16:06,541 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-27 16:16:06,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:06,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:06,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:16:06,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:16:06,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 16:16:06,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-04-27 16:16:06,542 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 15 [2022-04-27 16:16:06,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:16:06,543 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-04-27 16:16:06,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:16:06,543 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-27 16:16:06,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 16:16:06,543 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:16:06,543 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:16:06,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 16:16:06,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:16:06,760 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:16:06,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:16:06,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1254260258, now seen corresponding path program 1 times [2022-04-27 16:16:06,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:16:06,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335413470] [2022-04-27 16:16:06,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:16:06,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:16:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:06,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:16:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:06,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {574#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [73] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {556#true} is VALID [2022-04-27 16:16:06,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {556#true} [76] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-27 16:16:06,997 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {556#true} {556#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-27 16:16:06,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 16:16:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:07,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {556#true} [90] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {556#true} is VALID [2022-04-27 16:16:07,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {556#true} [92] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-27 16:16:07,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {556#true} [95] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-27 16:16:07,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {556#true} {565#(and (= main_~j~0 0) (or (<= (div main_~n~0 2) 1) (<= (div main_~n~0 2) main_~k~0)))} [98] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {565#(and (= main_~j~0 0) (or (<= (div main_~n~0 2) 1) (<= (div main_~n~0 2) main_~k~0)))} is VALID [2022-04-27 16:16:07,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {556#true} [71] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {574#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:16:07,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {574#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [73] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {556#true} is VALID [2022-04-27 16:16:07,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {556#true} [76] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-27 16:16:07,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {556#true} {556#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-27 16:16:07,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {556#true} [72] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-27 16:16:07,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {556#true} [75] mainENTRY-->L27: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {556#true} is VALID [2022-04-27 16:16:07,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {556#true} [78] L27-->L30-2: Formula: (and (= v_main_~i~0_2 0) (<= v_main_~n~0_7 1000000) (= v_main_~k~0_5 v_main_~n~0_7)) InVars {main_~n~0=v_main_~n~0_7} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_7, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {561#(and (= main_~i~0 0) (<= main_~n~0 main_~k~0))} is VALID [2022-04-27 16:16:07,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {561#(and (= main_~i~0 0) (<= main_~n~0 main_~k~0))} [82] L30-2-->L30-2: Formula: (or (and (= v_main_~k~0_7 v_main_~k~0_6) (not (< v_main_~i~0_5 v_main_~n~0_9)) (= |v_main_#t~post2_3| |v_main_#t~post2_1|) (= v_main_~i~0_4 v_main_~i~0_5)) (and (< v_main_~k~0_6 v_main_~k~0_7) (< v_main_~k~0_7 (+ v_main_~k~0_6 2 (div (+ (- 1) v_main_~n~0_9 (* (- 1) v_main_~i~0_5)) 2))) (= (+ v_main_~i~0_5 (* v_main_~k~0_7 2)) (+ v_main_~i~0_4 (* v_main_~k~0_6 2))))) InVars {main_~i~0=v_main_~i~0_5, main_#t~post2=|v_main_#t~post2_3|, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_7} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2] {562#(or (<= main_~n~0 0) (and (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= (* main_~n~0 2) (+ (* main_~k~0 2) main_~i~0))))} is VALID [2022-04-27 16:16:07,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {562#(or (<= main_~n~0 0) (and (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= (* main_~n~0 2) (+ (* main_~k~0 2) main_~i~0))))} [82] L30-2-->L30-2: Formula: (or (and (= v_main_~k~0_7 v_main_~k~0_6) (not (< v_main_~i~0_5 v_main_~n~0_9)) (= |v_main_#t~post2_3| |v_main_#t~post2_1|) (= v_main_~i~0_4 v_main_~i~0_5)) (and (< v_main_~k~0_6 v_main_~k~0_7) (< v_main_~k~0_7 (+ v_main_~k~0_6 2 (div (+ (- 1) v_main_~n~0_9 (* (- 1) v_main_~i~0_5)) 2))) (= (+ v_main_~i~0_5 (* v_main_~k~0_7 2)) (+ v_main_~i~0_4 (* v_main_~k~0_6 2))))) InVars {main_~i~0=v_main_~i~0_5, main_#t~post2=|v_main_#t~post2_3|, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_7} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2] {563#(or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 0))} is VALID [2022-04-27 16:16:07,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {563#(or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 0))} [81] L30-2-->L30-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {563#(or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 0))} is VALID [2022-04-27 16:16:07,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {563#(or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 0))} [83] L30-3-->L35-2: Formula: (= v_main_~j~0_1 0) InVars {} OutVars{main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {564#(and (= main_~j~0 0) (or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 0)))} is VALID [2022-04-27 16:16:07,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {564#(and (= main_~j~0 0) (or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 0)))} [86] L35-2-->L36: Formula: (< v_main_~j~0_3 (let ((.cse0 (div v_main_~n~0_2 2))) (ite (and (< v_main_~n~0_2 0) (not (= (mod v_main_~n~0_2 2) 0))) (+ .cse0 1) .cse0))) InVars {main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {565#(and (= main_~j~0 0) (or (<= (div main_~n~0 2) 1) (<= (div main_~n~0 2) main_~k~0)))} is VALID [2022-04-27 16:16:07,021 INFO L272 TraceCheckUtils]: 12: Hoare triple {565#(and (= main_~j~0 0) (or (<= (div main_~n~0 2) 1) (<= (div main_~n~0 2) main_~k~0)))} [88] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {556#true} is VALID [2022-04-27 16:16:07,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {556#true} [90] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {556#true} is VALID [2022-04-27 16:16:07,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {556#true} [92] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-27 16:16:07,023 INFO L290 TraceCheckUtils]: 15: Hoare triple {556#true} [95] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-27 16:16:07,024 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {556#true} {565#(and (= main_~j~0 0) (or (<= (div main_~n~0 2) 1) (<= (div main_~n~0 2) main_~k~0)))} [98] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {565#(and (= main_~j~0 0) (or (<= (div main_~n~0 2) 1) (<= (div main_~n~0 2) main_~k~0)))} is VALID [2022-04-27 16:16:07,025 INFO L290 TraceCheckUtils]: 17: Hoare triple {565#(and (= main_~j~0 0) (or (<= (div main_~n~0 2) 1) (<= (div main_~n~0 2) main_~k~0)))} [89] L36-1-->L35-2: Formula: (and (= v_main_~k~0_3 (+ v_main_~k~0_2 1)) (= v_main_~j~0_4 (+ v_main_~j~0_5 1))) InVars {main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post3=|v_main_#t~post3_1|, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post3] {570#(or (<= (+ (div main_~n~0 2) 1) main_~j~0) (and (<= (div main_~n~0 2) main_~j~0) (or (= (+ (* (- 2) (div main_~n~0 2)) main_~n~0) 0) (<= 0 main_~n~0))) (<= (+ (div main_~n~0 2) 1) (+ main_~k~0 main_~j~0)) (and (<= (div main_~n~0 2) (+ main_~k~0 main_~j~0)) (or (= (+ (* (- 2) (div main_~n~0 2)) main_~n~0) 0) (<= 0 main_~n~0))))} is VALID [2022-04-27 16:16:07,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {570#(or (<= (+ (div main_~n~0 2) 1) main_~j~0) (and (<= (div main_~n~0 2) main_~j~0) (or (= (+ (* (- 2) (div main_~n~0 2)) main_~n~0) 0) (<= 0 main_~n~0))) (<= (+ (div main_~n~0 2) 1) (+ main_~k~0 main_~j~0)) (and (<= (div main_~n~0 2) (+ main_~k~0 main_~j~0)) (or (= (+ (* (- 2) (div main_~n~0 2)) main_~n~0) 0) (<= 0 main_~n~0))))} [86] L35-2-->L36: Formula: (< v_main_~j~0_3 (let ((.cse0 (div v_main_~n~0_2 2))) (ite (and (< v_main_~n~0_2 0) (not (= (mod v_main_~n~0_2 2) 0))) (+ .cse0 1) .cse0))) InVars {main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {571#(<= 1 main_~k~0)} is VALID [2022-04-27 16:16:07,026 INFO L272 TraceCheckUtils]: 19: Hoare triple {571#(<= 1 main_~k~0)} [88] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {572#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:16:07,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {572#(not (= |__VERIFIER_assert_#in~cond| 0))} [90] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {573#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:16:07,027 INFO L290 TraceCheckUtils]: 21: Hoare triple {573#(not (= __VERIFIER_assert_~cond 0))} [91] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {557#false} is VALID [2022-04-27 16:16:07,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {557#false} [93] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#false} is VALID [2022-04-27 16:16:07,028 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:16:07,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:16:07,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335413470] [2022-04-27 16:16:07,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335413470] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:16:07,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903553382] [2022-04-27 16:16:07,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:16:07,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:16:07,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:16:07,031 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:16:07,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 16:16:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:07,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 16:16:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:16:07,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:16:08,331 INFO L272 TraceCheckUtils]: 0: Hoare triple {556#true} [71] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-27 16:16:08,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {556#true} [73] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {556#true} is VALID [2022-04-27 16:16:08,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {556#true} [76] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-27 16:16:08,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {556#true} {556#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-27 16:16:08,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {556#true} [72] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-27 16:16:08,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {556#true} [75] mainENTRY-->L27: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {556#true} is VALID [2022-04-27 16:16:08,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {556#true} [78] L27-->L30-2: Formula: (and (= v_main_~i~0_2 0) (<= v_main_~n~0_7 1000000) (= v_main_~k~0_5 v_main_~n~0_7)) InVars {main_~n~0=v_main_~n~0_7} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_7, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {561#(and (= main_~i~0 0) (<= main_~n~0 main_~k~0))} is VALID [2022-04-27 16:16:08,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {561#(and (= main_~i~0 0) (<= main_~n~0 main_~k~0))} [82] L30-2-->L30-2: Formula: (or (and (= v_main_~k~0_7 v_main_~k~0_6) (not (< v_main_~i~0_5 v_main_~n~0_9)) (= |v_main_#t~post2_3| |v_main_#t~post2_1|) (= v_main_~i~0_4 v_main_~i~0_5)) (and (< v_main_~k~0_6 v_main_~k~0_7) (< v_main_~k~0_7 (+ v_main_~k~0_6 2 (div (+ (- 1) v_main_~n~0_9 (* (- 1) v_main_~i~0_5)) 2))) (= (+ v_main_~i~0_5 (* v_main_~k~0_7 2)) (+ v_main_~i~0_4 (* v_main_~k~0_6 2))))) InVars {main_~i~0=v_main_~i~0_5, main_#t~post2=|v_main_#t~post2_3|, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_7} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2] {599#(or (and (not (< 0 main_~n~0)) (= main_~i~0 0) (<= main_~n~0 main_~k~0)) (and (< (div main_~i~0 2) (+ (div (+ (- 1) main_~n~0) 2) 2)) (= 0 (mod main_~i~0 2)) (< 0 (div main_~i~0 2)) (<= main_~n~0 (+ (div main_~i~0 2) main_~k~0))))} is VALID [2022-04-27 16:16:08,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {599#(or (and (not (< 0 main_~n~0)) (= main_~i~0 0) (<= main_~n~0 main_~k~0)) (and (< (div main_~i~0 2) (+ (div (+ (- 1) main_~n~0) 2) 2)) (= 0 (mod main_~i~0 2)) (< 0 (div main_~i~0 2)) (<= main_~n~0 (+ (div main_~i~0 2) main_~k~0))))} [82] L30-2-->L30-2: Formula: (or (and (= v_main_~k~0_7 v_main_~k~0_6) (not (< v_main_~i~0_5 v_main_~n~0_9)) (= |v_main_#t~post2_3| |v_main_#t~post2_1|) (= v_main_~i~0_4 v_main_~i~0_5)) (and (< v_main_~k~0_6 v_main_~k~0_7) (< v_main_~k~0_7 (+ v_main_~k~0_6 2 (div (+ (- 1) v_main_~n~0_9 (* (- 1) v_main_~i~0_5)) 2))) (= (+ v_main_~i~0_5 (* v_main_~k~0_7 2)) (+ v_main_~i~0_4 (* v_main_~k~0_6 2))))) InVars {main_~i~0=v_main_~i~0_5, main_#t~post2=|v_main_#t~post2_3|, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_7} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2] {603#(or (< main_~n~0 (+ (div (+ (- 1) main_~n~0) 2) main_~k~0 2)) (<= main_~n~0 main_~k~0))} is VALID [2022-04-27 16:16:08,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {603#(or (< main_~n~0 (+ (div (+ (- 1) main_~n~0) 2) main_~k~0 2)) (<= main_~n~0 main_~k~0))} [81] L30-2-->L30-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {603#(or (< main_~n~0 (+ (div (+ (- 1) main_~n~0) 2) main_~k~0 2)) (<= main_~n~0 main_~k~0))} is VALID [2022-04-27 16:16:08,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {603#(or (< main_~n~0 (+ (div (+ (- 1) main_~n~0) 2) main_~k~0 2)) (<= main_~n~0 main_~k~0))} [83] L30-3-->L35-2: Formula: (= v_main_~j~0_1 0) InVars {} OutVars{main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {610#(and (<= 0 main_~j~0) (or (< main_~n~0 (+ (div (+ (- 1) main_~n~0) 2) main_~k~0 2)) (<= main_~n~0 main_~k~0)))} is VALID [2022-04-27 16:16:08,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {610#(and (<= 0 main_~j~0) (or (< main_~n~0 (+ (div (+ (- 1) main_~n~0) 2) main_~k~0 2)) (<= main_~n~0 main_~k~0)))} [86] L35-2-->L36: Formula: (< v_main_~j~0_3 (let ((.cse0 (div v_main_~n~0_2 2))) (ite (and (< v_main_~n~0_2 0) (not (= (mod v_main_~n~0_2 2) 0))) (+ .cse0 1) .cse0))) InVars {main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {610#(and (<= 0 main_~j~0) (or (< main_~n~0 (+ (div (+ (- 1) main_~n~0) 2) main_~k~0 2)) (<= main_~n~0 main_~k~0)))} is VALID [2022-04-27 16:16:08,345 INFO L272 TraceCheckUtils]: 12: Hoare triple {610#(and (<= 0 main_~j~0) (or (< main_~n~0 (+ (div (+ (- 1) main_~n~0) 2) main_~k~0 2)) (<= main_~n~0 main_~k~0)))} [88] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {556#true} is VALID [2022-04-27 16:16:08,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {556#true} [90] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {556#true} is VALID [2022-04-27 16:16:08,345 INFO L290 TraceCheckUtils]: 14: Hoare triple {556#true} [92] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-27 16:16:08,345 INFO L290 TraceCheckUtils]: 15: Hoare triple {556#true} [95] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-27 16:16:08,346 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {556#true} {610#(and (<= 0 main_~j~0) (or (< main_~n~0 (+ (div (+ (- 1) main_~n~0) 2) main_~k~0 2)) (<= main_~n~0 main_~k~0)))} [98] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {610#(and (<= 0 main_~j~0) (or (< main_~n~0 (+ (div (+ (- 1) main_~n~0) 2) main_~k~0 2)) (<= main_~n~0 main_~k~0)))} is VALID [2022-04-27 16:16:08,346 INFO L290 TraceCheckUtils]: 17: Hoare triple {610#(and (<= 0 main_~j~0) (or (< main_~n~0 (+ (div (+ (- 1) main_~n~0) 2) main_~k~0 2)) (<= main_~n~0 main_~k~0)))} [89] L36-1-->L35-2: Formula: (and (= v_main_~k~0_3 (+ v_main_~k~0_2 1)) (= v_main_~j~0_4 (+ v_main_~j~0_5 1))) InVars {main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post3=|v_main_#t~post3_1|, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post3] {632#(and (<= 1 main_~j~0) (or (<= main_~n~0 (+ main_~k~0 1)) (< main_~n~0 (+ (div (+ (- 1) main_~n~0) 2) main_~k~0 3))))} is VALID [2022-04-27 16:16:08,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {632#(and (<= 1 main_~j~0) (or (<= main_~n~0 (+ main_~k~0 1)) (< main_~n~0 (+ (div (+ (- 1) main_~n~0) 2) main_~k~0 3))))} [86] L35-2-->L36: Formula: (< v_main_~j~0_3 (let ((.cse0 (div v_main_~n~0_2 2))) (ite (and (< v_main_~n~0_2 0) (not (= (mod v_main_~n~0_2 2) 0))) (+ .cse0 1) .cse0))) InVars {main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {571#(<= 1 main_~k~0)} is VALID [2022-04-27 16:16:08,348 INFO L272 TraceCheckUtils]: 19: Hoare triple {571#(<= 1 main_~k~0)} [88] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {639#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:16:08,348 INFO L290 TraceCheckUtils]: 20: Hoare triple {639#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {643#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:16:08,349 INFO L290 TraceCheckUtils]: 21: Hoare triple {643#(<= 1 __VERIFIER_assert_~cond)} [91] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {557#false} is VALID [2022-04-27 16:16:08,349 INFO L290 TraceCheckUtils]: 22: Hoare triple {557#false} [93] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#false} is VALID [2022-04-27 16:16:08,349 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:16:08,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:16:09,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {557#false} [93] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#false} is VALID [2022-04-27 16:16:09,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {643#(<= 1 __VERIFIER_assert_~cond)} [91] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {557#false} is VALID [2022-04-27 16:16:09,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {639#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {643#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:16:09,179 INFO L272 TraceCheckUtils]: 19: Hoare triple {571#(<= 1 main_~k~0)} [88] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {639#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:16:09,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {662#(or (<= 1 main_~k~0) (and (not (< main_~j~0 (div main_~n~0 2))) (or (not (< main_~j~0 (+ (div main_~n~0 2) 1))) (not (< main_~n~0 0)) (= (mod main_~n~0 2) 0))))} [86] L35-2-->L36: Formula: (< v_main_~j~0_3 (let ((.cse0 (div v_main_~n~0_2 2))) (ite (and (< v_main_~n~0_2 0) (not (= (mod v_main_~n~0_2 2) 0))) (+ .cse0 1) .cse0))) InVars {main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {571#(<= 1 main_~k~0)} is VALID [2022-04-27 16:16:09,180 INFO L290 TraceCheckUtils]: 17: Hoare triple {666#(or (and (<= (div main_~n~0 2) (+ main_~j~0 1)) (or (<= (div main_~n~0 2) main_~j~0) (not (< main_~n~0 0)) (= (mod main_~n~0 2) 0))) (<= 2 main_~k~0))} [89] L36-1-->L35-2: Formula: (and (= v_main_~k~0_3 (+ v_main_~k~0_2 1)) (= v_main_~j~0_4 (+ v_main_~j~0_5 1))) InVars {main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_5} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post3=|v_main_#t~post3_1|, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post3] {662#(or (<= 1 main_~k~0) (and (not (< main_~j~0 (div main_~n~0 2))) (or (not (< main_~j~0 (+ (div main_~n~0 2) 1))) (not (< main_~n~0 0)) (= (mod main_~n~0 2) 0))))} is VALID [2022-04-27 16:16:09,181 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {556#true} {666#(or (and (<= (div main_~n~0 2) (+ main_~j~0 1)) (or (<= (div main_~n~0 2) main_~j~0) (not (< main_~n~0 0)) (= (mod main_~n~0 2) 0))) (<= 2 main_~k~0))} [98] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {666#(or (and (<= (div main_~n~0 2) (+ main_~j~0 1)) (or (<= (div main_~n~0 2) main_~j~0) (not (< main_~n~0 0)) (= (mod main_~n~0 2) 0))) (<= 2 main_~k~0))} is VALID [2022-04-27 16:16:09,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {556#true} [95] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-27 16:16:09,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {556#true} [92] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-27 16:16:09,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {556#true} [90] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {556#true} is VALID [2022-04-27 16:16:09,181 INFO L272 TraceCheckUtils]: 12: Hoare triple {666#(or (and (<= (div main_~n~0 2) (+ main_~j~0 1)) (or (<= (div main_~n~0 2) main_~j~0) (not (< main_~n~0 0)) (= (mod main_~n~0 2) 0))) (<= 2 main_~k~0))} [88] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_8) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {556#true} is VALID [2022-04-27 16:16:09,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {666#(or (and (<= (div main_~n~0 2) (+ main_~j~0 1)) (or (<= (div main_~n~0 2) main_~j~0) (not (< main_~n~0 0)) (= (mod main_~n~0 2) 0))) (<= 2 main_~k~0))} [86] L35-2-->L36: Formula: (< v_main_~j~0_3 (let ((.cse0 (div v_main_~n~0_2 2))) (ite (and (< v_main_~n~0_2 0) (not (= (mod v_main_~n~0_2 2) 0))) (+ .cse0 1) .cse0))) InVars {main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {666#(or (and (<= (div main_~n~0 2) (+ main_~j~0 1)) (or (<= (div main_~n~0 2) main_~j~0) (not (< main_~n~0 0)) (= (mod main_~n~0 2) 0))) (<= 2 main_~k~0))} is VALID [2022-04-27 16:16:09,182 INFO L290 TraceCheckUtils]: 10: Hoare triple {688#(or (<= 2 main_~k~0) (<= (div main_~n~0 2) 1))} [83] L30-3-->L35-2: Formula: (= v_main_~j~0_1 0) InVars {} OutVars{main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {666#(or (and (<= (div main_~n~0 2) (+ main_~j~0 1)) (or (<= (div main_~n~0 2) main_~j~0) (not (< main_~n~0 0)) (= (mod main_~n~0 2) 0))) (<= 2 main_~k~0))} is VALID [2022-04-27 16:16:09,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {688#(or (<= 2 main_~k~0) (<= (div main_~n~0 2) 1))} [81] L30-2-->L30-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {688#(or (<= 2 main_~k~0) (<= (div main_~n~0 2) 1))} is VALID [2022-04-27 16:16:09,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {695#(or (and (<= 2 main_~k~0) (<= (+ 3 (div (+ (- 1) (* (- 1) main_~i~0) main_~n~0) 2)) main_~k~0)) (<= (div main_~n~0 2) 1))} [82] L30-2-->L30-2: Formula: (or (and (= v_main_~k~0_7 v_main_~k~0_6) (not (< v_main_~i~0_5 v_main_~n~0_9)) (= |v_main_#t~post2_3| |v_main_#t~post2_1|) (= v_main_~i~0_4 v_main_~i~0_5)) (and (< v_main_~k~0_6 v_main_~k~0_7) (< v_main_~k~0_7 (+ v_main_~k~0_6 2 (div (+ (- 1) v_main_~n~0_9 (* (- 1) v_main_~i~0_5)) 2))) (= (+ v_main_~i~0_5 (* v_main_~k~0_7 2)) (+ v_main_~i~0_4 (* v_main_~k~0_6 2))))) InVars {main_~i~0=v_main_~i~0_5, main_#t~post2=|v_main_#t~post2_3|, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_7} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2] {688#(or (<= 2 main_~k~0) (<= (div main_~n~0 2) 1))} is VALID [2022-04-27 16:16:09,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {695#(or (and (<= 2 main_~k~0) (<= (+ 3 (div (+ (- 1) (* (- 1) main_~i~0) main_~n~0) 2)) main_~k~0)) (<= (div main_~n~0 2) 1))} [82] L30-2-->L30-2: Formula: (or (and (= v_main_~k~0_7 v_main_~k~0_6) (not (< v_main_~i~0_5 v_main_~n~0_9)) (= |v_main_#t~post2_3| |v_main_#t~post2_1|) (= v_main_~i~0_4 v_main_~i~0_5)) (and (< v_main_~k~0_6 v_main_~k~0_7) (< v_main_~k~0_7 (+ v_main_~k~0_6 2 (div (+ (- 1) v_main_~n~0_9 (* (- 1) v_main_~i~0_5)) 2))) (= (+ v_main_~i~0_5 (* v_main_~k~0_7 2)) (+ v_main_~i~0_4 (* v_main_~k~0_6 2))))) InVars {main_~i~0=v_main_~i~0_5, main_#t~post2=|v_main_#t~post2_3|, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_7} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2] {695#(or (and (<= 2 main_~k~0) (<= (+ 3 (div (+ (- 1) (* (- 1) main_~i~0) main_~n~0) 2)) main_~k~0)) (<= (div main_~n~0 2) 1))} is VALID [2022-04-27 16:16:09,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {556#true} [78] L27-->L30-2: Formula: (and (= v_main_~i~0_2 0) (<= v_main_~n~0_7 1000000) (= v_main_~k~0_5 v_main_~n~0_7)) InVars {main_~n~0=v_main_~n~0_7} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_7, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {695#(or (and (<= 2 main_~k~0) (<= (+ 3 (div (+ (- 1) (* (- 1) main_~i~0) main_~n~0) 2)) main_~k~0)) (<= (div main_~n~0 2) 1))} is VALID [2022-04-27 16:16:09,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {556#true} [75] mainENTRY-->L27: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {556#true} is VALID [2022-04-27 16:16:09,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {556#true} [72] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-27 16:16:09,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {556#true} {556#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-27 16:16:09,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {556#true} [76] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-27 16:16:09,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {556#true} [73] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {556#true} is VALID [2022-04-27 16:16:09,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {556#true} [71] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {556#true} is VALID [2022-04-27 16:16:09,186 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 16:16:09,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903553382] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:16:09,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:16:09,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 22 [2022-04-27 16:16:09,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315777452] [2022-04-27 16:16:09,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:16:09,187 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 19 states have internal predecessors, (35), 5 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 23 [2022-04-27 16:16:09,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:16:09,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 19 states have internal predecessors, (35), 5 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 16:16:09,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:16:09,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-27 16:16:09,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:16:09,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-27 16:16:09,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2022-04-27 16:16:09,232 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 22 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 19 states have internal predecessors, (35), 5 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 16:16:10,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:10,010 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-27 16:16:10,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 16:16:10,010 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 19 states have internal predecessors, (35), 5 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 23 [2022-04-27 16:16:10,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:16:10,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 19 states have internal predecessors, (35), 5 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 16:16:10,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 30 transitions. [2022-04-27 16:16:10,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 19 states have internal predecessors, (35), 5 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 16:16:10,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 30 transitions. [2022-04-27 16:16:10,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 30 transitions. [2022-04-27 16:16:10,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:16:10,054 INFO L225 Difference]: With dead ends: 36 [2022-04-27 16:16:10,054 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 16:16:10,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=214, Invalid=908, Unknown=0, NotChecked=0, Total=1122 [2022-04-27 16:16:10,056 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 16:16:10,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 53 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 16:16:10,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 16:16:10,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 16:16:10,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:16:10,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:16:10,058 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:16:10,058 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:16:10,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:10,058 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:16:10,058 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:16:10,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:10,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:10,058 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 16:16:10,059 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 16:16:10,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:16:10,059 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:16:10,059 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:16:10,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:10,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:16:10,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:16:10,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:16:10,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:16:10,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 16:16:10,059 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2022-04-27 16:16:10,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:16:10,059 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 16:16:10,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 19 states have internal predecessors, (35), 5 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 16:16:10,060 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:16:10,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:16:10,061 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 16:16:10,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 16:16:10,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 16:16:10,264 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-04-27 16:16:10,265 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 16:16:10,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:16:10 BasicIcfg [2022-04-27 16:16:10,267 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 16:16:10,268 INFO L158 Benchmark]: Toolchain (without parser) took 11655.89ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 144.8MB in the beginning and 91.3MB in the end (delta: 53.5MB). Peak memory consumption was 93.3MB. Max. memory is 8.0GB. [2022-04-27 16:16:10,268 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 194.0MB. Free memory was 160.9MB in the beginning and 160.7MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:16:10,268 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.89ms. Allocated memory is still 194.0MB. Free memory was 144.5MB in the beginning and 170.5MB in the end (delta: -26.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 16:16:10,268 INFO L158 Benchmark]: Boogie Preprocessor took 38.67ms. Allocated memory is still 194.0MB. Free memory was 170.5MB in the beginning and 168.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 16:16:10,268 INFO L158 Benchmark]: RCFGBuilder took 244.92ms. Allocated memory is still 194.0MB. Free memory was 168.9MB in the beginning and 156.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 16:16:10,269 INFO L158 Benchmark]: IcfgTransformer took 4364.24ms. Allocated memory is still 194.0MB. Free memory was 156.3MB in the beginning and 136.4MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-04-27 16:16:10,269 INFO L158 Benchmark]: TraceAbstraction took 6825.64ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 135.4MB in the beginning and 91.3MB in the end (delta: 44.1MB). Peak memory consumption was 83.6MB. Max. memory is 8.0GB. [2022-04-27 16:16:10,270 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from IcfgTransformer: - StatisticsResult: Jordan loop acceleration statistics 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 194.0MB. Free memory was 160.9MB in the beginning and 160.7MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 175.89ms. Allocated memory is still 194.0MB. Free memory was 144.5MB in the beginning and 170.5MB in the end (delta: -26.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.67ms. Allocated memory is still 194.0MB. Free memory was 170.5MB in the beginning and 168.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 244.92ms. Allocated memory is still 194.0MB. Free memory was 168.9MB in the beginning and 156.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 4364.24ms. Allocated memory is still 194.0MB. Free memory was 156.3MB in the beginning and 136.4MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 6825.64ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 135.4MB in the beginning and 91.3MB in the end (delta: 44.1MB). Peak memory consumption was 83.6MB. 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: 19]: 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 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 142 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 139 mSDsluCounter, 158 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 99 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 326 IncrementalHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 59 mSDtfsCounter, 326 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 64 SyntacticMatches, 7 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=3, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 820 SizeOfPredicates, 13 NumberOfNonLiveVariables, 131 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 7/24 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 RESULT: Ultimate proved your program to be correct! [2022-04-27 16:16:10,285 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...