/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loops/sum04-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 22:01:26,050 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 22:01:26,051 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 22:01:26,083 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 22:01:26,084 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 22:01:26,085 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 22:01:26,086 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 22:01:26,088 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 22:01:26,090 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 22:01:26,093 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 22:01:26,093 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 22:01:26,094 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 22:01:26,095 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 22:01:26,096 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 22:01:26,097 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 22:01:26,099 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 22:01:26,099 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 22:01:26,100 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 22:01:26,101 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 22:01:26,105 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 22:01:26,107 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 22:01:26,107 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 22:01:26,108 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 22:01:26,108 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 22:01:26,109 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 22:01:26,114 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 22:01:26,114 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 22:01:26,114 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 22:01:26,114 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 22:01:26,115 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 22:01:26,116 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 22:01:26,116 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 22:01:26,117 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 22:01:26,117 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 22:01:26,118 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 22:01:26,118 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 22:01:26,118 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 22:01:26,119 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 22:01:26,119 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 22:01:26,119 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 22:01:26,119 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 22:01:26,120 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 22:01:26,121 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-07 22:01:26,142 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 22:01:26,143 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 22:01:26,143 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 22:01:26,143 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 22:01:26,144 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 22:01:26,144 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 22:01:26,144 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 22:01:26,144 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 22:01:26,144 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 22:01:26,145 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 22:01:26,145 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 22:01:26,145 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 22:01:26,145 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 22:01:26,145 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 22:01:26,145 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 22:01:26,146 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 22:01:26,146 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 22:01:26,146 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 22:01:26,146 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 22:01:26,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 22:01:26,146 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 22:01:26,146 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 22:01:26,146 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 22:01:26,146 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 22:01:26,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 22:01:26,147 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 22:01:26,147 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-07 22:01:26,147 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-07 22:01:26,148 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 22:01:26,148 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 22:01:26,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 22:01:26,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 22:01:26,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 22:01:26,357 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 22:01:26,357 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 22:01:26,358 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum04-1.i [2022-04-07 22:01:26,409 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91e386396/bc73b24564014301a0a2d1786d8183d9/FLAGad602dc49 [2022-04-07 22:01:26,786 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 22:01:26,789 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-1.i [2022-04-07 22:01:26,794 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91e386396/bc73b24564014301a0a2d1786d8183d9/FLAGad602dc49 [2022-04-07 22:01:26,804 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91e386396/bc73b24564014301a0a2d1786d8183d9 [2022-04-07 22:01:26,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 22:01:26,808 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 22:01:26,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 22:01:26,825 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 22:01:26,832 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 22:01:26,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:01:26" (1/1) ... [2022-04-07 22:01:26,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2770c409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:26, skipping insertion in model container [2022-04-07 22:01:26,834 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:01:26" (1/1) ... [2022-04-07 22:01:26,840 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 22:01:26,856 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 22:01:26,955 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-1.i[808,821] [2022-04-07 22:01:26,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 22:01:26,976 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 22:01:26,984 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-1.i[808,821] [2022-04-07 22:01:26,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 22:01:27,004 INFO L208 MainTranslator]: Completed translation [2022-04-07 22:01:27,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:27 WrapperNode [2022-04-07 22:01:27,004 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 22:01:27,005 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 22:01:27,005 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 22:01:27,005 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 22:01:27,014 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:27" (1/1) ... [2022-04-07 22:01:27,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:27" (1/1) ... [2022-04-07 22:01:27,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:27" (1/1) ... [2022-04-07 22:01:27,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:27" (1/1) ... [2022-04-07 22:01:27,027 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:27" (1/1) ... [2022-04-07 22:01:27,031 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:27" (1/1) ... [2022-04-07 22:01:27,035 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:27" (1/1) ... [2022-04-07 22:01:27,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 22:01:27,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 22:01:27,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 22:01:27,038 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 22:01:27,038 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:27" (1/1) ... [2022-04-07 22:01:27,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 22:01:27,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:01:27,079 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 22:01:27,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 22:01:27,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 22:01:27,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 22:01:27,107 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 22:01:27,107 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 22:01:27,107 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 22:01:27,107 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 22:01:27,108 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 22:01:27,108 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-07 22:01:27,109 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-07 22:01:27,109 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 22:01:27,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 22:01:27,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 22:01:27,109 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 22:01:27,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 22:01:27,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 22:01:27,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 22:01:27,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 22:01:27,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 22:01:27,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 22:01:27,155 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 22:01:27,156 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 22:01:27,234 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 22:01:27,239 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 22:01:27,239 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 22:01:27,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:01:27 BoogieIcfgContainer [2022-04-07 22:01:27,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 22:01:27,241 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 22:01:27,241 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 22:01:27,242 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 22:01:27,244 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:01:27" (1/1) ... [2022-04-07 22:01:27,245 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-07 22:01:27,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 10:01:27 BasicIcfg [2022-04-07 22:01:27,258 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 22:01:27,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 22:01:27,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 22:01:27,261 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 22:01:27,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 10:01:26" (1/4) ... [2022-04-07 22:01:27,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a60e26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:01:27, skipping insertion in model container [2022-04-07 22:01:27,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:01:27" (2/4) ... [2022-04-07 22:01:27,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a60e26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:01:27, skipping insertion in model container [2022-04-07 22:01:27,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:01:27" (3/4) ... [2022-04-07 22:01:27,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a60e26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 10:01:27, skipping insertion in model container [2022-04-07 22:01:27,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 10:01:27" (4/4) ... [2022-04-07 22:01:27,263 INFO L111 eAbstractionObserver]: Analyzing ICFG sum04-1.iqvasr [2022-04-07 22:01:27,266 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 22:01:27,266 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 22:01:27,294 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 22:01:27,298 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 22:01:27,298 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 22:01:27,331 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:01:27,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 22:01:27,334 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:01:27,334 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:01:27,335 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:01:27,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:01:27,338 INFO L85 PathProgramCache]: Analyzing trace with hash -423489079, now seen corresponding path program 1 times [2022-04-07 22:01:27,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:01:27,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428436479] [2022-04-07 22:01:27,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:01:27,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:01:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:27,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:01:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:27,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-07 22:01:27,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 22:01:27,464 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 22:01:27,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:01:27,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-07 22:01:27,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 22:01:27,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 22:01:27,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 22:01:27,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~i~0_5 1)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {23#true} is VALID [2022-04-07 22:01:27,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} [56] L24-3-->L24-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-07 22:01:27,468 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {24#false} is VALID [2022-04-07 22:01:27,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} [63] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {24#false} is VALID [2022-04-07 22:01:27,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} [65] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-07 22:01:27,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-07 22:01:27,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:01:27,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:01:27,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428436479] [2022-04-07 22:01:27,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428436479] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:01:27,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:01:27,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 22:01:27,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244031727] [2022-04-07 22:01:27,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:01:27,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-07 22:01:27,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:01:27,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:27,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:01:27,491 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 22:01:27,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:01:27,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 22:01:27,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 22:01:27,509 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:27,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:27,557 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-07 22:01:27,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 22:01:27,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-07 22:01:27,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:01:27,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:27,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-07 22:01:27,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:27,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-07 22:01:27,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2022-04-07 22:01:27,600 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-07 22:01:27,605 INFO L225 Difference]: With dead ends: 31 [2022-04-07 22:01:27,605 INFO L226 Difference]: Without dead ends: 14 [2022-04-07 22:01:27,607 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 22:01:27,611 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 22:01:27,612 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 22:01:27,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-07 22:01:27,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-07 22:01:27,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:01:27,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:27,630 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:27,631 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:27,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:27,632 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-07 22:01:27,633 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-07 22:01:27,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:01:27,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:01:27,633 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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 14 states. [2022-04-07 22:01:27,633 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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 14 states. [2022-04-07 22:01:27,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:27,635 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-07 22:01:27,635 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-07 22:01:27,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:01:27,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:01:27,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:01:27,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:01:27,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:27,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-07 22:01:27,638 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-07 22:01:27,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:01:27,638 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-07 22:01:27,638 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:27,639 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-07 22:01:27,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 22:01:27,639 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:01:27,639 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:01:27,639 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 22:01:27,640 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:01:27,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:01:27,640 INFO L85 PathProgramCache]: Analyzing trace with hash -422565558, now seen corresponding path program 1 times [2022-04-07 22:01:27,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:01:27,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450485328] [2022-04-07 22:01:27,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:01:27,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:01:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:27,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:01:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:27,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {120#true} is VALID [2022-04-07 22:01:27,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {120#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-07 22:01:27,683 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {120#true} {120#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-07 22:01:27,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {120#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:01:27,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {120#true} is VALID [2022-04-07 22:01:27,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {120#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-07 22:01:27,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120#true} {120#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-07 22:01:27,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {120#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-07 22:01:27,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {120#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~i~0_5 1)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {125#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-07 22:01:27,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {125#(= (+ (- 1) main_~i~0) 0)} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {121#false} is VALID [2022-04-07 22:01:27,687 INFO L272 TraceCheckUtils]: 7: Hoare triple {121#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {121#false} is VALID [2022-04-07 22:01:27,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {121#false} [63] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {121#false} is VALID [2022-04-07 22:01:27,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {121#false} [65] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {121#false} is VALID [2022-04-07 22:01:27,687 INFO L290 TraceCheckUtils]: 10: Hoare triple {121#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {121#false} is VALID [2022-04-07 22:01:27,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:01:27,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:01:27,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450485328] [2022-04-07 22:01:27,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450485328] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:01:27,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:01:27,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 22:01:27,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961460169] [2022-04-07 22:01:27,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:01:27,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-07 22:01:27,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:01:27,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:27,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:01:27,699 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 22:01:27,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:01:27,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 22:01:27,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 22:01:27,700 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:27,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:27,746 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-07 22:01:27,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 22:01:27,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-07 22:01:27,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:01:27,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:27,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-04-07 22:01:27,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:27,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-04-07 22:01:27,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 29 transitions. [2022-04-07 22:01:27,773 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-07 22:01:27,774 INFO L225 Difference]: With dead ends: 25 [2022-04-07 22:01:27,774 INFO L226 Difference]: Without dead ends: 17 [2022-04-07 22:01:27,774 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 22:01:27,775 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 22:01:27,776 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 22:01:27,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-07 22:01:27,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-07 22:01:27,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:01:27,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:27,779 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:27,779 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:27,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:27,782 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-07 22:01:27,782 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-07 22:01:27,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:01:27,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:01:27,782 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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 17 states. [2022-04-07 22:01:27,783 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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 17 states. [2022-04-07 22:01:27,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:27,784 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-07 22:01:27,784 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-07 22:01:27,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:01:27,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:01:27,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:01:27,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:01:27,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:27,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-07 22:01:27,785 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-04-07 22:01:27,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:01:27,785 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-07 22:01:27,785 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:27,786 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-07 22:01:27,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 22:01:27,786 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:01:27,786 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:01:27,786 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 22:01:27,786 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:01:27,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:01:27,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1744981802, now seen corresponding path program 1 times [2022-04-07 22:01:27,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:01:27,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619305963] [2022-04-07 22:01:27,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:01:27,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:01:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:27,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:01:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:27,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {232#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {225#true} is VALID [2022-04-07 22:01:27,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {225#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#true} is VALID [2022-04-07 22:01:27,833 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {225#true} {225#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#true} is VALID [2022-04-07 22:01:27,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {225#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:01:27,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {225#true} is VALID [2022-04-07 22:01:27,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {225#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#true} is VALID [2022-04-07 22:01:27,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {225#true} {225#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#true} is VALID [2022-04-07 22:01:27,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {225#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#true} is VALID [2022-04-07 22:01:27,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {225#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~i~0_5 1)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {230#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-07 22:01:27,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {230#(= (+ (- 1) main_~i~0) 0)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 8) InVars {main_~i~0=v_main_~i~0_9} OutVars{main_~i~0=v_main_~i~0_9} AuxVars[] AssignedVars[] {230#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-07 22:01:27,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {230#(= (+ (- 1) main_~i~0) 0)} [60] L25-->L24-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< v_main_~i~0_1 4)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {230#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-07 22:01:27,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {230#(= (+ (- 1) main_~i~0) 0)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {231#(<= main_~i~0 2)} is VALID [2022-04-07 22:01:27,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {231#(<= main_~i~0 2)} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {226#false} is VALID [2022-04-07 22:01:27,839 INFO L272 TraceCheckUtils]: 10: Hoare triple {226#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {226#false} is VALID [2022-04-07 22:01:27,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {226#false} [63] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {226#false} is VALID [2022-04-07 22:01:27,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {226#false} [65] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {226#false} is VALID [2022-04-07 22:01:27,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {226#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#false} is VALID [2022-04-07 22:01:27,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:01:27,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:01:27,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619305963] [2022-04-07 22:01:27,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619305963] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 22:01:27,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903587079] [2022-04-07 22:01:27,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:01:27,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:01:27,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:01:27,844 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 22:01:27,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 22:01:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:27,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 22:01:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:27,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 22:01:28,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {225#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#true} is VALID [2022-04-07 22:01:28,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {225#true} [52] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {225#true} is VALID [2022-04-07 22:01:28,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {225#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#true} is VALID [2022-04-07 22:01:28,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {225#true} {225#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#true} is VALID [2022-04-07 22:01:28,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {225#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#true} is VALID [2022-04-07 22:01:28,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {225#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~i~0_5 1)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {251#(<= main_~i~0 1)} is VALID [2022-04-07 22:01:28,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {251#(<= main_~i~0 1)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 8) InVars {main_~i~0=v_main_~i~0_9} OutVars{main_~i~0=v_main_~i~0_9} AuxVars[] AssignedVars[] {251#(<= main_~i~0 1)} is VALID [2022-04-07 22:01:28,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {251#(<= main_~i~0 1)} [60] L25-->L24-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< v_main_~i~0_1 4)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {251#(<= main_~i~0 1)} is VALID [2022-04-07 22:01:28,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {251#(<= main_~i~0 1)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {231#(<= main_~i~0 2)} is VALID [2022-04-07 22:01:28,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {231#(<= main_~i~0 2)} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {226#false} is VALID [2022-04-07 22:01:28,047 INFO L272 TraceCheckUtils]: 10: Hoare triple {226#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {226#false} is VALID [2022-04-07 22:01:28,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {226#false} [63] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {226#false} is VALID [2022-04-07 22:01:28,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {226#false} [65] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {226#false} is VALID [2022-04-07 22:01:28,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {226#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#false} is VALID [2022-04-07 22:01:28,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:01:28,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 22:01:28,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {226#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#false} is VALID [2022-04-07 22:01:28,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {226#false} [65] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {226#false} is VALID [2022-04-07 22:01:28,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {226#false} [63] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {226#false} is VALID [2022-04-07 22:01:28,127 INFO L272 TraceCheckUtils]: 10: Hoare triple {226#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {226#false} is VALID [2022-04-07 22:01:28,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {288#(<= main_~i~0 8)} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {226#false} is VALID [2022-04-07 22:01:28,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {292#(<= main_~i~0 7)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {288#(<= main_~i~0 8)} is VALID [2022-04-07 22:01:28,129 INFO L290 TraceCheckUtils]: 7: Hoare triple {292#(<= main_~i~0 7)} [60] L25-->L24-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< v_main_~i~0_1 4)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {292#(<= main_~i~0 7)} is VALID [2022-04-07 22:01:28,129 INFO L290 TraceCheckUtils]: 6: Hoare triple {292#(<= main_~i~0 7)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 8) InVars {main_~i~0=v_main_~i~0_9} OutVars{main_~i~0=v_main_~i~0_9} AuxVars[] AssignedVars[] {292#(<= main_~i~0 7)} is VALID [2022-04-07 22:01:28,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {225#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~i~0_5 1)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {292#(<= main_~i~0 7)} is VALID [2022-04-07 22:01:28,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {225#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#true} is VALID [2022-04-07 22:01:28,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {225#true} {225#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#true} is VALID [2022-04-07 22:01:28,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {225#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#true} is VALID [2022-04-07 22:01:28,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {225#true} [52] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {225#true} is VALID [2022-04-07 22:01:28,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {225#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#true} is VALID [2022-04-07 22:01:28,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:01:28,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903587079] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 22:01:28,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 22:01:28,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-07 22:01:28,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128138515] [2022-04-07 22:01:28,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 22:01:28,137 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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-07 22:01:28,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:01:28,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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-07 22:01:28,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:01:28,156 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 22:01:28,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:01:28,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 22:01:28,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-07 22:01:28,157 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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-07 22:01:28,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:28,265 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-04-07 22:01:28,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 22:01:28,265 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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-07 22:01:28,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:01:28,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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-07 22:01:28,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2022-04-07 22:01:28,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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-07 22:01:28,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2022-04-07 22:01:28,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 39 transitions. [2022-04-07 22:01:28,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:01:28,305 INFO L225 Difference]: With dead ends: 32 [2022-04-07 22:01:28,305 INFO L226 Difference]: Without dead ends: 24 [2022-04-07 22:01:28,305 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-04-07 22:01:28,308 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 31 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 22:01:28,309 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 18 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 22:01:28,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-07 22:01:28,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-07 22:01:28,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:01:28,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:28,318 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:28,318 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:28,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:28,320 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-07 22:01:28,320 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-07 22:01:28,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:01:28,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:01:28,320 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 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 24 states. [2022-04-07 22:01:28,321 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 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 24 states. [2022-04-07 22:01:28,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:28,322 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-07 22:01:28,322 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-07 22:01:28,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:01:28,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:01:28,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:01:28,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:01:28,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:28,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-07 22:01:28,324 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2022-04-07 22:01:28,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:01:28,325 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-07 22:01:28,325 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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-07 22:01:28,325 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-07 22:01:28,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 22:01:28,326 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:01:28,326 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:01:28,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-07 22:01:28,544 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:01:28,544 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:01:28,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:01:28,545 INFO L85 PathProgramCache]: Analyzing trace with hash -2062709365, now seen corresponding path program 1 times [2022-04-07 22:01:28,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:01:28,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874291861] [2022-04-07 22:01:28,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:01:28,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:01:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:28,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:01:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:28,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {466#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {456#true} is VALID [2022-04-07 22:01:28,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {456#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {456#true} is VALID [2022-04-07 22:01:28,666 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {456#true} {456#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {456#true} is VALID [2022-04-07 22:01:28,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {456#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {466#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:01:28,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {466#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {456#true} is VALID [2022-04-07 22:01:28,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {456#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {456#true} is VALID [2022-04-07 22:01:28,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {456#true} {456#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {456#true} is VALID [2022-04-07 22:01:28,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {456#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {456#true} is VALID [2022-04-07 22:01:28,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {456#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~i~0_5 1)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {461#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-07 22:01:28,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {461#(= (+ (- 1) main_~i~0) 0)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 8) InVars {main_~i~0=v_main_~i~0_9} OutVars{main_~i~0=v_main_~i~0_9} AuxVars[] AssignedVars[] {461#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-07 22:01:28,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {461#(= (+ (- 1) main_~i~0) 0)} [60] L25-->L24-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< v_main_~i~0_1 4)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {461#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-07 22:01:28,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {461#(= (+ (- 1) main_~i~0) 0)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {462#(<= main_~i~0 2)} is VALID [2022-04-07 22:01:28,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {462#(<= main_~i~0 2)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 8) InVars {main_~i~0=v_main_~i~0_9} OutVars{main_~i~0=v_main_~i~0_9} AuxVars[] AssignedVars[] {462#(<= main_~i~0 2)} is VALID [2022-04-07 22:01:28,670 INFO L290 TraceCheckUtils]: 10: Hoare triple {462#(<= main_~i~0 2)} [60] L25-->L24-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< v_main_~i~0_1 4)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {462#(<= main_~i~0 2)} is VALID [2022-04-07 22:01:28,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {462#(<= main_~i~0 2)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {463#(<= main_~i~0 3)} is VALID [2022-04-07 22:01:28,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {463#(<= main_~i~0 3)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 8) InVars {main_~i~0=v_main_~i~0_9} OutVars{main_~i~0=v_main_~i~0_9} AuxVars[] AssignedVars[] {463#(<= main_~i~0 3)} is VALID [2022-04-07 22:01:28,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {463#(<= main_~i~0 3)} [60] L25-->L24-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< v_main_~i~0_1 4)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {463#(<= main_~i~0 3)} is VALID [2022-04-07 22:01:28,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {463#(<= main_~i~0 3)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {464#(<= main_~i~0 4)} is VALID [2022-04-07 22:01:28,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {464#(<= main_~i~0 4)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 8) InVars {main_~i~0=v_main_~i~0_9} OutVars{main_~i~0=v_main_~i~0_9} AuxVars[] AssignedVars[] {464#(<= main_~i~0 4)} is VALID [2022-04-07 22:01:28,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {464#(<= main_~i~0 4)} [61] L25-->L24-2: Formula: (not (< v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {464#(<= main_~i~0 4)} is VALID [2022-04-07 22:01:28,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {464#(<= main_~i~0 4)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {465#(<= main_~i~0 5)} is VALID [2022-04-07 22:01:28,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {465#(<= main_~i~0 5)} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {457#false} is VALID [2022-04-07 22:01:28,679 INFO L272 TraceCheckUtils]: 19: Hoare triple {457#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {457#false} is VALID [2022-04-07 22:01:28,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {457#false} [63] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {457#false} is VALID [2022-04-07 22:01:28,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {457#false} [65] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {457#false} is VALID [2022-04-07 22:01:28,680 INFO L290 TraceCheckUtils]: 22: Hoare triple {457#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {457#false} is VALID [2022-04-07 22:01:28,680 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:01:28,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:01:28,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874291861] [2022-04-07 22:01:28,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874291861] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 22:01:28,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817105746] [2022-04-07 22:01:28,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:01:28,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:01:28,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:01:28,698 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 22:01:28,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 22:01:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:28,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-07 22:01:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:01:28,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 22:01:28,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {456#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {456#true} is VALID [2022-04-07 22:01:28,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {456#true} [52] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {456#true} is VALID [2022-04-07 22:01:28,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {456#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {456#true} is VALID [2022-04-07 22:01:28,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {456#true} {456#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {456#true} is VALID [2022-04-07 22:01:28,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {456#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {456#true} is VALID [2022-04-07 22:01:28,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {456#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~i~0_5 1)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {485#(<= main_~i~0 1)} is VALID [2022-04-07 22:01:28,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {485#(<= main_~i~0 1)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 8) InVars {main_~i~0=v_main_~i~0_9} OutVars{main_~i~0=v_main_~i~0_9} AuxVars[] AssignedVars[] {485#(<= main_~i~0 1)} is VALID [2022-04-07 22:01:28,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {485#(<= main_~i~0 1)} [60] L25-->L24-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< v_main_~i~0_1 4)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {485#(<= main_~i~0 1)} is VALID [2022-04-07 22:01:28,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {485#(<= main_~i~0 1)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {462#(<= main_~i~0 2)} is VALID [2022-04-07 22:01:28,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {462#(<= main_~i~0 2)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 8) InVars {main_~i~0=v_main_~i~0_9} OutVars{main_~i~0=v_main_~i~0_9} AuxVars[] AssignedVars[] {462#(<= main_~i~0 2)} is VALID [2022-04-07 22:01:28,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {462#(<= main_~i~0 2)} [60] L25-->L24-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< v_main_~i~0_1 4)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {462#(<= main_~i~0 2)} is VALID [2022-04-07 22:01:28,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {462#(<= main_~i~0 2)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {463#(<= main_~i~0 3)} is VALID [2022-04-07 22:01:28,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {463#(<= main_~i~0 3)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 8) InVars {main_~i~0=v_main_~i~0_9} OutVars{main_~i~0=v_main_~i~0_9} AuxVars[] AssignedVars[] {463#(<= main_~i~0 3)} is VALID [2022-04-07 22:01:28,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {463#(<= main_~i~0 3)} [60] L25-->L24-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< v_main_~i~0_1 4)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {463#(<= main_~i~0 3)} is VALID [2022-04-07 22:01:28,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {463#(<= main_~i~0 3)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {464#(<= main_~i~0 4)} is VALID [2022-04-07 22:01:28,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {464#(<= main_~i~0 4)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 8) InVars {main_~i~0=v_main_~i~0_9} OutVars{main_~i~0=v_main_~i~0_9} AuxVars[] AssignedVars[] {464#(<= main_~i~0 4)} is VALID [2022-04-07 22:01:28,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {464#(<= main_~i~0 4)} [61] L25-->L24-2: Formula: (not (< v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {464#(<= main_~i~0 4)} is VALID [2022-04-07 22:01:28,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {464#(<= main_~i~0 4)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {465#(<= main_~i~0 5)} is VALID [2022-04-07 22:01:28,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {465#(<= main_~i~0 5)} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {457#false} is VALID [2022-04-07 22:01:28,899 INFO L272 TraceCheckUtils]: 19: Hoare triple {457#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {457#false} is VALID [2022-04-07 22:01:28,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {457#false} [63] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {457#false} is VALID [2022-04-07 22:01:28,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {457#false} [65] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {457#false} is VALID [2022-04-07 22:01:28,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {457#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {457#false} is VALID [2022-04-07 22:01:28,900 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:01:28,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 22:01:29,079 INFO L290 TraceCheckUtils]: 22: Hoare triple {457#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {457#false} is VALID [2022-04-07 22:01:29,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {457#false} [65] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {457#false} is VALID [2022-04-07 22:01:29,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {457#false} [63] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {457#false} is VALID [2022-04-07 22:01:29,080 INFO L272 TraceCheckUtils]: 19: Hoare triple {457#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {457#false} is VALID [2022-04-07 22:01:29,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {549#(<= main_~i~0 8)} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {457#false} is VALID [2022-04-07 22:01:29,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {553#(<= main_~i~0 7)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {549#(<= main_~i~0 8)} is VALID [2022-04-07 22:01:29,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {553#(<= main_~i~0 7)} [61] L25-->L24-2: Formula: (not (< v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {553#(<= main_~i~0 7)} is VALID [2022-04-07 22:01:29,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {553#(<= main_~i~0 7)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 8) InVars {main_~i~0=v_main_~i~0_9} OutVars{main_~i~0=v_main_~i~0_9} AuxVars[] AssignedVars[] {553#(<= main_~i~0 7)} is VALID [2022-04-07 22:01:29,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {563#(<= main_~i~0 6)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {553#(<= main_~i~0 7)} is VALID [2022-04-07 22:01:29,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {563#(<= main_~i~0 6)} [60] L25-->L24-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< v_main_~i~0_1 4)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {563#(<= main_~i~0 6)} is VALID [2022-04-07 22:01:29,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {563#(<= main_~i~0 6)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 8) InVars {main_~i~0=v_main_~i~0_9} OutVars{main_~i~0=v_main_~i~0_9} AuxVars[] AssignedVars[] {563#(<= main_~i~0 6)} is VALID [2022-04-07 22:01:29,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {465#(<= main_~i~0 5)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {563#(<= main_~i~0 6)} is VALID [2022-04-07 22:01:29,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {465#(<= main_~i~0 5)} [60] L25-->L24-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< v_main_~i~0_1 4)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {465#(<= main_~i~0 5)} is VALID [2022-04-07 22:01:29,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {465#(<= main_~i~0 5)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 8) InVars {main_~i~0=v_main_~i~0_9} OutVars{main_~i~0=v_main_~i~0_9} AuxVars[] AssignedVars[] {465#(<= main_~i~0 5)} is VALID [2022-04-07 22:01:29,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {464#(<= main_~i~0 4)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {465#(<= main_~i~0 5)} is VALID [2022-04-07 22:01:29,098 INFO L290 TraceCheckUtils]: 7: Hoare triple {464#(<= main_~i~0 4)} [60] L25-->L24-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< v_main_~i~0_1 4)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {464#(<= main_~i~0 4)} is VALID [2022-04-07 22:01:29,098 INFO L290 TraceCheckUtils]: 6: Hoare triple {464#(<= main_~i~0 4)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 8) InVars {main_~i~0=v_main_~i~0_9} OutVars{main_~i~0=v_main_~i~0_9} AuxVars[] AssignedVars[] {464#(<= main_~i~0 4)} is VALID [2022-04-07 22:01:29,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {456#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~i~0_5 1)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {464#(<= main_~i~0 4)} is VALID [2022-04-07 22:01:29,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {456#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {456#true} is VALID [2022-04-07 22:01:29,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {456#true} {456#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {456#true} is VALID [2022-04-07 22:01:29,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {456#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {456#true} is VALID [2022-04-07 22:01:29,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {456#true} [52] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {456#true} is VALID [2022-04-07 22:01:29,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {456#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {456#true} is VALID [2022-04-07 22:01:29,100 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:01:29,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817105746] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 22:01:29,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 22:01:29,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-04-07 22:01:29,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396911081] [2022-04-07 22:01:29,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 22:01:29,101 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 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 23 [2022-04-07 22:01:29,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:01:29,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 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-07 22:01:29,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:01:29,121 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-07 22:01:29,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:01:29,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-07 22:01:29,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-04-07 22:01:29,125 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 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-07 22:01:29,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:29,314 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-04-07 22:01:29,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-07 22:01:29,315 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 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 23 [2022-04-07 22:01:29,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:01:29,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 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-07 22:01:29,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2022-04-07 22:01:29,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 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-07 22:01:29,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2022-04-07 22:01:29,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 55 transitions. [2022-04-07 22:01:29,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:01:29,361 INFO L225 Difference]: With dead ends: 46 [2022-04-07 22:01:29,362 INFO L226 Difference]: Without dead ends: 36 [2022-04-07 22:01:29,362 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2022-04-07 22:01:29,363 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 47 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 22:01:29,364 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 33 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 22:01:29,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-07 22:01:29,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-07 22:01:29,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:01:29,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:29,376 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:29,376 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:29,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:29,386 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-07 22:01:29,386 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-07 22:01:29,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:01:29,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:01:29,387 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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 36 states. [2022-04-07 22:01:29,387 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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 36 states. [2022-04-07 22:01:29,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:01:29,392 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-07 22:01:29,392 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-07 22:01:29,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:01:29,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:01:29,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:01:29,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:01:29,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:01:29,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-04-07 22:01:29,393 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 23 [2022-04-07 22:01:29,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:01:29,393 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-04-07 22:01:29,394 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 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-07 22:01:29,394 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-07 22:01:29,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-07 22:01:29,394 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:01:29,394 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:01:29,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 22:01:29,613 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-07 22:01:29,614 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:01:29,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:01:29,614 INFO L85 PathProgramCache]: Analyzing trace with hash 838331851, now seen corresponding path program 2 times [2022-04-07 22:01:29,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:01:29,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402057971] [2022-04-07 22:01:29,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:01:29,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:01:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 22:01:29,637 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-07 22:01:29,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 22:01:29,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-07 22:01:29,656 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-07 22:01:29,657 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 22:01:29,658 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-07 22:01:29,660 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2022-04-07 22:01:29,661 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 22:01:29,676 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-07 22:01:29,676 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-07 22:01:29,676 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-07 22:01:29,676 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-07 22:01:29,676 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 22:01:29,676 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-04-07 22:01:29,676 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-04-07 22:01:29,676 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-04-07 22:01:29,676 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 22:01:29,676 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 22:01:29,676 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 22:01:29,676 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2022-04-07 22:01:29,676 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-07 22:01:29,676 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-07 22:01:29,676 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 22:01:29,676 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 22:01:29,676 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-07 22:01:29,676 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-07 22:01:29,677 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-04-07 22:01:29,677 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 22:01:29,677 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 22:01:29,677 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 22:01:29,677 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 22:01:29,677 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-07 22:01:29,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 10:01:29 BasicIcfg [2022-04-07 22:01:29,677 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 22:01:29,678 INFO L158 Benchmark]: Toolchain (without parser) took 2869.97ms. Allocated memory was 176.2MB in the beginning and 235.9MB in the end (delta: 59.8MB). Free memory was 118.2MB in the beginning and 113.1MB in the end (delta: 5.1MB). Peak memory consumption was 64.8MB. Max. memory is 8.0GB. [2022-04-07 22:01:29,678 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 176.2MB. Free memory is still 134.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 22:01:29,678 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.87ms. Allocated memory was 176.2MB in the beginning and 235.9MB in the end (delta: 59.8MB). Free memory was 118.1MB in the beginning and 208.3MB in the end (delta: -90.2MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. [2022-04-07 22:01:29,678 INFO L158 Benchmark]: Boogie Preprocessor took 31.71ms. Allocated memory is still 235.9MB. Free memory was 208.3MB in the beginning and 206.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 22:01:29,679 INFO L158 Benchmark]: RCFGBuilder took 202.74ms. Allocated memory is still 235.9MB. Free memory was 206.8MB in the beginning and 195.8MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-07 22:01:29,679 INFO L158 Benchmark]: IcfgTransformer took 17.43ms. Allocated memory is still 235.9MB. Free memory was 195.8MB in the beginning and 194.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 22:01:29,679 INFO L158 Benchmark]: TraceAbstraction took 2418.11ms. Allocated memory is still 235.9MB. Free memory was 194.2MB in the beginning and 113.1MB in the end (delta: 81.2MB). Peak memory consumption was 81.2MB. Max. memory is 8.0GB. [2022-04-07 22:01:29,680 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 176.2MB. Free memory is still 134.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 179.87ms. Allocated memory was 176.2MB in the beginning and 235.9MB in the end (delta: 59.8MB). Free memory was 118.1MB in the beginning and 208.3MB in the end (delta: -90.2MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.71ms. Allocated memory is still 235.9MB. Free memory was 208.3MB in the beginning and 206.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 202.74ms. Allocated memory is still 235.9MB. Free memory was 206.8MB in the beginning and 195.8MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 17.43ms. Allocated memory is still 235.9MB. Free memory was 195.8MB in the beginning and 194.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 2418.11ms. Allocated memory is still 235.9MB. Free memory was 194.2MB in the beginning and 113.1MB in the end (delta: 81.2MB). Peak memory consumption was 81.2MB. 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 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] int i, sn=0; [L24] i=1 VAL [i=1, sn=0] [L24] COND TRUE i<=8 VAL [i=1, sn=0] [L25] COND TRUE i<4 [L26] sn = sn + (2) VAL [i=1, sn=2] [L24] i++ VAL [i=2, sn=2] [L24] COND TRUE i<=8 VAL [i=2, sn=2] [L25] COND TRUE i<4 [L26] sn = sn + (2) VAL [i=2, sn=4] [L24] i++ VAL [i=3, sn=4] [L24] COND TRUE i<=8 VAL [i=3, sn=4] [L25] COND TRUE i<4 [L26] sn = sn + (2) VAL [i=3, sn=6] [L24] i++ VAL [i=4, sn=6] [L24] COND TRUE i<=8 VAL [i=4, sn=6] [L25] COND FALSE !(i<4) VAL [i=4, sn=6] [L24] i++ VAL [i=5, sn=6] [L24] COND TRUE i<=8 VAL [i=5, sn=6] [L25] COND FALSE !(i<4) VAL [i=5, sn=6] [L24] i++ VAL [i=6, sn=6] [L24] COND TRUE i<=8 VAL [i=6, sn=6] [L25] COND FALSE !(i<4) VAL [i=6, sn=6] [L24] i++ VAL [i=7, sn=6] [L24] COND TRUE i<=8 VAL [i=7, sn=6] [L25] COND FALSE !(i<4) VAL [i=7, sn=6] [L24] i++ VAL [i=8, sn=6] [L24] COND TRUE i<=8 VAL [i=8, sn=6] [L25] COND FALSE !(i<4) VAL [i=8, sn=6] [L24] i++ VAL [i=9, sn=6] [L24] COND FALSE !(i<=8) VAL [i=9, sn=6] [L28] CALL __VERIFIER_assert(sn==8*(2) || sn == 0) VAL [\old(cond)=0] [L15] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 5, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 104 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 103 mSDsluCounter, 93 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 90 IncrementalHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 54 mSDtfsCounter, 90 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=4, InterpolantAutomatonStates: 25, 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, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 125 ConstructedInterpolants, 0 QuantifiedInterpolants, 267 SizeOfPredicates, 0 NumberOfNonLiveVariables, 126 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 0/69 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-07 22:01:29,703 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...