/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-invgen/large_const.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 00:36:23,412 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 00:36:23,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 00:36:23,446 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 00:36:23,447 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 00:36:23,448 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 00:36:23,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 00:36:23,454 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 00:36:23,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 00:36:23,460 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 00:36:23,460 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 00:36:23,461 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 00:36:23,461 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 00:36:23,461 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 00:36:23,462 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 00:36:23,462 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 00:36:23,463 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 00:36:23,463 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 00:36:23,464 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 00:36:23,465 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 00:36:23,466 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 00:36:23,468 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 00:36:23,469 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 00:36:23,470 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 00:36:23,471 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 00:36:23,478 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 00:36:23,478 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 00:36:23,478 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 00:36:23,479 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 00:36:23,479 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 00:36:23,480 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 00:36:23,480 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 00:36:23,481 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 00:36:23,482 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 00:36:23,482 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 00:36:23,483 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 00:36:23,483 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 00:36:23,483 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 00:36:23,483 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 00:36:23,484 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 00:36:23,484 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 00:36:23,486 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 00:36:23,486 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 00:36:23,510 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 00:36:23,510 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 00:36:23,511 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 00:36:23,511 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 00:36:23,511 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 00:36:23,512 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 00:36:23,512 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 00:36:23,512 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 00:36:23,512 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 00:36:23,512 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 00:36:23,513 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 00:36:23,513 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 00:36:23,513 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 00:36:23,513 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 00:36:23,513 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 00:36:23,513 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 00:36:23,513 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 00:36:23,513 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 00:36:23,513 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 00:36:23,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:36:23,514 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 00:36:23,514 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 00:36:23,514 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 00:36:23,514 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 00:36:23,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 00:36:23,514 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 00:36:23,514 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 00:36:23,514 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 00:36:23,516 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 00:36:23,516 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-15 00:36:23,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 00:36:23,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 00:36:23,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 00:36:23,713 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 00:36:23,714 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 00:36:23,715 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/large_const.i [2022-04-15 00:36:23,751 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f273483af/3940446c0345486294bad9d07854e8a4/FLAG9de3e59f6 [2022-04-15 00:36:24,099 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 00:36:24,100 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/large_const.i [2022-04-15 00:36:24,104 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f273483af/3940446c0345486294bad9d07854e8a4/FLAG9de3e59f6 [2022-04-15 00:36:24,117 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f273483af/3940446c0345486294bad9d07854e8a4 [2022-04-15 00:36:24,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 00:36:24,122 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 00:36:24,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 00:36:24,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 00:36:24,126 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 00:36:24,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:36:24" (1/1) ... [2022-04-15 00:36:24,131 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ca5be9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:36:24, skipping insertion in model container [2022-04-15 00:36:24,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:36:24" (1/1) ... [2022-04-15 00:36:24,136 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 00:36:24,147 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 00:36:24,306 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-invgen/large_const.i[893,906] [2022-04-15 00:36:24,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:36:24,335 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 00:36:24,347 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-invgen/large_const.i[893,906] [2022-04-15 00:36:24,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:36:24,368 INFO L208 MainTranslator]: Completed translation [2022-04-15 00:36:24,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:36:24 WrapperNode [2022-04-15 00:36:24,370 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 00:36:24,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 00:36:24,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 00:36:24,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 00:36:24,379 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:36:24" (1/1) ... [2022-04-15 00:36:24,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:36:24" (1/1) ... [2022-04-15 00:36:24,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:36:24" (1/1) ... [2022-04-15 00:36:24,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:36:24" (1/1) ... [2022-04-15 00:36:24,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:36:24" (1/1) ... [2022-04-15 00:36:24,398 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:36:24" (1/1) ... [2022-04-15 00:36:24,404 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:36:24" (1/1) ... [2022-04-15 00:36:24,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 00:36:24,407 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 00:36:24,407 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 00:36:24,407 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 00:36:24,408 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:36:24" (1/1) ... [2022-04-15 00:36:24,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:36:24,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:36:24,429 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-15 00:36:24,444 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-15 00:36:24,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 00:36:24,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 00:36:24,461 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 00:36:24,461 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 00:36:24,461 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 00:36:24,461 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 00:36:24,462 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 00:36:24,462 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 00:36:24,463 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 00:36:24,463 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 00:36:24,463 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 00:36:24,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 00:36:24,463 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 00:36:24,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 00:36:24,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 00:36:24,463 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 00:36:24,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 00:36:24,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 00:36:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 00:36:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 00:36:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 00:36:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 00:36:24,529 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 00:36:24,531 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 00:36:24,737 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 00:36:24,741 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 00:36:24,742 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 00:36:24,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:36:24 BoogieIcfgContainer [2022-04-15 00:36:24,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 00:36:24,743 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 00:36:24,744 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 00:36:24,744 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 00:36:24,746 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:36:24" (1/1) ... [2022-04-15 00:36:24,748 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 00:36:24,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:36:24 BasicIcfg [2022-04-15 00:36:24,768 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 00:36:24,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 00:36:24,769 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 00:36:24,774 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 00:36:24,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:36:24" (1/4) ... [2022-04-15 00:36:24,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be93306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:36:24, skipping insertion in model container [2022-04-15 00:36:24,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:36:24" (2/4) ... [2022-04-15 00:36:24,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be93306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:36:24, skipping insertion in model container [2022-04-15 00:36:24,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:36:24" (3/4) ... [2022-04-15 00:36:24,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be93306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:36:24, skipping insertion in model container [2022-04-15 00:36:24,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:36:24" (4/4) ... [2022-04-15 00:36:24,776 INFO L111 eAbstractionObserver]: Analyzing ICFG large_const.iqvasr [2022-04-15 00:36:24,779 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 00:36:24,779 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 00:36:24,809 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 00:36:24,813 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-15 00:36:24,813 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 00:36:24,829 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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-15 00:36:24,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 00:36:24,832 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:36:24,832 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:36:24,833 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:36:24,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:36:24,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1699974766, now seen corresponding path program 1 times [2022-04-15 00:36:24,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:36:24,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856922252] [2022-04-15 00:36:24,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:36:24,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:36:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:36:25,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:36:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:36:25,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] 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] {29#true} is VALID [2022-04-15 00:36:25,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-15 00:36:25,088 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-15 00:36:25,090 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:36:25,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] 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] {29#true} is VALID [2022-04-15 00:36:25,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-15 00:36:25,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-15 00:36:25,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} [87] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {29#true} is VALID [2022-04-15 00:36:25,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} [90] mainENTRY-->L31: Formula: (and (= 10000 v_main_~c3~0_2) (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet1_2|) (= |v_main_#in~argc_1| v_main_~argc_1) (= 2000 v_main_~c2~0_2) (= 4000 v_main_~c1~0_2) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~c1~0=v_main_~c1~0_2, main_~v~0=v_main_~v~0_6, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~j~0=v_main_~j~0_1, main_~argc=v_main_~argc_1, main_~c2~0=v_main_~c2~0_2, main_#in~argv.base=|v_main_#in~argv.base_1|, main_~k~0=v_main_~k~0_7, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~n~0=v_main_~n~0_2, main_~argv.base=v_main_~argv.base_1, main_~c3~0=v_main_~c3~0_2, main_~argv.offset=v_main_~argv.offset_1} AuxVars[] AssignedVars[main_~c1~0, main_~v~0, main_#t~nondet1, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~argc, main_~c2~0, main_~argv.base, main_~c3~0, main_~argv.offset] {29#true} is VALID [2022-04-15 00:36:25,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} [93] L31-->L40-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_2 0) (< v_main_~n~0_5 10) (= v_main_~k~0_8 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {34#(= main_~i~0 0)} is VALID [2022-04-15 00:36:25,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#(= main_~i~0 0)} [96] L40-2-->L34-2: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {35#(<= main_~n~0 0)} is VALID [2022-04-15 00:36:25,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#(<= main_~n~0 0)} [98] L34-2-->L46-2: Formula: (= v_main_~j~0_2 0) InVars {} OutVars{main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {36#(and (= main_~j~0 0) (<= main_~n~0 0))} is VALID [2022-04-15 00:36:25,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#(and (= main_~j~0 0) (<= main_~n~0 0))} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {30#false} is VALID [2022-04-15 00:36:25,112 INFO L272 TraceCheckUtils]: 10: Hoare triple {30#false} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {30#false} is VALID [2022-04-15 00:36:25,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {30#false} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {30#false} is VALID [2022-04-15 00:36:25,113 INFO L290 TraceCheckUtils]: 12: Hoare triple {30#false} [112] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {30#false} is VALID [2022-04-15 00:36:25,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {30#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#false} is VALID [2022-04-15 00:36:25,113 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-15 00:36:25,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:36:25,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856922252] [2022-04-15 00:36:25,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856922252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:36:25,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:36:25,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:36:25,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254906549] [2022-04-15 00:36:25,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:36:25,119 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 14 [2022-04-15 00:36:25,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:36:25,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-15 00:36:25,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:36:25,144 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:36:25,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:36:25,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:36:25,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:36:25,165 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-15 00:36:25,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:36:25,397 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-15 00:36:25,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 00:36:25,397 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 14 [2022-04-15 00:36:25,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:36:25,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-15 00:36:25,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-04-15 00:36:25,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-15 00:36:25,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-04-15 00:36:25,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 62 transitions. [2022-04-15 00:36:25,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:36:25,454 INFO L225 Difference]: With dead ends: 47 [2022-04-15 00:36:25,455 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 00:36:25,456 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-15 00:36:25,459 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 38 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:36:25,459 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 44 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 00:36:25,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 00:36:25,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-15 00:36:25,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:36:25,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:36:25,477 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:36:25,478 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:36:25,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:36:25,479 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-15 00:36:25,480 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-15 00:36:25,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:36:25,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:36:25,480 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-15 00:36:25,480 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-15 00:36:25,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:36:25,482 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-15 00:36:25,482 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-15 00:36:25,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:36:25,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:36:25,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:36:25,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:36:25,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:36:25,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-04-15 00:36:25,485 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2022-04-15 00:36:25,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:36:25,485 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-04-15 00:36:25,485 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-15 00:36:25,485 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-15 00:36:25,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 00:36:25,486 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:36:25,486 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:36:25,486 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 00:36:25,486 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:36:25,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:36:25,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1632940157, now seen corresponding path program 1 times [2022-04-15 00:36:25,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:36:25,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132811672] [2022-04-15 00:36:25,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:36:25,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:36:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:36:25,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:36:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:36:25,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] 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] {181#true} is VALID [2022-04-15 00:36:25,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {181#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-15 00:36:25,582 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {181#true} {181#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-15 00:36:25,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {181#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:36:25,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] 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] {181#true} is VALID [2022-04-15 00:36:25,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {181#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-15 00:36:25,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {181#true} {181#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-15 00:36:25,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {181#true} [87] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {181#true} is VALID [2022-04-15 00:36:25,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {181#true} [90] mainENTRY-->L31: Formula: (and (= 10000 v_main_~c3~0_2) (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet1_2|) (= |v_main_#in~argc_1| v_main_~argc_1) (= 2000 v_main_~c2~0_2) (= 4000 v_main_~c1~0_2) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~c1~0=v_main_~c1~0_2, main_~v~0=v_main_~v~0_6, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~j~0=v_main_~j~0_1, main_~argc=v_main_~argc_1, main_~c2~0=v_main_~c2~0_2, main_#in~argv.base=|v_main_#in~argv.base_1|, main_~k~0=v_main_~k~0_7, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~n~0=v_main_~n~0_2, main_~argv.base=v_main_~argv.base_1, main_~c3~0=v_main_~c3~0_2, main_~argv.offset=v_main_~argv.offset_1} AuxVars[] AssignedVars[main_~c1~0, main_~v~0, main_#t~nondet1, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~argc, main_~c2~0, main_~argv.base, main_~c3~0, main_~argv.offset] {186#(<= 4000 main_~c1~0)} is VALID [2022-04-15 00:36:25,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {186#(<= 4000 main_~c1~0)} [93] L31-->L40-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_2 0) (< v_main_~n~0_5 10) (= v_main_~k~0_8 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {187#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} is VALID [2022-04-15 00:36:25,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {187#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} [97] L40-2-->L37: Formula: (and (< v_main_~i~0_5 v_main_~n~0_9) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~v~0_7 |v_main_#t~nondet3_2|) (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_#t~nondet3=|v_main_#t~nondet3_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~v~0=v_main_~v~0_7, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~v~0, main_#t~nondet3, main_~i~0, main_#t~post2] {187#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} is VALID [2022-04-15 00:36:25,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {187#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} [100] L37-->L38: Formula: (and (<= 0 v_main_~v~0_1) (< v_main_~n~0_1 2)) InVars {main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {187#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} is VALID [2022-04-15 00:36:25,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {187#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} [104] L38-->L40-2: Formula: (and (= v_main_~v~0_2 0) (= v_main_~k~0_1 (+ v_main_~k~0_2 v_main_~c1~0_1))) InVars {main_~c1~0=v_main_~c1~0_1, main_~v~0=v_main_~v~0_2, main_~k~0=v_main_~k~0_2} OutVars{main_~c1~0=v_main_~c1~0_1, main_~v~0=v_main_~v~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0] {188#(<= 4000 main_~k~0)} is VALID [2022-04-15 00:36:25,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {188#(<= 4000 main_~k~0)} [96] L40-2-->L34-2: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {188#(<= 4000 main_~k~0)} is VALID [2022-04-15 00:36:25,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {188#(<= 4000 main_~k~0)} [98] L34-2-->L46-2: Formula: (= v_main_~j~0_2 0) InVars {} OutVars{main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {188#(<= 4000 main_~k~0)} is VALID [2022-04-15 00:36:25,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {188#(<= 4000 main_~k~0)} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {188#(<= 4000 main_~k~0)} is VALID [2022-04-15 00:36:25,588 INFO L272 TraceCheckUtils]: 13: Hoare triple {188#(<= 4000 main_~k~0)} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {189#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:36:25,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {189#(not (= |__VERIFIER_assert_#in~cond| 0))} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {190#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:36:25,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {190#(not (= __VERIFIER_assert_~cond 0))} [112] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {182#false} is VALID [2022-04-15 00:36:25,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {182#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#false} is VALID [2022-04-15 00:36:25,590 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-15 00:36:25,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:36:25,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132811672] [2022-04-15 00:36:25,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132811672] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:36:25,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920001535] [2022-04-15 00:36:25,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:36:25,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:36:25,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:36:25,592 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-15 00:36:25,593 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-15 00:36:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:36:25,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 00:36:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:36:25,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:36:25,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {181#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-15 00:36:25,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {181#true} [88] 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] {181#true} is VALID [2022-04-15 00:36:25,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {181#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-15 00:36:25,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {181#true} {181#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-15 00:36:25,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {181#true} [87] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {181#true} is VALID [2022-04-15 00:36:25,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {181#true} [90] mainENTRY-->L31: Formula: (and (= 10000 v_main_~c3~0_2) (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet1_2|) (= |v_main_#in~argc_1| v_main_~argc_1) (= 2000 v_main_~c2~0_2) (= 4000 v_main_~c1~0_2) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~c1~0=v_main_~c1~0_2, main_~v~0=v_main_~v~0_6, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~j~0=v_main_~j~0_1, main_~argc=v_main_~argc_1, main_~c2~0=v_main_~c2~0_2, main_#in~argv.base=|v_main_#in~argv.base_1|, main_~k~0=v_main_~k~0_7, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~n~0=v_main_~n~0_2, main_~argv.base=v_main_~argv.base_1, main_~c3~0=v_main_~c3~0_2, main_~argv.offset=v_main_~argv.offset_1} AuxVars[] AssignedVars[main_~c1~0, main_~v~0, main_#t~nondet1, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~argc, main_~c2~0, main_~argv.base, main_~c3~0, main_~argv.offset] {186#(<= 4000 main_~c1~0)} is VALID [2022-04-15 00:36:25,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {186#(<= 4000 main_~c1~0)} [93] L31-->L40-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_2 0) (< v_main_~n~0_5 10) (= v_main_~k~0_8 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {213#(and (<= 0 main_~k~0) (<= 4000 main_~c1~0))} is VALID [2022-04-15 00:36:25,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {213#(and (<= 0 main_~k~0) (<= 4000 main_~c1~0))} [97] L40-2-->L37: Formula: (and (< v_main_~i~0_5 v_main_~n~0_9) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~v~0_7 |v_main_#t~nondet3_2|) (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_#t~nondet3=|v_main_#t~nondet3_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~v~0=v_main_~v~0_7, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~v~0, main_#t~nondet3, main_~i~0, main_#t~post2] {213#(and (<= 0 main_~k~0) (<= 4000 main_~c1~0))} is VALID [2022-04-15 00:36:25,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {213#(and (<= 0 main_~k~0) (<= 4000 main_~c1~0))} [100] L37-->L38: Formula: (and (<= 0 v_main_~v~0_1) (< v_main_~n~0_1 2)) InVars {main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {213#(and (<= 0 main_~k~0) (<= 4000 main_~c1~0))} is VALID [2022-04-15 00:36:25,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {213#(and (<= 0 main_~k~0) (<= 4000 main_~c1~0))} [104] L38-->L40-2: Formula: (and (= v_main_~v~0_2 0) (= v_main_~k~0_1 (+ v_main_~k~0_2 v_main_~c1~0_1))) InVars {main_~c1~0=v_main_~c1~0_1, main_~v~0=v_main_~v~0_2, main_~k~0=v_main_~k~0_2} OutVars{main_~c1~0=v_main_~c1~0_1, main_~v~0=v_main_~v~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0] {188#(<= 4000 main_~k~0)} is VALID [2022-04-15 00:36:25,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {188#(<= 4000 main_~k~0)} [96] L40-2-->L34-2: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {188#(<= 4000 main_~k~0)} is VALID [2022-04-15 00:36:25,851 INFO L290 TraceCheckUtils]: 11: Hoare triple {188#(<= 4000 main_~k~0)} [98] L34-2-->L46-2: Formula: (= v_main_~j~0_2 0) InVars {} OutVars{main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {188#(<= 4000 main_~k~0)} is VALID [2022-04-15 00:36:25,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {188#(<= 4000 main_~k~0)} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {188#(<= 4000 main_~k~0)} is VALID [2022-04-15 00:36:25,855 INFO L272 TraceCheckUtils]: 13: Hoare triple {188#(<= 4000 main_~k~0)} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {235#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:36:25,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {235#(<= 1 |__VERIFIER_assert_#in~cond|)} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {239#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:36:25,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {239#(<= 1 __VERIFIER_assert_~cond)} [112] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {182#false} is VALID [2022-04-15 00:36:25,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {182#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#false} is VALID [2022-04-15 00:36:25,856 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-15 00:36:25,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:36:26,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {182#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#false} is VALID [2022-04-15 00:36:26,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {239#(<= 1 __VERIFIER_assert_~cond)} [112] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {182#false} is VALID [2022-04-15 00:36:26,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {235#(<= 1 |__VERIFIER_assert_#in~cond|)} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {239#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:36:26,021 INFO L272 TraceCheckUtils]: 13: Hoare triple {255#(< 0 main_~k~0)} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {235#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:36:26,022 INFO L290 TraceCheckUtils]: 12: Hoare triple {255#(< 0 main_~k~0)} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {255#(< 0 main_~k~0)} is VALID [2022-04-15 00:36:26,022 INFO L290 TraceCheckUtils]: 11: Hoare triple {255#(< 0 main_~k~0)} [98] L34-2-->L46-2: Formula: (= v_main_~j~0_2 0) InVars {} OutVars{main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {255#(< 0 main_~k~0)} is VALID [2022-04-15 00:36:26,023 INFO L290 TraceCheckUtils]: 10: Hoare triple {255#(< 0 main_~k~0)} [96] L40-2-->L34-2: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {255#(< 0 main_~k~0)} is VALID [2022-04-15 00:36:26,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {268#(< 0 (+ main_~k~0 main_~c1~0))} [104] L38-->L40-2: Formula: (and (= v_main_~v~0_2 0) (= v_main_~k~0_1 (+ v_main_~k~0_2 v_main_~c1~0_1))) InVars {main_~c1~0=v_main_~c1~0_1, main_~v~0=v_main_~v~0_2, main_~k~0=v_main_~k~0_2} OutVars{main_~c1~0=v_main_~c1~0_1, main_~v~0=v_main_~v~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0] {255#(< 0 main_~k~0)} is VALID [2022-04-15 00:36:26,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {268#(< 0 (+ main_~k~0 main_~c1~0))} [100] L37-->L38: Formula: (and (<= 0 v_main_~v~0_1) (< v_main_~n~0_1 2)) InVars {main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {268#(< 0 (+ main_~k~0 main_~c1~0))} is VALID [2022-04-15 00:36:26,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {268#(< 0 (+ main_~k~0 main_~c1~0))} [97] L40-2-->L37: Formula: (and (< v_main_~i~0_5 v_main_~n~0_9) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~v~0_7 |v_main_#t~nondet3_2|) (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_#t~nondet3=|v_main_#t~nondet3_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~v~0=v_main_~v~0_7, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~v~0, main_#t~nondet3, main_~i~0, main_#t~post2] {268#(< 0 (+ main_~k~0 main_~c1~0))} is VALID [2022-04-15 00:36:26,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {278#(< 0 main_~c1~0)} [93] L31-->L40-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_2 0) (< v_main_~n~0_5 10) (= v_main_~k~0_8 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {268#(< 0 (+ main_~k~0 main_~c1~0))} is VALID [2022-04-15 00:36:26,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {181#true} [90] mainENTRY-->L31: Formula: (and (= 10000 v_main_~c3~0_2) (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet1_2|) (= |v_main_#in~argc_1| v_main_~argc_1) (= 2000 v_main_~c2~0_2) (= 4000 v_main_~c1~0_2) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~c1~0=v_main_~c1~0_2, main_~v~0=v_main_~v~0_6, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~j~0=v_main_~j~0_1, main_~argc=v_main_~argc_1, main_~c2~0=v_main_~c2~0_2, main_#in~argv.base=|v_main_#in~argv.base_1|, main_~k~0=v_main_~k~0_7, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~n~0=v_main_~n~0_2, main_~argv.base=v_main_~argv.base_1, main_~c3~0=v_main_~c3~0_2, main_~argv.offset=v_main_~argv.offset_1} AuxVars[] AssignedVars[main_~c1~0, main_~v~0, main_#t~nondet1, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~argc, main_~c2~0, main_~argv.base, main_~c3~0, main_~argv.offset] {278#(< 0 main_~c1~0)} is VALID [2022-04-15 00:36:26,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {181#true} [87] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {181#true} is VALID [2022-04-15 00:36:26,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {181#true} {181#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-15 00:36:26,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {181#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-15 00:36:26,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {181#true} [88] 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] {181#true} is VALID [2022-04-15 00:36:26,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {181#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-15 00:36:26,027 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-15 00:36:26,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920001535] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:36:26,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:36:26,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-15 00:36:26,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411332763] [2022-04-15 00:36:26,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:36:26,033 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 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 17 [2022-04-15 00:36:26,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:36:26,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 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-15 00:36:26,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:36:26,057 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 00:36:26,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:36:26,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 00:36:26,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-15 00:36:26,058 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 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-15 00:36:26,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:36:26,563 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-04-15 00:36:26,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 00:36:26,563 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 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 17 [2022-04-15 00:36:26,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:36:26,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 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-15 00:36:26,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-15 00:36:26,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 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-15 00:36:26,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-15 00:36:26,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 59 transitions. [2022-04-15 00:36:26,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:36:26,613 INFO L225 Difference]: With dead ends: 48 [2022-04-15 00:36:26,613 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 00:36:26,614 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2022-04-15 00:36:26,614 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 97 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 00:36:26,615 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 47 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 00:36:26,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 00:36:26,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2022-04-15 00:36:26,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:36:26,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 35 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 00:36:26,638 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 35 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 00:36:26,638 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 35 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 00:36:26,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:36:26,641 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-04-15 00:36:26,641 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-04-15 00:36:26,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:36:26,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:36:26,642 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 46 states. [2022-04-15 00:36:26,642 INFO L87 Difference]: Start difference. First operand has 35 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 46 states. [2022-04-15 00:36:26,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:36:26,644 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-04-15 00:36:26,645 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-04-15 00:36:26,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:36:26,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:36:26,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:36:26,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:36:26,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 00:36:26,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-04-15 00:36:26,647 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 17 [2022-04-15 00:36:26,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:36:26,647 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-04-15 00:36:26,647 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 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-15 00:36:26,647 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-15 00:36:26,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 00:36:26,648 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:36:26,648 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:36:26,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 00:36:26,848 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:36:26,849 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:36:26,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:36:26,849 INFO L85 PathProgramCache]: Analyzing trace with hash 922895784, now seen corresponding path program 1 times [2022-04-15 00:36:26,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:36:26,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161514944] [2022-04-15 00:36:26,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:36:26,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:36:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:36:26,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:36:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:36:26,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {536#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] 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] {526#true} is VALID [2022-04-15 00:36:26,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-15 00:36:26,913 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {526#true} {526#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-15 00:36:26,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {526#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {536#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:36:26,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {536#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] 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] {526#true} is VALID [2022-04-15 00:36:26,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {526#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-15 00:36:26,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {526#true} {526#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-15 00:36:26,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {526#true} [87] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {526#true} is VALID [2022-04-15 00:36:26,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {526#true} [90] mainENTRY-->L31: Formula: (and (= 10000 v_main_~c3~0_2) (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet1_2|) (= |v_main_#in~argc_1| v_main_~argc_1) (= 2000 v_main_~c2~0_2) (= 4000 v_main_~c1~0_2) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~c1~0=v_main_~c1~0_2, main_~v~0=v_main_~v~0_6, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~j~0=v_main_~j~0_1, main_~argc=v_main_~argc_1, main_~c2~0=v_main_~c2~0_2, main_#in~argv.base=|v_main_#in~argv.base_1|, main_~k~0=v_main_~k~0_7, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~n~0=v_main_~n~0_2, main_~argv.base=v_main_~argv.base_1, main_~c3~0=v_main_~c3~0_2, main_~argv.offset=v_main_~argv.offset_1} AuxVars[] AssignedVars[main_~c1~0, main_~v~0, main_#t~nondet1, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~argc, main_~c2~0, main_~argv.base, main_~c3~0, main_~argv.offset] {531#(<= 2000 main_~c2~0)} is VALID [2022-04-15 00:36:26,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {531#(<= 2000 main_~c2~0)} [93] L31-->L40-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_2 0) (< v_main_~n~0_5 10) (= v_main_~k~0_8 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {532#(and (= main_~k~0 0) (<= 2000 main_~c2~0))} is VALID [2022-04-15 00:36:26,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {532#(and (= main_~k~0 0) (<= 2000 main_~c2~0))} [97] L40-2-->L37: Formula: (and (< v_main_~i~0_5 v_main_~n~0_9) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~v~0_7 |v_main_#t~nondet3_2|) (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_#t~nondet3=|v_main_#t~nondet3_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~v~0=v_main_~v~0_7, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~v~0, main_#t~nondet3, main_~i~0, main_#t~post2] {532#(and (= main_~k~0 0) (<= 2000 main_~c2~0))} is VALID [2022-04-15 00:36:26,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {532#(and (= main_~k~0 0) (<= 2000 main_~c2~0))} [100] L37-->L38: Formula: (and (<= 0 v_main_~v~0_1) (< v_main_~n~0_1 2)) InVars {main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {532#(and (= main_~k~0 0) (<= 2000 main_~c2~0))} is VALID [2022-04-15 00:36:26,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {532#(and (= main_~k~0 0) (<= 2000 main_~c2~0))} [105] L38-->L40: Formula: (not (= v_main_~v~0_3 0)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {532#(and (= main_~k~0 0) (<= 2000 main_~c2~0))} is VALID [2022-04-15 00:36:26,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {532#(and (= main_~k~0 0) (<= 2000 main_~c2~0))} [108] L40-->L40-2: Formula: (and (= v_main_~k~0_3 (+ v_main_~k~0_4 v_main_~c2~0_1)) (= v_main_~v~0_4 1)) InVars {main_~v~0=v_main_~v~0_4, main_~c2~0=v_main_~c2~0_1, main_~k~0=v_main_~k~0_4} OutVars{main_~v~0=v_main_~v~0_4, main_~c2~0=v_main_~c2~0_1, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[main_~k~0] {533#(<= 2000 main_~k~0)} is VALID [2022-04-15 00:36:26,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {533#(<= 2000 main_~k~0)} [96] L40-2-->L34-2: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {533#(<= 2000 main_~k~0)} is VALID [2022-04-15 00:36:26,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {533#(<= 2000 main_~k~0)} [98] L34-2-->L46-2: Formula: (= v_main_~j~0_2 0) InVars {} OutVars{main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {533#(<= 2000 main_~k~0)} is VALID [2022-04-15 00:36:26,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {533#(<= 2000 main_~k~0)} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {533#(<= 2000 main_~k~0)} is VALID [2022-04-15 00:36:26,918 INFO L272 TraceCheckUtils]: 14: Hoare triple {533#(<= 2000 main_~k~0)} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {534#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:36:26,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {534#(not (= |__VERIFIER_assert_#in~cond| 0))} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {535#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:36:26,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {535#(not (= __VERIFIER_assert_~cond 0))} [112] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {527#false} is VALID [2022-04-15 00:36:26,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {527#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {527#false} is VALID [2022-04-15 00:36:26,920 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-15 00:36:26,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:36:26,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161514944] [2022-04-15 00:36:26,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161514944] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:36:26,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780937453] [2022-04-15 00:36:26,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:36:26,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:36:26,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:36:26,921 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-15 00:36:26,923 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-15 00:36:26,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:36:26,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 00:36:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:36:26,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:36:27,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {526#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-15 00:36:27,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#true} [88] 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] {526#true} is VALID [2022-04-15 00:36:27,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {526#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-15 00:36:27,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {526#true} {526#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-15 00:36:27,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {526#true} [87] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {526#true} is VALID [2022-04-15 00:36:27,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {526#true} [90] mainENTRY-->L31: Formula: (and (= 10000 v_main_~c3~0_2) (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet1_2|) (= |v_main_#in~argc_1| v_main_~argc_1) (= 2000 v_main_~c2~0_2) (= 4000 v_main_~c1~0_2) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~c1~0=v_main_~c1~0_2, main_~v~0=v_main_~v~0_6, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~j~0=v_main_~j~0_1, main_~argc=v_main_~argc_1, main_~c2~0=v_main_~c2~0_2, main_#in~argv.base=|v_main_#in~argv.base_1|, main_~k~0=v_main_~k~0_7, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~n~0=v_main_~n~0_2, main_~argv.base=v_main_~argv.base_1, main_~c3~0=v_main_~c3~0_2, main_~argv.offset=v_main_~argv.offset_1} AuxVars[] AssignedVars[main_~c1~0, main_~v~0, main_#t~nondet1, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~argc, main_~c2~0, main_~argv.base, main_~c3~0, main_~argv.offset] {531#(<= 2000 main_~c2~0)} is VALID [2022-04-15 00:36:27,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {531#(<= 2000 main_~c2~0)} [93] L31-->L40-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_2 0) (< v_main_~n~0_5 10) (= v_main_~k~0_8 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {558#(and (<= 0 main_~k~0) (<= 2000 main_~c2~0))} is VALID [2022-04-15 00:36:27,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {558#(and (<= 0 main_~k~0) (<= 2000 main_~c2~0))} [97] L40-2-->L37: Formula: (and (< v_main_~i~0_5 v_main_~n~0_9) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~v~0_7 |v_main_#t~nondet3_2|) (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_#t~nondet3=|v_main_#t~nondet3_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~v~0=v_main_~v~0_7, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~v~0, main_#t~nondet3, main_~i~0, main_#t~post2] {558#(and (<= 0 main_~k~0) (<= 2000 main_~c2~0))} is VALID [2022-04-15 00:36:27,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {558#(and (<= 0 main_~k~0) (<= 2000 main_~c2~0))} [100] L37-->L38: Formula: (and (<= 0 v_main_~v~0_1) (< v_main_~n~0_1 2)) InVars {main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {558#(and (<= 0 main_~k~0) (<= 2000 main_~c2~0))} is VALID [2022-04-15 00:36:27,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {558#(and (<= 0 main_~k~0) (<= 2000 main_~c2~0))} [105] L38-->L40: Formula: (not (= v_main_~v~0_3 0)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {558#(and (<= 0 main_~k~0) (<= 2000 main_~c2~0))} is VALID [2022-04-15 00:36:27,105 INFO L290 TraceCheckUtils]: 10: Hoare triple {558#(and (<= 0 main_~k~0) (<= 2000 main_~c2~0))} [108] L40-->L40-2: Formula: (and (= v_main_~k~0_3 (+ v_main_~k~0_4 v_main_~c2~0_1)) (= v_main_~v~0_4 1)) InVars {main_~v~0=v_main_~v~0_4, main_~c2~0=v_main_~c2~0_1, main_~k~0=v_main_~k~0_4} OutVars{main_~v~0=v_main_~v~0_4, main_~c2~0=v_main_~c2~0_1, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[main_~k~0] {533#(<= 2000 main_~k~0)} is VALID [2022-04-15 00:36:27,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {533#(<= 2000 main_~k~0)} [96] L40-2-->L34-2: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {533#(<= 2000 main_~k~0)} is VALID [2022-04-15 00:36:27,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {533#(<= 2000 main_~k~0)} [98] L34-2-->L46-2: Formula: (= v_main_~j~0_2 0) InVars {} OutVars{main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {533#(<= 2000 main_~k~0)} is VALID [2022-04-15 00:36:27,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {533#(<= 2000 main_~k~0)} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {533#(<= 2000 main_~k~0)} is VALID [2022-04-15 00:36:27,109 INFO L272 TraceCheckUtils]: 14: Hoare triple {533#(<= 2000 main_~k~0)} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {583#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:36:27,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {583#(<= 1 |__VERIFIER_assert_#in~cond|)} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {587#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:36:27,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {587#(<= 1 __VERIFIER_assert_~cond)} [112] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {527#false} is VALID [2022-04-15 00:36:27,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {527#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {527#false} is VALID [2022-04-15 00:36:27,110 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-15 00:36:27,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:36:27,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {527#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {527#false} is VALID [2022-04-15 00:36:27,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {587#(<= 1 __VERIFIER_assert_~cond)} [112] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {527#false} is VALID [2022-04-15 00:36:27,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {583#(<= 1 |__VERIFIER_assert_#in~cond|)} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {587#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:36:27,250 INFO L272 TraceCheckUtils]: 14: Hoare triple {603#(< 0 main_~k~0)} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {583#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:36:27,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {603#(< 0 main_~k~0)} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {603#(< 0 main_~k~0)} is VALID [2022-04-15 00:36:27,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {603#(< 0 main_~k~0)} [98] L34-2-->L46-2: Formula: (= v_main_~j~0_2 0) InVars {} OutVars{main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {603#(< 0 main_~k~0)} is VALID [2022-04-15 00:36:27,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {603#(< 0 main_~k~0)} [96] L40-2-->L34-2: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {603#(< 0 main_~k~0)} is VALID [2022-04-15 00:36:27,256 INFO L290 TraceCheckUtils]: 10: Hoare triple {616#(< 0 (+ main_~k~0 main_~c2~0))} [108] L40-->L40-2: Formula: (and (= v_main_~k~0_3 (+ v_main_~k~0_4 v_main_~c2~0_1)) (= v_main_~v~0_4 1)) InVars {main_~v~0=v_main_~v~0_4, main_~c2~0=v_main_~c2~0_1, main_~k~0=v_main_~k~0_4} OutVars{main_~v~0=v_main_~v~0_4, main_~c2~0=v_main_~c2~0_1, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[main_~k~0] {603#(< 0 main_~k~0)} is VALID [2022-04-15 00:36:27,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {616#(< 0 (+ main_~k~0 main_~c2~0))} [105] L38-->L40: Formula: (not (= v_main_~v~0_3 0)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {616#(< 0 (+ main_~k~0 main_~c2~0))} is VALID [2022-04-15 00:36:27,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {616#(< 0 (+ main_~k~0 main_~c2~0))} [100] L37-->L38: Formula: (and (<= 0 v_main_~v~0_1) (< v_main_~n~0_1 2)) InVars {main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {616#(< 0 (+ main_~k~0 main_~c2~0))} is VALID [2022-04-15 00:36:27,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {616#(< 0 (+ main_~k~0 main_~c2~0))} [97] L40-2-->L37: Formula: (and (< v_main_~i~0_5 v_main_~n~0_9) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~v~0_7 |v_main_#t~nondet3_2|) (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_#t~nondet3=|v_main_#t~nondet3_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~v~0=v_main_~v~0_7, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~v~0, main_#t~nondet3, main_~i~0, main_#t~post2] {616#(< 0 (+ main_~k~0 main_~c2~0))} is VALID [2022-04-15 00:36:27,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {629#(< 0 main_~c2~0)} [93] L31-->L40-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_2 0) (< v_main_~n~0_5 10) (= v_main_~k~0_8 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {616#(< 0 (+ main_~k~0 main_~c2~0))} is VALID [2022-04-15 00:36:27,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {526#true} [90] mainENTRY-->L31: Formula: (and (= 10000 v_main_~c3~0_2) (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet1_2|) (= |v_main_#in~argc_1| v_main_~argc_1) (= 2000 v_main_~c2~0_2) (= 4000 v_main_~c1~0_2) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~c1~0=v_main_~c1~0_2, main_~v~0=v_main_~v~0_6, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~j~0=v_main_~j~0_1, main_~argc=v_main_~argc_1, main_~c2~0=v_main_~c2~0_2, main_#in~argv.base=|v_main_#in~argv.base_1|, main_~k~0=v_main_~k~0_7, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~n~0=v_main_~n~0_2, main_~argv.base=v_main_~argv.base_1, main_~c3~0=v_main_~c3~0_2, main_~argv.offset=v_main_~argv.offset_1} AuxVars[] AssignedVars[main_~c1~0, main_~v~0, main_#t~nondet1, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~argc, main_~c2~0, main_~argv.base, main_~c3~0, main_~argv.offset] {629#(< 0 main_~c2~0)} is VALID [2022-04-15 00:36:27,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {526#true} [87] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {526#true} is VALID [2022-04-15 00:36:27,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {526#true} {526#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-15 00:36:27,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {526#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-15 00:36:27,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#true} [88] 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] {526#true} is VALID [2022-04-15 00:36:27,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {526#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-15 00:36:27,277 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-15 00:36:27,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780937453] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:36:27,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:36:27,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-15 00:36:27,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255698732] [2022-04-15 00:36:27,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:36:27,278 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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 18 [2022-04-15 00:36:27,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:36:27,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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-15 00:36:27,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:36:27,299 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 00:36:27,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:36:27,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 00:36:27,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-15 00:36:27,300 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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-15 00:36:27,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:36:27,928 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2022-04-15 00:36:27,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 00:36:27,930 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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 18 [2022-04-15 00:36:27,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:36:27,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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-15 00:36:27,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-15 00:36:27,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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-15 00:36:27,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-15 00:36:27,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 59 transitions. [2022-04-15 00:36:27,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:36:27,993 INFO L225 Difference]: With dead ends: 61 [2022-04-15 00:36:27,993 INFO L226 Difference]: Without dead ends: 59 [2022-04-15 00:36:27,994 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2022-04-15 00:36:27,997 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 63 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 00:36:27,998 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 75 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 00:36:27,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-15 00:36:28,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 41. [2022-04-15 00:36:28,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:36:28,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 41 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 00:36:28,028 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 41 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 00:36:28,028 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 41 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 00:36:28,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:36:28,030 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-15 00:36:28,030 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-15 00:36:28,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:36:28,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:36:28,031 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 59 states. [2022-04-15 00:36:28,032 INFO L87 Difference]: Start difference. First operand has 41 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 59 states. [2022-04-15 00:36:28,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:36:28,037 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-15 00:36:28,037 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-15 00:36:28,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:36:28,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:36:28,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:36:28,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:36:28,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 00:36:28,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2022-04-15 00:36:28,039 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 18 [2022-04-15 00:36:28,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:36:28,039 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-04-15 00:36:28,039 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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-15 00:36:28,039 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-15 00:36:28,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 00:36:28,040 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:36:28,040 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:36:28,057 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-15 00:36:28,240 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,SelfDestructingSolverStorable2 [2022-04-15 00:36:28,240 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:36:28,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:36:28,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1629261177, now seen corresponding path program 1 times [2022-04-15 00:36:28,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:36:28,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982301231] [2022-04-15 00:36:28,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:36:28,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:36:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:36:28,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:36:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:36:28,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {939#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] 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] {929#true} is VALID [2022-04-15 00:36:28,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {929#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-15 00:36:28,306 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {929#true} {929#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-15 00:36:28,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {929#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {939#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:36:28,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {939#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] 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] {929#true} is VALID [2022-04-15 00:36:28,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {929#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-15 00:36:28,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {929#true} {929#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-15 00:36:28,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {929#true} [87] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {929#true} is VALID [2022-04-15 00:36:28,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {929#true} [90] mainENTRY-->L31: Formula: (and (= 10000 v_main_~c3~0_2) (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet1_2|) (= |v_main_#in~argc_1| v_main_~argc_1) (= 2000 v_main_~c2~0_2) (= 4000 v_main_~c1~0_2) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~c1~0=v_main_~c1~0_2, main_~v~0=v_main_~v~0_6, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~j~0=v_main_~j~0_1, main_~argc=v_main_~argc_1, main_~c2~0=v_main_~c2~0_2, main_#in~argv.base=|v_main_#in~argv.base_1|, main_~k~0=v_main_~k~0_7, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~n~0=v_main_~n~0_2, main_~argv.base=v_main_~argv.base_1, main_~c3~0=v_main_~c3~0_2, main_~argv.offset=v_main_~argv.offset_1} AuxVars[] AssignedVars[main_~c1~0, main_~v~0, main_#t~nondet1, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~argc, main_~c2~0, main_~argv.base, main_~c3~0, main_~argv.offset] {934#(<= 10000 main_~c3~0)} is VALID [2022-04-15 00:36:28,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {934#(<= 10000 main_~c3~0)} [93] L31-->L40-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_2 0) (< v_main_~n~0_5 10) (= v_main_~k~0_8 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {935#(and (<= 10000 main_~c3~0) (= main_~k~0 0))} is VALID [2022-04-15 00:36:28,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {935#(and (<= 10000 main_~c3~0) (= main_~k~0 0))} [97] L40-2-->L37: Formula: (and (< v_main_~i~0_5 v_main_~n~0_9) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~v~0_7 |v_main_#t~nondet3_2|) (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_#t~nondet3=|v_main_#t~nondet3_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~v~0=v_main_~v~0_7, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~v~0, main_#t~nondet3, main_~i~0, main_#t~post2] {935#(and (<= 10000 main_~c3~0) (= main_~k~0 0))} is VALID [2022-04-15 00:36:28,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {935#(and (<= 10000 main_~c3~0) (= main_~k~0 0))} [100] L37-->L38: Formula: (and (<= 0 v_main_~v~0_1) (< v_main_~n~0_1 2)) InVars {main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {935#(and (<= 10000 main_~c3~0) (= main_~k~0 0))} is VALID [2022-04-15 00:36:28,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {935#(and (<= 10000 main_~c3~0) (= main_~k~0 0))} [105] L38-->L40: Formula: (not (= v_main_~v~0_3 0)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {935#(and (<= 10000 main_~c3~0) (= main_~k~0 0))} is VALID [2022-04-15 00:36:28,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {935#(and (<= 10000 main_~c3~0) (= main_~k~0 0))} [109] L40-->L40-2: Formula: (and (= v_main_~k~0_5 (+ v_main_~k~0_6 v_main_~c3~0_1)) (not (= v_main_~v~0_5 1))) InVars {main_~v~0=v_main_~v~0_5, main_~k~0=v_main_~k~0_6, main_~c3~0=v_main_~c3~0_1} OutVars{main_~v~0=v_main_~v~0_5, main_~k~0=v_main_~k~0_5, main_~c3~0=v_main_~c3~0_1} AuxVars[] AssignedVars[main_~k~0] {936#(<= 10000 main_~k~0)} is VALID [2022-04-15 00:36:28,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {936#(<= 10000 main_~k~0)} [96] L40-2-->L34-2: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {936#(<= 10000 main_~k~0)} is VALID [2022-04-15 00:36:28,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {936#(<= 10000 main_~k~0)} [98] L34-2-->L46-2: Formula: (= v_main_~j~0_2 0) InVars {} OutVars{main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {936#(<= 10000 main_~k~0)} is VALID [2022-04-15 00:36:28,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {936#(<= 10000 main_~k~0)} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {936#(<= 10000 main_~k~0)} is VALID [2022-04-15 00:36:28,311 INFO L272 TraceCheckUtils]: 14: Hoare triple {936#(<= 10000 main_~k~0)} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {937#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:36:28,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {937#(not (= |__VERIFIER_assert_#in~cond| 0))} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {938#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:36:28,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {938#(not (= __VERIFIER_assert_~cond 0))} [112] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {930#false} is VALID [2022-04-15 00:36:28,316 INFO L290 TraceCheckUtils]: 17: Hoare triple {930#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {930#false} is VALID [2022-04-15 00:36:28,316 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-15 00:36:28,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:36:28,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982301231] [2022-04-15 00:36:28,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982301231] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:36:28,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301480747] [2022-04-15 00:36:28,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:36:28,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:36:28,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:36:28,317 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 00:36:28,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 00:36:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:36:28,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 00:36:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:36:28,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:36:28,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {929#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-15 00:36:28,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {929#true} [88] 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] {929#true} is VALID [2022-04-15 00:36:28,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {929#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-15 00:36:28,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {929#true} {929#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-15 00:36:28,463 INFO L272 TraceCheckUtils]: 4: Hoare triple {929#true} [87] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {929#true} is VALID [2022-04-15 00:36:28,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {929#true} [90] mainENTRY-->L31: Formula: (and (= 10000 v_main_~c3~0_2) (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet1_2|) (= |v_main_#in~argc_1| v_main_~argc_1) (= 2000 v_main_~c2~0_2) (= 4000 v_main_~c1~0_2) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~c1~0=v_main_~c1~0_2, main_~v~0=v_main_~v~0_6, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~j~0=v_main_~j~0_1, main_~argc=v_main_~argc_1, main_~c2~0=v_main_~c2~0_2, main_#in~argv.base=|v_main_#in~argv.base_1|, main_~k~0=v_main_~k~0_7, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~n~0=v_main_~n~0_2, main_~argv.base=v_main_~argv.base_1, main_~c3~0=v_main_~c3~0_2, main_~argv.offset=v_main_~argv.offset_1} AuxVars[] AssignedVars[main_~c1~0, main_~v~0, main_#t~nondet1, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~argc, main_~c2~0, main_~argv.base, main_~c3~0, main_~argv.offset] {934#(<= 10000 main_~c3~0)} is VALID [2022-04-15 00:36:28,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {934#(<= 10000 main_~c3~0)} [93] L31-->L40-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_2 0) (< v_main_~n~0_5 10) (= v_main_~k~0_8 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {961#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} is VALID [2022-04-15 00:36:28,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {961#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} [97] L40-2-->L37: Formula: (and (< v_main_~i~0_5 v_main_~n~0_9) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~v~0_7 |v_main_#t~nondet3_2|) (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_#t~nondet3=|v_main_#t~nondet3_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~v~0=v_main_~v~0_7, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~v~0, main_#t~nondet3, main_~i~0, main_#t~post2] {961#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} is VALID [2022-04-15 00:36:28,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {961#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} [100] L37-->L38: Formula: (and (<= 0 v_main_~v~0_1) (< v_main_~n~0_1 2)) InVars {main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {961#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} is VALID [2022-04-15 00:36:28,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {961#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} [105] L38-->L40: Formula: (not (= v_main_~v~0_3 0)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {961#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} is VALID [2022-04-15 00:36:28,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {961#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} [109] L40-->L40-2: Formula: (and (= v_main_~k~0_5 (+ v_main_~k~0_6 v_main_~c3~0_1)) (not (= v_main_~v~0_5 1))) InVars {main_~v~0=v_main_~v~0_5, main_~k~0=v_main_~k~0_6, main_~c3~0=v_main_~c3~0_1} OutVars{main_~v~0=v_main_~v~0_5, main_~k~0=v_main_~k~0_5, main_~c3~0=v_main_~c3~0_1} AuxVars[] AssignedVars[main_~k~0] {936#(<= 10000 main_~k~0)} is VALID [2022-04-15 00:36:28,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {936#(<= 10000 main_~k~0)} [96] L40-2-->L34-2: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {936#(<= 10000 main_~k~0)} is VALID [2022-04-15 00:36:28,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {936#(<= 10000 main_~k~0)} [98] L34-2-->L46-2: Formula: (= v_main_~j~0_2 0) InVars {} OutVars{main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {936#(<= 10000 main_~k~0)} is VALID [2022-04-15 00:36:28,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {936#(<= 10000 main_~k~0)} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {936#(<= 10000 main_~k~0)} is VALID [2022-04-15 00:36:28,467 INFO L272 TraceCheckUtils]: 14: Hoare triple {936#(<= 10000 main_~k~0)} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {986#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:36:28,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {986#(<= 1 |__VERIFIER_assert_#in~cond|)} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {990#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:36:28,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {990#(<= 1 __VERIFIER_assert_~cond)} [112] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {930#false} is VALID [2022-04-15 00:36:28,468 INFO L290 TraceCheckUtils]: 17: Hoare triple {930#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {930#false} is VALID [2022-04-15 00:36:28,468 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-15 00:36:28,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:36:28,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {930#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {930#false} is VALID [2022-04-15 00:36:28,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {990#(<= 1 __VERIFIER_assert_~cond)} [112] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {930#false} is VALID [2022-04-15 00:36:28,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {986#(<= 1 |__VERIFIER_assert_#in~cond|)} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {990#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:36:28,614 INFO L272 TraceCheckUtils]: 14: Hoare triple {1006#(< 0 main_~k~0)} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {986#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:36:28,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {1006#(< 0 main_~k~0)} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {1006#(< 0 main_~k~0)} is VALID [2022-04-15 00:36:28,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {1006#(< 0 main_~k~0)} [98] L34-2-->L46-2: Formula: (= v_main_~j~0_2 0) InVars {} OutVars{main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {1006#(< 0 main_~k~0)} is VALID [2022-04-15 00:36:28,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {1006#(< 0 main_~k~0)} [96] L40-2-->L34-2: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {1006#(< 0 main_~k~0)} is VALID [2022-04-15 00:36:28,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {1019#(< 0 (+ main_~k~0 main_~c3~0))} [109] L40-->L40-2: Formula: (and (= v_main_~k~0_5 (+ v_main_~k~0_6 v_main_~c3~0_1)) (not (= v_main_~v~0_5 1))) InVars {main_~v~0=v_main_~v~0_5, main_~k~0=v_main_~k~0_6, main_~c3~0=v_main_~c3~0_1} OutVars{main_~v~0=v_main_~v~0_5, main_~k~0=v_main_~k~0_5, main_~c3~0=v_main_~c3~0_1} AuxVars[] AssignedVars[main_~k~0] {1006#(< 0 main_~k~0)} is VALID [2022-04-15 00:36:28,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {1019#(< 0 (+ main_~k~0 main_~c3~0))} [105] L38-->L40: Formula: (not (= v_main_~v~0_3 0)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {1019#(< 0 (+ main_~k~0 main_~c3~0))} is VALID [2022-04-15 00:36:28,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {1019#(< 0 (+ main_~k~0 main_~c3~0))} [100] L37-->L38: Formula: (and (<= 0 v_main_~v~0_1) (< v_main_~n~0_1 2)) InVars {main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {1019#(< 0 (+ main_~k~0 main_~c3~0))} is VALID [2022-04-15 00:36:28,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {1019#(< 0 (+ main_~k~0 main_~c3~0))} [97] L40-2-->L37: Formula: (and (< v_main_~i~0_5 v_main_~n~0_9) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~v~0_7 |v_main_#t~nondet3_2|) (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_#t~nondet3=|v_main_#t~nondet3_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~v~0=v_main_~v~0_7, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~v~0, main_#t~nondet3, main_~i~0, main_#t~post2] {1019#(< 0 (+ main_~k~0 main_~c3~0))} is VALID [2022-04-15 00:36:28,617 INFO L290 TraceCheckUtils]: 6: Hoare triple {1032#(< 0 main_~c3~0)} [93] L31-->L40-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_2 0) (< v_main_~n~0_5 10) (= v_main_~k~0_8 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {1019#(< 0 (+ main_~k~0 main_~c3~0))} is VALID [2022-04-15 00:36:28,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {929#true} [90] mainENTRY-->L31: Formula: (and (= 10000 v_main_~c3~0_2) (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet1_2|) (= |v_main_#in~argc_1| v_main_~argc_1) (= 2000 v_main_~c2~0_2) (= 4000 v_main_~c1~0_2) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~c1~0=v_main_~c1~0_2, main_~v~0=v_main_~v~0_6, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~j~0=v_main_~j~0_1, main_~argc=v_main_~argc_1, main_~c2~0=v_main_~c2~0_2, main_#in~argv.base=|v_main_#in~argv.base_1|, main_~k~0=v_main_~k~0_7, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~n~0=v_main_~n~0_2, main_~argv.base=v_main_~argv.base_1, main_~c3~0=v_main_~c3~0_2, main_~argv.offset=v_main_~argv.offset_1} AuxVars[] AssignedVars[main_~c1~0, main_~v~0, main_#t~nondet1, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~argc, main_~c2~0, main_~argv.base, main_~c3~0, main_~argv.offset] {1032#(< 0 main_~c3~0)} is VALID [2022-04-15 00:36:28,617 INFO L272 TraceCheckUtils]: 4: Hoare triple {929#true} [87] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {929#true} is VALID [2022-04-15 00:36:28,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {929#true} {929#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-15 00:36:28,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {929#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-15 00:36:28,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {929#true} [88] 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] {929#true} is VALID [2022-04-15 00:36:28,618 INFO L272 TraceCheckUtils]: 0: Hoare triple {929#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {929#true} is VALID [2022-04-15 00:36:28,618 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-15 00:36:28,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301480747] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:36:28,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:36:28,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-15 00:36:28,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234568931] [2022-04-15 00:36:28,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:36:28,619 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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 18 [2022-04-15 00:36:28,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:36:28,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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-15 00:36:28,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:36:28,641 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 00:36:28,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:36:28,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 00:36:28,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-15 00:36:28,642 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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-15 00:36:29,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:36:29,232 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2022-04-15 00:36:29,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 00:36:29,232 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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 18 [2022-04-15 00:36:29,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:36:29,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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-15 00:36:29,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-15 00:36:29,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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-15 00:36:29,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-15 00:36:29,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 59 transitions. [2022-04-15 00:36:29,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:36:29,279 INFO L225 Difference]: With dead ends: 65 [2022-04-15 00:36:29,279 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 00:36:29,280 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2022-04-15 00:36:29,280 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 49 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 00:36:29,281 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 70 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 00:36:29,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 00:36:29,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 46. [2022-04-15 00:36:29,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:36:29,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 46 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 00:36:29,315 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 46 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 00:36:29,315 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 46 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 00:36:29,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:36:29,318 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-04-15 00:36:29,318 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2022-04-15 00:36:29,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:36:29,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:36:29,318 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 63 states. [2022-04-15 00:36:29,319 INFO L87 Difference]: Start difference. First operand has 46 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 63 states. [2022-04-15 00:36:29,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:36:29,321 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-04-15 00:36:29,321 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2022-04-15 00:36:29,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:36:29,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:36:29,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:36:29,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:36:29,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 00:36:29,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-04-15 00:36:29,323 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 18 [2022-04-15 00:36:29,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:36:29,323 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2022-04-15 00:36:29,323 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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-15 00:36:29,323 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2022-04-15 00:36:29,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 00:36:29,324 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:36:29,324 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:36:29,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 00:36:29,543 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:36:29,543 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:36:29,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:36:29,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1917225923, now seen corresponding path program 1 times [2022-04-15 00:36:29,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:36:29,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748361189] [2022-04-15 00:36:29,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:36:29,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:36:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:36:29,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:36:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:36:29,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {1359#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] 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] {1351#true} is VALID [2022-04-15 00:36:29,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {1351#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1351#true} is VALID [2022-04-15 00:36:29,609 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1351#true} {1351#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1351#true} is VALID [2022-04-15 00:36:29,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {1351#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1359#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:36:29,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {1359#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] 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] {1351#true} is VALID [2022-04-15 00:36:29,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {1351#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1351#true} is VALID [2022-04-15 00:36:29,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1351#true} {1351#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1351#true} is VALID [2022-04-15 00:36:29,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {1351#true} [87] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {1351#true} is VALID [2022-04-15 00:36:29,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {1351#true} [90] mainENTRY-->L31: Formula: (and (= 10000 v_main_~c3~0_2) (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet1_2|) (= |v_main_#in~argc_1| v_main_~argc_1) (= 2000 v_main_~c2~0_2) (= 4000 v_main_~c1~0_2) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~c1~0=v_main_~c1~0_2, main_~v~0=v_main_~v~0_6, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~j~0=v_main_~j~0_1, main_~argc=v_main_~argc_1, main_~c2~0=v_main_~c2~0_2, main_#in~argv.base=|v_main_#in~argv.base_1|, main_~k~0=v_main_~k~0_7, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~n~0=v_main_~n~0_2, main_~argv.base=v_main_~argv.base_1, main_~c3~0=v_main_~c3~0_2, main_~argv.offset=v_main_~argv.offset_1} AuxVars[] AssignedVars[main_~c1~0, main_~v~0, main_#t~nondet1, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~argc, main_~c2~0, main_~argv.base, main_~c3~0, main_~argv.offset] {1351#true} is VALID [2022-04-15 00:36:29,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {1351#true} [93] L31-->L40-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_2 0) (< v_main_~n~0_5 10) (= v_main_~k~0_8 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {1356#(= main_~i~0 0)} is VALID [2022-04-15 00:36:29,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {1356#(= main_~i~0 0)} [97] L40-2-->L37: Formula: (and (< v_main_~i~0_5 v_main_~n~0_9) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~v~0_7 |v_main_#t~nondet3_2|) (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_#t~nondet3=|v_main_#t~nondet3_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~v~0=v_main_~v~0_7, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~v~0, main_#t~nondet3, main_~i~0, main_#t~post2] {1357#(<= 1 main_~i~0)} is VALID [2022-04-15 00:36:29,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {1357#(<= 1 main_~i~0)} [100] L37-->L38: Formula: (and (<= 0 v_main_~v~0_1) (< v_main_~n~0_1 2)) InVars {main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {1358#(<= main_~n~0 main_~i~0)} is VALID [2022-04-15 00:36:29,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {1358#(<= main_~n~0 main_~i~0)} [104] L38-->L40-2: Formula: (and (= v_main_~v~0_2 0) (= v_main_~k~0_1 (+ v_main_~k~0_2 v_main_~c1~0_1))) InVars {main_~c1~0=v_main_~c1~0_1, main_~v~0=v_main_~v~0_2, main_~k~0=v_main_~k~0_2} OutVars{main_~c1~0=v_main_~c1~0_1, main_~v~0=v_main_~v~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0] {1358#(<= main_~n~0 main_~i~0)} is VALID [2022-04-15 00:36:29,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {1358#(<= main_~n~0 main_~i~0)} [97] L40-2-->L37: Formula: (and (< v_main_~i~0_5 v_main_~n~0_9) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~v~0_7 |v_main_#t~nondet3_2|) (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_#t~nondet3=|v_main_#t~nondet3_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~v~0=v_main_~v~0_7, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~v~0, main_#t~nondet3, main_~i~0, main_#t~post2] {1352#false} is VALID [2022-04-15 00:36:29,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {1352#false} [100] L37-->L38: Formula: (and (<= 0 v_main_~v~0_1) (< v_main_~n~0_1 2)) InVars {main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {1352#false} is VALID [2022-04-15 00:36:29,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {1352#false} [105] L38-->L40: Formula: (not (= v_main_~v~0_3 0)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {1352#false} is VALID [2022-04-15 00:36:29,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {1352#false} [108] L40-->L40-2: Formula: (and (= v_main_~k~0_3 (+ v_main_~k~0_4 v_main_~c2~0_1)) (= v_main_~v~0_4 1)) InVars {main_~v~0=v_main_~v~0_4, main_~c2~0=v_main_~c2~0_1, main_~k~0=v_main_~k~0_4} OutVars{main_~v~0=v_main_~v~0_4, main_~c2~0=v_main_~c2~0_1, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[main_~k~0] {1352#false} is VALID [2022-04-15 00:36:29,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {1352#false} [96] L40-2-->L34-2: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {1352#false} is VALID [2022-04-15 00:36:29,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {1352#false} [98] L34-2-->L46-2: Formula: (= v_main_~j~0_2 0) InVars {} OutVars{main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {1352#false} is VALID [2022-04-15 00:36:29,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {1352#false} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {1352#false} is VALID [2022-04-15 00:36:29,613 INFO L272 TraceCheckUtils]: 17: Hoare triple {1352#false} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1352#false} is VALID [2022-04-15 00:36:29,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {1352#false} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1352#false} is VALID [2022-04-15 00:36:29,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {1352#false} [112] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1352#false} is VALID [2022-04-15 00:36:29,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {1352#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1352#false} is VALID [2022-04-15 00:36:29,613 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:36:29,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:36:29,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748361189] [2022-04-15 00:36:29,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748361189] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:36:29,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763959758] [2022-04-15 00:36:29,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:36:29,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:36:29,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:36:29,618 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 00:36:29,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 00:36:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:36:29,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 00:36:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:36:29,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:36:29,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {1351#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1351#true} is VALID [2022-04-15 00:36:29,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {1351#true} [88] 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] {1351#true} is VALID [2022-04-15 00:36:29,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {1351#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1351#true} is VALID [2022-04-15 00:36:29,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1351#true} {1351#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1351#true} is VALID [2022-04-15 00:36:29,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {1351#true} [87] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {1351#true} is VALID [2022-04-15 00:36:29,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {1351#true} [90] mainENTRY-->L31: Formula: (and (= 10000 v_main_~c3~0_2) (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet1_2|) (= |v_main_#in~argc_1| v_main_~argc_1) (= 2000 v_main_~c2~0_2) (= 4000 v_main_~c1~0_2) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~c1~0=v_main_~c1~0_2, main_~v~0=v_main_~v~0_6, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~j~0=v_main_~j~0_1, main_~argc=v_main_~argc_1, main_~c2~0=v_main_~c2~0_2, main_#in~argv.base=|v_main_#in~argv.base_1|, main_~k~0=v_main_~k~0_7, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~n~0=v_main_~n~0_2, main_~argv.base=v_main_~argv.base_1, main_~c3~0=v_main_~c3~0_2, main_~argv.offset=v_main_~argv.offset_1} AuxVars[] AssignedVars[main_~c1~0, main_~v~0, main_#t~nondet1, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~argc, main_~c2~0, main_~argv.base, main_~c3~0, main_~argv.offset] {1351#true} is VALID [2022-04-15 00:36:29,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {1351#true} [93] L31-->L40-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_2 0) (< v_main_~n~0_5 10) (= v_main_~k~0_8 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {1381#(<= 0 main_~i~0)} is VALID [2022-04-15 00:36:29,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {1381#(<= 0 main_~i~0)} [97] L40-2-->L37: Formula: (and (< v_main_~i~0_5 v_main_~n~0_9) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~v~0_7 |v_main_#t~nondet3_2|) (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_#t~nondet3=|v_main_#t~nondet3_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~v~0=v_main_~v~0_7, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~v~0, main_#t~nondet3, main_~i~0, main_#t~post2] {1357#(<= 1 main_~i~0)} is VALID [2022-04-15 00:36:29,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {1357#(<= 1 main_~i~0)} [100] L37-->L38: Formula: (and (<= 0 v_main_~v~0_1) (< v_main_~n~0_1 2)) InVars {main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {1388#(and (< main_~n~0 2) (<= 1 main_~i~0))} is VALID [2022-04-15 00:36:29,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {1388#(and (< main_~n~0 2) (<= 1 main_~i~0))} [104] L38-->L40-2: Formula: (and (= v_main_~v~0_2 0) (= v_main_~k~0_1 (+ v_main_~k~0_2 v_main_~c1~0_1))) InVars {main_~c1~0=v_main_~c1~0_1, main_~v~0=v_main_~v~0_2, main_~k~0=v_main_~k~0_2} OutVars{main_~c1~0=v_main_~c1~0_1, main_~v~0=v_main_~v~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0] {1388#(and (< main_~n~0 2) (<= 1 main_~i~0))} is VALID [2022-04-15 00:36:29,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {1388#(and (< main_~n~0 2) (<= 1 main_~i~0))} [97] L40-2-->L37: Formula: (and (< v_main_~i~0_5 v_main_~n~0_9) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~v~0_7 |v_main_#t~nondet3_2|) (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_#t~nondet3=|v_main_#t~nondet3_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~v~0=v_main_~v~0_7, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~v~0, main_#t~nondet3, main_~i~0, main_#t~post2] {1352#false} is VALID [2022-04-15 00:36:29,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {1352#false} [100] L37-->L38: Formula: (and (<= 0 v_main_~v~0_1) (< v_main_~n~0_1 2)) InVars {main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {1352#false} is VALID [2022-04-15 00:36:29,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {1352#false} [105] L38-->L40: Formula: (not (= v_main_~v~0_3 0)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {1352#false} is VALID [2022-04-15 00:36:29,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {1352#false} [108] L40-->L40-2: Formula: (and (= v_main_~k~0_3 (+ v_main_~k~0_4 v_main_~c2~0_1)) (= v_main_~v~0_4 1)) InVars {main_~v~0=v_main_~v~0_4, main_~c2~0=v_main_~c2~0_1, main_~k~0=v_main_~k~0_4} OutVars{main_~v~0=v_main_~v~0_4, main_~c2~0=v_main_~c2~0_1, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[main_~k~0] {1352#false} is VALID [2022-04-15 00:36:29,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {1352#false} [96] L40-2-->L34-2: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {1352#false} is VALID [2022-04-15 00:36:29,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {1352#false} [98] L34-2-->L46-2: Formula: (= v_main_~j~0_2 0) InVars {} OutVars{main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {1352#false} is VALID [2022-04-15 00:36:29,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {1352#false} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {1352#false} is VALID [2022-04-15 00:36:29,743 INFO L272 TraceCheckUtils]: 17: Hoare triple {1352#false} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1352#false} is VALID [2022-04-15 00:36:29,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {1352#false} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1352#false} is VALID [2022-04-15 00:36:29,743 INFO L290 TraceCheckUtils]: 19: Hoare triple {1352#false} [112] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1352#false} is VALID [2022-04-15 00:36:29,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {1352#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1352#false} is VALID [2022-04-15 00:36:29,743 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:36:29,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 00:36:29,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763959758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:36:29,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 00:36:29,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2022-04-15 00:36:29,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198611990] [2022-04-15 00:36:29,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:36:29,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 00:36:29,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:36:29,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:36:29,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:36:29,756 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 00:36:29,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:36:29,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 00:36:29,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-15 00:36:29,756 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:36:29,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:36:29,822 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2022-04-15 00:36:29,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 00:36:29,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 00:36:29,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:36:29,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:36:29,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-15 00:36:29,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:36:29,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-15 00:36:29,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2022-04-15 00:36:29,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:36:29,847 INFO L225 Difference]: With dead ends: 68 [2022-04-15 00:36:29,847 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 00:36:29,847 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-15 00:36:29,848 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:36:29,848 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 32 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:36:29,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 00:36:29,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2022-04-15 00:36:29,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:36:29,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 31 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 00:36:29,878 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 31 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 00:36:29,878 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 31 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 00:36:29,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:36:29,879 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-15 00:36:29,879 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-15 00:36:29,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:36:29,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:36:29,880 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-04-15 00:36:29,880 INFO L87 Difference]: Start difference. First operand has 31 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-04-15 00:36:29,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:36:29,881 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-15 00:36:29,881 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-15 00:36:29,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:36:29,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:36:29,881 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:36:29,881 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:36:29,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 00:36:29,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-15 00:36:29,882 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 21 [2022-04-15 00:36:29,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:36:29,882 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-15 00:36:29,883 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:36:29,883 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-15 00:36:29,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 00:36:29,883 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:36:29,883 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:36:29,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 00:36:30,099 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:36:30,100 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:36:30,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:36:30,100 INFO L85 PathProgramCache]: Analyzing trace with hash -186078045, now seen corresponding path program 1 times [2022-04-15 00:36:30,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:36:30,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240696563] [2022-04-15 00:36:30,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:36:30,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:36:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:36:30,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:36:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:36:30,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {1651#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] 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] {1631#true} is VALID [2022-04-15 00:36:30,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {1631#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1631#true} is VALID [2022-04-15 00:36:30,176 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1631#true} {1631#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1631#true} is VALID [2022-04-15 00:36:30,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 00:36:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:36:30,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {1631#true} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1631#true} is VALID [2022-04-15 00:36:30,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {1631#true} [113] L18-->L18-2: Formula: (not (= 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[] {1631#true} is VALID [2022-04-15 00:36:30,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {1631#true} [116] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1631#true} is VALID [2022-04-15 00:36:30,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1631#true} {1638#(<= 4000 main_~k~0)} [119] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1638#(<= 4000 main_~k~0)} is VALID [2022-04-15 00:36:30,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-15 00:36:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:36:30,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {1631#true} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1631#true} is VALID [2022-04-15 00:36:30,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {1631#true} [113] L18-->L18-2: Formula: (not (= 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[] {1631#true} is VALID [2022-04-15 00:36:30,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {1631#true} [116] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1631#true} is VALID [2022-04-15 00:36:30,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1631#true} {1643#(<= 3999 main_~k~0)} [119] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1643#(<= 3999 main_~k~0)} is VALID [2022-04-15 00:36:30,187 INFO L272 TraceCheckUtils]: 0: Hoare triple {1631#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1651#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:36:30,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {1651#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] 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] {1631#true} is VALID [2022-04-15 00:36:30,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {1631#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1631#true} is VALID [2022-04-15 00:36:30,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1631#true} {1631#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1631#true} is VALID [2022-04-15 00:36:30,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {1631#true} [87] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {1631#true} is VALID [2022-04-15 00:36:30,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {1631#true} [90] mainENTRY-->L31: Formula: (and (= 10000 v_main_~c3~0_2) (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet1_2|) (= |v_main_#in~argc_1| v_main_~argc_1) (= 2000 v_main_~c2~0_2) (= 4000 v_main_~c1~0_2) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~c1~0=v_main_~c1~0_2, main_~v~0=v_main_~v~0_6, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~j~0=v_main_~j~0_1, main_~argc=v_main_~argc_1, main_~c2~0=v_main_~c2~0_2, main_#in~argv.base=|v_main_#in~argv.base_1|, main_~k~0=v_main_~k~0_7, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~n~0=v_main_~n~0_2, main_~argv.base=v_main_~argv.base_1, main_~c3~0=v_main_~c3~0_2, main_~argv.offset=v_main_~argv.offset_1} AuxVars[] AssignedVars[main_~c1~0, main_~v~0, main_#t~nondet1, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~argc, main_~c2~0, main_~argv.base, main_~c3~0, main_~argv.offset] {1636#(<= 4000 main_~c1~0)} is VALID [2022-04-15 00:36:30,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {1636#(<= 4000 main_~c1~0)} [93] L31-->L40-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_2 0) (< v_main_~n~0_5 10) (= v_main_~k~0_8 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {1637#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} is VALID [2022-04-15 00:36:30,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {1637#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} [97] L40-2-->L37: Formula: (and (< v_main_~i~0_5 v_main_~n~0_9) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~v~0_7 |v_main_#t~nondet3_2|) (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_#t~nondet3=|v_main_#t~nondet3_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~v~0=v_main_~v~0_7, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~v~0, main_#t~nondet3, main_~i~0, main_#t~post2] {1637#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} is VALID [2022-04-15 00:36:30,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {1637#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} [100] L37-->L38: Formula: (and (<= 0 v_main_~v~0_1) (< v_main_~n~0_1 2)) InVars {main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {1637#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} is VALID [2022-04-15 00:36:30,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {1637#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} [104] L38-->L40-2: Formula: (and (= v_main_~v~0_2 0) (= v_main_~k~0_1 (+ v_main_~k~0_2 v_main_~c1~0_1))) InVars {main_~c1~0=v_main_~c1~0_1, main_~v~0=v_main_~v~0_2, main_~k~0=v_main_~k~0_2} OutVars{main_~c1~0=v_main_~c1~0_1, main_~v~0=v_main_~v~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0] {1638#(<= 4000 main_~k~0)} is VALID [2022-04-15 00:36:30,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {1638#(<= 4000 main_~k~0)} [96] L40-2-->L34-2: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {1638#(<= 4000 main_~k~0)} is VALID [2022-04-15 00:36:30,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {1638#(<= 4000 main_~k~0)} [98] L34-2-->L46-2: Formula: (= v_main_~j~0_2 0) InVars {} OutVars{main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {1638#(<= 4000 main_~k~0)} is VALID [2022-04-15 00:36:30,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {1638#(<= 4000 main_~k~0)} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {1638#(<= 4000 main_~k~0)} is VALID [2022-04-15 00:36:30,194 INFO L272 TraceCheckUtils]: 13: Hoare triple {1638#(<= 4000 main_~k~0)} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1631#true} is VALID [2022-04-15 00:36:30,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {1631#true} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1631#true} is VALID [2022-04-15 00:36:30,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {1631#true} [113] L18-->L18-2: Formula: (not (= 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[] {1631#true} is VALID [2022-04-15 00:36:30,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {1631#true} [116] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1631#true} is VALID [2022-04-15 00:36:30,195 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1631#true} {1638#(<= 4000 main_~k~0)} [119] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1638#(<= 4000 main_~k~0)} is VALID [2022-04-15 00:36:30,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {1638#(<= 4000 main_~k~0)} [110] L47-1-->L46-2: Formula: (and (= v_main_~j~0_5 (+ v_main_~j~0_6 1)) (= v_main_~k~0_11 (+ v_main_~k~0_10 1))) InVars {main_~k~0=v_main_~k~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~k~0=v_main_~k~0_10, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {1643#(<= 3999 main_~k~0)} is VALID [2022-04-15 00:36:30,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {1643#(<= 3999 main_~k~0)} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {1643#(<= 3999 main_~k~0)} is VALID [2022-04-15 00:36:30,196 INFO L272 TraceCheckUtils]: 20: Hoare triple {1643#(<= 3999 main_~k~0)} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1631#true} is VALID [2022-04-15 00:36:30,196 INFO L290 TraceCheckUtils]: 21: Hoare triple {1631#true} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1631#true} is VALID [2022-04-15 00:36:30,196 INFO L290 TraceCheckUtils]: 22: Hoare triple {1631#true} [113] L18-->L18-2: Formula: (not (= 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[] {1631#true} is VALID [2022-04-15 00:36:30,196 INFO L290 TraceCheckUtils]: 23: Hoare triple {1631#true} [116] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1631#true} is VALID [2022-04-15 00:36:30,197 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1631#true} {1643#(<= 3999 main_~k~0)} [119] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1643#(<= 3999 main_~k~0)} is VALID [2022-04-15 00:36:30,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {1643#(<= 3999 main_~k~0)} [110] L47-1-->L46-2: Formula: (and (= v_main_~j~0_5 (+ v_main_~j~0_6 1)) (= v_main_~k~0_11 (+ v_main_~k~0_10 1))) InVars {main_~k~0=v_main_~k~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~k~0=v_main_~k~0_10, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {1648#(<= 3998 main_~k~0)} is VALID [2022-04-15 00:36:30,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {1648#(<= 3998 main_~k~0)} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {1648#(<= 3998 main_~k~0)} is VALID [2022-04-15 00:36:30,198 INFO L272 TraceCheckUtils]: 27: Hoare triple {1648#(<= 3998 main_~k~0)} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1649#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:36:30,198 INFO L290 TraceCheckUtils]: 28: Hoare triple {1649#(not (= |__VERIFIER_assert_#in~cond| 0))} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1650#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:36:30,199 INFO L290 TraceCheckUtils]: 29: Hoare triple {1650#(not (= __VERIFIER_assert_~cond 0))} [112] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1632#false} is VALID [2022-04-15 00:36:30,199 INFO L290 TraceCheckUtils]: 30: Hoare triple {1632#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1632#false} is VALID [2022-04-15 00:36:30,199 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 00:36:30,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:36:30,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240696563] [2022-04-15 00:36:30,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240696563] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:36:30,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340584295] [2022-04-15 00:36:30,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:36:30,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:36:30,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:36:30,200 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 00:36:30,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 00:36:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:36:30,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 00:36:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:36:30,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:36:30,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {1631#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1631#true} is VALID [2022-04-15 00:36:30,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {1631#true} [88] 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] {1631#true} is VALID [2022-04-15 00:36:30,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {1631#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1631#true} is VALID [2022-04-15 00:36:30,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1631#true} {1631#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1631#true} is VALID [2022-04-15 00:36:30,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {1631#true} [87] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {1631#true} is VALID [2022-04-15 00:36:30,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {1631#true} [90] mainENTRY-->L31: Formula: (and (= 10000 v_main_~c3~0_2) (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet1_2|) (= |v_main_#in~argc_1| v_main_~argc_1) (= 2000 v_main_~c2~0_2) (= 4000 v_main_~c1~0_2) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~c1~0=v_main_~c1~0_2, main_~v~0=v_main_~v~0_6, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~j~0=v_main_~j~0_1, main_~argc=v_main_~argc_1, main_~c2~0=v_main_~c2~0_2, main_#in~argv.base=|v_main_#in~argv.base_1|, main_~k~0=v_main_~k~0_7, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~n~0=v_main_~n~0_2, main_~argv.base=v_main_~argv.base_1, main_~c3~0=v_main_~c3~0_2, main_~argv.offset=v_main_~argv.offset_1} AuxVars[] AssignedVars[main_~c1~0, main_~v~0, main_#t~nondet1, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~argc, main_~c2~0, main_~argv.base, main_~c3~0, main_~argv.offset] {1631#true} is VALID [2022-04-15 00:36:30,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {1631#true} [93] L31-->L40-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_2 0) (< v_main_~n~0_5 10) (= v_main_~k~0_8 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {1631#true} is VALID [2022-04-15 00:36:30,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {1631#true} [97] L40-2-->L37: Formula: (and (< v_main_~i~0_5 v_main_~n~0_9) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~v~0_7 |v_main_#t~nondet3_2|) (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_#t~nondet3=|v_main_#t~nondet3_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~v~0=v_main_~v~0_7, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~v~0, main_#t~nondet3, main_~i~0, main_#t~post2] {1631#true} is VALID [2022-04-15 00:36:30,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {1631#true} [100] L37-->L38: Formula: (and (<= 0 v_main_~v~0_1) (< v_main_~n~0_1 2)) InVars {main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {1679#(< main_~n~0 2)} is VALID [2022-04-15 00:36:30,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {1679#(< main_~n~0 2)} [104] L38-->L40-2: Formula: (and (= v_main_~v~0_2 0) (= v_main_~k~0_1 (+ v_main_~k~0_2 v_main_~c1~0_1))) InVars {main_~c1~0=v_main_~c1~0_1, main_~v~0=v_main_~v~0_2, main_~k~0=v_main_~k~0_2} OutVars{main_~c1~0=v_main_~c1~0_1, main_~v~0=v_main_~v~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0] {1679#(< main_~n~0 2)} is VALID [2022-04-15 00:36:30,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {1679#(< main_~n~0 2)} [96] L40-2-->L34-2: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {1679#(< main_~n~0 2)} is VALID [2022-04-15 00:36:30,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {1679#(< main_~n~0 2)} [98] L34-2-->L46-2: Formula: (= v_main_~j~0_2 0) InVars {} OutVars{main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {1689#(and (<= 0 main_~j~0) (< main_~n~0 2))} is VALID [2022-04-15 00:36:30,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {1689#(and (<= 0 main_~j~0) (< main_~n~0 2))} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {1689#(and (<= 0 main_~j~0) (< main_~n~0 2))} is VALID [2022-04-15 00:36:30,392 INFO L272 TraceCheckUtils]: 13: Hoare triple {1689#(and (<= 0 main_~j~0) (< main_~n~0 2))} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1631#true} is VALID [2022-04-15 00:36:30,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {1631#true} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1631#true} is VALID [2022-04-15 00:36:30,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {1631#true} [113] L18-->L18-2: Formula: (not (= 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[] {1631#true} is VALID [2022-04-15 00:36:30,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {1631#true} [116] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1631#true} is VALID [2022-04-15 00:36:30,393 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1631#true} {1689#(and (<= 0 main_~j~0) (< main_~n~0 2))} [119] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1689#(and (<= 0 main_~j~0) (< main_~n~0 2))} is VALID [2022-04-15 00:36:30,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {1689#(and (<= 0 main_~j~0) (< main_~n~0 2))} [110] L47-1-->L46-2: Formula: (and (= v_main_~j~0_5 (+ v_main_~j~0_6 1)) (= v_main_~k~0_11 (+ v_main_~k~0_10 1))) InVars {main_~k~0=v_main_~k~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~k~0=v_main_~k~0_10, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {1711#(and (<= 1 main_~j~0) (< main_~n~0 2))} is VALID [2022-04-15 00:36:30,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {1711#(and (<= 1 main_~j~0) (< main_~n~0 2))} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {1632#false} is VALID [2022-04-15 00:36:30,394 INFO L272 TraceCheckUtils]: 20: Hoare triple {1632#false} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1632#false} is VALID [2022-04-15 00:36:30,394 INFO L290 TraceCheckUtils]: 21: Hoare triple {1632#false} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1632#false} is VALID [2022-04-15 00:36:30,394 INFO L290 TraceCheckUtils]: 22: Hoare triple {1632#false} [113] L18-->L18-2: Formula: (not (= 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[] {1632#false} is VALID [2022-04-15 00:36:30,394 INFO L290 TraceCheckUtils]: 23: Hoare triple {1632#false} [116] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1632#false} is VALID [2022-04-15 00:36:30,394 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1632#false} {1632#false} [119] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1632#false} is VALID [2022-04-15 00:36:30,394 INFO L290 TraceCheckUtils]: 25: Hoare triple {1632#false} [110] L47-1-->L46-2: Formula: (and (= v_main_~j~0_5 (+ v_main_~j~0_6 1)) (= v_main_~k~0_11 (+ v_main_~k~0_10 1))) InVars {main_~k~0=v_main_~k~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~k~0=v_main_~k~0_10, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {1632#false} is VALID [2022-04-15 00:36:30,394 INFO L290 TraceCheckUtils]: 26: Hoare triple {1632#false} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {1632#false} is VALID [2022-04-15 00:36:30,395 INFO L272 TraceCheckUtils]: 27: Hoare triple {1632#false} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1632#false} is VALID [2022-04-15 00:36:30,395 INFO L290 TraceCheckUtils]: 28: Hoare triple {1632#false} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1632#false} is VALID [2022-04-15 00:36:30,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {1632#false} [112] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1632#false} is VALID [2022-04-15 00:36:30,395 INFO L290 TraceCheckUtils]: 30: Hoare triple {1632#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1632#false} is VALID [2022-04-15 00:36:30,395 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 00:36:30,395 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 00:36:30,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340584295] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:36:30,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 00:36:30,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2022-04-15 00:36:30,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627596567] [2022-04-15 00:36:30,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:36:30,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 31 [2022-04-15 00:36:30,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:36:30,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:36:30,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:36:30,413 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 00:36:30,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:36:30,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 00:36:30,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-04-15 00:36:30,413 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:36:30,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:36:30,468 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-15 00:36:30,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 00:36:30,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 31 [2022-04-15 00:36:30,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:36:30,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:36:30,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-15 00:36:30,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:36:30,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-15 00:36:30,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-15 00:36:30,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:36:30,489 INFO L225 Difference]: With dead ends: 35 [2022-04-15 00:36:30,489 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 00:36:30,490 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-04-15 00:36:30,490 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 5 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:36:30,490 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 41 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:36:30,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 00:36:30,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 00:36:30,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:36:30,491 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-15 00:36:30,491 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-15 00:36:30,491 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-15 00:36:30,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:36:30,491 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:36:30,491 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:36:30,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:36:30,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:36:30,492 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-15 00:36:30,492 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-15 00:36:30,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:36:30,492 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:36:30,492 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:36:30,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:36:30,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:36:30,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:36:30,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:36:30,492 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-15 00:36:30,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 00:36:30,492 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2022-04-15 00:36:30,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:36:30,492 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 00:36:30,493 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:36:30,493 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:36:30,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:36:30,494 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 00:36:30,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 00:36:30,702 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:36:30,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 00:36:30,908 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-15 00:36:30,908 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:36:30,908 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:36:30,908 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 00:36:30,908 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 00:36:30,908 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:36:30,908 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:36:30,909 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 52) the Hoare annotation is: true [2022-04-15 00:36:30,909 INFO L882 garLoopResultBuilder]: For program point L31(line 31) no Hoare annotation was computed. [2022-04-15 00:36:30,909 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 24 52) no Hoare annotation was computed. [2022-04-15 00:36:30,909 INFO L878 garLoopResultBuilder]: At program point L40-2(lines 34 44) the Hoare annotation is: (let ((.cse0 (<= 10000 main_~c3~0)) (.cse1 (<= 4000 main_~c1~0)) (.cse2 (<= 2000 main_~c2~0))) (or (and .cse0 (<= 2000 main_~k~0) .cse1 (< main_~n~0 2) .cse2 (<= 1 main_~i~0)) (and .cse0 (= main_~k~0 0) .cse1 (= main_~i~0 0) .cse2))) [2022-04-15 00:36:30,909 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 24 52) no Hoare annotation was computed. [2022-04-15 00:36:30,909 INFO L882 garLoopResultBuilder]: For program point L34-2(lines 34 44) no Hoare annotation was computed. [2022-04-15 00:36:30,909 INFO L882 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-04-15 00:36:30,909 INFO L878 garLoopResultBuilder]: At program point L46-2(lines 46 50) the Hoare annotation is: (let ((.cse0 (<= 10000 main_~c3~0)) (.cse1 (<= 4000 main_~c1~0)) (.cse2 (< main_~n~0 2)) (.cse3 (<= 2000 main_~c2~0)) (.cse4 (<= 1 main_~i~0))) (or (and .cse0 (<= 1 main_~j~0) .cse1 .cse2 .cse3 (< 0 main_~k~0) .cse4) (and .cse0 (<= 0 main_~j~0) (<= 2000 main_~k~0) .cse1 .cse2 .cse3 .cse4) (and (= main_~j~0 0) (= main_~i~0 0) (<= main_~n~0 0)))) [2022-04-15 00:36:30,909 INFO L882 garLoopResultBuilder]: For program point L38(lines 38 43) no Hoare annotation was computed. [2022-04-15 00:36:30,909 INFO L882 garLoopResultBuilder]: For program point L46-3(lines 46 50) no Hoare annotation was computed. [2022-04-15 00:36:30,909 INFO L878 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (and (<= 10000 main_~c3~0) (<= 0 main_~j~0) (<= 2000 main_~k~0) (<= 4000 main_~c1~0) (< main_~n~0 2) (<= 2000 main_~c2~0) (<= 1 main_~i~0)) [2022-04-15 00:36:30,909 INFO L882 garLoopResultBuilder]: For program point L40(lines 40 43) no Hoare annotation was computed. [2022-04-15 00:36:30,909 INFO L882 garLoopResultBuilder]: For program point L47-1(line 47) no Hoare annotation was computed. [2022-04-15 00:36:30,909 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-15 00:36:30,909 INFO L882 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-15 00:36:30,909 INFO L882 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-15 00:36:30,910 INFO L882 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-15 00:36:30,910 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-15 00:36:30,910 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-15 00:36:30,912 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-04-15 00:36:30,913 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 00:36:30,916 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:36:30,916 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-15 00:36:30,916 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-15 00:36:30,916 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:36:30,916 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-15 00:36:30,917 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-15 00:36:30,917 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-15 00:36:30,917 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-15 00:36:30,917 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 00:36:30,917 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 00:36:30,917 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2022-04-15 00:36:30,917 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2022-04-15 00:36:30,917 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-15 00:36:30,917 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-15 00:36:30,917 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-15 00:36:30,917 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-15 00:36:30,917 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 00:36:30,917 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2022-04-15 00:36:30,917 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-15 00:36:30,917 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-15 00:36:30,917 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:36:30,917 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 00:36:30,917 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2022-04-15 00:36:30,917 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2022-04-15 00:36:30,921 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-15 00:36:30,921 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-15 00:36:30,921 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-04-15 00:36:30,921 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2022-04-15 00:36:30,921 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-15 00:36:30,921 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-15 00:36:30,921 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 00:36:30,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:36:30 BasicIcfg [2022-04-15 00:36:30,931 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 00:36:30,932 INFO L158 Benchmark]: Toolchain (without parser) took 6810.21ms. Allocated memory was 192.9MB in the beginning and 275.8MB in the end (delta: 82.8MB). Free memory was 130.3MB in the beginning and 228.6MB in the end (delta: -98.4MB). Peak memory consumption was 128.0MB. Max. memory is 8.0GB. [2022-04-15 00:36:30,932 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 192.9MB. Free memory was 146.9MB in the beginning and 146.8MB in the end (delta: 71.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 00:36:30,933 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.54ms. Allocated memory was 192.9MB in the beginning and 275.8MB in the end (delta: 82.8MB). Free memory was 130.0MB in the beginning and 246.0MB in the end (delta: -116.0MB). Peak memory consumption was 15.1MB. Max. memory is 8.0GB. [2022-04-15 00:36:30,933 INFO L158 Benchmark]: Boogie Preprocessor took 35.24ms. Allocated memory is still 275.8MB. Free memory was 246.0MB in the beginning and 244.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 00:36:30,933 INFO L158 Benchmark]: RCFGBuilder took 335.96ms. Allocated memory is still 275.8MB. Free memory was 244.5MB in the beginning and 230.8MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-15 00:36:30,933 INFO L158 Benchmark]: IcfgTransformer took 24.56ms. Allocated memory is still 275.8MB. Free memory was 230.8MB in the beginning and 228.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 00:36:30,933 INFO L158 Benchmark]: TraceAbstraction took 6162.17ms. Allocated memory is still 275.8MB. Free memory was 228.2MB in the beginning and 228.6MB in the end (delta: -434.7kB). Peak memory consumption was 142.9MB. Max. memory is 8.0GB. [2022-04-15 00:36:30,934 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 192.9MB. Free memory was 146.9MB in the beginning and 146.8MB in the end (delta: 71.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 247.54ms. Allocated memory was 192.9MB in the beginning and 275.8MB in the end (delta: 82.8MB). Free memory was 130.0MB in the beginning and 246.0MB in the end (delta: -116.0MB). Peak memory consumption was 15.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.24ms. Allocated memory is still 275.8MB. Free memory was 246.0MB in the beginning and 244.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 335.96ms. Allocated memory is still 275.8MB. Free memory was 244.5MB in the beginning and 230.8MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 24.56ms. Allocated memory is still 275.8MB. Free memory was 230.8MB in the beginning and 228.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 6162.17ms. Allocated memory is still 275.8MB. Free memory was 228.2MB in the beginning and 228.6MB in the end (delta: -434.7kB). Peak memory consumption was 142.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 272 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 270 mSDsluCounter, 309 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 164 mSDsCounter, 126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 756 IncrementalHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 126 mSolverCounterUnsat, 145 mSDtfsCounter, 756 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 239 GetRequests, 149 SyntacticMatches, 3 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=4, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 48 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 14 PreInvPairs, 20 NumberOfFragments, 124 HoareAnnotationTreeSize, 14 FomulaSimplifications, 3 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 400 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 224 NumberOfCodeBlocks, 224 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 263 ConstructedInterpolants, 0 QuantifiedInterpolants, 717 SizeOfPredicates, 9 NumberOfNonLiveVariables, 483 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 14 InterpolantComputations, 3 PerfectInterpolantSequences, 33/51 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: 34]: Loop Invariant Derived loop invariant: (((((10000 <= c3 && 2000 <= k) && 4000 <= c1) && n < 2) && 2000 <= c2) && 1 <= i) || ((((10000 <= c3 && k == 0) && 4000 <= c1) && i == 0) && 2000 <= c2) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((((((10000 <= c3 && 1 <= j) && 4000 <= c1) && n < 2) && 2000 <= c2) && 0 < k) && 1 <= i) || ((((((10000 <= c3 && 0 <= j) && 2000 <= k) && 4000 <= c1) && n < 2) && 2000 <= c2) && 1 <= i)) || ((j == 0 && i == 0) && n <= 0) RESULT: Ultimate proved your program to be correct! [2022-04-15 00:36:30,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...