/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/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loop-zilu/benchmark09_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 23:30:57,691 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 23:30:57,693 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 23:30:57,720 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 23:30:57,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 23:30:57,721 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 23:30:57,722 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 23:30:57,723 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 23:30:57,724 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 23:30:57,724 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 23:30:57,725 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 23:30:57,725 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 23:30:57,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 23:30:57,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 23:30:57,727 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 23:30:57,728 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 23:30:57,728 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 23:30:57,729 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 23:30:57,730 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 23:30:57,731 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 23:30:57,731 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 23:30:57,740 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 23:30:57,741 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 23:30:57,741 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 23:30:57,742 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 23:30:57,744 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 23:30:57,744 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 23:30:57,744 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 23:30:57,744 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 23:30:57,745 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 23:30:57,745 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 23:30:57,745 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 23:30:57,746 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 23:30:57,746 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 23:30:57,747 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 23:30:57,747 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 23:30:57,747 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 23:30:57,748 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 23:30:57,748 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 23:30:57,748 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 23:30:57,749 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 23:30:57,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 23:30:57,751 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-07 23:30:57,764 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 23:30:57,765 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 23:30:57,765 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 23:30:57,765 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 23:30:57,766 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 23:30:57,766 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 23:30:57,766 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 23:30:57,766 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 23:30:57,766 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 23:30:57,766 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 23:30:57,766 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 23:30:57,766 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 23:30:57,766 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 23:30:57,766 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 23:30:57,766 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 23:30:57,767 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 23:30:57,767 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 23:30:57,767 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 23:30:57,767 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 23:30:57,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 23:30:57,767 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 23:30:57,767 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 23:30:57,767 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 23:30:57,767 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 23:30:57,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 23:30:57,767 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 23:30:57,768 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-07 23:30:57,768 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-07 23:30:57,768 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 23:30:57,768 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 23:30:57,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 23:30:57,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 23:30:57,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 23:30:57,963 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 23:30:57,964 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 23:30:57,965 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark09_conjunctive.i [2022-04-07 23:30:58,021 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70af13a83/d435bb550d2948a49ba12cb65d31ada1/FLAGb4d8c8f35 [2022-04-07 23:30:58,360 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 23:30:58,360 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark09_conjunctive.i [2022-04-07 23:30:58,366 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70af13a83/d435bb550d2948a49ba12cb65d31ada1/FLAGb4d8c8f35 [2022-04-07 23:30:58,374 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70af13a83/d435bb550d2948a49ba12cb65d31ada1 [2022-04-07 23:30:58,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 23:30:58,377 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 23:30:58,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 23:30:58,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 23:30:58,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 23:30:58,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:30:58" (1/1) ... [2022-04-07 23:30:58,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5356bd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:30:58, skipping insertion in model container [2022-04-07 23:30:58,382 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:30:58" (1/1) ... [2022-04-07 23:30:58,386 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 23:30:58,394 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 23:30:58,518 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-zilu/benchmark09_conjunctive.i[873,886] [2022-04-07 23:30:58,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 23:30:58,544 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 23:30:58,556 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-zilu/benchmark09_conjunctive.i[873,886] [2022-04-07 23:30:58,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 23:30:58,571 INFO L208 MainTranslator]: Completed translation [2022-04-07 23:30:58,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:30:58 WrapperNode [2022-04-07 23:30:58,571 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 23:30:58,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 23:30:58,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 23:30:58,572 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 23:30:58,579 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:30:58" (1/1) ... [2022-04-07 23:30:58,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:30:58" (1/1) ... [2022-04-07 23:30:58,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:30:58" (1/1) ... [2022-04-07 23:30:58,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:30:58" (1/1) ... [2022-04-07 23:30:58,586 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:30:58" (1/1) ... [2022-04-07 23:30:58,589 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:30:58" (1/1) ... [2022-04-07 23:30:58,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:30:58" (1/1) ... [2022-04-07 23:30:58,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 23:30:58,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 23:30:58,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 23:30:58,593 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 23:30:58,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:30:58" (1/1) ... [2022-04-07 23:30:58,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 23:30:58,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:30:58,616 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 23:30:58,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 23:30:58,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 23:30:58,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 23:30:58,640 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 23:30:58,640 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 23:30:58,640 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 23:30:58,640 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 23:30:58,640 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-07 23:30:58,640 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-07 23:30:58,640 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 23:30:58,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 23:30:58,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 23:30:58,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-07 23:30:58,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 23:30:58,641 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 23:30:58,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 23:30:58,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 23:30:58,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 23:30:58,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 23:30:58,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 23:30:58,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 23:30:58,696 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 23:30:58,698 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 23:30:58,791 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 23:30:58,796 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 23:30:58,796 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 23:30:58,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:30:58 BoogieIcfgContainer [2022-04-07 23:30:58,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 23:30:58,798 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 23:30:58,798 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 23:30:58,798 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 23:30:58,800 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:30:58" (1/1) ... [2022-04-07 23:30:58,802 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-07 23:30:58,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 11:30:58 BasicIcfg [2022-04-07 23:30:58,826 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 23:30:58,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 23:30:58,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 23:30:58,829 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 23:30:58,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 11:30:58" (1/4) ... [2022-04-07 23:30:58,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ea61756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:30:58, skipping insertion in model container [2022-04-07 23:30:58,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:30:58" (2/4) ... [2022-04-07 23:30:58,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ea61756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:30:58, skipping insertion in model container [2022-04-07 23:30:58,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:30:58" (3/4) ... [2022-04-07 23:30:58,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ea61756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 11:30:58, skipping insertion in model container [2022-04-07 23:30:58,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 11:30:58" (4/4) ... [2022-04-07 23:30:58,831 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark09_conjunctive.iqvasr [2022-04-07 23:30:58,847 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 23:30:58,847 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 23:30:58,896 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 23:30:58,900 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 23:30:58,900 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 23:30:58,915 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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-07 23:30:58,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 23:30:58,919 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:30:58,919 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:30:58,920 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:30:58,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:30:58,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1724549087, now seen corresponding path program 1 times [2022-04-07 23:30:58,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:30:58,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525962754] [2022-04-07 23:30:58,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:30:58,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:30:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:30:59,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:30:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:30:59,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {24#true} is VALID [2022-04-07 23:30:59,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-07 23:30:59,116 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-07 23:30:59,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:30:59,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {24#true} is VALID [2022-04-07 23:30:59,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-07 23:30:59,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-07 23:30:59,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-07 23:30:59,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} [57] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~y~0_3 |v_main_#t~nondet2_2|) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet2, main_~y~0] {24#true} is VALID [2022-04-07 23:30:59,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} [60] L22-->L23-2: Formula: (and (= v_main_~x~0_8 v_main_~y~0_7) (<= 0 v_main_~y~0_7)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-07 23:30:59,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#true} [62] L23-2-->L23-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-07 23:30:59,121 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} [65] L23-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~y~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {25#false} is VALID [2022-04-07 23:30:59,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} [69] __VERIFIER_assertENTRY-->L15: 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] {25#false} is VALID [2022-04-07 23:30:59,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} [70] L15-->L16: 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[] {25#false} is VALID [2022-04-07 23:30:59,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} [72] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-07 23:30:59,122 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-07 23:30:59,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:30:59,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525962754] [2022-04-07 23:30:59,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525962754] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:30:59,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:30:59,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 23:30:59,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009491123] [2022-04-07 23:30:59,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:30:59,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-07 23:30:59,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:30:59,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-07 23:30:59,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:30:59,158 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 23:30:59,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:30:59,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 23:30:59,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 23:30:59,185 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-07 23:30:59,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:30:59,256 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-07 23:30:59,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 23:30:59,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-07 23:30:59,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:30:59,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-07 23:30:59,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-04-07 23:30:59,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-07 23:30:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-04-07 23:30:59,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2022-04-07 23:30:59,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:30:59,323 INFO L225 Difference]: With dead ends: 33 [2022-04-07 23:30:59,323 INFO L226 Difference]: Without dead ends: 14 [2022-04-07 23:30:59,326 INFO L912 BasicCegarLoop]: 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-07 23:30:59,329 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 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-07 23:30:59,331 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 23:30:59,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-07 23:30:59,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-07 23:30:59,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:30:59,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 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-07 23:30:59,362 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 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-07 23:30:59,363 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 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-07 23:30:59,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:30:59,368 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-07 23:30:59,368 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-07 23:30:59,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:30:59,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:30:59,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 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) Second operand 14 states. [2022-04-07 23:30:59,369 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 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) Second operand 14 states. [2022-04-07 23:30:59,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:30:59,370 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-07 23:30:59,370 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-07 23:30:59,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:30:59,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:30:59,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:30:59,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:30:59,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 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-07 23:30:59,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-07 23:30:59,373 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2022-04-07 23:30:59,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:30:59,373 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-07 23:30:59,373 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-07 23:30:59,373 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-07 23:30:59,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 23:30:59,374 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:30:59,374 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:30:59,374 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 23:30:59,374 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:30:59,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:30:59,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1725472608, now seen corresponding path program 1 times [2022-04-07 23:30:59,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:30:59,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010313333] [2022-04-07 23:30:59,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:30:59,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:30:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:30:59,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:30:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:30:59,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {132#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {123#true} is VALID [2022-04-07 23:30:59,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {123#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-07 23:30:59,525 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {123#true} {123#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-07 23:30:59,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {123#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {132#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:30:59,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {132#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {123#true} is VALID [2022-04-07 23:30:59,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {123#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-07 23:30:59,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123#true} {123#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-07 23:30:59,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {123#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-07 23:30:59,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {123#true} [57] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~y~0_3 |v_main_#t~nondet2_2|) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet2, main_~y~0] {123#true} is VALID [2022-04-07 23:30:59,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {123#true} [60] L22-->L23-2: Formula: (and (= v_main_~x~0_8 v_main_~y~0_7) (<= 0 v_main_~y~0_7)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} AuxVars[] AssignedVars[] {128#(and (or (<= main_~y~0 0) (<= main_~y~0 main_~x~0)) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-07 23:30:59,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {128#(and (or (<= main_~y~0 0) (<= main_~y~0 main_~x~0)) (< 0 (+ main_~y~0 1)))} [63] L23-2-->L23-3: Formula: (= v_main_~x~0_1 0) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {129#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-07 23:30:59,529 INFO L272 TraceCheckUtils]: 8: Hoare triple {129#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} [65] L23-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~y~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {130#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 23:30:59,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {130#(not (= |__VERIFIER_assert_#in~cond| 0))} [69] __VERIFIER_assertENTRY-->L15: 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] {131#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 23:30:59,529 INFO L290 TraceCheckUtils]: 10: Hoare triple {131#(not (= __VERIFIER_assert_~cond 0))} [70] L15-->L16: 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[] {124#false} is VALID [2022-04-07 23:30:59,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {124#false} [72] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#false} is VALID [2022-04-07 23:30:59,530 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-07 23:30:59,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:30:59,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010313333] [2022-04-07 23:30:59,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010313333] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:30:59,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:30:59,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-07 23:30:59,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383279011] [2022-04-07 23:30:59,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:30:59,532 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 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 12 [2022-04-07 23:30:59,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:30:59,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 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-07 23:30:59,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:30:59,541 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 23:30:59,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:30:59,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 23:30:59,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-07 23:30:59,542 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 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-07 23:30:59,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:30:59,680 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-07 23:30:59,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 23:30:59,680 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 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 12 [2022-04-07 23:30:59,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:30:59,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 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-07 23:30:59,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-07 23:30:59,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 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-07 23:30:59,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-07 23:30:59,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2022-04-07 23:30:59,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:30:59,702 INFO L225 Difference]: With dead ends: 20 [2022-04-07 23:30:59,702 INFO L226 Difference]: Without dead ends: 15 [2022-04-07 23:30:59,702 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-04-07 23:30:59,703 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 23:30:59,704 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 29 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 23:30:59,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-07 23:30:59,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-07 23:30:59,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:30:59,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 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-07 23:30:59,709 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 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-07 23:30:59,709 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 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-07 23:30:59,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:30:59,711 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-07 23:30:59,711 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-07 23:30:59,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:30:59,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:30:59,712 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 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) Second operand 15 states. [2022-04-07 23:30:59,713 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 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) Second operand 15 states. [2022-04-07 23:30:59,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:30:59,715 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-07 23:30:59,715 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-07 23:30:59,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:30:59,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:30:59,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:30:59,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:30:59,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 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-07 23:30:59,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-07 23:30:59,717 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-07 23:30:59,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:30:59,717 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-07 23:30:59,717 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 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-07 23:30:59,718 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-07 23:30:59,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-07 23:30:59,718 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:30:59,718 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:30:59,718 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 23:30:59,718 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:30:59,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:30:59,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1979475853, now seen corresponding path program 1 times [2022-04-07 23:30:59,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:30:59,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162924943] [2022-04-07 23:30:59,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:30:59,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:30:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:30:59,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:30:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:30:59,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {233#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {226#true} is VALID [2022-04-07 23:30:59,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {226#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-07 23:30:59,823 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {226#true} {226#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-07 23:30:59,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {226#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {233#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:30:59,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {233#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {226#true} is VALID [2022-04-07 23:30:59,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {226#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-07 23:30:59,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {226#true} {226#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-07 23:30:59,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {226#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-07 23:30:59,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {226#true} [57] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~y~0_3 |v_main_#t~nondet2_2|) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet2, main_~y~0] {226#true} is VALID [2022-04-07 23:30:59,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {226#true} [60] L22-->L23-2: Formula: (and (= v_main_~x~0_8 v_main_~y~0_7) (<= 0 v_main_~y~0_7)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} AuxVars[] AssignedVars[] {231#(and (or (<= main_~x~0 main_~y~0) (<= main_~x~0 0)) (< 0 (+ main_~x~0 1)))} is VALID [2022-04-07 23:30:59,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {231#(and (or (<= main_~x~0 main_~y~0) (<= main_~x~0 0)) (< 0 (+ main_~x~0 1)))} [64] L23-2-->L26: Formula: (and (= v_main_~x~0_3 (+ v_main_~x~0_2 1)) (= (+ v_main_~y~0_1 1) v_main_~y~0_2) (not (= v_main_~x~0_3 0))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post3] {232#(and (<= 0 main_~y~0) (<= 0 main_~x~0))} is VALID [2022-04-07 23:30:59,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {232#(and (<= 0 main_~y~0) (<= 0 main_~x~0))} [66] L26-->L23-3: Formula: (or (< v_main_~x~0_5 0) (< v_main_~y~0_4 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_4} OutVars{main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {227#false} is VALID [2022-04-07 23:30:59,827 INFO L272 TraceCheckUtils]: 9: Hoare triple {227#false} [65] L23-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~y~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {227#false} is VALID [2022-04-07 23:30:59,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {227#false} [69] __VERIFIER_assertENTRY-->L15: 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] {227#false} is VALID [2022-04-07 23:30:59,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {227#false} [70] L15-->L16: 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[] {227#false} is VALID [2022-04-07 23:30:59,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {227#false} [72] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {227#false} is VALID [2022-04-07 23:30:59,828 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-07 23:30:59,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:30:59,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162924943] [2022-04-07 23:30:59,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162924943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:30:59,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:30:59,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 23:30:59,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947849700] [2022-04-07 23:30:59,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:30:59,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 13 [2022-04-07 23:30:59,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:30:59,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-07 23:30:59,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:30:59,864 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 23:30:59,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:30:59,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 23:30:59,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 23:30:59,865 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-07 23:30:59,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:30:59,958 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-07 23:30:59,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 23:30:59,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 13 [2022-04-07 23:30:59,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:30:59,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-07 23:30:59,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-07 23:30:59,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-07 23:30:59,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-07 23:30:59,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 19 transitions. [2022-04-07 23:30:59,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:30:59,975 INFO L225 Difference]: With dead ends: 20 [2022-04-07 23:30:59,975 INFO L226 Difference]: Without dead ends: 15 [2022-04-07 23:30:59,975 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-07 23:30:59,976 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 23:30:59,976 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 23 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 23:30:59,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-07 23:30:59,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-07 23:30:59,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:30:59,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 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-07 23:30:59,986 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 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-07 23:30:59,986 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 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-07 23:30:59,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:30:59,987 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-07 23:30:59,987 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-07 23:30:59,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:30:59,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:30:59,987 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 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) Second operand 15 states. [2022-04-07 23:30:59,987 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 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) Second operand 15 states. [2022-04-07 23:30:59,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:30:59,988 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-07 23:30:59,988 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-07 23:30:59,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:30:59,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:30:59,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:30:59,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:30:59,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 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-07 23:30:59,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-07 23:30:59,989 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-07 23:30:59,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:30:59,990 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-07 23:30:59,990 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-07 23:30:59,990 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-07 23:30:59,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 23:30:59,990 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:30:59,990 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:30:59,990 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 23:30:59,990 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:30:59,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:30:59,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1260871293, now seen corresponding path program 1 times [2022-04-07 23:30:59,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:30:59,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626728955] [2022-04-07 23:30:59,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:30:59,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:31:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:31:00,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:31:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:31:00,104 INFO L290 TraceCheckUtils]: 0: Hoare triple {332#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {321#true} is VALID [2022-04-07 23:31:00,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {321#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {321#true} is VALID [2022-04-07 23:31:00,104 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {321#true} {321#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {321#true} is VALID [2022-04-07 23:31:00,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {321#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {332#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:31:00,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {332#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {321#true} is VALID [2022-04-07 23:31:00,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {321#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {321#true} is VALID [2022-04-07 23:31:00,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {321#true} {321#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {321#true} is VALID [2022-04-07 23:31:00,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {321#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {321#true} is VALID [2022-04-07 23:31:00,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {321#true} [57] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~y~0_3 |v_main_#t~nondet2_2|) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet2, main_~y~0] {321#true} is VALID [2022-04-07 23:31:00,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {321#true} [60] L22-->L23-2: Formula: (and (= v_main_~x~0_8 v_main_~y~0_7) (<= 0 v_main_~y~0_7)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} AuxVars[] AssignedVars[] {326#(<= main_~y~0 main_~x~0)} is VALID [2022-04-07 23:31:00,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {326#(<= main_~y~0 main_~x~0)} [64] L23-2-->L26: Formula: (and (= v_main_~x~0_3 (+ v_main_~x~0_2 1)) (= (+ v_main_~y~0_1 1) v_main_~y~0_2) (not (= v_main_~x~0_3 0))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post3] {327#(or (<= main_~y~0 0) (<= main_~y~0 main_~x~0))} is VALID [2022-04-07 23:31:00,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {327#(or (<= main_~y~0 0) (<= main_~y~0 main_~x~0))} [67] L26-->L23-2: Formula: (and (not (< v_main_~y~0_5 0)) (not (< v_main_~x~0_6 0))) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_5} OutVars{main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[] {328#(and (or (<= main_~y~0 0) (<= main_~y~0 main_~x~0)) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-07 23:31:00,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {328#(and (or (<= main_~y~0 0) (<= main_~y~0 main_~x~0)) (< 0 (+ main_~y~0 1)))} [63] L23-2-->L23-3: Formula: (= v_main_~x~0_1 0) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {329#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-07 23:31:00,108 INFO L272 TraceCheckUtils]: 10: Hoare triple {329#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} [65] L23-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~y~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {330#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 23:31:00,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {330#(not (= |__VERIFIER_assert_#in~cond| 0))} [69] __VERIFIER_assertENTRY-->L15: 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] {331#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 23:31:00,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {331#(not (= __VERIFIER_assert_~cond 0))} [70] L15-->L16: 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[] {322#false} is VALID [2022-04-07 23:31:00,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {322#false} [72] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {322#false} is VALID [2022-04-07 23:31:00,109 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-07 23:31:00,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:31:00,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626728955] [2022-04-07 23:31:00,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626728955] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:31:00,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781622290] [2022-04-07 23:31:00,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:31:00,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:31:00,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:31:00,111 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 23:31:00,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 23:31:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:31:00,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-07 23:31:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:31:00,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:31:00,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {321#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {321#true} is VALID [2022-04-07 23:31:00,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {321#true} [55] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {321#true} is VALID [2022-04-07 23:31:00,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {321#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {321#true} is VALID [2022-04-07 23:31:00,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {321#true} {321#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {321#true} is VALID [2022-04-07 23:31:00,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {321#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {321#true} is VALID [2022-04-07 23:31:00,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {321#true} [57] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~y~0_3 |v_main_#t~nondet2_2|) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet2, main_~y~0] {321#true} is VALID [2022-04-07 23:31:00,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {321#true} [60] L22-->L23-2: Formula: (and (= v_main_~x~0_8 v_main_~y~0_7) (<= 0 v_main_~y~0_7)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} AuxVars[] AssignedVars[] {326#(<= main_~y~0 main_~x~0)} is VALID [2022-04-07 23:31:00,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {326#(<= main_~y~0 main_~x~0)} [64] L23-2-->L26: Formula: (and (= v_main_~x~0_3 (+ v_main_~x~0_2 1)) (= (+ v_main_~y~0_1 1) v_main_~y~0_2) (not (= v_main_~x~0_3 0))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post3] {326#(<= main_~y~0 main_~x~0)} is VALID [2022-04-07 23:31:00,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {326#(<= main_~y~0 main_~x~0)} [67] L26-->L23-2: Formula: (and (not (< v_main_~y~0_5 0)) (not (< v_main_~x~0_6 0))) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_5} OutVars{main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[] {360#(and (not (< main_~y~0 0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-07 23:31:00,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {360#(and (not (< main_~y~0 0)) (<= main_~y~0 main_~x~0))} [63] L23-2-->L23-3: Formula: (= v_main_~x~0_1 0) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {329#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-07 23:31:00,392 INFO L272 TraceCheckUtils]: 10: Hoare triple {329#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} [65] L23-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~y~0_9 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {367#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:31:00,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {367#(<= 1 |__VERIFIER_assert_#in~cond|)} [69] __VERIFIER_assertENTRY-->L15: 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] {371#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:31:00,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {371#(<= 1 __VERIFIER_assert_~cond)} [70] L15-->L16: 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[] {322#false} is VALID [2022-04-07 23:31:00,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {322#false} [72] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {322#false} is VALID [2022-04-07 23:31:00,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:31:00,394 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 23:31:00,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781622290] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:31:00,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 23:31:00,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2022-04-07 23:31:00,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274444450] [2022-04-07 23:31:00,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:31:00,395 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 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-07 23:31:00,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:31:00,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 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-07 23:31:00,404 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-07 23:31:00,405 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 23:31:00,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:31:00,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 23:31:00,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-07 23:31:00,410 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 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-07 23:31:00,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:31:00,486 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-07 23:31:00,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 23:31:00,486 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 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-07 23:31:00,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:31:00,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 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-07 23:31:00,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 14 transitions. [2022-04-07 23:31:00,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 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-07 23:31:00,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 14 transitions. [2022-04-07 23:31:00,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 14 transitions. [2022-04-07 23:31:00,502 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-07 23:31:00,502 INFO L225 Difference]: With dead ends: 15 [2022-04-07 23:31:00,502 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 23:31:00,503 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-07 23:31:00,508 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 23:31:00,510 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 32 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 23:31:00,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 23:31:00,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 23:31:00,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:31:00,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 23:31:00,512 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 23:31:00,512 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 23:31:00,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:31:00,512 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 23:31:00,512 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 23:31:00,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:31:00,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:31:00,512 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 23:31:00,512 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 23:31:00,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:31:00,512 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 23:31:00,512 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 23:31:00,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:31:00,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:31:00,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:31:00,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:31:00,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 23:31:00,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 23:31:00,513 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-07 23:31:00,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:31:00,513 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 23:31:00,513 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 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-07 23:31:00,513 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 23:31:00,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:31:00,515 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 23:31:00,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-07 23:31:00,723 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:31:00,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 23:31:00,781 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-07 23:31:00,782 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 23:31:00,782 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 23:31:00,782 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 23:31:00,782 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 23:31:00,782 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 23:31:00,782 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 23:31:00,782 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 19 30) the Hoare annotation is: true [2022-04-07 23:31:00,782 INFO L882 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2022-04-07 23:31:00,782 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 19 30) no Hoare annotation was computed. [2022-04-07 23:31:00,782 INFO L878 garLoopResultBuilder]: At program point L23-2(lines 23 27) the Hoare annotation is: (and (<= main_~x~0 main_~y~0) (< 0 (+ main_~x~0 1)) (<= main_~y~0 main_~x~0)) [2022-04-07 23:31:00,782 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 19 30) no Hoare annotation was computed. [2022-04-07 23:31:00,782 INFO L878 garLoopResultBuilder]: At program point L23-3(lines 23 27) the Hoare annotation is: (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) [2022-04-07 23:31:00,782 INFO L882 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2022-04-07 23:31:00,782 INFO L882 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-04-07 23:31:00,783 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-07 23:31:00,783 INFO L882 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-04-07 23:31:00,783 INFO L882 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-07 23:31:00,783 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 18) no Hoare annotation was computed. [2022-04-07 23:31:00,783 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-04-07 23:31:00,783 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 18) no Hoare annotation was computed. [2022-04-07 23:31:00,785 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-04-07 23:31:00,786 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 23:31:00,788 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 23:31:00,788 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-07 23:31:00,788 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 23:31:00,788 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 23:31:00,788 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-07 23:31:00,789 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-07 23:31:00,789 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 23:31:00,789 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 23:31:00,789 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 23:31:00,789 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 23:31:00,791 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-07 23:31:00,791 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 23:31:00,791 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 23:31:00,791 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-07 23:31:00,791 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 23:31:00,791 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-07 23:31:00,791 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-07 23:31:00,791 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 23:31:00,791 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 23:31:00,791 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-07 23:31:00,791 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-07 23:31:00,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 11:31:00 BasicIcfg [2022-04-07 23:31:00,797 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 23:31:00,798 INFO L158 Benchmark]: Toolchain (without parser) took 2420.78ms. Allocated memory was 178.3MB in the beginning and 240.1MB in the end (delta: 61.9MB). Free memory was 120.5MB in the beginning and 149.1MB in the end (delta: -28.6MB). Peak memory consumption was 33.4MB. Max. memory is 8.0GB. [2022-04-07 23:31:00,798 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 178.3MB. Free memory was 136.5MB in the beginning and 136.4MB in the end (delta: 72.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 23:31:00,798 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.77ms. Allocated memory was 178.3MB in the beginning and 240.1MB in the end (delta: 61.9MB). Free memory was 120.2MB in the beginning and 210.0MB in the end (delta: -89.8MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. [2022-04-07 23:31:00,798 INFO L158 Benchmark]: Boogie Preprocessor took 20.15ms. Allocated memory is still 240.1MB. Free memory was 210.0MB in the beginning and 208.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 23:31:00,799 INFO L158 Benchmark]: RCFGBuilder took 204.27ms. Allocated memory is still 240.1MB. Free memory was 208.3MB in the beginning and 197.1MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 23:31:00,799 INFO L158 Benchmark]: IcfgTransformer took 28.34ms. Allocated memory is still 240.1MB. Free memory was 197.1MB in the beginning and 195.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 23:31:00,799 INFO L158 Benchmark]: TraceAbstraction took 1969.92ms. Allocated memory is still 240.1MB. Free memory was 195.0MB in the beginning and 149.1MB in the end (delta: 45.9MB). Peak memory consumption was 45.7MB. Max. memory is 8.0GB. [2022-04-07 23:31:00,800 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 178.3MB. Free memory was 136.5MB in the beginning and 136.4MB in the end (delta: 72.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 193.77ms. Allocated memory was 178.3MB in the beginning and 240.1MB in the end (delta: 61.9MB). Free memory was 120.2MB in the beginning and 210.0MB in the end (delta: -89.8MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.15ms. Allocated memory is still 240.1MB. Free memory was 210.0MB in the beginning and 208.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 204.27ms. Allocated memory is still 240.1MB. Free memory was 208.3MB in the beginning and 197.1MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 28.34ms. Allocated memory is still 240.1MB. Free memory was 197.1MB in the beginning and 195.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 1969.92ms. Allocated memory is still 240.1MB. Free memory was 195.0MB in the beginning and 149.1MB in the end (delta: 45.9MB). Peak memory consumption was 45.7MB. 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: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 109 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 72 IncrementalHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 53 mSDtfsCounter, 72 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 13 NumberOfFragments, 32 HoareAnnotationTreeSize, 10 FomulaSimplifications, 13 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 41 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 65 NumberOfCodeBlocks, 65 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 60 ConstructedInterpolants, 0 QuantifiedInterpolants, 185 SizeOfPredicates, 2 NumberOfNonLiveVariables, 64 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 1/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (x <= y && 0 < x + 1) && y <= x RESULT: Ultimate proved your program to be correct! [2022-04-07 23:31:00,824 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...