/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-lit/hhk2008.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:41:50,877 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:41:50,879 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:41:50,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:41:50,908 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:41:50,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:41:50,912 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:41:50,913 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:41:50,914 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:41:50,918 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:41:50,919 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:41:50,922 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:41:50,922 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:41:50,924 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:41:50,925 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:41:50,926 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:41:50,926 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:41:50,927 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:41:50,928 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:41:50,929 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:41:50,930 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:41:50,934 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:41:50,934 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:41:50,935 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:41:50,936 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:41:50,938 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:41:50,938 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:41:50,938 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:41:50,939 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:41:50,939 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:41:50,940 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:41:50,940 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:41:50,940 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:41:50,941 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:41:50,941 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:41:50,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:41:50,942 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:41:50,943 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:41:50,943 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:41:50,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:41:50,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:41:50,952 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:41:50,952 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 21:41:50,979 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:41:50,980 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:41:50,980 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:41:50,980 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:41:50,981 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:41:50,981 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:41:50,983 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:41:50,984 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:41:50,984 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:41:50,984 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:41:50,985 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:41:50,985 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:41:50,985 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:41:50,985 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:41:50,985 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:41:50,985 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:41:50,985 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:41:50,986 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:41:50,986 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:41:50,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:41:50,986 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:41:50,986 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:41:50,986 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:41:50,986 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:41:50,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:41:50,987 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:41:50,987 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:41:50,987 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:41:50,988 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:41:50,988 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 21:41:51,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:41:51,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:41:51,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:41:51,233 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:41:51,233 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:41:51,234 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/hhk2008.i [2022-04-27 21:41:51,297 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cb4f8eeb/4bb705bc3f6242379a1af1a9e436f85c/FLAGd8fad0918 [2022-04-27 21:41:51,654 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:41:51,655 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/hhk2008.i [2022-04-27 21:41:51,661 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cb4f8eeb/4bb705bc3f6242379a1af1a9e436f85c/FLAGd8fad0918 [2022-04-27 21:41:51,678 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cb4f8eeb/4bb705bc3f6242379a1af1a9e436f85c [2022-04-27 21:41:51,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:41:51,682 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:41:51,684 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:41:51,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:41:51,687 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:41:51,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:41:51" (1/1) ... [2022-04-27 21:41:51,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b76f3a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:51, skipping insertion in model container [2022-04-27 21:41:51,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:41:51" (1/1) ... [2022-04-27 21:41:51,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:41:51,708 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:41:51,846 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-lit/hhk2008.i[895,908] [2022-04-27 21:41:51,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:41:51,878 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:41:51,893 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-lit/hhk2008.i[895,908] [2022-04-27 21:41:51,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:41:51,914 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:41:51,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:51 WrapperNode [2022-04-27 21:41:51,915 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:41:51,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:41:51,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:41:51,916 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:41:51,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:51" (1/1) ... [2022-04-27 21:41:51,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:51" (1/1) ... [2022-04-27 21:41:51,930 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:51" (1/1) ... [2022-04-27 21:41:51,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:51" (1/1) ... [2022-04-27 21:41:51,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:51" (1/1) ... [2022-04-27 21:41:51,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:51" (1/1) ... [2022-04-27 21:41:51,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:51" (1/1) ... [2022-04-27 21:41:51,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:41:51,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:41:51,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:41:51,946 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:41:51,949 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:51" (1/1) ... [2022-04-27 21:41:51,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:41:51,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:41:51,971 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 21:41:51,973 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 21:41:52,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:41:52,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:41:52,004 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:41:52,005 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 21:41:52,005 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 21:41:52,005 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:41:52,005 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:41:52,005 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:41:52,005 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 21:41:52,005 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 21:41:52,005 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:41:52,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:41:52,006 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 21:41:52,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:41:52,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 21:41:52,006 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:41:52,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:41:52,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:41:52,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:41:52,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:41:52,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:41:52,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:41:52,064 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:41:52,065 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:41:52,168 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:41:52,174 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:41:52,174 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 21:41:52,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:41:52 BoogieIcfgContainer [2022-04-27 21:41:52,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:41:52,176 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:41:52,176 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:41:52,177 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:41:52,180 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:41:52" (1/1) ... [2022-04-27 21:41:52,181 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:41:52,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:41:52 BasicIcfg [2022-04-27 21:41:52,203 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:41:52,204 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:41:52,204 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:41:52,207 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:41:52,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:41:51" (1/4) ... [2022-04-27 21:41:52,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ab76edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:41:52, skipping insertion in model container [2022-04-27 21:41:52,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:51" (2/4) ... [2022-04-27 21:41:52,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ab76edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:41:52, skipping insertion in model container [2022-04-27 21:41:52,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:41:52" (3/4) ... [2022-04-27 21:41:52,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ab76edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:41:52, skipping insertion in model container [2022-04-27 21:41:52,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:41:52" (4/4) ... [2022-04-27 21:41:52,209 INFO L111 eAbstractionObserver]: Analyzing ICFG hhk2008.iqvasr [2022-04-27 21:41:52,220 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:41:52,220 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:41:52,281 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:41:52,304 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@63aa91b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7158ab70 [2022-04-27 21:41:52,304 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:41:52,310 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:41:52,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 21:41:52,315 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:41:52,316 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:41:52,316 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:41:52,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:41:52,321 INFO L85 PathProgramCache]: Analyzing trace with hash 96256690, now seen corresponding path program 1 times [2022-04-27 21:41:52,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:41:52,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553228623] [2022-04-27 21:41:52,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:41:52,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:41:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:52,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:41:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:52,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [63] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {24#true} is VALID [2022-04-27 21:41:52,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} [66] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 21:41:52,509 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 21:41:52,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} [61] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:41:52,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [63] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {24#true} is VALID [2022-04-27 21:41:52,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} [66] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 21:41:52,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 21:41:52,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} [62] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 21:41:52,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} [65] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~b~0_4 |v_main_#t~nondet2_2|) (= v_main_~a~0_5 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~res~0=v_main_~res~0_5, main_~cnt~0=v_main_~cnt~0_5, main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~res~0, main_~cnt~0, main_#t~nondet1, main_#t~nondet2, main_~b~0, main_~a~0] {24#true} is VALID [2022-04-27 21:41:52,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} [68] L28-->L29: Formula: (<= v_main_~a~0_2 1000000) InVars {main_~a~0=v_main_~a~0_2} OutVars{main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 21:41:52,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#true} [71] L29-->L32-2: Formula: (and (<= v_main_~b~0_3 1000000) (= v_main_~b~0_3 v_main_~cnt~0_3) (<= 0 v_main_~b~0_3) (= v_main_~a~0_4 v_main_~res~0_4)) InVars {main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_4} OutVars{main_~res~0=v_main_~res~0_4, main_~cnt~0=v_main_~cnt~0_3, main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~res~0, main_~cnt~0] {24#true} is VALID [2022-04-27 21:41:52,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#true} [72] L32-2-->L32-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 21:41:52,514 INFO L272 TraceCheckUtils]: 9: Hoare triple {25#false} [75] L32-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~a~0_6 v_main_~b~0_5) v_main_~res~0_6) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~res~0=v_main_~res~0_6, main_~b~0=v_main_~b~0_5, main_~a~0=v_main_~a~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~res~0, __VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {25#false} is VALID [2022-04-27 21:41:52,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} [77] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {25#false} is VALID [2022-04-27 21:41:52,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} [78] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 21:41:52,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {25#false} [80] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 21:41:52,515 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 21:41:52,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:41:52,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553228623] [2022-04-27 21:41:52,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553228623] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:41:52,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:41:52,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 21:41:52,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609671532] [2022-04-27 21:41:52,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:41:52,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 21:41:52,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:41:52,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:52,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:41:52,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 21:41:52,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:41:52,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 21:41:52,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:41:52,581 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:52,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:52,672 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-27 21:41:52,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 21:41:52,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 21:41:52,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:41:52,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:52,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-04-27 21:41:52,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:52,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-04-27 21:41:52,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2022-04-27 21:41:52,725 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 21:41:52,732 INFO L225 Difference]: With dead ends: 33 [2022-04-27 21:41:52,733 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 21:41:52,735 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 21:41:52,739 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:41:52,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:41:52,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 21:41:52,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 21:41:52,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:41:52,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:52,761 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:52,761 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:52,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:52,767 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 21:41:52,767 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 21:41:52,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:41:52,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:41:52,768 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 21:41:52,768 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 21:41:52,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:52,770 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 21:41:52,770 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 21:41:52,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:41:52,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:41:52,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:41:52,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:41:52,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:52,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-27 21:41:52,773 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 13 [2022-04-27 21:41:52,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:41:52,773 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-27 21:41:52,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:52,774 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 21:41:52,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 21:41:52,774 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:41:52,775 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:41:52,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:41:52,778 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:41:52,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:41:52,779 INFO L85 PathProgramCache]: Analyzing trace with hash 97180211, now seen corresponding path program 1 times [2022-04-27 21:41:52,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:41:52,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932592493] [2022-04-27 21:41:52,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:41:52,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:41:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:52,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:41:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:52,947 INFO L290 TraceCheckUtils]: 0: Hoare triple {132#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [63] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {123#true} is VALID [2022-04-27 21:41:52,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {123#true} [66] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-27 21:41:52,947 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {123#true} {123#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-27 21:41:52,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {123#true} [61] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {132#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:41:52,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {132#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [63] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {123#true} is VALID [2022-04-27 21:41:52,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {123#true} [66] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-27 21:41:52,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123#true} {123#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-27 21:41:52,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {123#true} [62] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-27 21:41:52,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {123#true} [65] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~b~0_4 |v_main_#t~nondet2_2|) (= v_main_~a~0_5 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~res~0=v_main_~res~0_5, main_~cnt~0=v_main_~cnt~0_5, main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~res~0, main_~cnt~0, main_#t~nondet1, main_#t~nondet2, main_~b~0, main_~a~0] {123#true} is VALID [2022-04-27 21:41:52,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {123#true} [68] L28-->L29: Formula: (<= v_main_~a~0_2 1000000) InVars {main_~a~0=v_main_~a~0_2} OutVars{main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-27 21:41:52,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {123#true} [71] L29-->L32-2: Formula: (and (<= v_main_~b~0_3 1000000) (= v_main_~b~0_3 v_main_~cnt~0_3) (<= 0 v_main_~b~0_3) (= v_main_~a~0_4 v_main_~res~0_4)) InVars {main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_4} OutVars{main_~res~0=v_main_~res~0_4, main_~cnt~0=v_main_~cnt~0_3, main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~res~0, main_~cnt~0] {128#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (or (<= (+ main_~b~0 main_~a~0) main_~res~0) (<= (+ main_~b~0 main_~a~0) (+ main_~cnt~0 main_~res~0))))} is VALID [2022-04-27 21:41:52,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {128#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (or (<= (+ main_~b~0 main_~a~0) main_~res~0) (<= (+ main_~b~0 main_~a~0) (+ main_~cnt~0 main_~res~0))))} [73] L32-2-->L32-3: Formula: (not (< 0 v_main_~cnt~0_4)) InVars {main_~cnt~0=v_main_~cnt~0_4} OutVars{main_~cnt~0=v_main_~cnt~0_4} AuxVars[] AssignedVars[] {129#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0))} is VALID [2022-04-27 21:41:52,953 INFO L272 TraceCheckUtils]: 9: Hoare triple {129#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0))} [75] L32-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~a~0_6 v_main_~b~0_5) v_main_~res~0_6) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~res~0=v_main_~res~0_6, main_~b~0=v_main_~b~0_5, main_~a~0=v_main_~a~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~res~0, __VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {130#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:41:52,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {130#(not (= |__VERIFIER_assert_#in~cond| 0))} [77] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {131#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:41:52,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {131#(not (= __VERIFIER_assert_~cond 0))} [78] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {124#false} is VALID [2022-04-27 21:41:52,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {124#false} [80] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#false} is VALID [2022-04-27 21:41:52,955 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 21:41:52,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:41:52,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932592493] [2022-04-27 21:41:52,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932592493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:41:52,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:41:52,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 21:41:52,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267242959] [2022-04-27 21:41:52,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:41:52,957 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 21:41:52,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:41:52,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:52,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:41:52,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:41:52,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:41:52,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:41:52,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:41:52,972 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:53,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:53,142 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-27 21:41:53,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:41:53,142 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 21:41:53,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:41:53,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:53,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2022-04-27 21:41:53,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:53,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2022-04-27 21:41:53,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 20 transitions. [2022-04-27 21:41:53,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:41:53,176 INFO L225 Difference]: With dead ends: 20 [2022-04-27 21:41:53,176 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 21:41:53,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-04-27 21:41:53,182 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:41:53,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 28 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:41:53,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 21:41:53,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 21:41:53,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:41:53,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:53,192 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:53,193 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:53,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:53,195 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 21:41:53,195 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 21:41:53,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:41:53,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:41:53,197 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 21:41:53,198 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 21:41:53,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:53,200 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 21:41:53,200 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 21:41:53,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:41:53,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:41:53,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:41:53,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:41:53,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:53,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-27 21:41:53,203 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-27 21:41:53,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:41:53,204 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-27 21:41:53,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:53,204 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 21:41:53,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 21:41:53,205 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:41:53,205 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:41:53,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:41:53,205 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:41:53,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:41:53,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1255659171, now seen corresponding path program 1 times [2022-04-27 21:41:53,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:41:53,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692848718] [2022-04-27 21:41:53,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:41:53,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:41:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:53,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:41:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:53,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {236#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [63] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {226#true} is VALID [2022-04-27 21:41:53,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {226#true} [66] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 21:41:53,421 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {226#true} {226#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 21:41:53,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {226#true} [61] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {236#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:41:53,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [63] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {226#true} is VALID [2022-04-27 21:41:53,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {226#true} [66] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 21:41:53,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {226#true} {226#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 21:41:53,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {226#true} [62] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 21:41:53,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {226#true} [65] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~b~0_4 |v_main_#t~nondet2_2|) (= v_main_~a~0_5 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~res~0=v_main_~res~0_5, main_~cnt~0=v_main_~cnt~0_5, main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~res~0, main_~cnt~0, main_#t~nondet1, main_#t~nondet2, main_~b~0, main_~a~0] {226#true} is VALID [2022-04-27 21:41:53,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {226#true} [68] L28-->L29: Formula: (<= v_main_~a~0_2 1000000) InVars {main_~a~0=v_main_~a~0_2} OutVars{main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 21:41:53,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {226#true} [71] L29-->L32-2: Formula: (and (<= v_main_~b~0_3 1000000) (= v_main_~b~0_3 v_main_~cnt~0_3) (<= 0 v_main_~b~0_3) (= v_main_~a~0_4 v_main_~res~0_4)) InVars {main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_4} OutVars{main_~res~0=v_main_~res~0_4, main_~cnt~0=v_main_~cnt~0_3, main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~res~0, main_~cnt~0] {231#(and (<= (+ main_~b~0 main_~a~0) (+ main_~cnt~0 main_~res~0)) (<= (+ main_~cnt~0 main_~res~0) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-27 21:41:53,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {231#(and (<= (+ main_~b~0 main_~a~0) (+ main_~cnt~0 main_~res~0)) (<= (+ main_~cnt~0 main_~res~0) (+ main_~b~0 main_~a~0)))} [74] L32-2-->L32-2: Formula: (and (= v_main_~cnt~0_1 (+ (- 1) v_main_~cnt~0_2)) (< 0 v_main_~cnt~0_2) (= (+ v_main_~res~0_2 1) v_main_~res~0_1)) InVars {main_~res~0=v_main_~res~0_2, main_~cnt~0=v_main_~cnt~0_2} OutVars{main_~res~0=v_main_~res~0_1, main_~cnt~0=v_main_~cnt~0_1} AuxVars[] AssignedVars[main_~res~0, main_~cnt~0] {232#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (or (<= (+ main_~b~0 main_~a~0) main_~res~0) (<= (+ main_~b~0 main_~a~0) (+ main_~cnt~0 main_~res~0))))} is VALID [2022-04-27 21:41:53,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {232#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (or (<= (+ main_~b~0 main_~a~0) main_~res~0) (<= (+ main_~b~0 main_~a~0) (+ main_~cnt~0 main_~res~0))))} [73] L32-2-->L32-3: Formula: (not (< 0 v_main_~cnt~0_4)) InVars {main_~cnt~0=v_main_~cnt~0_4} OutVars{main_~cnt~0=v_main_~cnt~0_4} AuxVars[] AssignedVars[] {233#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0))} is VALID [2022-04-27 21:41:53,427 INFO L272 TraceCheckUtils]: 10: Hoare triple {233#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0))} [75] L32-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~a~0_6 v_main_~b~0_5) v_main_~res~0_6) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~res~0=v_main_~res~0_6, main_~b~0=v_main_~b~0_5, main_~a~0=v_main_~a~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~res~0, __VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {234#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:41:53,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {234#(not (= |__VERIFIER_assert_#in~cond| 0))} [77] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {235#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:41:53,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {235#(not (= __VERIFIER_assert_~cond 0))} [78] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {227#false} is VALID [2022-04-27 21:41:53,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {227#false} [80] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {227#false} is VALID [2022-04-27 21:41:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:41:53,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:41:53,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692848718] [2022-04-27 21:41:53,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692848718] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:41:53,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964870301] [2022-04-27 21:41:53,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:41:53,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:41:53,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:41:53,431 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 21:41:53,454 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 21:41:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:53,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 21:41:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:53,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:41:53,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {226#true} [61] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 21:41:53,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {226#true} [63] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {226#true} is VALID [2022-04-27 21:41:53,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {226#true} [66] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 21:41:53,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {226#true} {226#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 21:41:53,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {226#true} [62] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 21:41:53,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {226#true} [65] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~b~0_4 |v_main_#t~nondet2_2|) (= v_main_~a~0_5 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~res~0=v_main_~res~0_5, main_~cnt~0=v_main_~cnt~0_5, main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~res~0, main_~cnt~0, main_#t~nondet1, main_#t~nondet2, main_~b~0, main_~a~0] {226#true} is VALID [2022-04-27 21:41:53,779 INFO L290 TraceCheckUtils]: 6: Hoare triple {226#true} [68] L28-->L29: Formula: (<= v_main_~a~0_2 1000000) InVars {main_~a~0=v_main_~a~0_2} OutVars{main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 21:41:53,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {226#true} [71] L29-->L32-2: Formula: (and (<= v_main_~b~0_3 1000000) (= v_main_~b~0_3 v_main_~cnt~0_3) (<= 0 v_main_~b~0_3) (= v_main_~a~0_4 v_main_~res~0_4)) InVars {main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_4} OutVars{main_~res~0=v_main_~res~0_4, main_~cnt~0=v_main_~cnt~0_3, main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~res~0, main_~cnt~0] {261#(and (= main_~cnt~0 main_~b~0) (= main_~res~0 main_~a~0))} is VALID [2022-04-27 21:41:53,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {261#(and (= main_~cnt~0 main_~b~0) (= main_~res~0 main_~a~0))} [74] L32-2-->L32-2: Formula: (and (= v_main_~cnt~0_1 (+ (- 1) v_main_~cnt~0_2)) (< 0 v_main_~cnt~0_2) (= (+ v_main_~res~0_2 1) v_main_~res~0_1)) InVars {main_~res~0=v_main_~res~0_2, main_~cnt~0=v_main_~cnt~0_2} OutVars{main_~res~0=v_main_~res~0_1, main_~cnt~0=v_main_~cnt~0_1} AuxVars[] AssignedVars[main_~res~0, main_~cnt~0] {265#(and (= (+ (- 1) main_~res~0) main_~a~0) (<= main_~b~0 (+ main_~cnt~0 1)) (< 0 main_~b~0))} is VALID [2022-04-27 21:41:53,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {265#(and (= (+ (- 1) main_~res~0) main_~a~0) (<= main_~b~0 (+ main_~cnt~0 1)) (< 0 main_~b~0))} [73] L32-2-->L32-3: Formula: (not (< 0 v_main_~cnt~0_4)) InVars {main_~cnt~0=v_main_~cnt~0_4} OutVars{main_~cnt~0=v_main_~cnt~0_4} AuxVars[] AssignedVars[] {269#(and (= (+ (- 1) main_~res~0) main_~a~0) (<= main_~b~0 1) (< 0 main_~b~0))} is VALID [2022-04-27 21:41:53,782 INFO L272 TraceCheckUtils]: 10: Hoare triple {269#(and (= (+ (- 1) main_~res~0) main_~a~0) (<= main_~b~0 1) (< 0 main_~b~0))} [75] L32-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~a~0_6 v_main_~b~0_5) v_main_~res~0_6) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~res~0=v_main_~res~0_6, main_~b~0=v_main_~b~0_5, main_~a~0=v_main_~a~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~res~0, __VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {273#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:41:53,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {273#(<= 1 |__VERIFIER_assert_#in~cond|)} [77] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {277#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:41:53,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {277#(<= 1 __VERIFIER_assert_~cond)} [78] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {227#false} is VALID [2022-04-27 21:41:53,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {227#false} [80] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {227#false} is VALID [2022-04-27 21:41:53,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:41:53,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:41:53,959 INFO L290 TraceCheckUtils]: 13: Hoare triple {227#false} [80] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {227#false} is VALID [2022-04-27 21:41:53,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {277#(<= 1 __VERIFIER_assert_~cond)} [78] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {227#false} is VALID [2022-04-27 21:41:53,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {273#(<= 1 |__VERIFIER_assert_#in~cond|)} [77] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {277#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:41:53,962 INFO L272 TraceCheckUtils]: 10: Hoare triple {233#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0))} [75] L32-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~a~0_6 v_main_~b~0_5) v_main_~res~0_6) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~res~0=v_main_~res~0_6, main_~b~0=v_main_~b~0_5, main_~a~0=v_main_~a~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~res~0, __VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {273#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:41:53,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {296#(or (and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0)) (< 0 main_~cnt~0))} [73] L32-2-->L32-3: Formula: (not (< 0 v_main_~cnt~0_4)) InVars {main_~cnt~0=v_main_~cnt~0_4} OutVars{main_~cnt~0=v_main_~cnt~0_4} AuxVars[] AssignedVars[] {233#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0))} is VALID [2022-04-27 21:41:53,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {300#(or (< 1 main_~cnt~0) (not (< 0 main_~cnt~0)) (and (< main_~res~0 (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (+ main_~res~0 1))))} [74] L32-2-->L32-2: Formula: (and (= v_main_~cnt~0_1 (+ (- 1) v_main_~cnt~0_2)) (< 0 v_main_~cnt~0_2) (= (+ v_main_~res~0_2 1) v_main_~res~0_1)) InVars {main_~res~0=v_main_~res~0_2, main_~cnt~0=v_main_~cnt~0_2} OutVars{main_~res~0=v_main_~res~0_1, main_~cnt~0=v_main_~cnt~0_1} AuxVars[] AssignedVars[main_~res~0, main_~cnt~0] {296#(or (and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0)) (< 0 main_~cnt~0))} is VALID [2022-04-27 21:41:53,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {226#true} [71] L29-->L32-2: Formula: (and (<= v_main_~b~0_3 1000000) (= v_main_~b~0_3 v_main_~cnt~0_3) (<= 0 v_main_~b~0_3) (= v_main_~a~0_4 v_main_~res~0_4)) InVars {main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_4} OutVars{main_~res~0=v_main_~res~0_4, main_~cnt~0=v_main_~cnt~0_3, main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~res~0, main_~cnt~0] {300#(or (< 1 main_~cnt~0) (not (< 0 main_~cnt~0)) (and (< main_~res~0 (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (+ main_~res~0 1))))} is VALID [2022-04-27 21:41:53,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {226#true} [68] L28-->L29: Formula: (<= v_main_~a~0_2 1000000) InVars {main_~a~0=v_main_~a~0_2} OutVars{main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 21:41:53,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {226#true} [65] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~b~0_4 |v_main_#t~nondet2_2|) (= v_main_~a~0_5 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~res~0=v_main_~res~0_5, main_~cnt~0=v_main_~cnt~0_5, main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~res~0, main_~cnt~0, main_#t~nondet1, main_#t~nondet2, main_~b~0, main_~a~0] {226#true} is VALID [2022-04-27 21:41:53,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {226#true} [62] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 21:41:53,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {226#true} {226#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 21:41:53,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {226#true} [66] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 21:41:53,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {226#true} [63] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {226#true} is VALID [2022-04-27 21:41:53,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {226#true} [61] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 21:41:53,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:41:53,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964870301] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:41:53,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:41:53,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-04-27 21:41:53,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109389951] [2022-04-27 21:41:53,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:41:53,968 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (6), 4 states have call predecessors, (6), 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 21:41:53,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:41:53,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:53,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:41:53,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 21:41:53,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:41:53,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 21:41:53,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-04-27 21:41:53,989 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:54,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:54,313 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-27 21:41:54,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 21:41:54,313 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (6), 4 states have call predecessors, (6), 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 21:41:54,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:41:54,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:54,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2022-04-27 21:41:54,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:54,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2022-04-27 21:41:54,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 18 transitions. [2022-04-27 21:41:54,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:41:54,339 INFO L225 Difference]: With dead ends: 17 [2022-04-27 21:41:54,339 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 21:41:54,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2022-04-27 21:41:54,343 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 15 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:41:54,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 41 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:41:54,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 21:41:54,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 21:41:54,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:41:54,346 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 21:41:54,346 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 21:41:54,346 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 21:41:54,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:54,346 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:41:54,347 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:41:54,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:41:54,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:41:54,347 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 21:41:54,347 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 21:41:54,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:54,347 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:41:54,347 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:41:54,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:41:54,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:41:54,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:41:54,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:41:54,348 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 21:41:54,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 21:41:54,348 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-27 21:41:54,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:41:54,349 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 21:41:54,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:54,350 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:41:54,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:41:54,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 21:41:54,378 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 21:41:54,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:41:54,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 21:41:54,630 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 21:41:54,630 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:41:54,630 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:41:54,630 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 21:41:54,631 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 21:41:54,631 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:41:54,631 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:41:54,631 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 38) the Hoare annotation is: true [2022-04-27 21:41:54,631 INFO L899 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-04-27 21:41:54,631 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 24 38) no Hoare annotation was computed. [2022-04-27 21:41:54,631 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2022-04-27 21:41:54,632 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 24 38) no Hoare annotation was computed. [2022-04-27 21:41:54,632 INFO L895 garLoopResultBuilder]: At program point L32-2(lines 32 35) the Hoare annotation is: (let ((.cse1 (+ main_~cnt~0 main_~res~0)) (.cse0 (+ main_~b~0 main_~a~0))) (and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= .cse0 .cse1) (<= .cse1 .cse0))) [2022-04-27 21:41:54,632 INFO L895 garLoopResultBuilder]: At program point L32-3(lines 32 35) the Hoare annotation is: (and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0)) [2022-04-27 21:41:54,632 INFO L899 garLoopResultBuilder]: For program point L36(line 36) no Hoare annotation was computed. [2022-04-27 21:41:54,632 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-27 21:41:54,632 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-27 21:41:54,634 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-27 21:41:54,635 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-27 21:41:54,636 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-27 21:41:54,637 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-27 21:41:54,644 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 21:41:54,654 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:41:54,659 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:41:54,659 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 21:41:54,659 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:41:54,660 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:41:54,660 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 21:41:54,660 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 21:41:54,660 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:41:54,660 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:41:54,660 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:41:54,660 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:41:54,660 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 21:41:54,660 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 21:41:54,660 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 21:41:54,660 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 21:41:54,660 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 21:41:54,661 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:41:54,665 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:41:54,665 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:41:54,665 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 21:41:54,665 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 21:41:54,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:41:54 BasicIcfg [2022-04-27 21:41:54,675 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 21:41:54,676 INFO L158 Benchmark]: Toolchain (without parser) took 2993.20ms. Allocated memory was 183.5MB in the beginning and 230.7MB in the end (delta: 47.2MB). Free memory was 129.0MB in the beginning and 112.6MB in the end (delta: 16.4MB). Peak memory consumption was 63.8MB. Max. memory is 8.0GB. [2022-04-27 21:41:54,678 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 183.5MB. Free memory is still 145.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:41:54,679 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.38ms. Allocated memory was 183.5MB in the beginning and 230.7MB in the end (delta: 47.2MB). Free memory was 128.8MB in the beginning and 202.7MB in the end (delta: -73.9MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. [2022-04-27 21:41:54,679 INFO L158 Benchmark]: Boogie Preprocessor took 29.95ms. Allocated memory is still 230.7MB. Free memory was 202.7MB in the beginning and 201.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 21:41:54,679 INFO L158 Benchmark]: RCFGBuilder took 229.48ms. Allocated memory is still 230.7MB. Free memory was 201.1MB in the beginning and 190.1MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 21:41:54,680 INFO L158 Benchmark]: IcfgTransformer took 26.42ms. Allocated memory is still 230.7MB. Free memory was 190.1MB in the beginning and 188.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 21:41:54,680 INFO L158 Benchmark]: TraceAbstraction took 2470.50ms. Allocated memory is still 230.7MB. Free memory was 188.0MB in the beginning and 112.6MB in the end (delta: 75.4MB). Peak memory consumption was 76.9MB. Max. memory is 8.0GB. [2022-04-27 21:41:54,682 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 183.5MB. Free memory is still 145.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 231.38ms. Allocated memory was 183.5MB in the beginning and 230.7MB in the end (delta: 47.2MB). Free memory was 128.8MB in the beginning and 202.7MB in the end (delta: -73.9MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.95ms. Allocated memory is still 230.7MB. Free memory was 202.7MB in the beginning and 201.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 229.48ms. Allocated memory is still 230.7MB. Free memory was 201.1MB in the beginning and 190.1MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 26.42ms. Allocated memory is still 230.7MB. Free memory was 190.1MB in the beginning and 188.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 2470.50ms. Allocated memory is still 230.7MB. Free memory was 188.0MB in the beginning and 112.6MB in the end (delta: 75.4MB). Peak memory consumption was 76.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 94 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 78 IncrementalHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 42 mSDtfsCounter, 78 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 15 NumberOfFragments, 44 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 103 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 251 SizeOfPredicates, 2 NumberOfNonLiveVariables, 65 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 0/3 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: 32]: Loop Invariant Derived loop invariant: (res < b + a + 1 && b + a <= cnt + res) && cnt + res <= b + a RESULT: Ultimate proved your program to be correct! [2022-04-27 21:41:54,717 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...