/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-acceleration/array_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:18:01,294 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:18:01,296 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:18:01,341 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:18:01,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:18:01,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:18:01,346 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:18:01,348 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:18:01,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:18:01,353 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:18:01,354 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:18:01,355 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:18:01,355 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:18:01,359 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:18:01,360 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:18:01,364 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:18:01,365 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:18:01,365 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:18:01,367 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:18:01,372 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:18:01,373 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:18:01,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:18:01,375 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:18:01,376 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:18:01,377 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:18:01,383 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:18:01,384 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:18:01,384 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:18:01,385 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:18:01,385 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:18:01,386 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:18:01,386 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:18:01,388 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:18:01,388 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:18:01,389 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:18:01,390 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:18:01,390 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:18:01,390 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:18:01,390 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:18:01,391 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:18:01,391 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:18:01,393 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:18:01,393 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 21:18:01,417 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:18:01,418 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:18:01,418 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:18:01,419 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:18:01,419 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:18:01,420 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:18:01,420 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:18:01,420 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:18:01,420 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:18:01,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:18:01,421 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:18:01,421 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:18:01,421 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:18:01,421 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:18:01,421 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:18:01,421 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:18:01,422 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:18:01,422 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:18:01,422 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:18:01,422 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:18:01,422 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:18:01,422 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:18:01,422 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:18:01,422 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:18:01,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:18:01,423 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:18:01,423 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:18:01,423 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:18:01,424 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:18:01,424 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 21:18:01,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:18:01,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:18:01,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:18:01,677 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:18:01,677 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:18:01,679 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_1-2.c [2022-04-27 21:18:01,733 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c83f50a7e/aa7cacf3f31443f0b296b98f7b0329bf/FLAG1f97c3eae [2022-04-27 21:18:02,041 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:18:02,041 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_1-2.c [2022-04-27 21:18:02,046 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c83f50a7e/aa7cacf3f31443f0b296b98f7b0329bf/FLAG1f97c3eae [2022-04-27 21:18:02,474 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c83f50a7e/aa7cacf3f31443f0b296b98f7b0329bf [2022-04-27 21:18:02,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:18:02,477 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:18:02,479 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:18:02,479 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:18:02,482 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:18:02,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:18:02" (1/1) ... [2022-04-27 21:18:02,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20acfce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:18:02, skipping insertion in model container [2022-04-27 21:18:02,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:18:02" (1/1) ... [2022-04-27 21:18:02,490 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:18:02,501 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:18:02,638 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-acceleration/array_1-2.c[321,334] [2022-04-27 21:18:02,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:18:02,673 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:18:02,683 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-acceleration/array_1-2.c[321,334] [2022-04-27 21:18:02,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:18:02,695 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:18:02,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:18:02 WrapperNode [2022-04-27 21:18:02,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:18:02,698 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:18:02,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:18:02,698 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:18:02,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:18:02" (1/1) ... [2022-04-27 21:18:02,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:18:02" (1/1) ... [2022-04-27 21:18:02,709 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:18:02" (1/1) ... [2022-04-27 21:18:02,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:18:02" (1/1) ... [2022-04-27 21:18:02,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:18:02" (1/1) ... [2022-04-27 21:18:02,717 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:18:02" (1/1) ... [2022-04-27 21:18:02,718 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:18:02" (1/1) ... [2022-04-27 21:18:02,719 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:18:02,720 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:18:02,720 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:18:02,720 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:18:02,721 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:18:02" (1/1) ... [2022-04-27 21:18:02,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:18:02,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:18:02,748 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 21:18:02,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 21:18:02,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:18:02,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:18:02,775 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:18:02,775 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 21:18:02,775 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:18:02,775 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:18:02,775 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:18:02,775 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:18:02,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:18:02,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:18:02,776 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:18:02,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 21:18:02,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:18:02,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:18:02,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:18:02,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:18:02,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:18:02,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:18:02,824 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:18:02,825 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:18:02,927 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:18:02,933 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:18:02,933 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 21:18:02,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:18:02 BoogieIcfgContainer [2022-04-27 21:18:02,935 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:18:02,936 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:18:02,936 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:18:02,937 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:18:02,939 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:18:02" (1/1) ... [2022-04-27 21:18:02,941 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:18:02,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:18:02 BasicIcfg [2022-04-27 21:18:02,957 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:18:02,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:18:02,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:18:02,961 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:18:02,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:18:02" (1/4) ... [2022-04-27 21:18:02,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7606f1f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:18:02, skipping insertion in model container [2022-04-27 21:18:02,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:18:02" (2/4) ... [2022-04-27 21:18:02,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7606f1f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:18:02, skipping insertion in model container [2022-04-27 21:18:02,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:18:02" (3/4) ... [2022-04-27 21:18:02,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7606f1f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:18:02, skipping insertion in model container [2022-04-27 21:18:02,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:18:02" (4/4) ... [2022-04-27 21:18:02,963 INFO L111 eAbstractionObserver]: Analyzing ICFG array_1-2.cqvasr [2022-04-27 21:18:02,974 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:18:02,974 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:18:03,010 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:18:03,015 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1cee332e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@211c234f [2022-04-27 21:18:03,016 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:18:03,023 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:18:03,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 21:18:03,029 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:18:03,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:18:03,030 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:18:03,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:18:03,043 INFO L85 PathProgramCache]: Analyzing trace with hash -737742564, now seen corresponding path program 1 times [2022-04-27 21:18:03,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:18:03,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573409822] [2022-04-27 21:18:03,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:18:03,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:18:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:18:03,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:18:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:18:03,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [44] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_4| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 1) 0) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 48 (select .cse0 0)) (= 1 (select |v_#valid_5| 3)) (= 12 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {24#true} is VALID [2022-04-27 21:18:03,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} [47] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 21:18:03,308 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} [62] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 21:18:03,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} [42] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:18:03,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [44] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_4| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 1) 0) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 48 (select .cse0 0)) (= 1 (select |v_#valid_5| 3)) (= 12 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {24#true} is VALID [2022-04-27 21:18:03,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} [47] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 21:18:03,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} [62] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 21:18:03,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} [43] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 21:18:03,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} [46] mainENTRY-->L16-3: Formula: (and (= v_main_~i~0_1 0) (= 0 |v_main_~#A~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_2|) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#A~0.base_2| 1)) (= 0 (select |v_#valid_2| |v_main_~#A~0.base_2|)) (= |v_#length_1| (store |v_#length_2| |v_main_~#A~0.base_2| 8192)) (not (= |v_main_~#A~0.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#A~0.offset=|v_main_~#A~0.offset_2|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_1, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_2|} AuxVars[] AssignedVars[main_~#A~0.offset, #valid, main_~i~0, #length, main_~#A~0.base] {24#true} is VALID [2022-04-27 21:18:03,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} [48] L16-3-->L16-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 21:18:03,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#false} [51] L16-4-->L20: Formula: (= |v_main_#t~mem5_1| (select (select |v_#memory_int_1| |v_main_~#A~0.base_1|) (+ 4092 |v_main_~#A~0.offset_1|))) InVars {#memory_int=|v_#memory_int_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#A~0.base=|v_main_~#A~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_#t~mem5=|v_main_#t~mem5_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#A~0.base=|v_main_~#A~0.base_1|} AuxVars[] AssignedVars[main_#t~mem5] {25#false} is VALID [2022-04-27 21:18:03,320 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} [53] L20-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= 1023 |v_main_#t~mem5_4|) 1 0)) InVars {main_#t~mem5=|v_main_#t~mem5_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem5] {25#false} is VALID [2022-04-27 21:18:03,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} [55] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {25#false} is VALID [2022-04-27 21:18:03,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} [57] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 21:18:03,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} [59] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 21:18:03,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:18:03,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:18:03,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573409822] [2022-04-27 21:18:03,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573409822] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:18:03,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:18:03,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 21:18:03,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232396603] [2022-04-27 21:18:03,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:18:03,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:18:03,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:18:03,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:03,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:18:03,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 21:18:03,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:18:03,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 21:18:03,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:18:03,401 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:03,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:18:03,499 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-27 21:18:03,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 21:18:03,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:18:03,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:18:03,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:03,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-27 21:18:03,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:03,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-27 21:18:03,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-04-27 21:18:03,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:18:03,569 INFO L225 Difference]: With dead ends: 34 [2022-04-27 21:18:03,569 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 21:18:03,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:18:03,577 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:18:03,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:18:03,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 21:18:03,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 21:18:03,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:18:03,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:03,604 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:03,605 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:03,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:18:03,607 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 21:18:03,607 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 21:18:03,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:18:03,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:18:03,607 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 21:18:03,608 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 21:18:03,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:18:03,609 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 21:18:03,610 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 21:18:03,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:18:03,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:18:03,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:18:03,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:18:03,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:03,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-27 21:18:03,613 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-27 21:18:03,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:18:03,613 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-27 21:18:03,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:03,614 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 21:18:03,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 21:18:03,614 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:18:03,614 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:18:03,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:18:03,615 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:18:03,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:18:03,616 INFO L85 PathProgramCache]: Analyzing trace with hash -709113413, now seen corresponding path program 1 times [2022-04-27 21:18:03,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:18:03,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080524910] [2022-04-27 21:18:03,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:18:03,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:18:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:18:03,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:18:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:18:03,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [44] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_4| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 1) 0) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 48 (select .cse0 0)) (= 1 (select |v_#valid_5| 3)) (= 12 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {124#true} is VALID [2022-04-27 21:18:03,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {124#true} [47] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#true} is VALID [2022-04-27 21:18:03,718 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {124#true} {124#true} [62] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#true} is VALID [2022-04-27 21:18:03,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {124#true} [42] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:18:03,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [44] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_4| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 1) 0) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 48 (select .cse0 0)) (= 1 (select |v_#valid_5| 3)) (= 12 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {124#true} is VALID [2022-04-27 21:18:03,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {124#true} [47] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#true} is VALID [2022-04-27 21:18:03,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {124#true} {124#true} [62] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#true} is VALID [2022-04-27 21:18:03,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {124#true} [43] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#true} is VALID [2022-04-27 21:18:03,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {124#true} [46] mainENTRY-->L16-3: Formula: (and (= v_main_~i~0_1 0) (= 0 |v_main_~#A~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_2|) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#A~0.base_2| 1)) (= 0 (select |v_#valid_2| |v_main_~#A~0.base_2|)) (= |v_#length_1| (store |v_#length_2| |v_main_~#A~0.base_2| 8192)) (not (= |v_main_~#A~0.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#A~0.offset=|v_main_~#A~0.offset_2|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_1, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_2|} AuxVars[] AssignedVars[main_~#A~0.offset, #valid, main_~i~0, #length, main_~#A~0.base] {129#(= main_~i~0 0)} is VALID [2022-04-27 21:18:03,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {129#(= main_~i~0 0)} [49] L16-3-->L16-4: Formula: (not (< v_main_~i~0_3 1024)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[] {125#false} is VALID [2022-04-27 21:18:03,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {125#false} [51] L16-4-->L20: Formula: (= |v_main_#t~mem5_1| (select (select |v_#memory_int_1| |v_main_~#A~0.base_1|) (+ 4092 |v_main_~#A~0.offset_1|))) InVars {#memory_int=|v_#memory_int_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#A~0.base=|v_main_~#A~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_#t~mem5=|v_main_#t~mem5_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#A~0.base=|v_main_~#A~0.base_1|} AuxVars[] AssignedVars[main_#t~mem5] {125#false} is VALID [2022-04-27 21:18:03,722 INFO L272 TraceCheckUtils]: 8: Hoare triple {125#false} [53] L20-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= 1023 |v_main_#t~mem5_4|) 1 0)) InVars {main_#t~mem5=|v_main_#t~mem5_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem5] {125#false} is VALID [2022-04-27 21:18:03,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {125#false} [55] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {125#false} is VALID [2022-04-27 21:18:03,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {125#false} [57] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {125#false} is VALID [2022-04-27 21:18:03,723 INFO L290 TraceCheckUtils]: 11: Hoare triple {125#false} [59] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {125#false} is VALID [2022-04-27 21:18:03,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:18:03,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:18:03,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080524910] [2022-04-27 21:18:03,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080524910] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:18:03,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:18:03,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 21:18:03,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482264847] [2022-04-27 21:18:03,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:18:03,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:18:03,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:18:03,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:03,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:18:03,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 21:18:03,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:18:03,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 21:18:03,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 21:18:03,745 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:03,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:18:03,815 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-27 21:18:03,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 21:18:03,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:18:03,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:18:03,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:03,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-27 21:18:03,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:03,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-27 21:18:03,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 22 transitions. [2022-04-27 21:18:03,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:18:03,853 INFO L225 Difference]: With dead ends: 22 [2022-04-27 21:18:03,853 INFO L226 Difference]: Without dead ends: 16 [2022-04-27 21:18:03,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:18:03,855 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:18:03,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:18:03,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-27 21:18:03,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-27 21:18:03,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:18:03,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:03,863 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:03,863 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:03,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:18:03,865 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-27 21:18:03,865 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 21:18:03,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:18:03,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:18:03,865 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 21:18:03,866 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 21:18:03,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:18:03,870 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-27 21:18:03,870 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 21:18:03,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:18:03,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:18:03,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:18:03,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:18:03,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:03,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-27 21:18:03,878 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2022-04-27 21:18:03,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:18:03,879 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-27 21:18:03,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:03,879 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 21:18:03,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 21:18:03,879 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:18:03,880 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:18:03,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:18:03,880 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:18:03,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:18:03,881 INFO L85 PathProgramCache]: Analyzing trace with hash -341174979, now seen corresponding path program 1 times [2022-04-27 21:18:03,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:18:03,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415376711] [2022-04-27 21:18:03,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:18:03,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:18:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:18:03,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:18:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:18:03,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {229#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [44] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_4| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 1) 0) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 48 (select .cse0 0)) (= 1 (select |v_#valid_5| 3)) (= 12 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {222#true} is VALID [2022-04-27 21:18:03,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {222#true} [47] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {222#true} is VALID [2022-04-27 21:18:03,963 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {222#true} {222#true} [62] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {222#true} is VALID [2022-04-27 21:18:03,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {222#true} [42] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {229#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:18:03,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {229#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [44] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_4| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 1) 0) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 48 (select .cse0 0)) (= 1 (select |v_#valid_5| 3)) (= 12 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {222#true} is VALID [2022-04-27 21:18:03,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {222#true} [47] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {222#true} is VALID [2022-04-27 21:18:03,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {222#true} {222#true} [62] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {222#true} is VALID [2022-04-27 21:18:03,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {222#true} [43] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {222#true} is VALID [2022-04-27 21:18:03,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {222#true} [46] mainENTRY-->L16-3: Formula: (and (= v_main_~i~0_1 0) (= 0 |v_main_~#A~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_2|) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#A~0.base_2| 1)) (= 0 (select |v_#valid_2| |v_main_~#A~0.base_2|)) (= |v_#length_1| (store |v_#length_2| |v_main_~#A~0.base_2| 8192)) (not (= |v_main_~#A~0.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#A~0.offset=|v_main_~#A~0.offset_2|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_1, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_2|} AuxVars[] AssignedVars[main_~#A~0.offset, #valid, main_~i~0, #length, main_~#A~0.base] {227#(= main_~i~0 0)} is VALID [2022-04-27 21:18:03,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {227#(= main_~i~0 0)} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {227#(= main_~i~0 0)} is VALID [2022-04-27 21:18:03,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {227#(= main_~i~0 0)} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {228#(<= main_~i~0 1)} is VALID [2022-04-27 21:18:03,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {228#(<= main_~i~0 1)} [49] L16-3-->L16-4: Formula: (not (< v_main_~i~0_3 1024)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[] {223#false} is VALID [2022-04-27 21:18:03,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {223#false} [51] L16-4-->L20: Formula: (= |v_main_#t~mem5_1| (select (select |v_#memory_int_1| |v_main_~#A~0.base_1|) (+ 4092 |v_main_~#A~0.offset_1|))) InVars {#memory_int=|v_#memory_int_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#A~0.base=|v_main_~#A~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_#t~mem5=|v_main_#t~mem5_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#A~0.base=|v_main_~#A~0.base_1|} AuxVars[] AssignedVars[main_#t~mem5] {223#false} is VALID [2022-04-27 21:18:03,970 INFO L272 TraceCheckUtils]: 10: Hoare triple {223#false} [53] L20-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= 1023 |v_main_#t~mem5_4|) 1 0)) InVars {main_#t~mem5=|v_main_#t~mem5_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem5] {223#false} is VALID [2022-04-27 21:18:03,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {223#false} [55] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {223#false} is VALID [2022-04-27 21:18:03,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {223#false} [57] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {223#false} is VALID [2022-04-27 21:18:03,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {223#false} [59] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {223#false} is VALID [2022-04-27 21:18:03,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:18:03,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:18:03,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415376711] [2022-04-27 21:18:03,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415376711] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:18:03,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506806885] [2022-04-27 21:18:03,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:18:03,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:18:03,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:18:03,983 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:18:03,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 21:18:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:18:04,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 21:18:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:18:04,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:18:04,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {222#true} [42] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {222#true} is VALID [2022-04-27 21:18:04,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {222#true} [44] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_4| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 1) 0) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 48 (select .cse0 0)) (= 1 (select |v_#valid_5| 3)) (= 12 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {222#true} is VALID [2022-04-27 21:18:04,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {222#true} [47] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {222#true} is VALID [2022-04-27 21:18:04,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {222#true} {222#true} [62] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {222#true} is VALID [2022-04-27 21:18:04,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {222#true} [43] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {222#true} is VALID [2022-04-27 21:18:04,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {222#true} [46] mainENTRY-->L16-3: Formula: (and (= v_main_~i~0_1 0) (= 0 |v_main_~#A~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_2|) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#A~0.base_2| 1)) (= 0 (select |v_#valid_2| |v_main_~#A~0.base_2|)) (= |v_#length_1| (store |v_#length_2| |v_main_~#A~0.base_2| 8192)) (not (= |v_main_~#A~0.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#A~0.offset=|v_main_~#A~0.offset_2|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_1, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_2|} AuxVars[] AssignedVars[main_~#A~0.offset, #valid, main_~i~0, #length, main_~#A~0.base] {248#(<= main_~i~0 0)} is VALID [2022-04-27 21:18:04,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {248#(<= main_~i~0 0)} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {248#(<= main_~i~0 0)} is VALID [2022-04-27 21:18:04,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {248#(<= main_~i~0 0)} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {228#(<= main_~i~0 1)} is VALID [2022-04-27 21:18:04,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {228#(<= main_~i~0 1)} [49] L16-3-->L16-4: Formula: (not (< v_main_~i~0_3 1024)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[] {223#false} is VALID [2022-04-27 21:18:04,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {223#false} [51] L16-4-->L20: Formula: (= |v_main_#t~mem5_1| (select (select |v_#memory_int_1| |v_main_~#A~0.base_1|) (+ 4092 |v_main_~#A~0.offset_1|))) InVars {#memory_int=|v_#memory_int_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#A~0.base=|v_main_~#A~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_#t~mem5=|v_main_#t~mem5_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#A~0.base=|v_main_~#A~0.base_1|} AuxVars[] AssignedVars[main_#t~mem5] {223#false} is VALID [2022-04-27 21:18:04,203 INFO L272 TraceCheckUtils]: 10: Hoare triple {223#false} [53] L20-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= 1023 |v_main_#t~mem5_4|) 1 0)) InVars {main_#t~mem5=|v_main_#t~mem5_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem5] {223#false} is VALID [2022-04-27 21:18:04,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {223#false} [55] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {223#false} is VALID [2022-04-27 21:18:04,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {223#false} [57] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {223#false} is VALID [2022-04-27 21:18:04,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {223#false} [59] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {223#false} is VALID [2022-04-27 21:18:04,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:18:04,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:18:04,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {223#false} [59] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {223#false} is VALID [2022-04-27 21:18:04,321 INFO L290 TraceCheckUtils]: 12: Hoare triple {223#false} [57] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {223#false} is VALID [2022-04-27 21:18:04,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {223#false} [55] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {223#false} is VALID [2022-04-27 21:18:04,321 INFO L272 TraceCheckUtils]: 10: Hoare triple {223#false} [53] L20-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= 1023 |v_main_#t~mem5_4|) 1 0)) InVars {main_#t~mem5=|v_main_#t~mem5_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem5] {223#false} is VALID [2022-04-27 21:18:04,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {223#false} [51] L16-4-->L20: Formula: (= |v_main_#t~mem5_1| (select (select |v_#memory_int_1| |v_main_~#A~0.base_1|) (+ 4092 |v_main_~#A~0.offset_1|))) InVars {#memory_int=|v_#memory_int_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#A~0.base=|v_main_~#A~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_#t~mem5=|v_main_#t~mem5_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#A~0.base=|v_main_~#A~0.base_1|} AuxVars[] AssignedVars[main_#t~mem5] {223#false} is VALID [2022-04-27 21:18:04,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {288#(< main_~i~0 1024)} [49] L16-3-->L16-4: Formula: (not (< v_main_~i~0_3 1024)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[] {223#false} is VALID [2022-04-27 21:18:04,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {292#(< main_~i~0 1023)} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {288#(< main_~i~0 1024)} is VALID [2022-04-27 21:18:04,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {292#(< main_~i~0 1023)} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {292#(< main_~i~0 1023)} is VALID [2022-04-27 21:18:04,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {222#true} [46] mainENTRY-->L16-3: Formula: (and (= v_main_~i~0_1 0) (= 0 |v_main_~#A~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_2|) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#A~0.base_2| 1)) (= 0 (select |v_#valid_2| |v_main_~#A~0.base_2|)) (= |v_#length_1| (store |v_#length_2| |v_main_~#A~0.base_2| 8192)) (not (= |v_main_~#A~0.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#A~0.offset=|v_main_~#A~0.offset_2|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_1, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_2|} AuxVars[] AssignedVars[main_~#A~0.offset, #valid, main_~i~0, #length, main_~#A~0.base] {292#(< main_~i~0 1023)} is VALID [2022-04-27 21:18:04,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {222#true} [43] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {222#true} is VALID [2022-04-27 21:18:04,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {222#true} {222#true} [62] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {222#true} is VALID [2022-04-27 21:18:04,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {222#true} [47] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {222#true} is VALID [2022-04-27 21:18:04,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {222#true} [44] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_4| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 1) 0) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 48 (select .cse0 0)) (= 1 (select |v_#valid_5| 3)) (= 12 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {222#true} is VALID [2022-04-27 21:18:04,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {222#true} [42] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {222#true} is VALID [2022-04-27 21:18:04,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:18:04,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506806885] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:18:04,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:18:04,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-27 21:18:04,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129389905] [2022-04-27 21:18:04,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:18:04,334 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 21:18:04,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:18:04,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:04,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:18:04,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 21:18:04,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:18:04,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 21:18:04,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-27 21:18:04,358 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:04,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:18:04,486 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-27 21:18:04,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:18:04,487 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 21:18:04,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:18:04,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:04,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2022-04-27 21:18:04,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:04,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2022-04-27 21:18:04,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 29 transitions. [2022-04-27 21:18:04,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:18:04,524 INFO L225 Difference]: With dead ends: 27 [2022-04-27 21:18:04,524 INFO L226 Difference]: Without dead ends: 21 [2022-04-27 21:18:04,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-04-27 21:18:04,529 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:18:04,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 24 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:18:04,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-27 21:18:04,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-27 21:18:04,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:18:04,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:04,541 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:04,542 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:04,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:18:04,545 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-27 21:18:04,545 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-27 21:18:04,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:18:04,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:18:04,546 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-27 21:18:04,546 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-27 21:18:04,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:18:04,548 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-27 21:18:04,548 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-27 21:18:04,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:18:04,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:18:04,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:18:04,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:18:04,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:04,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-27 21:18:04,556 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2022-04-27 21:18:04,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:18:04,557 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-27 21:18:04,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:04,557 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-27 21:18:04,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 21:18:04,557 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:18:04,558 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:18:04,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 21:18:04,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:18:04,780 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:18:04,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:18:04,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1847565117, now seen corresponding path program 2 times [2022-04-27 21:18:04,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:18:04,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993904092] [2022-04-27 21:18:04,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:18:04,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:18:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:18:04,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:18:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:18:04,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {448#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [44] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_4| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 1) 0) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 48 (select .cse0 0)) (= 1 (select |v_#valid_5| 3)) (= 12 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {438#true} is VALID [2022-04-27 21:18:04,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {438#true} [47] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {438#true} is VALID [2022-04-27 21:18:04,946 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {438#true} {438#true} [62] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {438#true} is VALID [2022-04-27 21:18:04,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {438#true} [42] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {448#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:18:04,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {448#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [44] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_4| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 1) 0) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 48 (select .cse0 0)) (= 1 (select |v_#valid_5| 3)) (= 12 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {438#true} is VALID [2022-04-27 21:18:04,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {438#true} [47] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {438#true} is VALID [2022-04-27 21:18:04,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {438#true} {438#true} [62] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {438#true} is VALID [2022-04-27 21:18:04,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {438#true} [43] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {438#true} is VALID [2022-04-27 21:18:04,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {438#true} [46] mainENTRY-->L16-3: Formula: (and (= v_main_~i~0_1 0) (= 0 |v_main_~#A~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_2|) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#A~0.base_2| 1)) (= 0 (select |v_#valid_2| |v_main_~#A~0.base_2|)) (= |v_#length_1| (store |v_#length_2| |v_main_~#A~0.base_2| 8192)) (not (= |v_main_~#A~0.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#A~0.offset=|v_main_~#A~0.offset_2|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_1, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_2|} AuxVars[] AssignedVars[main_~#A~0.offset, #valid, main_~i~0, #length, main_~#A~0.base] {443#(= main_~i~0 0)} is VALID [2022-04-27 21:18:04,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {443#(= main_~i~0 0)} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {443#(= main_~i~0 0)} is VALID [2022-04-27 21:18:04,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {443#(= main_~i~0 0)} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {444#(<= main_~i~0 1)} is VALID [2022-04-27 21:18:04,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {444#(<= main_~i~0 1)} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {444#(<= main_~i~0 1)} is VALID [2022-04-27 21:18:04,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {444#(<= main_~i~0 1)} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {445#(<= main_~i~0 2)} is VALID [2022-04-27 21:18:04,951 INFO L290 TraceCheckUtils]: 10: Hoare triple {445#(<= main_~i~0 2)} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {445#(<= main_~i~0 2)} is VALID [2022-04-27 21:18:04,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {445#(<= main_~i~0 2)} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {446#(<= main_~i~0 3)} is VALID [2022-04-27 21:18:04,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {446#(<= main_~i~0 3)} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {446#(<= main_~i~0 3)} is VALID [2022-04-27 21:18:04,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {446#(<= main_~i~0 3)} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {447#(<= main_~i~0 4)} is VALID [2022-04-27 21:18:04,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {447#(<= main_~i~0 4)} [49] L16-3-->L16-4: Formula: (not (< v_main_~i~0_3 1024)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[] {439#false} is VALID [2022-04-27 21:18:04,954 INFO L290 TraceCheckUtils]: 15: Hoare triple {439#false} [51] L16-4-->L20: Formula: (= |v_main_#t~mem5_1| (select (select |v_#memory_int_1| |v_main_~#A~0.base_1|) (+ 4092 |v_main_~#A~0.offset_1|))) InVars {#memory_int=|v_#memory_int_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#A~0.base=|v_main_~#A~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_#t~mem5=|v_main_#t~mem5_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#A~0.base=|v_main_~#A~0.base_1|} AuxVars[] AssignedVars[main_#t~mem5] {439#false} is VALID [2022-04-27 21:18:04,954 INFO L272 TraceCheckUtils]: 16: Hoare triple {439#false} [53] L20-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= 1023 |v_main_#t~mem5_4|) 1 0)) InVars {main_#t~mem5=|v_main_#t~mem5_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem5] {439#false} is VALID [2022-04-27 21:18:04,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {439#false} [55] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {439#false} is VALID [2022-04-27 21:18:04,954 INFO L290 TraceCheckUtils]: 18: Hoare triple {439#false} [57] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {439#false} is VALID [2022-04-27 21:18:04,955 INFO L290 TraceCheckUtils]: 19: Hoare triple {439#false} [59] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {439#false} is VALID [2022-04-27 21:18:04,955 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:18:04,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:18:04,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993904092] [2022-04-27 21:18:04,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993904092] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:18:04,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466302850] [2022-04-27 21:18:04,956 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 21:18:04,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:18:04,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:18:04,957 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:18:04,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 21:18:05,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 21:18:05,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:18:05,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 21:18:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:18:05,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:18:05,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {438#true} [42] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {438#true} is VALID [2022-04-27 21:18:05,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {438#true} [44] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_4| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 1) 0) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 48 (select .cse0 0)) (= 1 (select |v_#valid_5| 3)) (= 12 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {438#true} is VALID [2022-04-27 21:18:05,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {438#true} [47] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {438#true} is VALID [2022-04-27 21:18:05,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {438#true} {438#true} [62] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {438#true} is VALID [2022-04-27 21:18:05,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {438#true} [43] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {438#true} is VALID [2022-04-27 21:18:05,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {438#true} [46] mainENTRY-->L16-3: Formula: (and (= v_main_~i~0_1 0) (= 0 |v_main_~#A~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_2|) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#A~0.base_2| 1)) (= 0 (select |v_#valid_2| |v_main_~#A~0.base_2|)) (= |v_#length_1| (store |v_#length_2| |v_main_~#A~0.base_2| 8192)) (not (= |v_main_~#A~0.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#A~0.offset=|v_main_~#A~0.offset_2|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_1, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_2|} AuxVars[] AssignedVars[main_~#A~0.offset, #valid, main_~i~0, #length, main_~#A~0.base] {467#(<= main_~i~0 0)} is VALID [2022-04-27 21:18:05,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {467#(<= main_~i~0 0)} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {467#(<= main_~i~0 0)} is VALID [2022-04-27 21:18:05,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {467#(<= main_~i~0 0)} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {444#(<= main_~i~0 1)} is VALID [2022-04-27 21:18:05,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {444#(<= main_~i~0 1)} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {444#(<= main_~i~0 1)} is VALID [2022-04-27 21:18:05,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {444#(<= main_~i~0 1)} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {445#(<= main_~i~0 2)} is VALID [2022-04-27 21:18:05,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {445#(<= main_~i~0 2)} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {445#(<= main_~i~0 2)} is VALID [2022-04-27 21:18:05,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {445#(<= main_~i~0 2)} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {446#(<= main_~i~0 3)} is VALID [2022-04-27 21:18:05,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {446#(<= main_~i~0 3)} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {446#(<= main_~i~0 3)} is VALID [2022-04-27 21:18:05,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {446#(<= main_~i~0 3)} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {447#(<= main_~i~0 4)} is VALID [2022-04-27 21:18:05,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {447#(<= main_~i~0 4)} [49] L16-3-->L16-4: Formula: (not (< v_main_~i~0_3 1024)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[] {439#false} is VALID [2022-04-27 21:18:05,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {439#false} [51] L16-4-->L20: Formula: (= |v_main_#t~mem5_1| (select (select |v_#memory_int_1| |v_main_~#A~0.base_1|) (+ 4092 |v_main_~#A~0.offset_1|))) InVars {#memory_int=|v_#memory_int_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#A~0.base=|v_main_~#A~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_#t~mem5=|v_main_#t~mem5_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#A~0.base=|v_main_~#A~0.base_1|} AuxVars[] AssignedVars[main_#t~mem5] {439#false} is VALID [2022-04-27 21:18:05,116 INFO L272 TraceCheckUtils]: 16: Hoare triple {439#false} [53] L20-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= 1023 |v_main_#t~mem5_4|) 1 0)) InVars {main_#t~mem5=|v_main_#t~mem5_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem5] {439#false} is VALID [2022-04-27 21:18:05,116 INFO L290 TraceCheckUtils]: 17: Hoare triple {439#false} [55] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {439#false} is VALID [2022-04-27 21:18:05,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {439#false} [57] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {439#false} is VALID [2022-04-27 21:18:05,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {439#false} [59] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {439#false} is VALID [2022-04-27 21:18:05,117 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:18:05,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:18:05,274 INFO L290 TraceCheckUtils]: 19: Hoare triple {439#false} [59] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {439#false} is VALID [2022-04-27 21:18:05,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {439#false} [57] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {439#false} is VALID [2022-04-27 21:18:05,275 INFO L290 TraceCheckUtils]: 17: Hoare triple {439#false} [55] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {439#false} is VALID [2022-04-27 21:18:05,275 INFO L272 TraceCheckUtils]: 16: Hoare triple {439#false} [53] L20-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= 1023 |v_main_#t~mem5_4|) 1 0)) InVars {main_#t~mem5=|v_main_#t~mem5_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem5] {439#false} is VALID [2022-04-27 21:18:05,275 INFO L290 TraceCheckUtils]: 15: Hoare triple {439#false} [51] L16-4-->L20: Formula: (= |v_main_#t~mem5_1| (select (select |v_#memory_int_1| |v_main_~#A~0.base_1|) (+ 4092 |v_main_~#A~0.offset_1|))) InVars {#memory_int=|v_#memory_int_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#A~0.base=|v_main_~#A~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_#t~mem5=|v_main_#t~mem5_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#A~0.base=|v_main_~#A~0.base_1|} AuxVars[] AssignedVars[main_#t~mem5] {439#false} is VALID [2022-04-27 21:18:05,276 INFO L290 TraceCheckUtils]: 14: Hoare triple {525#(< main_~i~0 1024)} [49] L16-3-->L16-4: Formula: (not (< v_main_~i~0_3 1024)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[] {439#false} is VALID [2022-04-27 21:18:05,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {529#(< main_~i~0 1023)} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {525#(< main_~i~0 1024)} is VALID [2022-04-27 21:18:05,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {529#(< main_~i~0 1023)} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {529#(< main_~i~0 1023)} is VALID [2022-04-27 21:18:05,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {536#(< main_~i~0 1022)} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {529#(< main_~i~0 1023)} is VALID [2022-04-27 21:18:05,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {536#(< main_~i~0 1022)} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {536#(< main_~i~0 1022)} is VALID [2022-04-27 21:18:05,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {543#(< main_~i~0 1021)} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {536#(< main_~i~0 1022)} is VALID [2022-04-27 21:18:05,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {543#(< main_~i~0 1021)} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {543#(< main_~i~0 1021)} is VALID [2022-04-27 21:18:05,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {550#(< main_~i~0 1020)} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {543#(< main_~i~0 1021)} is VALID [2022-04-27 21:18:05,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {550#(< main_~i~0 1020)} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {550#(< main_~i~0 1020)} is VALID [2022-04-27 21:18:05,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {438#true} [46] mainENTRY-->L16-3: Formula: (and (= v_main_~i~0_1 0) (= 0 |v_main_~#A~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_2|) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#A~0.base_2| 1)) (= 0 (select |v_#valid_2| |v_main_~#A~0.base_2|)) (= |v_#length_1| (store |v_#length_2| |v_main_~#A~0.base_2| 8192)) (not (= |v_main_~#A~0.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#A~0.offset=|v_main_~#A~0.offset_2|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_1, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_2|} AuxVars[] AssignedVars[main_~#A~0.offset, #valid, main_~i~0, #length, main_~#A~0.base] {550#(< main_~i~0 1020)} is VALID [2022-04-27 21:18:05,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {438#true} [43] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {438#true} is VALID [2022-04-27 21:18:05,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {438#true} {438#true} [62] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {438#true} is VALID [2022-04-27 21:18:05,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {438#true} [47] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {438#true} is VALID [2022-04-27 21:18:05,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {438#true} [44] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_4| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 1) 0) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 48 (select .cse0 0)) (= 1 (select |v_#valid_5| 3)) (= 12 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {438#true} is VALID [2022-04-27 21:18:05,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {438#true} [42] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {438#true} is VALID [2022-04-27 21:18:05,282 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:18:05,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466302850] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:18:05,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:18:05,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-27 21:18:05,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632670652] [2022-04-27 21:18:05,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:18:05,283 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 21:18:05,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:18:05,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:05,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:18:05,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 21:18:05,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:18:05,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 21:18:05,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2022-04-27 21:18:05,310 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:05,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:18:05,552 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-27 21:18:05,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 21:18:05,552 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 21:18:05,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:18:05,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:05,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 44 transitions. [2022-04-27 21:18:05,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:05,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 44 transitions. [2022-04-27 21:18:05,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 44 transitions. [2022-04-27 21:18:05,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:18:05,596 INFO L225 Difference]: With dead ends: 39 [2022-04-27 21:18:05,596 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 21:18:05,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2022-04-27 21:18:05,597 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 32 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:18:05,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 29 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:18:05,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 21:18:05,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-27 21:18:05,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:18:05,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:05,608 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:05,609 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:05,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:18:05,610 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-27 21:18:05,610 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-27 21:18:05,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:18:05,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:18:05,611 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-27 21:18:05,611 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-27 21:18:05,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:18:05,613 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-27 21:18:05,613 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-27 21:18:05,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:18:05,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:18:05,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:18:05,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:18:05,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:05,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-04-27 21:18:05,614 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 20 [2022-04-27 21:18:05,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:18:05,615 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-04-27 21:18:05,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:18:05,615 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-27 21:18:05,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 21:18:05,616 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:18:05,616 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:18:05,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 21:18:05,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 21:18:05,838 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:18:05,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:18:05,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1093643855, now seen corresponding path program 3 times [2022-04-27 21:18:05,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:18:05,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933258344] [2022-04-27 21:18:05,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:18:05,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:18:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:18:05,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:18:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:18:06,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {784#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [44] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_4| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 1) 0) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 48 (select .cse0 0)) (= 1 (select |v_#valid_5| 3)) (= 12 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {768#true} is VALID [2022-04-27 21:18:06,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {768#true} [47] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {768#true} is VALID [2022-04-27 21:18:06,003 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {768#true} {768#true} [62] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {768#true} is VALID [2022-04-27 21:18:06,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {768#true} [42] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:18:06,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {784#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [44] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_4| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 1) 0) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 48 (select .cse0 0)) (= 1 (select |v_#valid_5| 3)) (= 12 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {768#true} is VALID [2022-04-27 21:18:06,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {768#true} [47] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {768#true} is VALID [2022-04-27 21:18:06,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {768#true} {768#true} [62] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {768#true} is VALID [2022-04-27 21:18:06,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {768#true} [43] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {768#true} is VALID [2022-04-27 21:18:06,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {768#true} [46] mainENTRY-->L16-3: Formula: (and (= v_main_~i~0_1 0) (= 0 |v_main_~#A~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_2|) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#A~0.base_2| 1)) (= 0 (select |v_#valid_2| |v_main_~#A~0.base_2|)) (= |v_#length_1| (store |v_#length_2| |v_main_~#A~0.base_2| 8192)) (not (= |v_main_~#A~0.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#A~0.offset=|v_main_~#A~0.offset_2|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_1, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_2|} AuxVars[] AssignedVars[main_~#A~0.offset, #valid, main_~i~0, #length, main_~#A~0.base] {773#(= main_~i~0 0)} is VALID [2022-04-27 21:18:06,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {773#(= main_~i~0 0)} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {773#(= main_~i~0 0)} is VALID [2022-04-27 21:18:06,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {773#(= main_~i~0 0)} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {774#(<= main_~i~0 1)} is VALID [2022-04-27 21:18:06,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {774#(<= main_~i~0 1)} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {774#(<= main_~i~0 1)} is VALID [2022-04-27 21:18:06,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {774#(<= main_~i~0 1)} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {775#(<= main_~i~0 2)} is VALID [2022-04-27 21:18:06,007 INFO L290 TraceCheckUtils]: 10: Hoare triple {775#(<= main_~i~0 2)} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {775#(<= main_~i~0 2)} is VALID [2022-04-27 21:18:06,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {775#(<= main_~i~0 2)} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {776#(<= main_~i~0 3)} is VALID [2022-04-27 21:18:06,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {776#(<= main_~i~0 3)} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {776#(<= main_~i~0 3)} is VALID [2022-04-27 21:18:06,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {776#(<= main_~i~0 3)} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {777#(<= main_~i~0 4)} is VALID [2022-04-27 21:18:06,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {777#(<= main_~i~0 4)} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {777#(<= main_~i~0 4)} is VALID [2022-04-27 21:18:06,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {777#(<= main_~i~0 4)} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {778#(<= main_~i~0 5)} is VALID [2022-04-27 21:18:06,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {778#(<= main_~i~0 5)} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {778#(<= main_~i~0 5)} is VALID [2022-04-27 21:18:06,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {778#(<= main_~i~0 5)} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {779#(<= main_~i~0 6)} is VALID [2022-04-27 21:18:06,011 INFO L290 TraceCheckUtils]: 18: Hoare triple {779#(<= main_~i~0 6)} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {779#(<= main_~i~0 6)} is VALID [2022-04-27 21:18:06,011 INFO L290 TraceCheckUtils]: 19: Hoare triple {779#(<= main_~i~0 6)} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {780#(<= main_~i~0 7)} is VALID [2022-04-27 21:18:06,011 INFO L290 TraceCheckUtils]: 20: Hoare triple {780#(<= main_~i~0 7)} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {780#(<= main_~i~0 7)} is VALID [2022-04-27 21:18:06,012 INFO L290 TraceCheckUtils]: 21: Hoare triple {780#(<= main_~i~0 7)} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {781#(<= main_~i~0 8)} is VALID [2022-04-27 21:18:06,012 INFO L290 TraceCheckUtils]: 22: Hoare triple {781#(<= main_~i~0 8)} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {781#(<= main_~i~0 8)} is VALID [2022-04-27 21:18:06,013 INFO L290 TraceCheckUtils]: 23: Hoare triple {781#(<= main_~i~0 8)} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {782#(<= main_~i~0 9)} is VALID [2022-04-27 21:18:06,013 INFO L290 TraceCheckUtils]: 24: Hoare triple {782#(<= main_~i~0 9)} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {782#(<= main_~i~0 9)} is VALID [2022-04-27 21:18:06,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {782#(<= main_~i~0 9)} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {783#(<= main_~i~0 10)} is VALID [2022-04-27 21:18:06,014 INFO L290 TraceCheckUtils]: 26: Hoare triple {783#(<= main_~i~0 10)} [49] L16-3-->L16-4: Formula: (not (< v_main_~i~0_3 1024)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[] {769#false} is VALID [2022-04-27 21:18:06,014 INFO L290 TraceCheckUtils]: 27: Hoare triple {769#false} [51] L16-4-->L20: Formula: (= |v_main_#t~mem5_1| (select (select |v_#memory_int_1| |v_main_~#A~0.base_1|) (+ 4092 |v_main_~#A~0.offset_1|))) InVars {#memory_int=|v_#memory_int_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#A~0.base=|v_main_~#A~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_#t~mem5=|v_main_#t~mem5_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#A~0.base=|v_main_~#A~0.base_1|} AuxVars[] AssignedVars[main_#t~mem5] {769#false} is VALID [2022-04-27 21:18:06,014 INFO L272 TraceCheckUtils]: 28: Hoare triple {769#false} [53] L20-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= 1023 |v_main_#t~mem5_4|) 1 0)) InVars {main_#t~mem5=|v_main_#t~mem5_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem5] {769#false} is VALID [2022-04-27 21:18:06,015 INFO L290 TraceCheckUtils]: 29: Hoare triple {769#false} [55] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {769#false} is VALID [2022-04-27 21:18:06,015 INFO L290 TraceCheckUtils]: 30: Hoare triple {769#false} [57] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {769#false} is VALID [2022-04-27 21:18:06,015 INFO L290 TraceCheckUtils]: 31: Hoare triple {769#false} [59] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {769#false} is VALID [2022-04-27 21:18:06,015 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:18:06,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:18:06,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933258344] [2022-04-27 21:18:06,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933258344] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:18:06,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312508427] [2022-04-27 21:18:06,016 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 21:18:06,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:18:06,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:18:06,017 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:18:06,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 21:18:06,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 21:18:06,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:18:06,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 21:18:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:18:06,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:18:06,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-27 21:18:06,451 INFO L356 Elim1Store]: treesize reduction 12, result has 20.0 percent of original size [2022-04-27 21:18:06,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2022-04-27 21:18:06,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {768#true} [42] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {768#true} is VALID [2022-04-27 21:18:06,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {768#true} [44] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_4| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 1) 0) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 48 (select .cse0 0)) (= 1 (select |v_#valid_5| 3)) (= 12 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {768#true} is VALID [2022-04-27 21:18:06,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {768#true} [47] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {768#true} is VALID [2022-04-27 21:18:06,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {768#true} {768#true} [62] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {768#true} is VALID [2022-04-27 21:18:06,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {768#true} [43] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {768#true} is VALID [2022-04-27 21:18:06,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {768#true} [46] mainENTRY-->L16-3: Formula: (and (= v_main_~i~0_1 0) (= 0 |v_main_~#A~0.offset_2|) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_2|) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#A~0.base_2| 1)) (= 0 (select |v_#valid_2| |v_main_~#A~0.base_2|)) (= |v_#length_1| (store |v_#length_2| |v_main_~#A~0.base_2| 8192)) (not (= |v_main_~#A~0.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#A~0.offset=|v_main_~#A~0.offset_2|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_1, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_2|} AuxVars[] AssignedVars[main_~#A~0.offset, #valid, main_~i~0, #length, main_~#A~0.base] {768#true} is VALID [2022-04-27 21:18:06,606 INFO L290 TraceCheckUtils]: 6: Hoare triple {768#true} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {768#true} is VALID [2022-04-27 21:18:06,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {768#true} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {768#true} is VALID [2022-04-27 21:18:06,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {768#true} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {768#true} is VALID [2022-04-27 21:18:06,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {768#true} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {768#true} is VALID [2022-04-27 21:18:06,607 INFO L290 TraceCheckUtils]: 10: Hoare triple {768#true} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {768#true} is VALID [2022-04-27 21:18:06,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {768#true} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {768#true} is VALID [2022-04-27 21:18:06,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {768#true} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {768#true} is VALID [2022-04-27 21:18:06,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {768#true} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {768#true} is VALID [2022-04-27 21:18:06,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {768#true} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {768#true} is VALID [2022-04-27 21:18:06,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {768#true} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {768#true} is VALID [2022-04-27 21:18:06,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {768#true} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {768#true} is VALID [2022-04-27 21:18:06,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {768#true} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {768#true} is VALID [2022-04-27 21:18:06,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {768#true} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {768#true} is VALID [2022-04-27 21:18:06,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {768#true} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {768#true} is VALID [2022-04-27 21:18:06,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {768#true} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {768#true} is VALID [2022-04-27 21:18:06,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {768#true} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {768#true} is VALID [2022-04-27 21:18:06,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {768#true} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {768#true} is VALID [2022-04-27 21:18:06,609 INFO L290 TraceCheckUtils]: 23: Hoare triple {768#true} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {768#true} is VALID [2022-04-27 21:18:06,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {768#true} [50] L16-3-->L16-2: Formula: (and (< v_main_~i~0_4 1024) (= (store |v_#memory_int_3| |v_main_~#A~0.base_5| (store (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_4 4) |v_main_~#A~0.offset_5|) v_main_~i~0_4)) |v_#memory_int_2|)) InVars {#memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_4, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[#memory_int] {860#(and (< main_~i~0 1024) (= main_~i~0 (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* main_~i~0 4)))))} is VALID [2022-04-27 21:18:06,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {860#(and (< main_~i~0 1024) (= main_~i~0 (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| (* main_~i~0 4)))))} [52] L16-2-->L16-3: Formula: (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {864#(and (< main_~i~0 1025) (= (+ (- 1) main_~i~0) (select (select |#memory_int| |main_~#A~0.base|) (+ (- 4) |main_~#A~0.offset| (* main_~i~0 4)))))} is VALID [2022-04-27 21:18:06,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {864#(and (< main_~i~0 1025) (= (+ (- 1) main_~i~0) (select (select |#memory_int| |main_~#A~0.base|) (+ (- 4) |main_~#A~0.offset| (* main_~i~0 4)))))} [49] L16-3-->L16-4: Formula: (not (< v_main_~i~0_3 1024)) InVars {main_~i~0=v_main_~i~0_3} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[] {868#(exists ((main_~i~0 Int)) (and (< main_~i~0 1025) (not (< main_~i~0 1024)) (= (+ (- 1) main_~i~0) (select (select |#memory_int| |main_~#A~0.base|) (+ (- 4) |main_~#A~0.offset| (* main_~i~0 4))))))} is VALID [2022-04-27 21:18:06,615 INFO L290 TraceCheckUtils]: 27: Hoare triple {868#(exists ((main_~i~0 Int)) (and (< main_~i~0 1025) (not (< main_~i~0 1024)) (= (+ (- 1) main_~i~0) (select (select |#memory_int| |main_~#A~0.base|) (+ (- 4) |main_~#A~0.offset| (* main_~i~0 4))))))} [51] L16-4-->L20: Formula: (= |v_main_#t~mem5_1| (select (select |v_#memory_int_1| |v_main_~#A~0.base_1|) (+ 4092 |v_main_~#A~0.offset_1|))) InVars {#memory_int=|v_#memory_int_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#A~0.base=|v_main_~#A~0.base_1|} OutVars{#memory_int=|v_#memory_int_1|, main_#t~mem5=|v_main_#t~mem5_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, main_~#A~0.base=|v_main_~#A~0.base_1|} AuxVars[] AssignedVars[main_#t~mem5] {872#(and (< |main_#t~mem5| 1024) (not (< |main_#t~mem5| 1023)))} is VALID [2022-04-27 21:18:06,615 INFO L272 TraceCheckUtils]: 28: Hoare triple {872#(and (< |main_#t~mem5| 1024) (not (< |main_#t~mem5| 1023)))} [53] L20-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= 1023 |v_main_#t~mem5_4|) 1 0)) InVars {main_#t~mem5=|v_main_#t~mem5_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem5] {876#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:18:06,618 INFO L290 TraceCheckUtils]: 29: Hoare triple {876#(<= 1 |__VERIFIER_assert_#in~cond|)} [55] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {880#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:18:06,619 INFO L290 TraceCheckUtils]: 30: Hoare triple {880#(<= 1 __VERIFIER_assert_~cond)} [57] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {769#false} is VALID [2022-04-27 21:18:06,619 INFO L290 TraceCheckUtils]: 31: Hoare triple {769#false} [59] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {769#false} is VALID [2022-04-27 21:18:06,619 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-27 21:18:06,619 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 21:18:06,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312508427] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:18:06,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 21:18:06,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 20 [2022-04-27 21:18:06,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132031414] [2022-04-27 21:18:06,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:18:06,620 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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 32 [2022-04-27 21:18:06,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:18:06,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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-27 21:18:06,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:18:06,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 21:18:06,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:18:06,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 21:18:06,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2022-04-27 21:18:06,643 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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-27 21:18:06,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:18:06,808 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-27 21:18:06,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 21:18:06,809 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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 32 [2022-04-27 21:18:06,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:18:06,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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-27 21:18:06,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2022-04-27 21:18:06,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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-27 21:18:06,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2022-04-27 21:18:06,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 16 transitions. [2022-04-27 21:18:06,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:18:06,832 INFO L225 Difference]: With dead ends: 33 [2022-04-27 21:18:06,832 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 21:18:06,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2022-04-27 21:18:06,833 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:18:06,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 41 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 9 Unchecked, 0.0s Time] [2022-04-27 21:18:06,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 21:18:06,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 21:18:06,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:18:06,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:18:06,834 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:18:06,835 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:18:06,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:18:06,835 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:18:06,835 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:18:06,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:18:06,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:18:06,835 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 21:18:06,836 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 21:18:06,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:18:06,836 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:18:06,836 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:18:06,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:18:06,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:18:06,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:18:06,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:18:06,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:18:06,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 21:18:06,837 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2022-04-27 21:18:06,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:18:06,837 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 21:18:06,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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-27 21:18:06,837 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:18:06,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:18:06,840 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 21:18:06,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 21:18:07,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:18:07,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 21:18:07,183 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 21:18:07,183 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:18:07,183 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:18:07,183 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 21:18:07,186 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 21:18:07,186 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:18:07,186 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:18:07,187 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 12 21) the Hoare annotation is: true [2022-04-27 21:18:07,187 INFO L895 garLoopResultBuilder]: At program point L16-3(lines 16 18) the Hoare annotation is: (or (= main_~i~0 0) (and (= main_~i~0 (+ (select (select |#memory_int| |main_~#A~0.base|) (+ (- 4) |main_~#A~0.offset| (* main_~i~0 4))) 1)) (< main_~i~0 1025))) [2022-04-27 21:18:07,187 INFO L899 garLoopResultBuilder]: For program point L16-4(lines 16 18) no Hoare annotation was computed. [2022-04-27 21:18:07,187 INFO L899 garLoopResultBuilder]: For program point L16-2(lines 16 18) no Hoare annotation was computed. [2022-04-27 21:18:07,187 INFO L895 garLoopResultBuilder]: At program point L20(line 20) the Hoare annotation is: (and (< |main_#t~mem5| 1024) (not (< |main_#t~mem5| 1023))) [2022-04-27 21:18:07,187 INFO L899 garLoopResultBuilder]: For program point L20-1(line 20) no Hoare annotation was computed. [2022-04-27 21:18:07,187 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 12 21) no Hoare annotation was computed. [2022-04-27 21:18:07,187 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 12 21) no Hoare annotation was computed. [2022-04-27 21:18:07,187 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-27 21:18:07,188 INFO L899 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2022-04-27 21:18:07,188 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-27 21:18:07,188 INFO L899 garLoopResultBuilder]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2022-04-27 21:18:07,188 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2022-04-27 21:18:07,188 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2022-04-27 21:18:07,191 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2022-04-27 21:18:07,193 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:18:07,196 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:18:07,197 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 21:18:07,197 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:18:07,197 WARN L170 areAnnotationChecker]: L16-4 has no Hoare annotation [2022-04-27 21:18:07,197 WARN L170 areAnnotationChecker]: L16-4 has no Hoare annotation [2022-04-27 21:18:07,197 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-27 21:18:07,197 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 21:18:07,197 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 21:18:07,197 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:18:07,197 WARN L170 areAnnotationChecker]: L16-4 has no Hoare annotation [2022-04-27 21:18:07,197 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-27 21:18:07,197 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 21:18:07,198 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 21:18:07,198 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-27 21:18:07,198 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:18:07,198 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-04-27 21:18:07,198 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:18:07,198 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:18:07,198 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:18:07,198 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 21:18:07,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:18:07 BasicIcfg [2022-04-27 21:18:07,211 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 21:18:07,212 INFO L158 Benchmark]: Toolchain (without parser) took 4734.86ms. Allocated memory was 195.0MB in the beginning and 289.4MB in the end (delta: 94.4MB). Free memory was 136.3MB in the beginning and 109.7MB in the end (delta: 26.6MB). Peak memory consumption was 120.3MB. Max. memory is 8.0GB. [2022-04-27 21:18:07,213 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 195.0MB. Free memory is still 152.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:18:07,213 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.69ms. Allocated memory was 195.0MB in the beginning and 289.4MB in the end (delta: 94.4MB). Free memory was 136.1MB in the beginning and 261.2MB in the end (delta: -125.1MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. [2022-04-27 21:18:07,213 INFO L158 Benchmark]: Boogie Preprocessor took 21.24ms. Allocated memory is still 289.4MB. Free memory was 261.2MB in the beginning and 259.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 21:18:07,214 INFO L158 Benchmark]: RCFGBuilder took 215.30ms. Allocated memory is still 289.4MB. Free memory was 259.7MB in the beginning and 248.6MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 21:18:07,214 INFO L158 Benchmark]: IcfgTransformer took 21.18ms. Allocated memory is still 289.4MB. Free memory was 248.6MB in the beginning and 247.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 21:18:07,214 INFO L158 Benchmark]: TraceAbstraction took 4253.17ms. Allocated memory is still 289.4MB. Free memory was 246.6MB in the beginning and 110.2MB in the end (delta: 136.3MB). Peak memory consumption was 135.8MB. Max. memory is 8.0GB. [2022-04-27 21:18:07,216 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.14ms. Allocated memory is still 195.0MB. Free memory is still 152.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 218.69ms. Allocated memory was 195.0MB in the beginning and 289.4MB in the end (delta: 94.4MB). Free memory was 136.1MB in the beginning and 261.2MB in the end (delta: -125.1MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.24ms. Allocated memory is still 289.4MB. Free memory was 261.2MB in the beginning and 259.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 215.30ms. Allocated memory is still 289.4MB. Free memory was 259.7MB in the beginning and 248.6MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 21.18ms. Allocated memory is still 289.4MB. Free memory was 248.6MB in the beginning and 247.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 4253.17ms. Allocated memory is still 289.4MB. Free memory was 246.6MB in the beginning and 110.2MB in the end (delta: 136.3MB). Peak memory consumption was 135.8MB. 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: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 5, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 73 mSDsluCounter, 136 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 9 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 110 IncrementalHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 64 mSDtfsCounter, 110 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=4, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 22 NumberOfFragments, 41 HoareAnnotationTreeSize, 11 FomulaSimplifications, 33 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 162 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 156 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 180 ConstructedInterpolants, 1 QuantifiedInterpolants, 390 SizeOfPredicates, 5 NumberOfNonLiveVariables, 256 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 100/251 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: 16]: Loop Invariant Derived loop invariant: i == 0 || (i == unknown-#memory_int-unknown[A][-4 + A + i * 4] + 1 && i < 1025) RESULT: Ultimate proved your program to be correct! [2022-04-27 21:18:07,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...