/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-simple/nested_2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 22:33:35,702 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 22:33:35,723 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 22:33:35,773 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 22:33:35,773 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 22:33:35,774 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 22:33:35,775 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 22:33:35,777 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 22:33:35,778 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 22:33:35,779 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 22:33:35,779 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 22:33:35,780 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 22:33:35,781 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 22:33:35,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 22:33:35,785 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 22:33:35,787 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 22:33:35,788 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 22:33:35,792 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 22:33:35,798 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 22:33:35,804 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 22:33:35,807 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 22:33:35,808 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 22:33:35,810 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 22:33:35,812 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 22:33:35,814 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 22:33:35,818 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 22:33:35,819 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 22:33:35,819 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 22:33:35,820 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 22:33:35,820 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 22:33:35,820 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 22:33:35,821 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 22:33:35,821 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 22:33:35,822 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 22:33:35,822 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 22:33:35,823 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 22:33:35,823 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 22:33:35,824 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 22:33:35,824 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 22:33:35,824 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 22:33:35,825 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 22:33:35,829 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 22:33:35,830 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 22:33:35,858 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 22:33:35,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 22:33:35,859 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 22:33:35,859 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 22:33:35,860 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 22:33:35,860 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 22:33:35,860 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 22:33:35,860 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 22:33:35,860 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 22:33:35,861 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 22:33:35,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 22:33:35,861 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 22:33:35,861 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 22:33:35,862 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 22:33:35,862 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 22:33:35,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 22:33:35,862 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 22:33:35,862 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 22:33:35,862 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 22:33:35,862 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:33:35,862 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 22:33:35,863 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 22:33:35,863 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 22:33:35,863 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 22:33:35,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 22:33:35,863 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 22:33:35,863 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 22:33:35,864 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 22:33:35,865 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 22:33:35,865 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-27 22:33:36,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 22:33:36,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 22:33:36,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 22:33:36,108 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 22:33:36,110 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 22:33:36,111 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-simple/nested_2.c [2022-04-27 22:33:36,162 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03ec58652/7c6b3a67affa4d80b41981fe8cd5204a/FLAGcd6d3c8f4 [2022-04-27 22:33:36,573 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 22:33:36,574 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_2.c [2022-04-27 22:33:36,579 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03ec58652/7c6b3a67affa4d80b41981fe8cd5204a/FLAGcd6d3c8f4 [2022-04-27 22:33:36,592 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03ec58652/7c6b3a67affa4d80b41981fe8cd5204a [2022-04-27 22:33:36,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 22:33:36,598 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 22:33:36,599 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 22:33:36,599 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 22:33:36,606 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 22:33:36,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:33:36" (1/1) ... [2022-04-27 22:33:36,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@702c66d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:33:36, skipping insertion in model container [2022-04-27 22:33:36,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:33:36" (1/1) ... [2022-04-27 22:33:36,620 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 22:33:36,632 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 22:33:36,769 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-simple/nested_2.c[730,743] [2022-04-27 22:33:36,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:33:36,779 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 22:33:36,791 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-simple/nested_2.c[730,743] [2022-04-27 22:33:36,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:33:36,803 INFO L208 MainTranslator]: Completed translation [2022-04-27 22:33:36,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:33:36 WrapperNode [2022-04-27 22:33:36,803 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 22:33:36,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 22:33:36,805 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 22:33:36,805 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 22:33:36,814 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:33:36" (1/1) ... [2022-04-27 22:33:36,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:33:36" (1/1) ... [2022-04-27 22:33:36,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:33:36" (1/1) ... [2022-04-27 22:33:36,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:33:36" (1/1) ... [2022-04-27 22:33:36,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:33:36" (1/1) ... [2022-04-27 22:33:36,831 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:33:36" (1/1) ... [2022-04-27 22:33:36,832 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:33:36" (1/1) ... [2022-04-27 22:33:36,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 22:33:36,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 22:33:36,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 22:33:36,834 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 22:33:36,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:33:36" (1/1) ... [2022-04-27 22:33:36,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:33:36,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:33:36,861 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 22:33:36,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 22:33:36,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 22:33:36,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 22:33:36,898 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 22:33:36,898 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 22:33:36,898 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 22:33:36,898 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 22:33:36,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 22:33:36,900 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 22:33:36,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 22:33:36,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 22:33:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 22:33:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 22:33:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 22:33:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 22:33:36,949 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 22:33:36,950 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 22:33:37,040 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 22:33:37,046 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 22:33:37,046 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 22:33:37,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:33:37 BoogieIcfgContainer [2022-04-27 22:33:37,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 22:33:37,048 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 22:33:37,048 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 22:33:37,049 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 22:33:37,052 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:33:37" (1/1) ... [2022-04-27 22:33:37,054 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 22:33:37,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:33:37 BasicIcfg [2022-04-27 22:33:37,069 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 22:33:37,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 22:33:37,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 22:33:37,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 22:33:37,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:33:36" (1/4) ... [2022-04-27 22:33:37,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@290c60b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:33:37, skipping insertion in model container [2022-04-27 22:33:37,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:33:36" (2/4) ... [2022-04-27 22:33:37,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@290c60b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:33:37, skipping insertion in model container [2022-04-27 22:33:37,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:33:37" (3/4) ... [2022-04-27 22:33:37,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@290c60b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:33:37, skipping insertion in model container [2022-04-27 22:33:37,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:33:37" (4/4) ... [2022-04-27 22:33:37,075 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_2.cqvasr [2022-04-27 22:33:37,101 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 22:33:37,102 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 22:33:37,164 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 22:33:37,185 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3993426c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@22da85c5 [2022-04-27 22:33:37,186 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 22:33:37,208 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 22:33:37,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-27 22:33:37,215 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:33:37,216 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:33:37,216 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:33:37,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:33:37,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1120438501, now seen corresponding path program 1 times [2022-04-27 22:33:37,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:33:37,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998682718] [2022-04-27 22:33:37,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:33:37,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:33:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:33:37,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:33:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:33:37,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] 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) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {21#true} is VALID [2022-04-27 22:33:37,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 22:33:37,433 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 22:33:37,435 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:33:37,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] 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) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {21#true} is VALID [2022-04-27 22:33:37,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 22:33:37,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 22:33:37,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-27 22:33:37,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} [51] mainENTRY-->L20-3: Formula: (and (= v_main_~b~0_2 6) (= v_main_~a~0_2 0)) InVars {} OutVars{main_~b~0=v_main_~b~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {21#true} is VALID [2022-04-27 22:33:37,441 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} [53] L20-3-->L20-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-27 22:33:37,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {22#false} [56] L20-4-->L26: Formula: (or (not (= v_main_~a~0_1 6)) (not (= v_main_~b~0_1 6))) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-27 22:33:37,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} [61] L26-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-27 22:33:37,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:33:37,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:33:37,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998682718] [2022-04-27 22:33:37,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998682718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:33:37,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:33:37,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 22:33:37,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368118498] [2022-04-27 22:33:37,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:33:37,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-27 22:33:37,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:33:37,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:37,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:33:37,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 22:33:37,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:33:37,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 22:33:37,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 22:33:37,503 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:37,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:33:37,565 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-27 22:33:37,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 22:33:37,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-27 22:33:37,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:33:37,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:37,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-04-27 22:33:37,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:37,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-04-27 22:33:37,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2022-04-27 22:33:37,642 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-27 22:33:37,650 INFO L225 Difference]: With dead ends: 30 [2022-04-27 22:33:37,650 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 22:33:37,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 22:33:37,657 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:33:37,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:33:37,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 22:33:37,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 22:33:37,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:33:37,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:37,684 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:37,684 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:37,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:33:37,686 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-27 22:33:37,687 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-27 22:33:37,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:33:37,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:33:37,687 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-27 22:33:37,688 INFO L87 Difference]: Start difference. First operand has 13 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-27 22:33:37,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:33:37,690 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-27 22:33:37,690 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-27 22:33:37,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:33:37,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:33:37,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:33:37,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:33:37,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:37,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-27 22:33:37,693 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2022-04-27 22:33:37,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:33:37,694 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-27 22:33:37,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:37,694 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-27 22:33:37,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-27 22:33:37,695 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:33:37,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:33:37,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 22:33:37,695 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:33:37,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:33:37,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1120439462, now seen corresponding path program 1 times [2022-04-27 22:33:37,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:33:37,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925721285] [2022-04-27 22:33:37,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:33:37,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:33:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:33:37,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:33:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:33:37,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] 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) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {112#true} is VALID [2022-04-27 22:33:37,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {112#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {112#true} is VALID [2022-04-27 22:33:37,750 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {112#true} {112#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {112#true} is VALID [2022-04-27 22:33:37,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {112#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:33:37,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] 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) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {112#true} is VALID [2022-04-27 22:33:37,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {112#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {112#true} is VALID [2022-04-27 22:33:37,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {112#true} {112#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {112#true} is VALID [2022-04-27 22:33:37,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {112#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {112#true} is VALID [2022-04-27 22:33:37,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {112#true} [51] mainENTRY-->L20-3: Formula: (and (= v_main_~b~0_2 6) (= v_main_~a~0_2 0)) InVars {} OutVars{main_~b~0=v_main_~b~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {117#(= main_~a~0 0)} is VALID [2022-04-27 22:33:37,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {117#(= main_~a~0 0)} [54] L20-3-->L20-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {113#false} is VALID [2022-04-27 22:33:37,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {113#false} [56] L20-4-->L26: Formula: (or (not (= v_main_~a~0_1 6)) (not (= v_main_~b~0_1 6))) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {113#false} is VALID [2022-04-27 22:33:37,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {113#false} [61] L26-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {113#false} is VALID [2022-04-27 22:33:37,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:33:37,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:33:37,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925721285] [2022-04-27 22:33:37,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925721285] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:33:37,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:33:37,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 22:33:37,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822473721] [2022-04-27 22:33:37,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:33:37,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-27 22:33:37,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:33:37,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:37,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:33:37,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 22:33:37,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:33:37,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 22:33:37,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 22:33:37,779 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:37,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:33:37,833 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-27 22:33:37,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 22:33:37,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-27 22:33:37,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:33:37,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:37,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-27 22:33:37,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:37,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-27 22:33:37,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 22 transitions. [2022-04-27 22:33:37,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:33:37,861 INFO L225 Difference]: With dead ends: 20 [2022-04-27 22:33:37,861 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 22:33:37,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 22:33:37,863 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:33:37,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 19 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:33:37,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 22:33:37,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2022-04-27 22:33:37,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:33:37,867 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:37,867 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:37,867 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:37,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:33:37,868 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 22:33:37,868 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 22:33:37,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:33:37,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:33:37,869 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 22:33:37,869 INFO L87 Difference]: Start difference. First operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 22:33:37,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:33:37,871 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 22:33:37,871 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 22:33:37,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:33:37,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:33:37,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:33:37,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:33:37,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:37,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-27 22:33:37,873 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2022-04-27 22:33:37,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:33:37,873 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-27 22:33:37,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:37,873 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 22:33:37,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 22:33:37,874 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:33:37,874 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:33:37,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 22:33:37,874 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:33:37,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:33:37,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1442269292, now seen corresponding path program 1 times [2022-04-27 22:33:37,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:33:37,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354235488] [2022-04-27 22:33:37,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:33:37,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:33:37,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:33:37,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:33:37,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:33:37,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] 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) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {206#true} is VALID [2022-04-27 22:33:37,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {206#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-27 22:33:37,922 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {206#true} {206#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-27 22:33:37,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {206#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:33:37,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] 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) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {206#true} is VALID [2022-04-27 22:33:37,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {206#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-27 22:33:37,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {206#true} {206#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-27 22:33:37,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {206#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-27 22:33:37,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {206#true} [51] mainENTRY-->L20-3: Formula: (and (= v_main_~b~0_2 6) (= v_main_~a~0_2 0)) InVars {} OutVars{main_~b~0=v_main_~b~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {206#true} is VALID [2022-04-27 22:33:37,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {206#true} [55] L20-3-->L21-3: Formula: (and (< v_main_~a~0_6 6) (= v_main_~b~0_4 0)) InVars {main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~b~0] {211#(= main_~b~0 0)} is VALID [2022-04-27 22:33:37,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {211#(= main_~b~0 0)} [59] L21-3-->L20-2: Formula: (not (< v_main_~b~0_5 6)) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {207#false} is VALID [2022-04-27 22:33:37,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {207#false} [64] L20-2-->L20-3: Formula: (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {207#false} is VALID [2022-04-27 22:33:37,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {207#false} [54] L20-3-->L20-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {207#false} is VALID [2022-04-27 22:33:37,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {207#false} [56] L20-4-->L26: Formula: (or (not (= v_main_~a~0_1 6)) (not (= v_main_~b~0_1 6))) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {207#false} is VALID [2022-04-27 22:33:37,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {207#false} [61] L26-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {207#false} is VALID [2022-04-27 22:33:37,926 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-27 22:33:37,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:33:37,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354235488] [2022-04-27 22:33:37,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354235488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:33:37,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:33:37,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 22:33:37,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451143554] [2022-04-27 22:33:37,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:33:37,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 22:33:37,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:33:37,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:37,939 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-27 22:33:37,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 22:33:37,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:33:37,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 22:33:37,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 22:33:37,941 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:37,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:33:37,997 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-27 22:33:38,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 22:33:38,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 22:33:38,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:33:38,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:38,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-04-27 22:33:38,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:38,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-04-27 22:33:38,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 25 transitions. [2022-04-27 22:33:38,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:33:38,041 INFO L225 Difference]: With dead ends: 23 [2022-04-27 22:33:38,041 INFO L226 Difference]: Without dead ends: 16 [2022-04-27 22:33:38,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 22:33:38,047 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:33:38,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 19 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:33:38,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-27 22:33:38,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-27 22:33:38,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:33:38,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:38,053 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:38,055 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:38,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:33:38,056 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-27 22:33:38,057 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-27 22:33:38,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:33:38,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:33:38,057 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 22:33:38,058 INFO L87 Difference]: Start difference. First operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 22:33:38,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:33:38,059 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-27 22:33:38,059 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-27 22:33:38,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:33:38,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:33:38,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:33:38,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:33:38,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:38,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-27 22:33:38,061 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-27 22:33:38,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:33:38,061 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-27 22:33:38,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:38,062 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 22:33:38,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 22:33:38,062 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:33:38,062 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:33:38,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 22:33:38,063 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:33:38,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:33:38,063 INFO L85 PathProgramCache]: Analyzing trace with hash -2120336465, now seen corresponding path program 1 times [2022-04-27 22:33:38,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:33:38,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349455697] [2022-04-27 22:33:38,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:33:38,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:33:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:33:38,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:33:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:33:38,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] 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) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {305#true} is VALID [2022-04-27 22:33:38,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {305#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {305#true} is VALID [2022-04-27 22:33:38,149 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {305#true} {305#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {305#true} is VALID [2022-04-27 22:33:38,150 INFO L272 TraceCheckUtils]: 0: Hoare triple {305#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {312#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:33:38,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] 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) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {305#true} is VALID [2022-04-27 22:33:38,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {305#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {305#true} is VALID [2022-04-27 22:33:38,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {305#true} {305#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {305#true} is VALID [2022-04-27 22:33:38,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {305#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {305#true} is VALID [2022-04-27 22:33:38,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {305#true} [51] mainENTRY-->L20-3: Formula: (and (= v_main_~b~0_2 6) (= v_main_~a~0_2 0)) InVars {} OutVars{main_~b~0=v_main_~b~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {305#true} is VALID [2022-04-27 22:33:38,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {305#true} [55] L20-3-->L21-3: Formula: (and (< v_main_~a~0_6 6) (= v_main_~b~0_4 0)) InVars {main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~b~0] {310#(= main_~b~0 0)} is VALID [2022-04-27 22:33:38,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {310#(= main_~b~0 0)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {310#(= main_~b~0 0)} is VALID [2022-04-27 22:33:38,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {310#(= main_~b~0 0)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {311#(<= main_~b~0 1)} is VALID [2022-04-27 22:33:38,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {311#(<= main_~b~0 1)} [59] L21-3-->L20-2: Formula: (not (< v_main_~b~0_5 6)) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {306#false} is VALID [2022-04-27 22:33:38,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {306#false} [64] L20-2-->L20-3: Formula: (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {306#false} is VALID [2022-04-27 22:33:38,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {306#false} [54] L20-3-->L20-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {306#false} is VALID [2022-04-27 22:33:38,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {306#false} [56] L20-4-->L26: Formula: (or (not (= v_main_~a~0_1 6)) (not (= v_main_~b~0_1 6))) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {306#false} is VALID [2022-04-27 22:33:38,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {306#false} [61] L26-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {306#false} is VALID [2022-04-27 22:33:38,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:33:38,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:33:38,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349455697] [2022-04-27 22:33:38,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349455697] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:33:38,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059950473] [2022-04-27 22:33:38,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:33:38,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:33:38,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:33:38,158 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:33:38,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 22:33:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:33:38,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 22:33:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:33:38,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:33:38,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {305#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {305#true} is VALID [2022-04-27 22:33:38,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {305#true} [49] 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) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {305#true} is VALID [2022-04-27 22:33:38,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {305#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {305#true} is VALID [2022-04-27 22:33:38,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {305#true} {305#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {305#true} is VALID [2022-04-27 22:33:38,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {305#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {305#true} is VALID [2022-04-27 22:33:38,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {305#true} [51] mainENTRY-->L20-3: Formula: (and (= v_main_~b~0_2 6) (= v_main_~a~0_2 0)) InVars {} OutVars{main_~b~0=v_main_~b~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {305#true} is VALID [2022-04-27 22:33:38,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {305#true} [55] L20-3-->L21-3: Formula: (and (< v_main_~a~0_6 6) (= v_main_~b~0_4 0)) InVars {main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~b~0] {334#(<= main_~b~0 0)} is VALID [2022-04-27 22:33:38,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {334#(<= main_~b~0 0)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {334#(<= main_~b~0 0)} is VALID [2022-04-27 22:33:38,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {334#(<= main_~b~0 0)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {311#(<= main_~b~0 1)} is VALID [2022-04-27 22:33:38,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {311#(<= main_~b~0 1)} [59] L21-3-->L20-2: Formula: (not (< v_main_~b~0_5 6)) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {306#false} is VALID [2022-04-27 22:33:38,329 INFO L290 TraceCheckUtils]: 10: Hoare triple {306#false} [64] L20-2-->L20-3: Formula: (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {306#false} is VALID [2022-04-27 22:33:38,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {306#false} [54] L20-3-->L20-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {306#false} is VALID [2022-04-27 22:33:38,330 INFO L290 TraceCheckUtils]: 12: Hoare triple {306#false} [56] L20-4-->L26: Formula: (or (not (= v_main_~a~0_1 6)) (not (= v_main_~b~0_1 6))) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {306#false} is VALID [2022-04-27 22:33:38,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {306#false} [61] L26-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {306#false} is VALID [2022-04-27 22:33:38,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:33:38,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:33:38,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {306#false} [61] L26-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {306#false} is VALID [2022-04-27 22:33:38,426 INFO L290 TraceCheckUtils]: 12: Hoare triple {306#false} [56] L20-4-->L26: Formula: (or (not (= v_main_~a~0_1 6)) (not (= v_main_~b~0_1 6))) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {306#false} is VALID [2022-04-27 22:33:38,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {306#false} [54] L20-3-->L20-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {306#false} is VALID [2022-04-27 22:33:38,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {306#false} [64] L20-2-->L20-3: Formula: (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {306#false} is VALID [2022-04-27 22:33:38,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {368#(< main_~b~0 6)} [59] L21-3-->L20-2: Formula: (not (< v_main_~b~0_5 6)) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {306#false} is VALID [2022-04-27 22:33:38,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {372#(< main_~b~0 5)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {368#(< main_~b~0 6)} is VALID [2022-04-27 22:33:38,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {372#(< main_~b~0 5)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {372#(< main_~b~0 5)} is VALID [2022-04-27 22:33:38,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {305#true} [55] L20-3-->L21-3: Formula: (and (< v_main_~a~0_6 6) (= v_main_~b~0_4 0)) InVars {main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~b~0] {372#(< main_~b~0 5)} is VALID [2022-04-27 22:33:38,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {305#true} [51] mainENTRY-->L20-3: Formula: (and (= v_main_~b~0_2 6) (= v_main_~a~0_2 0)) InVars {} OutVars{main_~b~0=v_main_~b~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {305#true} is VALID [2022-04-27 22:33:38,453 INFO L272 TraceCheckUtils]: 4: Hoare triple {305#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {305#true} is VALID [2022-04-27 22:33:38,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {305#true} {305#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {305#true} is VALID [2022-04-27 22:33:38,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {305#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {305#true} is VALID [2022-04-27 22:33:38,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {305#true} [49] 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) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {305#true} is VALID [2022-04-27 22:33:38,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {305#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {305#true} is VALID [2022-04-27 22:33:38,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:33:38,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059950473] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 22:33:38,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 22:33:38,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-27 22:33:38,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577773831] [2022-04-27 22:33:38,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 22:33:38,456 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 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-27 22:33:38,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:33:38,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 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-27 22:33:38,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:33:38,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 22:33:38,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:33:38,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 22:33:38,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-27 22:33:38,481 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 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-27 22:33:38,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:33:38,613 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-04-27 22:33:38,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 22:33:38,614 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 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-27 22:33:38,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:33:38,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 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-27 22:33:38,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-27 22:33:38,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 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-27 22:33:38,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-27 22:33:38,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 32 transitions. [2022-04-27 22:33:38,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:33:38,645 INFO L225 Difference]: With dead ends: 29 [2022-04-27 22:33:38,645 INFO L226 Difference]: Without dead ends: 21 [2022-04-27 22:33:38,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-04-27 22:33:38,646 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:33:38,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 24 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:33:38,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-27 22:33:38,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-27 22:33:38,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:33:38,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:38,652 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:38,653 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:38,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:33:38,654 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-27 22:33:38,654 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-27 22:33:38,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:33:38,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:33:38,654 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-27 22:33:38,655 INFO L87 Difference]: Start difference. First operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-27 22:33:38,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:33:38,656 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-27 22:33:38,656 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-27 22:33:38,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:33:38,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:33:38,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:33:38,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:33:38,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:38,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-04-27 22:33:38,658 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2022-04-27 22:33:38,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:33:38,658 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-04-27 22:33:38,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 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-27 22:33:38,658 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-27 22:33:38,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 22:33:38,659 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:33:38,659 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:33:38,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 22:33:38,875 WARN L477 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-27 22:33:38,876 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:33:38,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:33:38,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1933436800, now seen corresponding path program 2 times [2022-04-27 22:33:38,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:33:38,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573133567] [2022-04-27 22:33:38,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:33:38,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:33:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:33:38,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:33:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:33:38,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {531#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] 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) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {524#true} is VALID [2022-04-27 22:33:38,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {524#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {524#true} is VALID [2022-04-27 22:33:38,926 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {524#true} {524#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {524#true} is VALID [2022-04-27 22:33:38,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {524#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {531#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:33:38,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {531#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] 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) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {524#true} is VALID [2022-04-27 22:33:38,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {524#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {524#true} is VALID [2022-04-27 22:33:38,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {524#true} {524#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {524#true} is VALID [2022-04-27 22:33:38,927 INFO L272 TraceCheckUtils]: 4: Hoare triple {524#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {524#true} is VALID [2022-04-27 22:33:38,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {524#true} [51] mainENTRY-->L20-3: Formula: (and (= v_main_~b~0_2 6) (= v_main_~a~0_2 0)) InVars {} OutVars{main_~b~0=v_main_~b~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {529#(= main_~a~0 0)} is VALID [2022-04-27 22:33:38,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {529#(= main_~a~0 0)} [55] L20-3-->L21-3: Formula: (and (< v_main_~a~0_6 6) (= v_main_~b~0_4 0)) InVars {main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~b~0] {529#(= main_~a~0 0)} is VALID [2022-04-27 22:33:38,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {529#(= main_~a~0 0)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {529#(= main_~a~0 0)} is VALID [2022-04-27 22:33:38,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {529#(= main_~a~0 0)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {529#(= main_~a~0 0)} is VALID [2022-04-27 22:33:38,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {529#(= main_~a~0 0)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {529#(= main_~a~0 0)} is VALID [2022-04-27 22:33:38,938 INFO L290 TraceCheckUtils]: 10: Hoare triple {529#(= main_~a~0 0)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {529#(= main_~a~0 0)} is VALID [2022-04-27 22:33:38,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {529#(= main_~a~0 0)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {529#(= main_~a~0 0)} is VALID [2022-04-27 22:33:38,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {529#(= main_~a~0 0)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {529#(= main_~a~0 0)} is VALID [2022-04-27 22:33:38,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {529#(= main_~a~0 0)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {529#(= main_~a~0 0)} is VALID [2022-04-27 22:33:38,939 INFO L290 TraceCheckUtils]: 14: Hoare triple {529#(= main_~a~0 0)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {529#(= main_~a~0 0)} is VALID [2022-04-27 22:33:38,940 INFO L290 TraceCheckUtils]: 15: Hoare triple {529#(= main_~a~0 0)} [59] L21-3-->L20-2: Formula: (not (< v_main_~b~0_5 6)) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {529#(= main_~a~0 0)} is VALID [2022-04-27 22:33:38,940 INFO L290 TraceCheckUtils]: 16: Hoare triple {529#(= main_~a~0 0)} [64] L20-2-->L20-3: Formula: (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {530#(<= main_~a~0 1)} is VALID [2022-04-27 22:33:38,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {530#(<= main_~a~0 1)} [54] L20-3-->L20-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {525#false} is VALID [2022-04-27 22:33:38,941 INFO L290 TraceCheckUtils]: 18: Hoare triple {525#false} [56] L20-4-->L26: Formula: (or (not (= v_main_~a~0_1 6)) (not (= v_main_~b~0_1 6))) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {525#false} is VALID [2022-04-27 22:33:38,941 INFO L290 TraceCheckUtils]: 19: Hoare triple {525#false} [61] L26-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {525#false} is VALID [2022-04-27 22:33:38,942 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 22:33:38,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:33:38,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573133567] [2022-04-27 22:33:38,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573133567] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:33:38,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845806678] [2022-04-27 22:33:38,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 22:33:38,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:33:38,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:33:38,948 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:33:38,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 22:33:38,984 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 22:33:38,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 22:33:38,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 22:33:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:33:38,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:33:39,104 INFO L272 TraceCheckUtils]: 0: Hoare triple {524#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {524#true} is VALID [2022-04-27 22:33:39,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {524#true} [49] 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) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {524#true} is VALID [2022-04-27 22:33:39,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {524#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {524#true} is VALID [2022-04-27 22:33:39,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {524#true} {524#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {524#true} is VALID [2022-04-27 22:33:39,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {524#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {524#true} is VALID [2022-04-27 22:33:39,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {524#true} [51] mainENTRY-->L20-3: Formula: (and (= v_main_~b~0_2 6) (= v_main_~a~0_2 0)) InVars {} OutVars{main_~b~0=v_main_~b~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {550#(<= main_~a~0 0)} is VALID [2022-04-27 22:33:39,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {550#(<= main_~a~0 0)} [55] L20-3-->L21-3: Formula: (and (< v_main_~a~0_6 6) (= v_main_~b~0_4 0)) InVars {main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~b~0] {550#(<= main_~a~0 0)} is VALID [2022-04-27 22:33:39,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {550#(<= main_~a~0 0)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {550#(<= main_~a~0 0)} is VALID [2022-04-27 22:33:39,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {550#(<= main_~a~0 0)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {550#(<= main_~a~0 0)} is VALID [2022-04-27 22:33:39,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {550#(<= main_~a~0 0)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {550#(<= main_~a~0 0)} is VALID [2022-04-27 22:33:39,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {550#(<= main_~a~0 0)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {550#(<= main_~a~0 0)} is VALID [2022-04-27 22:33:39,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {550#(<= main_~a~0 0)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {550#(<= main_~a~0 0)} is VALID [2022-04-27 22:33:39,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {550#(<= main_~a~0 0)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {550#(<= main_~a~0 0)} is VALID [2022-04-27 22:33:39,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {550#(<= main_~a~0 0)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {550#(<= main_~a~0 0)} is VALID [2022-04-27 22:33:39,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {550#(<= main_~a~0 0)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {550#(<= main_~a~0 0)} is VALID [2022-04-27 22:33:39,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {550#(<= main_~a~0 0)} [59] L21-3-->L20-2: Formula: (not (< v_main_~b~0_5 6)) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {550#(<= main_~a~0 0)} is VALID [2022-04-27 22:33:39,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {550#(<= main_~a~0 0)} [64] L20-2-->L20-3: Formula: (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {530#(<= main_~a~0 1)} is VALID [2022-04-27 22:33:39,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {530#(<= main_~a~0 1)} [54] L20-3-->L20-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {525#false} is VALID [2022-04-27 22:33:39,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {525#false} [56] L20-4-->L26: Formula: (or (not (= v_main_~a~0_1 6)) (not (= v_main_~b~0_1 6))) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {525#false} is VALID [2022-04-27 22:33:39,131 INFO L290 TraceCheckUtils]: 19: Hoare triple {525#false} [61] L26-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {525#false} is VALID [2022-04-27 22:33:39,132 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 22:33:39,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:33:39,242 INFO L290 TraceCheckUtils]: 19: Hoare triple {525#false} [61] L26-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {525#false} is VALID [2022-04-27 22:33:39,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {525#false} [56] L20-4-->L26: Formula: (or (not (= v_main_~a~0_1 6)) (not (= v_main_~b~0_1 6))) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {525#false} is VALID [2022-04-27 22:33:39,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {599#(< main_~a~0 6)} [54] L20-3-->L20-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {525#false} is VALID [2022-04-27 22:33:39,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {603#(< main_~a~0 5)} [64] L20-2-->L20-3: Formula: (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {599#(< main_~a~0 6)} is VALID [2022-04-27 22:33:39,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {603#(< main_~a~0 5)} [59] L21-3-->L20-2: Formula: (not (< v_main_~b~0_5 6)) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {603#(< main_~a~0 5)} is VALID [2022-04-27 22:33:39,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {603#(< main_~a~0 5)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {603#(< main_~a~0 5)} is VALID [2022-04-27 22:33:39,249 INFO L290 TraceCheckUtils]: 13: Hoare triple {603#(< main_~a~0 5)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {603#(< main_~a~0 5)} is VALID [2022-04-27 22:33:39,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {603#(< main_~a~0 5)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {603#(< main_~a~0 5)} is VALID [2022-04-27 22:33:39,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {603#(< main_~a~0 5)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {603#(< main_~a~0 5)} is VALID [2022-04-27 22:33:39,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {603#(< main_~a~0 5)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {603#(< main_~a~0 5)} is VALID [2022-04-27 22:33:39,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {603#(< main_~a~0 5)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {603#(< main_~a~0 5)} is VALID [2022-04-27 22:33:39,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {603#(< main_~a~0 5)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {603#(< main_~a~0 5)} is VALID [2022-04-27 22:33:39,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {603#(< main_~a~0 5)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {603#(< main_~a~0 5)} is VALID [2022-04-27 22:33:39,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {603#(< main_~a~0 5)} [55] L20-3-->L21-3: Formula: (and (< v_main_~a~0_6 6) (= v_main_~b~0_4 0)) InVars {main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~b~0] {603#(< main_~a~0 5)} is VALID [2022-04-27 22:33:39,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {524#true} [51] mainENTRY-->L20-3: Formula: (and (= v_main_~b~0_2 6) (= v_main_~a~0_2 0)) InVars {} OutVars{main_~b~0=v_main_~b~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {603#(< main_~a~0 5)} is VALID [2022-04-27 22:33:39,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {524#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {524#true} is VALID [2022-04-27 22:33:39,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {524#true} {524#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {524#true} is VALID [2022-04-27 22:33:39,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {524#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {524#true} is VALID [2022-04-27 22:33:39,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {524#true} [49] 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) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {524#true} is VALID [2022-04-27 22:33:39,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {524#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {524#true} is VALID [2022-04-27 22:33:39,256 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 22:33:39,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845806678] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 22:33:39,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 22:33:39,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-27 22:33:39,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751594914] [2022-04-27 22:33:39,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 22:33:39,257 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 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 20 [2022-04-27 22:33:39,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:33:39,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 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-27 22:33:39,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:33:39,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 22:33:39,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:33:39,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 22:33:39,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-27 22:33:39,285 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 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-27 22:33:39,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:33:39,452 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-04-27 22:33:39,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 22:33:39,453 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 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 20 [2022-04-27 22:33:39,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:33:39,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 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-27 22:33:39,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2022-04-27 22:33:39,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 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-27 22:33:39,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2022-04-27 22:33:39,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 35 transitions. [2022-04-27 22:33:39,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:33:39,490 INFO L225 Difference]: With dead ends: 57 [2022-04-27 22:33:39,490 INFO L226 Difference]: Without dead ends: 54 [2022-04-27 22:33:39,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-04-27 22:33:39,491 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 45 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:33:39,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 24 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:33:39,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-27 22:33:39,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-27 22:33:39,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:33:39,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 50 states have (on average 1.1) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:39,518 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 50 states have (on average 1.1) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:39,519 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 50 states have (on average 1.1) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:39,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:33:39,521 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2022-04-27 22:33:39,521 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-27 22:33:39,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:33:39,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:33:39,522 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 50 states have (on average 1.1) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-27 22:33:39,522 INFO L87 Difference]: Start difference. First operand has 54 states, 50 states have (on average 1.1) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-27 22:33:39,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:33:39,524 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2022-04-27 22:33:39,524 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-27 22:33:39,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:33:39,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:33:39,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:33:39,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:33:39,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 50 states have (on average 1.1) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:39,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2022-04-27 22:33:39,527 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 20 [2022-04-27 22:33:39,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:33:39,527 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-04-27 22:33:39,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 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-27 22:33:39,527 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-27 22:33:39,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-27 22:33:39,528 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:33:39,529 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:33:39,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 22:33:39,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:33:39,744 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:33:39,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:33:39,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1544578086, now seen corresponding path program 3 times [2022-04-27 22:33:39,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:33:39,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504215650] [2022-04-27 22:33:39,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:33:39,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:33:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:33:39,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:33:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:33:39,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {949#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] 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) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {939#true} is VALID [2022-04-27 22:33:39,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {939#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {939#true} is VALID [2022-04-27 22:33:39,875 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {939#true} {939#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {939#true} is VALID [2022-04-27 22:33:39,876 INFO L272 TraceCheckUtils]: 0: Hoare triple {939#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {949#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:33:39,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {949#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] 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) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {939#true} is VALID [2022-04-27 22:33:39,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {939#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {939#true} is VALID [2022-04-27 22:33:39,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {939#true} {939#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {939#true} is VALID [2022-04-27 22:33:39,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {939#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {939#true} is VALID [2022-04-27 22:33:39,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {939#true} [51] mainENTRY-->L20-3: Formula: (and (= v_main_~b~0_2 6) (= v_main_~a~0_2 0)) InVars {} OutVars{main_~b~0=v_main_~b~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {939#true} is VALID [2022-04-27 22:33:39,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {939#true} [55] L20-3-->L21-3: Formula: (and (< v_main_~a~0_6 6) (= v_main_~b~0_4 0)) InVars {main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~b~0] {944#(= main_~b~0 0)} is VALID [2022-04-27 22:33:39,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {944#(= main_~b~0 0)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {944#(= main_~b~0 0)} is VALID [2022-04-27 22:33:39,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {944#(= main_~b~0 0)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {945#(<= main_~b~0 1)} is VALID [2022-04-27 22:33:39,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {945#(<= main_~b~0 1)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {945#(<= main_~b~0 1)} is VALID [2022-04-27 22:33:39,878 INFO L290 TraceCheckUtils]: 10: Hoare triple {945#(<= main_~b~0 1)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {946#(<= main_~b~0 2)} is VALID [2022-04-27 22:33:39,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {946#(<= main_~b~0 2)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {946#(<= main_~b~0 2)} is VALID [2022-04-27 22:33:39,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {946#(<= main_~b~0 2)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {947#(<= main_~b~0 3)} is VALID [2022-04-27 22:33:39,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {947#(<= main_~b~0 3)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {947#(<= main_~b~0 3)} is VALID [2022-04-27 22:33:39,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {947#(<= main_~b~0 3)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {948#(<= main_~b~0 4)} is VALID [2022-04-27 22:33:39,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {948#(<= main_~b~0 4)} [59] L21-3-->L20-2: Formula: (not (< v_main_~b~0_5 6)) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {940#false} is VALID [2022-04-27 22:33:39,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {940#false} [64] L20-2-->L20-3: Formula: (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {940#false} is VALID [2022-04-27 22:33:39,881 INFO L290 TraceCheckUtils]: 17: Hoare triple {940#false} [55] L20-3-->L21-3: Formula: (and (< v_main_~a~0_6 6) (= v_main_~b~0_4 0)) InVars {main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~b~0] {940#false} is VALID [2022-04-27 22:33:39,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {940#false} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {940#false} is VALID [2022-04-27 22:33:39,881 INFO L290 TraceCheckUtils]: 19: Hoare triple {940#false} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {940#false} is VALID [2022-04-27 22:33:39,881 INFO L290 TraceCheckUtils]: 20: Hoare triple {940#false} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {940#false} is VALID [2022-04-27 22:33:39,881 INFO L290 TraceCheckUtils]: 21: Hoare triple {940#false} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {940#false} is VALID [2022-04-27 22:33:39,881 INFO L290 TraceCheckUtils]: 22: Hoare triple {940#false} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {940#false} is VALID [2022-04-27 22:33:39,882 INFO L290 TraceCheckUtils]: 23: Hoare triple {940#false} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {940#false} is VALID [2022-04-27 22:33:39,882 INFO L290 TraceCheckUtils]: 24: Hoare triple {940#false} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {940#false} is VALID [2022-04-27 22:33:39,883 INFO L290 TraceCheckUtils]: 25: Hoare triple {940#false} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {940#false} is VALID [2022-04-27 22:33:39,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {940#false} [59] L21-3-->L20-2: Formula: (not (< v_main_~b~0_5 6)) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {940#false} is VALID [2022-04-27 22:33:39,883 INFO L290 TraceCheckUtils]: 27: Hoare triple {940#false} [64] L20-2-->L20-3: Formula: (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {940#false} is VALID [2022-04-27 22:33:39,884 INFO L290 TraceCheckUtils]: 28: Hoare triple {940#false} [55] L20-3-->L21-3: Formula: (and (< v_main_~a~0_6 6) (= v_main_~b~0_4 0)) InVars {main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~b~0] {940#false} is VALID [2022-04-27 22:33:39,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {940#false} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {940#false} is VALID [2022-04-27 22:33:39,884 INFO L290 TraceCheckUtils]: 30: Hoare triple {940#false} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {940#false} is VALID [2022-04-27 22:33:39,886 INFO L290 TraceCheckUtils]: 31: Hoare triple {940#false} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {940#false} is VALID [2022-04-27 22:33:39,886 INFO L290 TraceCheckUtils]: 32: Hoare triple {940#false} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {940#false} is VALID [2022-04-27 22:33:39,887 INFO L290 TraceCheckUtils]: 33: Hoare triple {940#false} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {940#false} is VALID [2022-04-27 22:33:39,887 INFO L290 TraceCheckUtils]: 34: Hoare triple {940#false} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {940#false} is VALID [2022-04-27 22:33:39,887 INFO L290 TraceCheckUtils]: 35: Hoare triple {940#false} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {940#false} is VALID [2022-04-27 22:33:39,888 INFO L290 TraceCheckUtils]: 36: Hoare triple {940#false} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {940#false} is VALID [2022-04-27 22:33:39,888 INFO L290 TraceCheckUtils]: 37: Hoare triple {940#false} [59] L21-3-->L20-2: Formula: (not (< v_main_~b~0_5 6)) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {940#false} is VALID [2022-04-27 22:33:39,888 INFO L290 TraceCheckUtils]: 38: Hoare triple {940#false} [64] L20-2-->L20-3: Formula: (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {940#false} is VALID [2022-04-27 22:33:39,888 INFO L290 TraceCheckUtils]: 39: Hoare triple {940#false} [55] L20-3-->L21-3: Formula: (and (< v_main_~a~0_6 6) (= v_main_~b~0_4 0)) InVars {main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~b~0] {940#false} is VALID [2022-04-27 22:33:39,888 INFO L290 TraceCheckUtils]: 40: Hoare triple {940#false} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {940#false} is VALID [2022-04-27 22:33:39,888 INFO L290 TraceCheckUtils]: 41: Hoare triple {940#false} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {940#false} is VALID [2022-04-27 22:33:39,888 INFO L290 TraceCheckUtils]: 42: Hoare triple {940#false} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {940#false} is VALID [2022-04-27 22:33:39,888 INFO L290 TraceCheckUtils]: 43: Hoare triple {940#false} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {940#false} is VALID [2022-04-27 22:33:39,889 INFO L290 TraceCheckUtils]: 44: Hoare triple {940#false} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {940#false} is VALID [2022-04-27 22:33:39,889 INFO L290 TraceCheckUtils]: 45: Hoare triple {940#false} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {940#false} is VALID [2022-04-27 22:33:39,889 INFO L290 TraceCheckUtils]: 46: Hoare triple {940#false} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {940#false} is VALID [2022-04-27 22:33:39,889 INFO L290 TraceCheckUtils]: 47: Hoare triple {940#false} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {940#false} is VALID [2022-04-27 22:33:39,889 INFO L290 TraceCheckUtils]: 48: Hoare triple {940#false} [59] L21-3-->L20-2: Formula: (not (< v_main_~b~0_5 6)) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {940#false} is VALID [2022-04-27 22:33:39,889 INFO L290 TraceCheckUtils]: 49: Hoare triple {940#false} [64] L20-2-->L20-3: Formula: (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {940#false} is VALID [2022-04-27 22:33:39,892 INFO L290 TraceCheckUtils]: 50: Hoare triple {940#false} [54] L20-3-->L20-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {940#false} is VALID [2022-04-27 22:33:39,894 INFO L290 TraceCheckUtils]: 51: Hoare triple {940#false} [56] L20-4-->L26: Formula: (or (not (= v_main_~a~0_1 6)) (not (= v_main_~b~0_1 6))) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {940#false} is VALID [2022-04-27 22:33:39,895 INFO L290 TraceCheckUtils]: 52: Hoare triple {940#false} [61] L26-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {940#false} is VALID [2022-04-27 22:33:39,896 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 127 proven. 16 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-04-27 22:33:39,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:33:39,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504215650] [2022-04-27 22:33:39,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504215650] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:33:39,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254718673] [2022-04-27 22:33:39,896 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 22:33:39,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:33:39,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:33:39,897 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:33:39,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 22:33:39,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-27 22:33:39,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 22:33:39,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 22:33:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:33:39,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:33:40,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {939#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {939#true} is VALID [2022-04-27 22:33:40,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {939#true} [49] 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) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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] {939#true} is VALID [2022-04-27 22:33:40,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {939#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {939#true} is VALID [2022-04-27 22:33:40,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {939#true} {939#true} [67] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {939#true} is VALID [2022-04-27 22:33:40,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {939#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {939#true} is VALID [2022-04-27 22:33:40,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {939#true} [51] mainENTRY-->L20-3: Formula: (and (= v_main_~b~0_2 6) (= v_main_~a~0_2 0)) InVars {} OutVars{main_~b~0=v_main_~b~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~b~0, main_~a~0] {939#true} is VALID [2022-04-27 22:33:40,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {939#true} [55] L20-3-->L21-3: Formula: (and (< v_main_~a~0_6 6) (= v_main_~b~0_4 0)) InVars {main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~b~0] {939#true} is VALID [2022-04-27 22:33:40,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {939#true} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {939#true} is VALID [2022-04-27 22:33:40,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {939#true} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {939#true} is VALID [2022-04-27 22:33:40,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {939#true} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {939#true} is VALID [2022-04-27 22:33:40,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {939#true} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {939#true} is VALID [2022-04-27 22:33:40,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {939#true} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {939#true} is VALID [2022-04-27 22:33:40,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {939#true} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {939#true} is VALID [2022-04-27 22:33:40,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {939#true} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {939#true} is VALID [2022-04-27 22:33:40,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {939#true} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {939#true} is VALID [2022-04-27 22:33:40,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {939#true} [59] L21-3-->L20-2: Formula: (not (< v_main_~b~0_5 6)) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {939#true} is VALID [2022-04-27 22:33:40,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {939#true} [64] L20-2-->L20-3: Formula: (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {939#true} is VALID [2022-04-27 22:33:40,356 INFO L290 TraceCheckUtils]: 17: Hoare triple {939#true} [55] L20-3-->L21-3: Formula: (and (< v_main_~a~0_6 6) (= v_main_~b~0_4 0)) InVars {main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~b~0] {939#true} is VALID [2022-04-27 22:33:40,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {939#true} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {939#true} is VALID [2022-04-27 22:33:40,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {939#true} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {939#true} is VALID [2022-04-27 22:33:40,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {939#true} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {939#true} is VALID [2022-04-27 22:33:40,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {939#true} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {939#true} is VALID [2022-04-27 22:33:40,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {939#true} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {939#true} is VALID [2022-04-27 22:33:40,357 INFO L290 TraceCheckUtils]: 23: Hoare triple {939#true} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {939#true} is VALID [2022-04-27 22:33:40,357 INFO L290 TraceCheckUtils]: 24: Hoare triple {939#true} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {939#true} is VALID [2022-04-27 22:33:40,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {939#true} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {939#true} is VALID [2022-04-27 22:33:40,358 INFO L290 TraceCheckUtils]: 26: Hoare triple {939#true} [59] L21-3-->L20-2: Formula: (not (< v_main_~b~0_5 6)) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {939#true} is VALID [2022-04-27 22:33:40,358 INFO L290 TraceCheckUtils]: 27: Hoare triple {939#true} [64] L20-2-->L20-3: Formula: (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {939#true} is VALID [2022-04-27 22:33:40,358 INFO L290 TraceCheckUtils]: 28: Hoare triple {939#true} [55] L20-3-->L21-3: Formula: (and (< v_main_~a~0_6 6) (= v_main_~b~0_4 0)) InVars {main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~b~0] {939#true} is VALID [2022-04-27 22:33:40,358 INFO L290 TraceCheckUtils]: 29: Hoare triple {939#true} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {939#true} is VALID [2022-04-27 22:33:40,358 INFO L290 TraceCheckUtils]: 30: Hoare triple {939#true} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {939#true} is VALID [2022-04-27 22:33:40,358 INFO L290 TraceCheckUtils]: 31: Hoare triple {939#true} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {939#true} is VALID [2022-04-27 22:33:40,359 INFO L290 TraceCheckUtils]: 32: Hoare triple {939#true} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {939#true} is VALID [2022-04-27 22:33:40,359 INFO L290 TraceCheckUtils]: 33: Hoare triple {939#true} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {939#true} is VALID [2022-04-27 22:33:40,359 INFO L290 TraceCheckUtils]: 34: Hoare triple {939#true} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {939#true} is VALID [2022-04-27 22:33:40,359 INFO L290 TraceCheckUtils]: 35: Hoare triple {939#true} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {939#true} is VALID [2022-04-27 22:33:40,359 INFO L290 TraceCheckUtils]: 36: Hoare triple {939#true} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {939#true} is VALID [2022-04-27 22:33:40,359 INFO L290 TraceCheckUtils]: 37: Hoare triple {939#true} [59] L21-3-->L20-2: Formula: (not (< v_main_~b~0_5 6)) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {939#true} is VALID [2022-04-27 22:33:40,359 INFO L290 TraceCheckUtils]: 38: Hoare triple {939#true} [64] L20-2-->L20-3: Formula: (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {939#true} is VALID [2022-04-27 22:33:40,361 INFO L290 TraceCheckUtils]: 39: Hoare triple {939#true} [55] L20-3-->L21-3: Formula: (and (< v_main_~a~0_6 6) (= v_main_~b~0_4 0)) InVars {main_~a~0=v_main_~a~0_6} OutVars{main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~b~0] {1070#(< main_~a~0 6)} is VALID [2022-04-27 22:33:40,362 INFO L290 TraceCheckUtils]: 40: Hoare triple {1070#(< main_~a~0 6)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {1070#(< main_~a~0 6)} is VALID [2022-04-27 22:33:40,363 INFO L290 TraceCheckUtils]: 41: Hoare triple {1070#(< main_~a~0 6)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {1070#(< main_~a~0 6)} is VALID [2022-04-27 22:33:40,365 INFO L290 TraceCheckUtils]: 42: Hoare triple {1070#(< main_~a~0 6)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {1070#(< main_~a~0 6)} is VALID [2022-04-27 22:33:40,366 INFO L290 TraceCheckUtils]: 43: Hoare triple {1070#(< main_~a~0 6)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {1070#(< main_~a~0 6)} is VALID [2022-04-27 22:33:40,366 INFO L290 TraceCheckUtils]: 44: Hoare triple {1070#(< main_~a~0 6)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {1070#(< main_~a~0 6)} is VALID [2022-04-27 22:33:40,366 INFO L290 TraceCheckUtils]: 45: Hoare triple {1070#(< main_~a~0 6)} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {1070#(< main_~a~0 6)} is VALID [2022-04-27 22:33:40,367 INFO L290 TraceCheckUtils]: 46: Hoare triple {1070#(< main_~a~0 6)} [60] L21-3-->L21-2: Formula: (< v_main_~b~0_6 6) InVars {main_~b~0=v_main_~b~0_6} OutVars{main_~b~0=v_main_~b~0_6} AuxVars[] AssignedVars[] {1092#(and (< main_~b~0 6) (< main_~a~0 6))} is VALID [2022-04-27 22:33:40,368 INFO L290 TraceCheckUtils]: 47: Hoare triple {1092#(and (< main_~b~0 6) (< main_~a~0 6))} [65] L21-2-->L21-3: Formula: (= (+ v_main_~b~0_8 1) v_main_~b~0_7) InVars {main_~b~0=v_main_~b~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_#t~pre5=|v_main_#t~pre5_1|} AuxVars[] AssignedVars[main_~b~0, main_#t~pre5] {1096#(and (< main_~b~0 7) (< main_~a~0 6))} is VALID [2022-04-27 22:33:40,369 INFO L290 TraceCheckUtils]: 48: Hoare triple {1096#(and (< main_~b~0 7) (< main_~a~0 6))} [59] L21-3-->L20-2: Formula: (not (< v_main_~b~0_5 6)) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {1100#(and (< main_~b~0 7) (< main_~a~0 6) (not (< main_~b~0 6)))} is VALID [2022-04-27 22:33:40,369 INFO L290 TraceCheckUtils]: 49: Hoare triple {1100#(and (< main_~b~0 7) (< main_~a~0 6) (not (< main_~b~0 6)))} [64] L20-2-->L20-3: Formula: (= v_main_~a~0_7 (+ v_main_~a~0_8 1)) InVars {main_~a~0=v_main_~a~0_8} OutVars{main_#t~pre4=|v_main_#t~pre4_1|, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {1104#(and (< main_~a~0 7) (< main_~b~0 7) (not (< main_~b~0 6)))} is VALID [2022-04-27 22:33:40,370 INFO L290 TraceCheckUtils]: 50: Hoare triple {1104#(and (< main_~a~0 7) (< main_~b~0 7) (not (< main_~b~0 6)))} [54] L20-3-->L20-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {1108#(and (< main_~a~0 7) (< main_~b~0 7) (not (< main_~b~0 6)) (not (< main_~a~0 6)))} is VALID [2022-04-27 22:33:40,371 INFO L290 TraceCheckUtils]: 51: Hoare triple {1108#(and (< main_~a~0 7) (< main_~b~0 7) (not (< main_~b~0 6)) (not (< main_~a~0 6)))} [56] L20-4-->L26: Formula: (or (not (= v_main_~a~0_1 6)) (not (= v_main_~b~0_1 6))) InVars {main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[] {940#false} is VALID [2022-04-27 22:33:40,371 INFO L290 TraceCheckUtils]: 52: Hoare triple {940#false} [61] L26-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {940#false} is VALID [2022-04-27 22:33:40,371 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-04-27 22:33:40,371 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 22:33:40,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254718673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:33:40,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 22:33:40,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2022-04-27 22:33:40,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806122784] [2022-04-27 22:33:40,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:33:40,373 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-27 22:33:40,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:33:40,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:40,387 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-27 22:33:40,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 22:33:40,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:33:40,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 22:33:40,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-27 22:33:40,389 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:40,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:33:40,512 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2022-04-27 22:33:40,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 22:33:40,513 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-27 22:33:40,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:33:40,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:40,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2022-04-27 22:33:40,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:40,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2022-04-27 22:33:40,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 16 transitions. [2022-04-27 22:33:40,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:33:40,532 INFO L225 Difference]: With dead ends: 54 [2022-04-27 22:33:40,532 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 22:33:40,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-27 22:33:40,535 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:33:40,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 36 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:33:40,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 22:33:40,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 22:33:40,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:33:40,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 22:33:40,537 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 22:33:40,537 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 22:33:40,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:33:40,538 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 22:33:40,538 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:33:40,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:33:40,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:33:40,538 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 22:33:40,538 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 22:33:40,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:33:40,538 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 22:33:40,538 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:33:40,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:33:40,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:33:40,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:33:40,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:33:40,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 22:33:40,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 22:33:40,539 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2022-04-27 22:33:40,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:33:40,539 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 22:33:40,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:33:40,539 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:33:40,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:33:40,542 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 22:33:40,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 22:33:40,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:33:40,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 22:33:40,951 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 22:33:40,951 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 22:33:40,951 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 22:33:40,951 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 22:33:40,951 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 22:33:40,952 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 22:33:40,952 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 22:33:40,952 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 15 29) the Hoare annotation is: true [2022-04-27 22:33:40,952 INFO L895 garLoopResultBuilder]: At program point L20-3(lines 20 24) the Hoare annotation is: (and (< main_~a~0 7) (< main_~b~0 7) (not (< main_~b~0 6))) [2022-04-27 22:33:40,952 INFO L899 garLoopResultBuilder]: For program point L20-4(lines 15 29) no Hoare annotation was computed. [2022-04-27 22:33:40,952 INFO L895 garLoopResultBuilder]: At program point L21-3(lines 21 23) the Hoare annotation is: (and (< main_~b~0 7) (< main_~a~0 6)) [2022-04-27 22:33:40,952 INFO L899 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2022-04-27 22:33:40,952 INFO L899 garLoopResultBuilder]: For program point L25-1(lines 25 27) no Hoare annotation was computed. [2022-04-27 22:33:40,952 INFO L899 garLoopResultBuilder]: For program point L20-2(lines 20 24) no Hoare annotation was computed. [2022-04-27 22:33:40,952 INFO L899 garLoopResultBuilder]: For program point L21-2(lines 21 23) no Hoare annotation was computed. [2022-04-27 22:33:40,952 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 26) no Hoare annotation was computed. [2022-04-27 22:33:40,952 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 15 29) no Hoare annotation was computed. [2022-04-27 22:33:40,952 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 15 29) no Hoare annotation was computed. [2022-04-27 22:33:40,955 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2022-04-27 22:33:40,956 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 22:33:40,960 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 22:33:40,960 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 22:33:40,960 WARN L170 areAnnotationChecker]: L20-4 has no Hoare annotation [2022-04-27 22:33:40,961 WARN L170 areAnnotationChecker]: L20-4 has no Hoare annotation [2022-04-27 22:33:40,962 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 22:33:40,962 WARN L170 areAnnotationChecker]: L20-4 has no Hoare annotation [2022-04-27 22:33:40,962 WARN L170 areAnnotationChecker]: L20-4 has no Hoare annotation [2022-04-27 22:33:40,962 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2022-04-27 22:33:40,962 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2022-04-27 22:33:40,962 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-04-27 22:33:40,962 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 22:33:40,962 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 22:33:40,963 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-27 22:33:40,963 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2022-04-27 22:33:40,963 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-04-27 22:33:40,963 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 22:33:40,963 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 22:33:40,963 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 22:33:40,963 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 22:33:40,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:33:40 BasicIcfg [2022-04-27 22:33:40,973 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 22:33:40,974 INFO L158 Benchmark]: Toolchain (without parser) took 4375.61ms. Allocated memory was 173.0MB in the beginning and 219.2MB in the end (delta: 46.1MB). Free memory was 120.5MB in the beginning and 133.7MB in the end (delta: -13.2MB). Peak memory consumption was 33.2MB. Max. memory is 8.0GB. [2022-04-27 22:33:40,974 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 173.0MB. Free memory is still 137.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 22:33:40,974 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.57ms. Allocated memory is still 173.0MB. Free memory was 120.3MB in the beginning and 148.6MB in the end (delta: -28.3MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2022-04-27 22:33:40,974 INFO L158 Benchmark]: Boogie Preprocessor took 28.74ms. Allocated memory is still 173.0MB. Free memory was 148.6MB in the beginning and 147.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 22:33:40,975 INFO L158 Benchmark]: RCFGBuilder took 213.82ms. Allocated memory is still 173.0MB. Free memory was 147.3MB in the beginning and 137.1MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-27 22:33:40,975 INFO L158 Benchmark]: IcfgTransformer took 20.83ms. Allocated memory is still 173.0MB. Free memory was 137.1MB in the beginning and 135.7MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 22:33:40,975 INFO L158 Benchmark]: TraceAbstraction took 3902.38ms. Allocated memory was 173.0MB in the beginning and 219.2MB in the end (delta: 46.1MB). Free memory was 135.2MB in the beginning and 133.7MB in the end (delta: 1.5MB). Peak memory consumption was 48.2MB. Max. memory is 8.0GB. [2022-04-27 22:33:40,977 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 173.0MB. Free memory is still 137.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 204.57ms. Allocated memory is still 173.0MB. Free memory was 120.3MB in the beginning and 148.6MB in the end (delta: -28.3MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.74ms. Allocated memory is still 173.0MB. Free memory was 148.6MB in the beginning and 147.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 213.82ms. Allocated memory is still 173.0MB. Free memory was 147.3MB in the beginning and 137.1MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * IcfgTransformer took 20.83ms. Allocated memory is still 173.0MB. Free memory was 137.1MB in the beginning and 135.7MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 3902.38ms. Allocated memory was 173.0MB in the beginning and 219.2MB in the end (delta: 46.1MB). Free memory was 135.2MB in the beginning and 133.7MB in the end (delta: 1.5MB). Peak memory consumption was 48.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 26]: 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 3 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 6, TraceHistogramMax: 16, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 107 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 107 mSDsluCounter, 144 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 107 IncrementalHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 73 mSDtfsCounter, 107 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=5, InterpolantAutomatonStates: 32, 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, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 31 NumberOfFragments, 28 HoareAnnotationTreeSize, 6 FomulaSimplifications, 109 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 175 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 204 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 227 ConstructedInterpolants, 0 QuantifiedInterpolants, 435 SizeOfPredicates, 2 NumberOfNonLiveVariables, 201 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 688/710 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: 21]: Loop Invariant Derived loop invariant: b < 7 && a < 6 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (a < 7 && b < 7) && !(b < 6) RESULT: Ultimate proved your program to be correct! [2022-04-27 22:33:41,020 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...