/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/loops/trex04.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:08:43,473 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:08:43,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:08:43,568 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:08:43,568 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:08:43,569 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:08:43,572 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:08:43,574 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:08:43,575 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:08:43,580 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:08:43,580 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:08:43,581 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:08:43,581 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:08:43,582 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:08:43,582 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:08:43,583 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:08:43,583 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:08:43,583 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:08:43,584 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:08:43,585 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:08:43,586 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:08:43,588 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:08:43,590 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:08:43,593 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:08:43,594 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:08:43,601 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:08:43,601 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:08:43,601 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:08:43,602 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:08:43,602 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:08:43,603 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:08:43,603 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:08:43,604 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:08:43,604 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:08:43,605 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:08:43,605 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:08:43,605 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:08:43,606 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:08:43,606 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:08:43,606 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:08:43,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:08:43,609 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:08:43,609 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:08:43,632 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:08:43,633 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:08:43,633 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:08:43,633 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:08:43,634 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:08:43,634 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:08:43,634 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:08:43,634 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:08:43,635 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:08:43,635 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:08:43,635 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:08:43,635 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:08:43,636 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:08:43,636 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:08:43,636 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:08:43,636 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:08:43,636 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:08:43,636 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:08:43,636 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:08:43,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:08:43,636 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:08:43,636 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:08:43,637 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:08:43,637 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:08:43,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:08:43,637 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:08:43,637 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:08:43,637 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:08:43,638 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:08:43,638 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:08:43,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:08:43,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:08:43,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:08:43,859 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:08:43,860 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:08:43,861 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/trex04.c [2022-04-27 21:08:43,905 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b471f146/05fd5e81f9a94be991672a1cec48914c/FLAGb6746844e [2022-04-27 21:08:44,242 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:08:44,242 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/trex04.c [2022-04-27 21:08:44,246 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b471f146/05fd5e81f9a94be991672a1cec48914c/FLAGb6746844e [2022-04-27 21:08:44,691 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b471f146/05fd5e81f9a94be991672a1cec48914c [2022-04-27 21:08:44,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:08:44,695 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:08:44,696 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:08:44,696 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:08:44,699 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:08:44,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:08:44" (1/1) ... [2022-04-27 21:08:44,700 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e3b5f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:08:44, skipping insertion in model container [2022-04-27 21:08:44,700 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:08:44" (1/1) ... [2022-04-27 21:08:44,705 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:08:44,713 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:08:44,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/loops/trex04.c[405,418] [2022-04-27 21:08:44,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:08:44,885 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:08:44,915 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/trex04.c[405,418] [2022-04-27 21:08:44,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:08:44,946 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:08:44,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:08:44 WrapperNode [2022-04-27 21:08:44,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:08:44,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:08:44,949 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:08:44,949 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:08:44,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:08:44" (1/1) ... [2022-04-27 21:08:44,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:08:44" (1/1) ... [2022-04-27 21:08:44,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:08:44" (1/1) ... [2022-04-27 21:08:44,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:08:44" (1/1) ... [2022-04-27 21:08:44,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:08:44" (1/1) ... [2022-04-27 21:08:44,991 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:08:44" (1/1) ... [2022-04-27 21:08:44,994 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:08:44" (1/1) ... [2022-04-27 21:08:44,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:08:44,999 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:08:44,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:08:44,999 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:08:44,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:08:44" (1/1) ... [2022-04-27 21:08:45,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:08:45,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:08:45,033 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:08:45,055 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:08:45,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:08:45,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:08:45,079 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:08:45,079 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 21:08:45,079 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 21:08:45,080 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2022-04-27 21:08:45,080 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:08:45,080 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:08:45,081 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:08:45,081 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:08:45,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:08:45,081 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 21:08:45,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:08:45,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-27 21:08:45,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 21:08:45,081 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2022-04-27 21:08:45,081 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:08:45,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:08:45,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:08:45,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:08:45,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:08:45,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:08:45,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:08:45,130 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:08:45,132 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:08:45,327 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:08:45,335 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:08:45,335 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 21:08:45,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:08:45 BoogieIcfgContainer [2022-04-27 21:08:45,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:08:45,338 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:08:45,338 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:08:45,339 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:08:45,341 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:08:45" (1/1) ... [2022-04-27 21:08:45,343 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:08:45,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:08:45 BasicIcfg [2022-04-27 21:08:45,362 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:08:45,363 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:08:45,363 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:08:45,366 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:08:45,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:08:44" (1/4) ... [2022-04-27 21:08:45,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ad10c03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:08:45, skipping insertion in model container [2022-04-27 21:08:45,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:08:44" (2/4) ... [2022-04-27 21:08:45,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ad10c03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:08:45, skipping insertion in model container [2022-04-27 21:08:45,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:08:45" (3/4) ... [2022-04-27 21:08:45,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ad10c03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:08:45, skipping insertion in model container [2022-04-27 21:08:45,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:08:45" (4/4) ... [2022-04-27 21:08:45,368 INFO L111 eAbstractionObserver]: Analyzing ICFG trex04.cqvasr [2022-04-27 21:08:45,377 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:08:45,378 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:08:45,412 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:08:45,417 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@493eeff9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1eba9dc1 [2022-04-27 21:08:45,417 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:08:45,422 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 20 states have (on average 1.55) internal successors, (31), 24 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 21:08:45,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 21:08:45,427 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:08:45,427 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:08:45,428 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:08:45,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:08:45,431 INFO L85 PathProgramCache]: Analyzing trace with hash -86347346, now seen corresponding path program 1 times [2022-04-27 21:08:45,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:08:45,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823484249] [2022-04-27 21:08:45,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:08:45,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:08:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:08:45,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:08:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:08:45,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [97] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {34#true} is VALID [2022-04-27 21:08:45,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 21:08:45,618 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 21:08:45,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} [95] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:08:45,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [97] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {34#true} is VALID [2022-04-27 21:08:45,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 21:08:45,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 21:08:45,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} [96] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 21:08:45,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} [99] mainENTRY-->L31: Formula: (and (= v_main_~d~0_3 1) (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~x~0_2 |v_main_#t~nondet8_2|)) InVars {main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~x~0=v_main_~x~0_2, main_~d~0=v_main_~d~0_3} AuxVars[] AssignedVars[main_~x~0, main_~d~0, main_#t~nondet8] {34#true} is VALID [2022-04-27 21:08:45,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} [102] L31-->L34: Formula: (and (= |v_main_#t~nondet10_2| v_main_~c2~1_6) (= |v_main_#t~nondet9_2| v_main_~c1~1_5) (<= 0 (+ v_main_~x~0_4 1000000)) (<= v_main_~x~0_4 1000000)) InVars {main_~x~0=v_main_~x~0_4, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~c1~1=v_main_~c1~1_5, main_~x~0=v_main_~x~0_4, main_~c2~1=v_main_~c2~1_6} AuxVars[] AssignedVars[main_~c1~1, main_~c2~1, main_#t~nondet9, main_#t~nondet10] {34#true} is VALID [2022-04-27 21:08:45,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} [104] L34-->L34-2: Formula: (and (not (= (mod v_main_~c1~1_6 256) 0)) (= v_main_~d~0_4 (+ (- 1) v_main_~d~0_5))) InVars {main_~d~0=v_main_~d~0_5, main_~c1~1=v_main_~c1~1_6} OutVars{main_~d~0=v_main_~d~0_4, main_~c1~1=v_main_~c1~1_6} AuxVars[] AssignedVars[main_~d~0] {34#true} is VALID [2022-04-27 21:08:45,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} [107] L34-2-->L35-2: Formula: (= (mod v_main_~c2~1_2 256) 0) InVars {main_~c2~1=v_main_~c2~1_2} OutVars{main_~c2~1=v_main_~c2~1_2} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 21:08:45,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#true} [109] L35-2-->L39: Formula: (and (= |v_main_#t~nondet11_2| v_main_~c1~1_2) (= |v_main_#t~nondet12_2| v_main_~c2~1_3)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~c2~1=v_main_~c2~1_3, main_~c1~1=v_main_~c1~1_2} AuxVars[] AssignedVars[main_~c1~1, main_~c2~1, main_#t~nondet12, main_#t~nondet11] {34#true} is VALID [2022-04-27 21:08:45,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {34#true} [112] L39-->L39-3: Formula: (= (mod v_main_~c1~1_4 256) 0) InVars {main_~c1~1=v_main_~c1~1_4} OutVars{main_~c1~1=v_main_~c1~1_4} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-27 21:08:45,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {34#true} [116] L39-3-->L42-1: Formula: (and (= v_main_~d~0_1 (+ (- 1) v_main_~d~0_2)) (not (= (mod v_main_~c2~1_4 256) 0))) InVars {main_~c2~1=v_main_~c2~1_4, main_~d~0=v_main_~d~0_2} OutVars{main_~c2~1=v_main_~c2~1_4, main_~d~0=v_main_~d~0_1} AuxVars[] AssignedVars[main_~d~0] {34#true} is VALID [2022-04-27 21:08:45,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#true} [120] L42-1-->L42-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 21:08:45,629 INFO L272 TraceCheckUtils]: 13: Hoare triple {35#false} [124] L42-2-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~x~0_8 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {35#false} is VALID [2022-04-27 21:08:45,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} [125] __VERIFIER_assertENTRY-->L10: 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] {35#false} is VALID [2022-04-27 21:08:45,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} [126] L10-->L11: 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[] {35#false} is VALID [2022-04-27 21:08:45,630 INFO L290 TraceCheckUtils]: 16: Hoare triple {35#false} [128] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-27 21:08:45,630 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:08:45,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:08:45,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823484249] [2022-04-27 21:08:45,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823484249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:08:45,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:08:45,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 21:08:45,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582538571] [2022-04-27 21:08:45,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:08:45,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 17 [2022-04-27 21:08:45,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:08:45,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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:08:45,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:08:45,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 21:08:45,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:08:45,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 21:08:45,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:08:45,687 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.55) internal successors, (31), 24 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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:08:45,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:08:45,809 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2022-04-27 21:08:45,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 21:08:45,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 17 [2022-04-27 21:08:45,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:08:45,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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:08:45,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-04-27 21:08:45,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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:08:45,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-04-27 21:08:45,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 53 transitions. [2022-04-27 21:08:45,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:08:45,873 INFO L225 Difference]: With dead ends: 42 [2022-04-27 21:08:45,873 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 21:08:45,875 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:08:45,877 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 26 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:08:45,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 39 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:08:45,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 21:08:45,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-27 21:08:45,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:08:45,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 19 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:08:45,899 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 19 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:08:45,899 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 19 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:08:45,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:08:45,902 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-04-27 21:08:45,902 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-27 21:08:45,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:08:45,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:08:45,903 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 19 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-27 21:08:45,909 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 19 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-27 21:08:45,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:08:45,912 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-04-27 21:08:45,912 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-27 21:08:45,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:08:45,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:08:45,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:08:45,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:08:45,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 19 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:08:45,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-04-27 21:08:45,915 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 17 [2022-04-27 21:08:45,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:08:45,916 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-04-27 21:08:45,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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:08:45,916 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-27 21:08:45,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 21:08:45,916 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:08:45,917 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:08:45,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:08:45,917 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:08:45,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:08:45,918 INFO L85 PathProgramCache]: Analyzing trace with hash -85423825, now seen corresponding path program 1 times [2022-04-27 21:08:45,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:08:45,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467378514] [2022-04-27 21:08:45,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:08:45,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:08:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:08:46,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:08:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:08:46,037 INFO L290 TraceCheckUtils]: 0: Hoare triple {187#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [97] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {179#true} is VALID [2022-04-27 21:08:46,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {179#true} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {179#true} is VALID [2022-04-27 21:08:46,038 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {179#true} {179#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {179#true} is VALID [2022-04-27 21:08:46,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {179#true} [95] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {187#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:08:46,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {187#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [97] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {179#true} is VALID [2022-04-27 21:08:46,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {179#true} [100] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {179#true} is VALID [2022-04-27 21:08:46,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {179#true} {179#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {179#true} is VALID [2022-04-27 21:08:46,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {179#true} [96] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {179#true} is VALID [2022-04-27 21:08:46,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {179#true} [99] mainENTRY-->L31: Formula: (and (= v_main_~d~0_3 1) (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~x~0_2 |v_main_#t~nondet8_2|)) InVars {main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_~x~0=v_main_~x~0_2, main_~d~0=v_main_~d~0_3} AuxVars[] AssignedVars[main_~x~0, main_~d~0, main_#t~nondet8] {179#true} is VALID [2022-04-27 21:08:46,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {179#true} [102] L31-->L34: Formula: (and (= |v_main_#t~nondet10_2| v_main_~c2~1_6) (= |v_main_#t~nondet9_2| v_main_~c1~1_5) (<= 0 (+ v_main_~x~0_4 1000000)) (<= v_main_~x~0_4 1000000)) InVars {main_~x~0=v_main_~x~0_4, main_#t~nondet9=|v_main_#t~nondet9_2|, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~c1~1=v_main_~c1~1_5, main_~x~0=v_main_~x~0_4, main_~c2~1=v_main_~c2~1_6} AuxVars[] AssignedVars[main_~c1~1, main_~c2~1, main_#t~nondet9, main_#t~nondet10] {179#true} is VALID [2022-04-27 21:08:46,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {179#true} [104] L34-->L34-2: Formula: (and (not (= (mod v_main_~c1~1_6 256) 0)) (= v_main_~d~0_4 (+ (- 1) v_main_~d~0_5))) InVars {main_~d~0=v_main_~d~0_5, main_~c1~1=v_main_~c1~1_6} OutVars{main_~d~0=v_main_~d~0_4, main_~c1~1=v_main_~c1~1_6} AuxVars[] AssignedVars[main_~d~0] {179#true} is VALID [2022-04-27 21:08:46,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {179#true} [107] L34-2-->L35-2: Formula: (= (mod v_main_~c2~1_2 256) 0) InVars {main_~c2~1=v_main_~c2~1_2} OutVars{main_~c2~1=v_main_~c2~1_2} AuxVars[] AssignedVars[] {179#true} is VALID [2022-04-27 21:08:46,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {179#true} [109] L35-2-->L39: Formula: (and (= |v_main_#t~nondet11_2| v_main_~c1~1_2) (= |v_main_#t~nondet12_2| v_main_~c2~1_3)) InVars {main_#t~nondet12=|v_main_#t~nondet12_2|, main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~c2~1=v_main_~c2~1_3, main_~c1~1=v_main_~c1~1_2} AuxVars[] AssignedVars[main_~c1~1, main_~c2~1, main_#t~nondet12, main_#t~nondet11] {179#true} is VALID [2022-04-27 21:08:46,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {179#true} [112] L39-->L39-3: Formula: (= (mod v_main_~c1~1_4 256) 0) InVars {main_~c1~1=v_main_~c1~1_4} OutVars{main_~c1~1=v_main_~c1~1_4} AuxVars[] AssignedVars[] {179#true} is VALID [2022-04-27 21:08:46,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {179#true} [116] L39-3-->L42-1: Formula: (and (= v_main_~d~0_1 (+ (- 1) v_main_~d~0_2)) (not (= (mod v_main_~c2~1_4 256) 0))) InVars {main_~c2~1=v_main_~c2~1_4, main_~d~0=v_main_~d~0_2} OutVars{main_~c2~1=v_main_~c2~1_4, main_~d~0=v_main_~d~0_1} AuxVars[] AssignedVars[main_~d~0] {179#true} is VALID [2022-04-27 21:08:46,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {179#true} [121] L42-1-->L42-2: Formula: (not (< 0 v_main_~x~0_5)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {184#(<= main_~x~0 0)} is VALID [2022-04-27 21:08:46,044 INFO L272 TraceCheckUtils]: 13: Hoare triple {184#(<= main_~x~0 0)} [124] L42-2-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~x~0_8 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {185#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:08:46,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {185#(not (= |__VERIFIER_assert_#in~cond| 0))} [125] __VERIFIER_assertENTRY-->L10: 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] {186#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:08:46,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {186#(not (= __VERIFIER_assert_~cond 0))} [126] L10-->L11: 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[] {180#false} is VALID [2022-04-27 21:08:46,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {180#false} [128] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {180#false} is VALID [2022-04-27 21:08:46,046 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:08:46,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:08:46,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467378514] [2022-04-27 21:08:46,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467378514] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:08:46,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:08:46,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:08:46,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879260814] [2022-04-27 21:08:46,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:08:46,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 17 [2022-04-27 21:08:46,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:08:46,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:08:46,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:08:46,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:08:46,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:08:46,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:08:46,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:08:46,071 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:08:46,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:08:46,260 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-04-27 21:08:46,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 21:08:46,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 17 [2022-04-27 21:08:46,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:08:46,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:08:46,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-27 21:08:46,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:08:46,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-27 21:08:46,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-04-27 21:08:46,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:08:46,305 INFO L225 Difference]: With dead ends: 25 [2022-04-27 21:08:46,305 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 21:08:46,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-27 21:08:46,308 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 21 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:08:46,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 44 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:08:46,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 21:08:46,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 21:08:46,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:08:46,311 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:08:46,311 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:08:46,311 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:08:46,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:08:46,311 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:08:46,312 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:08:46,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:08:46,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:08:46,312 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:08:46,312 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:08:46,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:08:46,312 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:08:46,312 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:08:46,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:08:46,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:08:46,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:08:46,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:08:46,313 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:08:46,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 21:08:46,313 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-04-27 21:08:46,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:08:46,314 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 21:08:46,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:08:46,315 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:08:46,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:08:46,317 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 21:08:46,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:08:46,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 21:08:46,340 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:08:46,341 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:08:46,341 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:08:46,341 INFO L902 garLoopResultBuilder]: At program point fooENTRY(lines 18 25) the Hoare annotation is: true [2022-04-27 21:08:46,341 INFO L899 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2022-04-27 21:08:46,341 INFO L899 garLoopResultBuilder]: For program point L22-2(lines 19 25) no Hoare annotation was computed. [2022-04-27 21:08:46,341 INFO L899 garLoopResultBuilder]: For program point L23-1(lines 18 25) no Hoare annotation was computed. [2022-04-27 21:08:46,342 INFO L899 garLoopResultBuilder]: For program point fooEXIT(lines 18 25) no Hoare annotation was computed. [2022-04-27 21:08:46,342 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 21:08:46,342 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 21:08:46,343 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:08:46,343 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:08:46,343 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 27 48) the Hoare annotation is: true [2022-04-27 21:08:46,343 INFO L899 garLoopResultBuilder]: For program point L31(line 31) no Hoare annotation was computed. [2022-04-27 21:08:46,343 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 27 48) no Hoare annotation was computed. [2022-04-27 21:08:46,343 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2022-04-27 21:08:46,344 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 27 48) no Hoare annotation was computed. [2022-04-27 21:08:46,346 INFO L899 garLoopResultBuilder]: For program point L34-2(lines 28 48) no Hoare annotation was computed. [2022-04-27 21:08:46,346 INFO L902 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: true [2022-04-27 21:08:46,352 INFO L899 garLoopResultBuilder]: For program point L35-2(line 35) no Hoare annotation was computed. [2022-04-27 21:08:46,352 INFO L899 garLoopResultBuilder]: For program point L39(line 39) no Hoare annotation was computed. [2022-04-27 21:08:46,352 INFO L902 garLoopResultBuilder]: At program point L39-1(line 39) the Hoare annotation is: true [2022-04-27 21:08:46,352 INFO L899 garLoopResultBuilder]: For program point L39-3(lines 28 48) no Hoare annotation was computed. [2022-04-27 21:08:46,352 INFO L899 garLoopResultBuilder]: For program point L42-1(lines 28 48) no Hoare annotation was computed. [2022-04-27 21:08:46,352 INFO L895 garLoopResultBuilder]: At program point L42-2(lines 42 45) the Hoare annotation is: (<= main_~x~0 0) [2022-04-27 21:08:46,352 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 14) the Hoare annotation is: true [2022-04-27 21:08:46,352 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 12) no Hoare annotation was computed. [2022-04-27 21:08:46,353 INFO L899 garLoopResultBuilder]: For program point L11(line 11) no Hoare annotation was computed. [2022-04-27 21:08:46,353 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 14) no Hoare annotation was computed. [2022-04-27 21:08:46,353 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2022-04-27 21:08:46,354 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 14) no Hoare annotation was computed. [2022-04-27 21:08:46,357 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-27 21:08:46,360 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:08:46,366 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:08:46,367 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-27 21:08:46,367 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-27 21:08:46,367 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 21:08:46,367 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:08:46,367 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-27 21:08:46,367 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-27 21:08:46,367 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-27 21:08:46,367 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-27 21:08:46,367 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 21:08:46,367 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 21:08:46,367 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:08:46,367 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:08:46,367 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-27 21:08:46,367 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-27 21:08:46,368 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-04-27 21:08:46,368 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-04-27 21:08:46,368 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 21:08:46,368 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 21:08:46,368 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-27 21:08:46,368 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:08:46,368 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2022-04-27 21:08:46,368 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2022-04-27 21:08:46,368 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-04-27 21:08:46,368 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:08:46,368 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:08:46,368 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-04-27 21:08:46,368 WARN L170 areAnnotationChecker]: fooEXIT has no Hoare annotation [2022-04-27 21:08:46,368 WARN L170 areAnnotationChecker]: fooEXIT has no Hoare annotation [2022-04-27 21:08:46,368 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 21:08:46,369 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 21:08:46,369 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-27 21:08:46,369 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-27 21:08:46,369 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-04-27 21:08:46,369 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-04-27 21:08:46,369 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-04-27 21:08:46,369 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 21:08:46,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:08:46 BasicIcfg [2022-04-27 21:08:46,370 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 21:08:46,371 INFO L158 Benchmark]: Toolchain (without parser) took 1675.83ms. Allocated memory was 191.9MB in the beginning and 327.2MB in the end (delta: 135.3MB). Free memory was 135.1MB in the beginning and 214.1MB in the end (delta: -79.0MB). Peak memory consumption was 54.7MB. Max. memory is 8.0GB. [2022-04-27 21:08:46,374 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 191.9MB. Free memory is still 150.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:08:46,375 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.68ms. Allocated memory was 191.9MB in the beginning and 327.2MB in the end (delta: 135.3MB). Free memory was 134.8MB in the beginning and 298.5MB in the end (delta: -163.7MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. [2022-04-27 21:08:46,375 INFO L158 Benchmark]: Boogie Preprocessor took 49.39ms. Allocated memory is still 327.2MB. Free memory was 298.5MB in the beginning and 296.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 21:08:46,375 INFO L158 Benchmark]: RCFGBuilder took 337.97ms. Allocated memory is still 327.2MB. Free memory was 296.9MB in the beginning and 283.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-27 21:08:46,375 INFO L158 Benchmark]: IcfgTransformer took 23.79ms. Allocated memory is still 327.2MB. Free memory was 283.3MB in the beginning and 281.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 21:08:46,376 INFO L158 Benchmark]: TraceAbstraction took 1006.95ms. Allocated memory is still 327.2MB. Free memory was 281.2MB in the beginning and 214.1MB in the end (delta: 67.1MB). Peak memory consumption was 67.1MB. Max. memory is 8.0GB. [2022-04-27 21:08:46,377 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.09ms. Allocated memory is still 191.9MB. Free memory is still 150.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 251.68ms. Allocated memory was 191.9MB in the beginning and 327.2MB in the end (delta: 135.3MB). Free memory was 134.8MB in the beginning and 298.5MB in the end (delta: -163.7MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.39ms. Allocated memory is still 327.2MB. Free memory was 298.5MB in the beginning and 296.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 337.97ms. Allocated memory is still 327.2MB. Free memory was 296.9MB in the beginning and 283.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 23.79ms. Allocated memory is still 327.2MB. Free memory was 283.3MB in the beginning and 281.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 1006.95ms. Allocated memory is still 327.2MB. Free memory was 281.2MB in the beginning and 214.1MB in the end (delta: 67.1MB). Peak memory consumption was 67.1MB. 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: 11]: 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 5 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 52 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 83 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 80 IncrementalHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 63 mSDtfsCounter, 80 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, InterpolantAutomatonStates: 9, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 11 PreInvPairs, 12 NumberOfFragments, 17 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 52 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-27 21:08:46,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...