/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/cggmp2005_variant.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 22:33:34,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 22:33:34,497 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 22:33:34,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 22:33:34,537 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 22:33:34,538 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 22:33:34,541 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 22:33:34,548 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 22:33:34,550 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 22:33:34,553 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 22:33:34,554 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 22:33:34,555 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 22:33:34,555 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 22:33:34,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 22:33:34,557 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 22:33:34,558 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 22:33:34,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 22:33:34,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 22:33:34,562 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 22:33:34,566 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 22:33:34,568 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 22:33:34,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 22:33:34,569 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 22:33:34,569 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 22:33:34,570 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 22:33:34,575 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 22:33:34,575 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 22:33:34,575 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 22:33:34,576 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 22:33:34,576 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 22:33:34,577 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 22:33:34,577 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 22:33:34,578 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 22:33:34,579 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 22:33:34,579 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 22:33:34,579 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 22:33:34,579 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 22:33:34,580 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 22:33:34,580 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 22:33:34,580 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 22:33:34,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 22:33:34,582 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 22:33:34,582 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-07 22:33:34,601 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 22:33:34,602 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 22:33:34,603 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 22:33:34,603 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 22:33:34,603 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 22:33:34,603 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 22:33:34,603 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 22:33:34,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 22:33:34,604 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 22:33:34,604 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 22:33:34,604 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 22:33:34,604 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 22:33:34,605 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 22:33:34,605 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 22:33:34,605 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 22:33:34,605 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 22:33:34,605 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 22:33:34,605 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 22:33:34,605 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 22:33:34,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 22:33:34,605 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 22:33:34,605 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 22:33:34,605 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 22:33:34,605 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 22:33:34,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 22:33:34,606 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 22:33:34,606 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-07 22:33:34,606 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-07 22:33:34,607 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 22:33:34,607 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 22:33:34,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 22:33:34,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 22:33:34,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 22:33:34,800 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 22:33:34,801 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 22:33:34,802 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/cggmp2005_variant.i [2022-04-07 22:33:34,852 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45e1b4089/f3e74564248c4d30b09a9de3ecdb92c9/FLAGfa06af7a5 [2022-04-07 22:33:35,250 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 22:33:35,250 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005_variant.i [2022-04-07 22:33:35,254 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45e1b4089/f3e74564248c4d30b09a9de3ecdb92c9/FLAGfa06af7a5 [2022-04-07 22:33:35,261 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45e1b4089/f3e74564248c4d30b09a9de3ecdb92c9 [2022-04-07 22:33:35,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 22:33:35,264 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 22:33:35,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 22:33:35,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 22:33:35,267 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 22:33:35,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:33:35" (1/1) ... [2022-04-07 22:33:35,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8f5d377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:33:35, skipping insertion in model container [2022-04-07 22:33:35,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:33:35" (1/1) ... [2022-04-07 22:33:35,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 22:33:35,296 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 22:33:35,406 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/cggmp2005_variant.i[895,908] [2022-04-07 22:33:35,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 22:33:35,418 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 22:33:35,426 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/cggmp2005_variant.i[895,908] [2022-04-07 22:33:35,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 22:33:35,436 INFO L208 MainTranslator]: Completed translation [2022-04-07 22:33:35,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:33:35 WrapperNode [2022-04-07 22:33:35,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 22:33:35,439 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 22:33:35,439 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 22:33:35,439 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 22:33:35,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:33:35" (1/1) ... [2022-04-07 22:33:35,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:33:35" (1/1) ... [2022-04-07 22:33:35,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:33:35" (1/1) ... [2022-04-07 22:33:35,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:33:35" (1/1) ... [2022-04-07 22:33:35,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:33:35" (1/1) ... [2022-04-07 22:33:35,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:33:35" (1/1) ... [2022-04-07 22:33:35,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:33:35" (1/1) ... [2022-04-07 22:33:35,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 22:33:35,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 22:33:35,461 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 22:33:35,461 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 22:33:35,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:33:35" (1/1) ... [2022-04-07 22:33:35,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 22:33:35,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:33:35,491 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 22:33:35,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 22:33:35,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 22:33:35,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 22:33:35,513 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 22:33:35,513 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 22:33:35,513 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 22:33:35,513 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 22:33:35,513 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 22:33:35,513 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 22:33:35,515 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-07 22:33:35,515 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-07 22:33:35,515 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 22:33:35,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 22:33:35,515 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 22:33:35,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 22:33:35,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 22:33:35,516 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 22:33:35,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 22:33:35,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 22:33:35,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 22:33:35,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 22:33:35,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 22:33:35,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 22:33:35,566 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 22:33:35,567 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 22:33:35,647 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 22:33:35,652 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 22:33:35,653 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 22:33:35,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:33:35 BoogieIcfgContainer [2022-04-07 22:33:35,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 22:33:35,654 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 22:33:35,654 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 22:33:35,655 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 22:33:35,657 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:33:35" (1/1) ... [2022-04-07 22:33:35,658 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-07 22:33:35,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 10:33:35 BasicIcfg [2022-04-07 22:33:35,674 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 22:33:35,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 22:33:35,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 22:33:35,677 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 22:33:35,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 10:33:35" (1/4) ... [2022-04-07 22:33:35,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62728a89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:33:35, skipping insertion in model container [2022-04-07 22:33:35,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:33:35" (2/4) ... [2022-04-07 22:33:35,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62728a89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:33:35, skipping insertion in model container [2022-04-07 22:33:35,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:33:35" (3/4) ... [2022-04-07 22:33:35,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62728a89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 10:33:35, skipping insertion in model container [2022-04-07 22:33:35,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 10:33:35" (4/4) ... [2022-04-07 22:33:35,679 INFO L111 eAbstractionObserver]: Analyzing ICFG cggmp2005_variant.iqvasr [2022-04-07 22:33:35,682 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 22:33:35,682 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 22:33:35,743 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 22:33:35,748 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 22:33:35,748 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 22:33:35,774 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:33:35,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 22:33:35,780 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:33:35,781 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:33:35,781 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:33:35,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:33:35,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1291699483, now seen corresponding path program 1 times [2022-04-07 22:33:35,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:33:35,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685178019] [2022-04-07 22:33:35,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:33:35,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:33:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:33:35,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:33:35,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:33:35,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] 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] {23#true} is VALID [2022-04-07 22:33:35,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 22:33:35,930 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 22:33:35,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:33:35,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] 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] {23#true} is VALID [2022-04-07 22:33:35,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 22:33:35,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 22:33:35,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 22:33:35,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [61] mainENTRY-->L28: Formula: (and (= v_main_~lo~0_4 0) (<= |v_main_#t~nondet1_2| 2147483647) (= |v_main_#t~nondet1_2| v_main_~mid~0_6) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~lo~0=v_main_~lo~0_4, main_~mid~0=v_main_~mid~0_6, main_~hi~0=v_main_~hi~0_5} AuxVars[] AssignedVars[main_~lo~0, main_#t~nondet1, main_~mid~0, main_~hi~0] {23#true} is VALID [2022-04-07 22:33:35,932 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} [64] L28-->L30-2: Formula: (and (<= v_main_~mid~0_2 1000000) (< 0 v_main_~mid~0_2) (= v_main_~hi~0_2 (* 2 v_main_~mid~0_2))) InVars {main_~mid~0=v_main_~mid~0_2} OutVars{main_~mid~0=v_main_~mid~0_2, main_~hi~0=v_main_~hi~0_2} AuxVars[] AssignedVars[main_~hi~0] {23#true} is VALID [2022-04-07 22:33:35,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#true} [66] L30-2-->L30-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-07 22:33:35,933 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} [69] L30-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~hi~0_6 v_main_~lo~0_7) 1 0)) InVars {main_~lo~0=v_main_~lo~0_7, main_~hi~0=v_main_~hi~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~lo~0, __VERIFIER_assert_#in~cond, main_~hi~0] {24#false} is VALID [2022-04-07 22:33:35,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} [71] __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] {24#false} is VALID [2022-04-07 22:33:35,934 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} [72] 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[] {24#false} is VALID [2022-04-07 22:33:35,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} [74] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-07 22:33:35,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:33:35,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:33:35,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685178019] [2022-04-07 22:33:35,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685178019] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:33:35,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:33:35,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 22:33:35,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886934096] [2022-04-07 22:33:35,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:33:35,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 22:33:35,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:33:35,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:33:35,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:33:35,956 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 22:33:35,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:33:35,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 22:33:35,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 22:33:35,977 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:33:36,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:33:36,025 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-07 22:33:36,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 22:33:36,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 22:33:36,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:33:36,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:33:36,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-07 22:33:36,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:33:36,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-07 22:33:36,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2022-04-07 22:33:36,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:33:36,072 INFO L225 Difference]: With dead ends: 32 [2022-04-07 22:33:36,072 INFO L226 Difference]: Without dead ends: 13 [2022-04-07 22:33:36,074 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 22:33:36,076 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 22:33:36,077 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 22:33:36,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-07 22:33:36,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-07 22:33:36,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:33:36,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:33:36,095 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:33:36,095 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:33:36,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:33:36,098 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-07 22:33:36,098 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-07 22:33:36,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:33:36,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:33:36,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 13 states. [2022-04-07 22:33:36,099 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 13 states. [2022-04-07 22:33:36,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:33:36,100 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-07 22:33:36,100 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-07 22:33:36,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:33:36,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:33:36,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:33:36,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:33:36,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:33:36,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-07 22:33:36,103 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 12 [2022-04-07 22:33:36,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:33:36,103 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-07 22:33:36,103 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:33:36,103 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-07 22:33:36,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 22:33:36,104 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:33:36,104 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:33:36,104 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 22:33:36,104 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:33:36,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:33:36,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1292623004, now seen corresponding path program 1 times [2022-04-07 22:33:36,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:33:36,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213384532] [2022-04-07 22:33:36,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:33:36,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:33:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:33:36,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:33:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:33:36,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] 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] {118#true} is VALID [2022-04-07 22:33:36,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-07 22:33:36,154 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118#true} {118#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-07 22:33:36,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {118#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:33:36,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] 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] {118#true} is VALID [2022-04-07 22:33:36,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {118#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-07 22:33:36,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118#true} {118#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-07 22:33:36,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {118#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-07 22:33:36,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {118#true} [61] mainENTRY-->L28: Formula: (and (= v_main_~lo~0_4 0) (<= |v_main_#t~nondet1_2| 2147483647) (= |v_main_#t~nondet1_2| v_main_~mid~0_6) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~lo~0=v_main_~lo~0_4, main_~mid~0=v_main_~mid~0_6, main_~hi~0=v_main_~hi~0_5} AuxVars[] AssignedVars[main_~lo~0, main_#t~nondet1, main_~mid~0, main_~hi~0] {118#true} is VALID [2022-04-07 22:33:36,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {118#true} [64] L28-->L30-2: Formula: (and (<= v_main_~mid~0_2 1000000) (< 0 v_main_~mid~0_2) (= v_main_~hi~0_2 (* 2 v_main_~mid~0_2))) InVars {main_~mid~0=v_main_~mid~0_2} OutVars{main_~mid~0=v_main_~mid~0_2, main_~hi~0=v_main_~hi~0_2} AuxVars[] AssignedVars[main_~hi~0] {123#(not (<= main_~mid~0 0))} is VALID [2022-04-07 22:33:36,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {123#(not (<= main_~mid~0 0))} [67] L30-2-->L30-3: Formula: (not (< 0 v_main_~mid~0_3)) InVars {main_~mid~0=v_main_~mid~0_3} OutVars{main_~mid~0=v_main_~mid~0_3} AuxVars[] AssignedVars[] {119#false} is VALID [2022-04-07 22:33:36,160 INFO L272 TraceCheckUtils]: 8: Hoare triple {119#false} [69] L30-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~hi~0_6 v_main_~lo~0_7) 1 0)) InVars {main_~lo~0=v_main_~lo~0_7, main_~hi~0=v_main_~hi~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~lo~0, __VERIFIER_assert_#in~cond, main_~hi~0] {119#false} is VALID [2022-04-07 22:33:36,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {119#false} [71] __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] {119#false} is VALID [2022-04-07 22:33:36,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {119#false} [72] 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[] {119#false} is VALID [2022-04-07 22:33:36,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {119#false} [74] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {119#false} is VALID [2022-04-07 22:33:36,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:33:36,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:33:36,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213384532] [2022-04-07 22:33:36,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213384532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:33:36,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:33:36,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 22:33:36,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005905412] [2022-04-07 22:33:36,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:33:36,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 22:33:36,164 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:33:36,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:33:36,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:33:36,180 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 22:33:36,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:33:36,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 22:33:36,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 22:33:36,183 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:33:36,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:33:36,242 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-07 22:33:36,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 22:33:36,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 22:33:36,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:33:36,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:33:36,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-07 22:33:36,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:33:36,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-07 22:33:36,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 19 transitions. [2022-04-07 22:33:36,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:33:36,269 INFO L225 Difference]: With dead ends: 19 [2022-04-07 22:33:36,269 INFO L226 Difference]: Without dead ends: 14 [2022-04-07 22:33:36,269 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 22:33:36,270 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 22:33:36,271 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 22:33:36,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-07 22:33:36,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-07 22:33:36,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:33:36,274 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-07 22:33:36,274 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-07 22:33:36,274 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-07 22:33:36,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:33:36,275 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-07 22:33:36,275 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-07 22:33:36,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:33:36,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:33:36,276 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-07 22:33:36,276 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-07 22:33:36,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:33:36,277 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-07 22:33:36,277 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-07 22:33:36,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:33:36,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:33:36,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:33:36,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:33:36,278 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-07 22:33:36,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-07 22:33:36,278 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-07 22:33:36,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:33:36,279 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-07 22:33:36,279 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:33:36,279 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-07 22:33:36,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-07 22:33:36,279 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:33:36,279 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:33:36,280 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 22:33:36,280 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:33:36,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:33:36,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1443329038, now seen corresponding path program 1 times [2022-04-07 22:33:36,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:33:36,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657572908] [2022-04-07 22:33:36,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:33:36,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:33:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:33:36,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:33:36,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:33:36,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {219#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] 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] {208#true} is VALID [2022-04-07 22:33:36,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 22:33:36,458 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {208#true} {208#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 22:33:36,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {219#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:33:36,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {219#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] 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] {208#true} is VALID [2022-04-07 22:33:36,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 22:33:36,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 22:33:36,460 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 22:33:36,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} [61] mainENTRY-->L28: Formula: (and (= v_main_~lo~0_4 0) (<= |v_main_#t~nondet1_2| 2147483647) (= |v_main_#t~nondet1_2| v_main_~mid~0_6) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~lo~0=v_main_~lo~0_4, main_~mid~0=v_main_~mid~0_6, main_~hi~0=v_main_~hi~0_5} AuxVars[] AssignedVars[main_~lo~0, main_#t~nondet1, main_~mid~0, main_~hi~0] {213#(= main_~lo~0 0)} is VALID [2022-04-07 22:33:36,461 INFO L290 TraceCheckUtils]: 6: Hoare triple {213#(= main_~lo~0 0)} [64] L28-->L30-2: Formula: (and (<= v_main_~mid~0_2 1000000) (< 0 v_main_~mid~0_2) (= v_main_~hi~0_2 (* 2 v_main_~mid~0_2))) InVars {main_~mid~0=v_main_~mid~0_2} OutVars{main_~mid~0=v_main_~mid~0_2, main_~hi~0=v_main_~hi~0_2} AuxVars[] AssignedVars[main_~hi~0] {214#(and (= main_~lo~0 0) (<= 2 main_~hi~0) (<= main_~hi~0 (* main_~mid~0 2)))} is VALID [2022-04-07 22:33:36,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {214#(and (= main_~lo~0 0) (<= 2 main_~hi~0) (<= main_~hi~0 (* main_~mid~0 2)))} [68] L30-2-->L30-2: Formula: (and (= v_main_~hi~0_3 (+ v_main_~hi~0_4 (- 1))) (< 0 v_main_~mid~0_5) (= v_main_~lo~0_2 (+ v_main_~lo~0_3 1)) (= v_main_~mid~0_4 (+ (- 1) v_main_~mid~0_5))) InVars {main_~lo~0=v_main_~lo~0_3, main_~mid~0=v_main_~mid~0_5, main_~hi~0=v_main_~hi~0_4} OutVars{main_~lo~0=v_main_~lo~0_2, main_~mid~0=v_main_~mid~0_4, main_~hi~0=v_main_~hi~0_3} AuxVars[] AssignedVars[main_~lo~0, main_~mid~0, main_~hi~0] {215#(and (or (<= main_~hi~0 (+ main_~lo~0 (* main_~mid~0 2))) (< main_~hi~0 (+ main_~lo~0 1))) (<= main_~lo~0 main_~hi~0))} is VALID [2022-04-07 22:33:36,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {215#(and (or (<= main_~hi~0 (+ main_~lo~0 (* main_~mid~0 2))) (< main_~hi~0 (+ main_~lo~0 1))) (<= main_~lo~0 main_~hi~0))} [67] L30-2-->L30-3: Formula: (not (< 0 v_main_~mid~0_3)) InVars {main_~mid~0=v_main_~mid~0_3} OutVars{main_~mid~0=v_main_~mid~0_3} AuxVars[] AssignedVars[] {216#(and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1)))} is VALID [2022-04-07 22:33:36,464 INFO L272 TraceCheckUtils]: 9: Hoare triple {216#(and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1)))} [69] L30-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~hi~0_6 v_main_~lo~0_7) 1 0)) InVars {main_~lo~0=v_main_~lo~0_7, main_~hi~0=v_main_~hi~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~lo~0, __VERIFIER_assert_#in~cond, main_~hi~0] {217#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 22:33:36,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {217#(not (= |__VERIFIER_assert_#in~cond| 0))} [71] __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] {218#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 22:33:36,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {218#(not (= __VERIFIER_assert_~cond 0))} [72] 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[] {209#false} is VALID [2022-04-07 22:33:36,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} [74] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-07 22:33:36,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:33:36,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:33:36,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657572908] [2022-04-07 22:33:36,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657572908] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 22:33:36,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841260554] [2022-04-07 22:33:36,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:33:36,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:33:36,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:33:36,476 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 22:33:36,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 22:33:36,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:33:36,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-07 22:33:36,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:33:36,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 22:33:37,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 22:33:37,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#true} [59] 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] {208#true} is VALID [2022-04-07 22:33:37,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 22:33:37,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 22:33:37,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 22:33:37,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} [61] mainENTRY-->L28: Formula: (and (= v_main_~lo~0_4 0) (<= |v_main_#t~nondet1_2| 2147483647) (= |v_main_#t~nondet1_2| v_main_~mid~0_6) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~lo~0=v_main_~lo~0_4, main_~mid~0=v_main_~mid~0_6, main_~hi~0=v_main_~hi~0_5} AuxVars[] AssignedVars[main_~lo~0, main_#t~nondet1, main_~mid~0, main_~hi~0] {213#(= main_~lo~0 0)} is VALID [2022-04-07 22:33:37,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {213#(= main_~lo~0 0)} [64] L28-->L30-2: Formula: (and (<= v_main_~mid~0_2 1000000) (< 0 v_main_~mid~0_2) (= v_main_~hi~0_2 (* 2 v_main_~mid~0_2))) InVars {main_~mid~0=v_main_~mid~0_2} OutVars{main_~mid~0=v_main_~mid~0_2, main_~hi~0=v_main_~hi~0_2} AuxVars[] AssignedVars[main_~hi~0] {241#(and (= main_~lo~0 0) (< 0 main_~mid~0) (= main_~hi~0 (* main_~mid~0 2)))} is VALID [2022-04-07 22:33:37,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {241#(and (= main_~lo~0 0) (< 0 main_~mid~0) (= main_~hi~0 (* main_~mid~0 2)))} [68] L30-2-->L30-2: Formula: (and (= v_main_~hi~0_3 (+ v_main_~hi~0_4 (- 1))) (< 0 v_main_~mid~0_5) (= v_main_~lo~0_2 (+ v_main_~lo~0_3 1)) (= v_main_~mid~0_4 (+ (- 1) v_main_~mid~0_5))) InVars {main_~lo~0=v_main_~lo~0_3, main_~mid~0=v_main_~mid~0_5, main_~hi~0=v_main_~hi~0_4} OutVars{main_~lo~0=v_main_~lo~0_2, main_~mid~0=v_main_~mid~0_4, main_~hi~0=v_main_~hi~0_3} AuxVars[] AssignedVars[main_~lo~0, main_~mid~0, main_~hi~0] {245#(and (< 0 (div (+ (- 1) (* (- 1) main_~hi~0)) (- 2))) (= (mod (+ main_~hi~0 1) 2) 0) (<= (div (+ (- 1) (* (- 1) main_~hi~0)) (- 2)) (+ main_~mid~0 1)) (= main_~lo~0 1))} is VALID [2022-04-07 22:33:37,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {245#(and (< 0 (div (+ (- 1) (* (- 1) main_~hi~0)) (- 2))) (= (mod (+ main_~hi~0 1) 2) 0) (<= (div (+ (- 1) (* (- 1) main_~hi~0)) (- 2)) (+ main_~mid~0 1)) (= main_~lo~0 1))} [67] L30-2-->L30-3: Formula: (not (< 0 v_main_~mid~0_3)) InVars {main_~mid~0=v_main_~mid~0_3} OutVars{main_~mid~0=v_main_~mid~0_3} AuxVars[] AssignedVars[] {249#(and (< 0 (div (+ (- 1) (* (- 1) main_~hi~0)) (- 2))) (= (mod (+ main_~hi~0 1) 2) 0) (<= (div (+ (- 1) (* (- 1) main_~hi~0)) (- 2)) 1) (= main_~lo~0 1))} is VALID [2022-04-07 22:33:37,203 INFO L272 TraceCheckUtils]: 9: Hoare triple {249#(and (< 0 (div (+ (- 1) (* (- 1) main_~hi~0)) (- 2))) (= (mod (+ main_~hi~0 1) 2) 0) (<= (div (+ (- 1) (* (- 1) main_~hi~0)) (- 2)) 1) (= main_~lo~0 1))} [69] L30-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~hi~0_6 v_main_~lo~0_7) 1 0)) InVars {main_~lo~0=v_main_~lo~0_7, main_~hi~0=v_main_~hi~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~lo~0, __VERIFIER_assert_#in~cond, main_~hi~0] {253#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 22:33:37,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {253#(<= 1 |__VERIFIER_assert_#in~cond|)} [71] __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] {257#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 22:33:37,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {257#(<= 1 __VERIFIER_assert_~cond)} [72] 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[] {209#false} is VALID [2022-04-07 22:33:37,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} [74] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-07 22:33:37,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:33:37,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 22:33:37,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} [74] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-07 22:33:37,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {257#(<= 1 __VERIFIER_assert_~cond)} [72] 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[] {209#false} is VALID [2022-04-07 22:33:37,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {253#(<= 1 |__VERIFIER_assert_#in~cond|)} [71] __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] {257#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 22:33:37,387 INFO L272 TraceCheckUtils]: 9: Hoare triple {216#(and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1)))} [69] L30-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~hi~0_6 v_main_~lo~0_7) 1 0)) InVars {main_~lo~0=v_main_~lo~0_7, main_~hi~0=v_main_~hi~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~lo~0, __VERIFIER_assert_#in~cond, main_~hi~0] {253#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 22:33:37,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {276#(or (< 0 main_~mid~0) (and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1))))} [67] L30-2-->L30-3: Formula: (not (< 0 v_main_~mid~0_3)) InVars {main_~mid~0=v_main_~mid~0_3} OutVars{main_~mid~0=v_main_~mid~0_3} AuxVars[] AssignedVars[] {216#(and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1)))} is VALID [2022-04-07 22:33:37,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {280#(or (< 1 main_~mid~0) (and (< main_~hi~0 (+ 3 main_~lo~0)) (<= (+ 2 main_~lo~0) main_~hi~0)))} [68] L30-2-->L30-2: Formula: (and (= v_main_~hi~0_3 (+ v_main_~hi~0_4 (- 1))) (< 0 v_main_~mid~0_5) (= v_main_~lo~0_2 (+ v_main_~lo~0_3 1)) (= v_main_~mid~0_4 (+ (- 1) v_main_~mid~0_5))) InVars {main_~lo~0=v_main_~lo~0_3, main_~mid~0=v_main_~mid~0_5, main_~hi~0=v_main_~hi~0_4} OutVars{main_~lo~0=v_main_~lo~0_2, main_~mid~0=v_main_~mid~0_4, main_~hi~0=v_main_~hi~0_3} AuxVars[] AssignedVars[main_~lo~0, main_~mid~0, main_~hi~0] {276#(or (< 0 main_~mid~0) (and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1))))} is VALID [2022-04-07 22:33:37,389 INFO L290 TraceCheckUtils]: 6: Hoare triple {213#(= main_~lo~0 0)} [64] L28-->L30-2: Formula: (and (<= v_main_~mid~0_2 1000000) (< 0 v_main_~mid~0_2) (= v_main_~hi~0_2 (* 2 v_main_~mid~0_2))) InVars {main_~mid~0=v_main_~mid~0_2} OutVars{main_~mid~0=v_main_~mid~0_2, main_~hi~0=v_main_~hi~0_2} AuxVars[] AssignedVars[main_~hi~0] {280#(or (< 1 main_~mid~0) (and (< main_~hi~0 (+ 3 main_~lo~0)) (<= (+ 2 main_~lo~0) main_~hi~0)))} is VALID [2022-04-07 22:33:37,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} [61] mainENTRY-->L28: Formula: (and (= v_main_~lo~0_4 0) (<= |v_main_#t~nondet1_2| 2147483647) (= |v_main_#t~nondet1_2| v_main_~mid~0_6) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~lo~0=v_main_~lo~0_4, main_~mid~0=v_main_~mid~0_6, main_~hi~0=v_main_~hi~0_5} AuxVars[] AssignedVars[main_~lo~0, main_#t~nondet1, main_~mid~0, main_~hi~0] {213#(= main_~lo~0 0)} is VALID [2022-04-07 22:33:37,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 22:33:37,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 22:33:37,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 22:33:37,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#true} [59] 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] {208#true} is VALID [2022-04-07 22:33:37,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-07 22:33:37,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:33:37,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841260554] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 22:33:37,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 22:33:37,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-07 22:33:37,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405211698] [2022-04-07 22:33:37,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 22:33:37,391 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 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 13 [2022-04-07 22:33:37,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:33:37,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 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-07 22:33:37,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:33:37,407 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-07 22:33:37,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:33:37,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-07 22:33:37,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-04-07 22:33:37,408 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 16 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 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-07 22:33:37,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:33:37,592 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-07 22:33:37,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 22:33:37,592 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 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 13 [2022-04-07 22:33:37,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:33:37,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 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-07 22:33:37,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. [2022-04-07 22:33:37,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 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-07 22:33:37,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. [2022-04-07 22:33:37,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 20 transitions. [2022-04-07 22:33:37,610 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-07 22:33:37,610 INFO L225 Difference]: With dead ends: 20 [2022-04-07 22:33:37,611 INFO L226 Difference]: Without dead ends: 15 [2022-04-07 22:33:37,611 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2022-04-07 22:33:37,612 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 22:33:37,612 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 37 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 22:33:37,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-07 22:33:37,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-07 22:33:37,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:33:37,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:33:37,617 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:33:37,617 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:33:37,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:33:37,618 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-07 22:33:37,618 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-07 22:33:37,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:33:37,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:33:37,618 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-07 22:33:37,618 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-07 22:33:37,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:33:37,619 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-07 22:33:37,619 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-07 22:33:37,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:33:37,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:33:37,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:33:37,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:33:37,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:33:37,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-07 22:33:37,620 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-07 22:33:37,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:33:37,620 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-07 22:33:37,621 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 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-07 22:33:37,621 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-07 22:33:37,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 22:33:37,621 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:33:37,621 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:33:37,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-07 22:33:37,835 WARN L460 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-07 22:33:37,836 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:33:37,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:33:37,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1820248796, now seen corresponding path program 2 times [2022-04-07 22:33:37,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:33:37,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426024775] [2022-04-07 22:33:37,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:33:37,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:33:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:33:37,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:33:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:33:37,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {413#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] 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] {401#true} is VALID [2022-04-07 22:33:37,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {401#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {401#true} is VALID [2022-04-07 22:33:37,982 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {401#true} {401#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {401#true} is VALID [2022-04-07 22:33:37,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {401#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:33:37,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {413#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] 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] {401#true} is VALID [2022-04-07 22:33:37,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {401#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {401#true} is VALID [2022-04-07 22:33:37,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {401#true} {401#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {401#true} is VALID [2022-04-07 22:33:37,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {401#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {401#true} is VALID [2022-04-07 22:33:37,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {401#true} [61] mainENTRY-->L28: Formula: (and (= v_main_~lo~0_4 0) (<= |v_main_#t~nondet1_2| 2147483647) (= |v_main_#t~nondet1_2| v_main_~mid~0_6) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~lo~0=v_main_~lo~0_4, main_~mid~0=v_main_~mid~0_6, main_~hi~0=v_main_~hi~0_5} AuxVars[] AssignedVars[main_~lo~0, main_#t~nondet1, main_~mid~0, main_~hi~0] {406#(= main_~lo~0 0)} is VALID [2022-04-07 22:33:37,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {406#(= main_~lo~0 0)} [64] L28-->L30-2: Formula: (and (<= v_main_~mid~0_2 1000000) (< 0 v_main_~mid~0_2) (= v_main_~hi~0_2 (* 2 v_main_~mid~0_2))) InVars {main_~mid~0=v_main_~mid~0_2} OutVars{main_~mid~0=v_main_~mid~0_2, main_~hi~0=v_main_~hi~0_2} AuxVars[] AssignedVars[main_~hi~0] {407#(and (= main_~lo~0 0) (<= (* main_~mid~0 2) main_~hi~0) (<= main_~hi~0 (* main_~mid~0 2)))} is VALID [2022-04-07 22:33:37,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {407#(and (= main_~lo~0 0) (<= (* main_~mid~0 2) main_~hi~0) (<= main_~hi~0 (* main_~mid~0 2)))} [68] L30-2-->L30-2: Formula: (and (= v_main_~hi~0_3 (+ v_main_~hi~0_4 (- 1))) (< 0 v_main_~mid~0_5) (= v_main_~lo~0_2 (+ v_main_~lo~0_3 1)) (= v_main_~mid~0_4 (+ (- 1) v_main_~mid~0_5))) InVars {main_~lo~0=v_main_~lo~0_3, main_~mid~0=v_main_~mid~0_5, main_~hi~0=v_main_~hi~0_4} OutVars{main_~lo~0=v_main_~lo~0_2, main_~mid~0=v_main_~mid~0_4, main_~hi~0=v_main_~hi~0_3} AuxVars[] AssignedVars[main_~lo~0, main_~mid~0, main_~hi~0] {408#(and (<= main_~hi~0 (+ main_~lo~0 (* main_~mid~0 2))) (<= (+ main_~lo~0 (* main_~mid~0 2)) main_~hi~0))} is VALID [2022-04-07 22:33:37,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {408#(and (<= main_~hi~0 (+ main_~lo~0 (* main_~mid~0 2))) (<= (+ main_~lo~0 (* main_~mid~0 2)) main_~hi~0))} [68] L30-2-->L30-2: Formula: (and (= v_main_~hi~0_3 (+ v_main_~hi~0_4 (- 1))) (< 0 v_main_~mid~0_5) (= v_main_~lo~0_2 (+ v_main_~lo~0_3 1)) (= v_main_~mid~0_4 (+ (- 1) v_main_~mid~0_5))) InVars {main_~lo~0=v_main_~lo~0_3, main_~mid~0=v_main_~mid~0_5, main_~hi~0=v_main_~hi~0_4} OutVars{main_~lo~0=v_main_~lo~0_2, main_~mid~0=v_main_~mid~0_4, main_~hi~0=v_main_~hi~0_3} AuxVars[] AssignedVars[main_~lo~0, main_~mid~0, main_~hi~0] {409#(and (or (<= main_~hi~0 (+ main_~lo~0 (* main_~mid~0 2))) (< main_~hi~0 (+ main_~lo~0 1))) (<= main_~lo~0 main_~hi~0))} is VALID [2022-04-07 22:33:37,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {409#(and (or (<= main_~hi~0 (+ main_~lo~0 (* main_~mid~0 2))) (< main_~hi~0 (+ main_~lo~0 1))) (<= main_~lo~0 main_~hi~0))} [67] L30-2-->L30-3: Formula: (not (< 0 v_main_~mid~0_3)) InVars {main_~mid~0=v_main_~mid~0_3} OutVars{main_~mid~0=v_main_~mid~0_3} AuxVars[] AssignedVars[] {410#(and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1)))} is VALID [2022-04-07 22:33:37,987 INFO L272 TraceCheckUtils]: 10: Hoare triple {410#(and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1)))} [69] L30-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~hi~0_6 v_main_~lo~0_7) 1 0)) InVars {main_~lo~0=v_main_~lo~0_7, main_~hi~0=v_main_~hi~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~lo~0, __VERIFIER_assert_#in~cond, main_~hi~0] {411#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 22:33:37,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {411#(not (= |__VERIFIER_assert_#in~cond| 0))} [71] __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] {412#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 22:33:37,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {412#(not (= __VERIFIER_assert_~cond 0))} [72] 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[] {402#false} is VALID [2022-04-07 22:33:37,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {402#false} [74] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {402#false} is VALID [2022-04-07 22:33:37,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:33:37,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:33:37,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426024775] [2022-04-07 22:33:37,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426024775] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 22:33:37,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527921303] [2022-04-07 22:33:37,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 22:33:37,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:33:37,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:33:37,995 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 22:33:37,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 22:33:38,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 22:33:38,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 22:33:38,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-07 22:33:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:33:38,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 22:33:38,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {401#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {401#true} is VALID [2022-04-07 22:33:38,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {401#true} [59] 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] {401#true} is VALID [2022-04-07 22:33:38,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {401#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {401#true} is VALID [2022-04-07 22:33:38,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {401#true} {401#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {401#true} is VALID [2022-04-07 22:33:38,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {401#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {401#true} is VALID [2022-04-07 22:33:38,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {401#true} [61] mainENTRY-->L28: Formula: (and (= v_main_~lo~0_4 0) (<= |v_main_#t~nondet1_2| 2147483647) (= |v_main_#t~nondet1_2| v_main_~mid~0_6) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~lo~0=v_main_~lo~0_4, main_~mid~0=v_main_~mid~0_6, main_~hi~0=v_main_~hi~0_5} AuxVars[] AssignedVars[main_~lo~0, main_#t~nondet1, main_~mid~0, main_~hi~0] {406#(= main_~lo~0 0)} is VALID [2022-04-07 22:33:38,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {406#(= main_~lo~0 0)} [64] L28-->L30-2: Formula: (and (<= v_main_~mid~0_2 1000000) (< 0 v_main_~mid~0_2) (= v_main_~hi~0_2 (* 2 v_main_~mid~0_2))) InVars {main_~mid~0=v_main_~mid~0_2} OutVars{main_~mid~0=v_main_~mid~0_2, main_~hi~0=v_main_~hi~0_2} AuxVars[] AssignedVars[main_~hi~0] {407#(and (= main_~lo~0 0) (<= (* main_~mid~0 2) main_~hi~0) (<= main_~hi~0 (* main_~mid~0 2)))} is VALID [2022-04-07 22:33:38,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {407#(and (= main_~lo~0 0) (<= (* main_~mid~0 2) main_~hi~0) (<= main_~hi~0 (* main_~mid~0 2)))} [68] L30-2-->L30-2: Formula: (and (= v_main_~hi~0_3 (+ v_main_~hi~0_4 (- 1))) (< 0 v_main_~mid~0_5) (= v_main_~lo~0_2 (+ v_main_~lo~0_3 1)) (= v_main_~mid~0_4 (+ (- 1) v_main_~mid~0_5))) InVars {main_~lo~0=v_main_~lo~0_3, main_~mid~0=v_main_~mid~0_5, main_~hi~0=v_main_~hi~0_4} OutVars{main_~lo~0=v_main_~lo~0_2, main_~mid~0=v_main_~mid~0_4, main_~hi~0=v_main_~hi~0_3} AuxVars[] AssignedVars[main_~lo~0, main_~mid~0, main_~hi~0] {438#(and (= (+ (- 1) main_~lo~0) 0) (<= (+ (* main_~mid~0 2) 1) main_~hi~0) (<= main_~hi~0 (+ (* main_~mid~0 2) 1)))} is VALID [2022-04-07 22:33:38,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {438#(and (= (+ (- 1) main_~lo~0) 0) (<= (+ (* main_~mid~0 2) 1) main_~hi~0) (<= main_~hi~0 (+ (* main_~mid~0 2) 1)))} [68] L30-2-->L30-2: Formula: (and (= v_main_~hi~0_3 (+ v_main_~hi~0_4 (- 1))) (< 0 v_main_~mid~0_5) (= v_main_~lo~0_2 (+ v_main_~lo~0_3 1)) (= v_main_~mid~0_4 (+ (- 1) v_main_~mid~0_5))) InVars {main_~lo~0=v_main_~lo~0_3, main_~mid~0=v_main_~mid~0_5, main_~hi~0=v_main_~hi~0_4} OutVars{main_~lo~0=v_main_~lo~0_2, main_~mid~0=v_main_~mid~0_4, main_~hi~0=v_main_~hi~0_3} AuxVars[] AssignedVars[main_~lo~0, main_~mid~0, main_~hi~0] {442#(and (< 0 (div main_~hi~0 2)) (<= (div (* (- 1) main_~hi~0) (- 2)) (+ main_~mid~0 1)) (= 2 main_~lo~0) (<= (div (* (- 1) main_~hi~0) (- 2)) (div main_~hi~0 2)))} is VALID [2022-04-07 22:33:38,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {442#(and (< 0 (div main_~hi~0 2)) (<= (div (* (- 1) main_~hi~0) (- 2)) (+ main_~mid~0 1)) (= 2 main_~lo~0) (<= (div (* (- 1) main_~hi~0) (- 2)) (div main_~hi~0 2)))} [67] L30-2-->L30-3: Formula: (not (< 0 v_main_~mid~0_3)) InVars {main_~mid~0=v_main_~mid~0_3} OutVars{main_~mid~0=v_main_~mid~0_3} AuxVars[] AssignedVars[] {446#(and (< 0 (div main_~hi~0 2)) (= 2 main_~lo~0) (<= (div (* (- 1) main_~hi~0) (- 2)) 1))} is VALID [2022-04-07 22:33:38,661 INFO L272 TraceCheckUtils]: 10: Hoare triple {446#(and (< 0 (div main_~hi~0 2)) (= 2 main_~lo~0) (<= (div (* (- 1) main_~hi~0) (- 2)) 1))} [69] L30-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~hi~0_6 v_main_~lo~0_7) 1 0)) InVars {main_~lo~0=v_main_~lo~0_7, main_~hi~0=v_main_~hi~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~lo~0, __VERIFIER_assert_#in~cond, main_~hi~0] {450#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 22:33:38,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {450#(<= 1 |__VERIFIER_assert_#in~cond|)} [71] __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] {454#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 22:33:38,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {454#(<= 1 __VERIFIER_assert_~cond)} [72] 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[] {402#false} is VALID [2022-04-07 22:33:38,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {402#false} [74] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {402#false} is VALID [2022-04-07 22:33:38,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:33:38,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 22:33:38,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {402#false} [74] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {402#false} is VALID [2022-04-07 22:33:38,927 INFO L290 TraceCheckUtils]: 12: Hoare triple {454#(<= 1 __VERIFIER_assert_~cond)} [72] 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[] {402#false} is VALID [2022-04-07 22:33:38,927 INFO L290 TraceCheckUtils]: 11: Hoare triple {450#(<= 1 |__VERIFIER_assert_#in~cond|)} [71] __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] {454#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 22:33:38,928 INFO L272 TraceCheckUtils]: 10: Hoare triple {410#(and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1)))} [69] L30-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~hi~0_6 v_main_~lo~0_7) 1 0)) InVars {main_~lo~0=v_main_~lo~0_7, main_~hi~0=v_main_~hi~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~lo~0, __VERIFIER_assert_#in~cond, main_~hi~0] {450#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 22:33:38,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {473#(or (< 0 main_~mid~0) (and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1))))} [67] L30-2-->L30-3: Formula: (not (< 0 v_main_~mid~0_3)) InVars {main_~mid~0=v_main_~mid~0_3} OutVars{main_~mid~0=v_main_~mid~0_3} AuxVars[] AssignedVars[] {410#(and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1)))} is VALID [2022-04-07 22:33:38,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {477#(or (< 1 main_~mid~0) (and (< main_~hi~0 (+ 3 main_~lo~0)) (<= (+ 2 main_~lo~0) main_~hi~0)) (not (< 0 main_~mid~0)))} [68] L30-2-->L30-2: Formula: (and (= v_main_~hi~0_3 (+ v_main_~hi~0_4 (- 1))) (< 0 v_main_~mid~0_5) (= v_main_~lo~0_2 (+ v_main_~lo~0_3 1)) (= v_main_~mid~0_4 (+ (- 1) v_main_~mid~0_5))) InVars {main_~lo~0=v_main_~lo~0_3, main_~mid~0=v_main_~mid~0_5, main_~hi~0=v_main_~hi~0_4} OutVars{main_~lo~0=v_main_~lo~0_2, main_~mid~0=v_main_~mid~0_4, main_~hi~0=v_main_~hi~0_3} AuxVars[] AssignedVars[main_~lo~0, main_~mid~0, main_~hi~0] {473#(or (< 0 main_~mid~0) (and (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1))))} is VALID [2022-04-07 22:33:38,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {481#(or (not (< 1 main_~mid~0)) (< 2 main_~mid~0) (and (< main_~hi~0 (+ 5 main_~lo~0)) (<= (+ main_~lo~0 4) main_~hi~0)))} [68] L30-2-->L30-2: Formula: (and (= v_main_~hi~0_3 (+ v_main_~hi~0_4 (- 1))) (< 0 v_main_~mid~0_5) (= v_main_~lo~0_2 (+ v_main_~lo~0_3 1)) (= v_main_~mid~0_4 (+ (- 1) v_main_~mid~0_5))) InVars {main_~lo~0=v_main_~lo~0_3, main_~mid~0=v_main_~mid~0_5, main_~hi~0=v_main_~hi~0_4} OutVars{main_~lo~0=v_main_~lo~0_2, main_~mid~0=v_main_~mid~0_4, main_~hi~0=v_main_~hi~0_3} AuxVars[] AssignedVars[main_~lo~0, main_~mid~0, main_~hi~0] {477#(or (< 1 main_~mid~0) (and (< main_~hi~0 (+ 3 main_~lo~0)) (<= (+ 2 main_~lo~0) main_~hi~0)) (not (< 0 main_~mid~0)))} is VALID [2022-04-07 22:33:38,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {406#(= main_~lo~0 0)} [64] L28-->L30-2: Formula: (and (<= v_main_~mid~0_2 1000000) (< 0 v_main_~mid~0_2) (= v_main_~hi~0_2 (* 2 v_main_~mid~0_2))) InVars {main_~mid~0=v_main_~mid~0_2} OutVars{main_~mid~0=v_main_~mid~0_2, main_~hi~0=v_main_~hi~0_2} AuxVars[] AssignedVars[main_~hi~0] {481#(or (not (< 1 main_~mid~0)) (< 2 main_~mid~0) (and (< main_~hi~0 (+ 5 main_~lo~0)) (<= (+ main_~lo~0 4) main_~hi~0)))} is VALID [2022-04-07 22:33:38,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {401#true} [61] mainENTRY-->L28: Formula: (and (= v_main_~lo~0_4 0) (<= |v_main_#t~nondet1_2| 2147483647) (= |v_main_#t~nondet1_2| v_main_~mid~0_6) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~lo~0=v_main_~lo~0_4, main_~mid~0=v_main_~mid~0_6, main_~hi~0=v_main_~hi~0_5} AuxVars[] AssignedVars[main_~lo~0, main_#t~nondet1, main_~mid~0, main_~hi~0] {406#(= main_~lo~0 0)} is VALID [2022-04-07 22:33:38,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {401#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {401#true} is VALID [2022-04-07 22:33:38,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {401#true} {401#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {401#true} is VALID [2022-04-07 22:33:38,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {401#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {401#true} is VALID [2022-04-07 22:33:38,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {401#true} [59] 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] {401#true} is VALID [2022-04-07 22:33:38,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {401#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {401#true} is VALID [2022-04-07 22:33:38,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:33:38,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527921303] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 22:33:38,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 22:33:38,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-07 22:33:38,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109895593] [2022-04-07 22:33:38,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 22:33:38,933 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 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-07 22:33:38,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:33:38,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 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-07 22:33:38,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:33:38,952 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-07 22:33:38,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:33:38,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-07 22:33:38,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-07 22:33:38,953 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 18 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 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-07 22:33:39,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:33:39,298 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-07 22:33:39,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-07 22:33:39,299 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 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-07 22:33:39,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:33:39,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 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-07 22:33:39,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2022-04-07 22:33:39,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 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-07 22:33:39,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2022-04-07 22:33:39,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 18 transitions. [2022-04-07 22:33:39,316 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-07 22:33:39,316 INFO L225 Difference]: With dead ends: 17 [2022-04-07 22:33:39,316 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 22:33:39,317 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2022-04-07 22:33:39,318 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 22:33:39,318 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 60 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 22:33:39,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 22:33:39,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 22:33:39,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:33:39,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 22:33:39,319 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 22:33:39,319 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 22:33:39,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:33:39,319 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 22:33:39,319 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 22:33:39,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:33:39,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:33:39,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 22:33:39,319 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 22:33:39,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:33:39,319 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 22:33:39,319 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 22:33:39,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:33:39,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:33:39,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:33:39,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:33:39,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 22:33:39,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 22:33:39,320 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-07 22:33:39,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:33:39,320 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 22:33:39,320 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 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-07 22:33:39,320 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 22:33:39,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:33:39,322 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 22:33:39,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 22:33:39,535 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-07 22:33:39,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 22:33:39,613 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-07 22:33:39,614 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 22:33:39,614 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 22:33:39,614 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 22:33:39,614 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 22:33:39,614 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 22:33:39,614 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 22:33:39,614 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 37) the Hoare annotation is: true [2022-04-07 22:33:39,614 INFO L882 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-04-07 22:33:39,614 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 24 37) no Hoare annotation was computed. [2022-04-07 22:33:39,614 INFO L878 garLoopResultBuilder]: At program point L30-2(lines 30 34) the Hoare annotation is: (let ((.cse0 (+ main_~lo~0 (* main_~mid~0 2)))) (and (<= main_~hi~0 .cse0) (<= main_~lo~0 main_~hi~0) (<= .cse0 main_~hi~0))) [2022-04-07 22:33:39,614 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 24 37) no Hoare annotation was computed. [2022-04-07 22:33:39,614 INFO L878 garLoopResultBuilder]: At program point L30-3(lines 30 34) the Hoare annotation is: (or (let ((.cse0 (+ main_~lo~0 (* main_~mid~0 2)))) (and (<= main_~hi~0 .cse0) (<= main_~lo~0 main_~hi~0) (< main_~hi~0 (+ main_~lo~0 1)) (<= .cse0 main_~hi~0))) (let ((.cse1 (div (+ (- 1) (* (- 1) main_~hi~0)) (- 2)))) (and (< 0 .cse1) (= (mod (+ main_~hi~0 1) 2) 0) (<= .cse1 1) (<= .cse1 (+ main_~mid~0 1)) (= main_~lo~0 1)))) [2022-04-07 22:33:39,614 INFO L882 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-04-07 22:33:39,614 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-07 22:33:39,614 INFO L882 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-07 22:33:39,614 INFO L882 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-07 22:33:39,615 INFO L882 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-07 22:33:39,615 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-07 22:33:39,615 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-07 22:33:39,617 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-07 22:33:39,618 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 22:33:39,627 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 22:33:39,627 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-07 22:33:39,627 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-07 22:33:39,627 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 22:33:39,627 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-07 22:33:39,628 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-07 22:33:39,628 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-07 22:33:39,628 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-07 22:33:39,628 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 22:33:39,628 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 22:33:39,631 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-07 22:33:39,631 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-07 22:33:39,631 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-07 22:33:39,631 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 22:33:39,631 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 22:33:39,631 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 22:33:39,631 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-07 22:33:39,631 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-07 22:33:39,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 10:33:39 BasicIcfg [2022-04-07 22:33:39,638 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 22:33:39,639 INFO L158 Benchmark]: Toolchain (without parser) took 4375.02ms. Allocated memory was 189.8MB in the beginning and 266.3MB in the end (delta: 76.5MB). Free memory was 134.0MB in the beginning and 162.1MB in the end (delta: -28.1MB). Peak memory consumption was 49.2MB. Max. memory is 8.0GB. [2022-04-07 22:33:39,639 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory was 150.4MB in the beginning and 150.3MB in the end (delta: 129.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 22:33:39,639 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.23ms. Allocated memory was 189.8MB in the beginning and 266.3MB in the end (delta: 76.5MB). Free memory was 133.7MB in the beginning and 239.3MB in the end (delta: -105.5MB). Peak memory consumption was 7.1MB. Max. memory is 8.0GB. [2022-04-07 22:33:39,640 INFO L158 Benchmark]: Boogie Preprocessor took 21.99ms. Allocated memory is still 266.3MB. Free memory was 239.3MB in the beginning and 238.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 22:33:39,640 INFO L158 Benchmark]: RCFGBuilder took 192.74ms. Allocated memory is still 266.3MB. Free memory was 238.2MB in the beginning and 227.2MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-07 22:33:39,640 INFO L158 Benchmark]: IcfgTransformer took 19.51ms. Allocated memory is still 266.3MB. Free memory was 227.2MB in the beginning and 225.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 22:33:39,640 INFO L158 Benchmark]: TraceAbstraction took 3963.28ms. Allocated memory is still 266.3MB. Free memory was 225.1MB in the beginning and 162.1MB in the end (delta: 63.0MB). Peak memory consumption was 64.6MB. Max. memory is 8.0GB. [2022-04-07 22:33:39,641 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 189.8MB. Free memory was 150.4MB in the beginning and 150.3MB in the end (delta: 129.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 172.23ms. Allocated memory was 189.8MB in the beginning and 266.3MB in the end (delta: 76.5MB). Free memory was 133.7MB in the beginning and 239.3MB in the end (delta: -105.5MB). Peak memory consumption was 7.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.99ms. Allocated memory is still 266.3MB. Free memory was 239.3MB in the beginning and 238.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 192.74ms. Allocated memory is still 266.3MB. Free memory was 238.2MB in the beginning and 227.2MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 19.51ms. Allocated memory is still 266.3MB. Free memory was 227.2MB in the beginning and 225.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 3963.28ms. Allocated memory is still 266.3MB. Free memory was 225.1MB in the beginning and 162.1MB in the end (delta: 63.0MB). Peak memory consumption was 64.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 139 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 89 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 125 IncrementalHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 50 mSDtfsCounter, 125 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 17 NumberOfFragments, 93 HoareAnnotationTreeSize, 11 FomulaSimplifications, 14 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 121 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 482 SizeOfPredicates, 6 NumberOfNonLiveVariables, 131 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 0/12 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: 30]: Loop Invariant Derived loop invariant: (hi <= lo + mid * 2 && lo <= hi) && lo + mid * 2 <= hi RESULT: Ultimate proved your program to be correct! [2022-04-07 22:33:39,666 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...