/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loop-zilu/benchmark26_linear.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 01:34:31,420 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 01:34:31,422 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 01:34:31,461 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 01:34:31,462 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 01:34:31,463 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 01:34:31,464 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 01:34:31,465 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 01:34:31,467 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 01:34:31,468 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 01:34:31,468 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 01:34:31,469 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 01:34:31,470 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 01:34:31,471 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 01:34:31,475 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 01:34:31,477 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 01:34:31,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 01:34:31,482 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 01:34:31,488 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 01:34:31,493 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 01:34:31,496 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 01:34:31,503 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 01:34:31,504 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 01:34:31,507 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 01:34:31,508 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 01:34:31,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 01:34:31,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 01:34:31,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 01:34:31,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 01:34:31,512 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 01:34:31,513 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 01:34:31,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 01:34:31,513 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 01:34:31,514 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 01:34:31,514 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 01:34:31,515 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 01:34:31,515 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 01:34:31,516 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 01:34:31,516 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 01:34:31,516 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 01:34:31,517 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 01:34:31,521 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 01:34:31,522 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 01:34:31,546 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 01:34:31,547 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 01:34:31,547 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 01:34:31,547 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 01:34:31,548 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 01:34:31,548 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 01:34:31,549 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 01:34:31,549 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 01:34:31,549 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 01:34:31,549 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 01:34:31,550 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 01:34:31,550 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 01:34:31,550 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 01:34:31,550 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 01:34:31,550 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 01:34:31,550 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 01:34:31,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 01:34:31,550 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 01:34:31,551 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 01:34:31,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 01:34:31,551 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 01:34:31,551 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 01:34:31,551 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 01:34:31,552 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 01:34:31,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 01:34:31,552 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 01:34:31,552 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 01:34:31,552 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 01:34:31,553 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 01:34:31,553 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 01:34:31,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 01:34:31,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 01:34:31,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 01:34:31,815 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 01:34:31,816 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 01:34:31,817 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark26_linear.i [2022-04-15 01:34:31,874 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4162ae31/2147b83ea1c8448eadeb84a911621020/FLAG2c013f304 [2022-04-15 01:34:32,278 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 01:34:32,278 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark26_linear.i [2022-04-15 01:34:32,283 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4162ae31/2147b83ea1c8448eadeb84a911621020/FLAG2c013f304 [2022-04-15 01:34:32,682 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4162ae31/2147b83ea1c8448eadeb84a911621020 [2022-04-15 01:34:32,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 01:34:32,684 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 01:34:32,687 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 01:34:32,687 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 01:34:32,694 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 01:34:32,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:34:32" (1/1) ... [2022-04-15 01:34:32,696 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bfe77cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:34:32, skipping insertion in model container [2022-04-15 01:34:32,696 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:34:32" (1/1) ... [2022-04-15 01:34:32,702 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 01:34:32,724 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 01:34:32,840 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark26_linear.i[868,881] [2022-04-15 01:34:32,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 01:34:32,866 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 01:34:32,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark26_linear.i[868,881] [2022-04-15 01:34:32,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 01:34:32,903 INFO L208 MainTranslator]: Completed translation [2022-04-15 01:34:32,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:34:32 WrapperNode [2022-04-15 01:34:32,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 01:34:32,907 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 01:34:32,907 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 01:34:32,908 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 01:34:32,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:34:32" (1/1) ... [2022-04-15 01:34:32,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:34:32" (1/1) ... [2022-04-15 01:34:32,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:34:32" (1/1) ... [2022-04-15 01:34:32,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:34:32" (1/1) ... [2022-04-15 01:34:32,925 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:34:32" (1/1) ... [2022-04-15 01:34:32,928 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:34:32" (1/1) ... [2022-04-15 01:34:32,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:34:32" (1/1) ... [2022-04-15 01:34:32,930 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 01:34:32,931 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 01:34:32,931 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 01:34:32,931 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 01:34:32,932 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:34:32" (1/1) ... [2022-04-15 01:34:32,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 01:34:32,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:34:32,959 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 01:34:32,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 01:34:33,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 01:34:33,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 01:34:33,008 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 01:34:33,008 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 01:34:33,009 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 01:34:33,009 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 01:34:33,009 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 01:34:33,010 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 01:34:33,011 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 01:34:33,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 01:34:33,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 01:34:33,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-15 01:34:33,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 01:34:33,011 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 01:34:33,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 01:34:33,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 01:34:33,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 01:34:33,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 01:34:33,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 01:34:33,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 01:34:33,079 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 01:34:33,082 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 01:34:33,240 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 01:34:33,261 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 01:34:33,261 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 01:34:33,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:34:33 BoogieIcfgContainer [2022-04-15 01:34:33,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 01:34:33,263 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 01:34:33,263 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 01:34:33,264 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 01:34:33,267 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:34:33" (1/1) ... [2022-04-15 01:34:33,268 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 01:34:33,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 01:34:33 BasicIcfg [2022-04-15 01:34:33,308 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 01:34:33,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 01:34:33,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 01:34:33,312 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 01:34:33,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:34:32" (1/4) ... [2022-04-15 01:34:33,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38116da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:34:33, skipping insertion in model container [2022-04-15 01:34:33,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:34:32" (2/4) ... [2022-04-15 01:34:33,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38116da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:34:33, skipping insertion in model container [2022-04-15 01:34:33,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:34:33" (3/4) ... [2022-04-15 01:34:33,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38116da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:34:33, skipping insertion in model container [2022-04-15 01:34:33,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 01:34:33" (4/4) ... [2022-04-15 01:34:33,315 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark26_linear.iqvasr [2022-04-15 01:34:33,318 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 01:34:33,319 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 01:34:33,407 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 01:34:33,413 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 01:34:33,413 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 01:34:33,441 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-15 01:34:33,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 01:34:33,446 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:34:33,446 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:34:33,447 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:34:33,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:34:33,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1809217115, now seen corresponding path program 1 times [2022-04-15 01:34:33,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:34:33,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354023273] [2022-04-15 01:34:33,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:34:33,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:34:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:33,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:34:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:33,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] 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) 21) (= (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-15 01:34:33,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 01:34:33,670 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 01:34:33,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} [48] 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-15 01:34:33,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] 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) 21) (= (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-15 01:34:33,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 01:34:33,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 01:34:33,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 01:34:33,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [52] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~y~0_3 |v_main_#t~nondet2_2|) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet2, main_~y~0] {23#true} is VALID [2022-04-15 01:34:33,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} [55] L22-->L23-2: Formula: (< v_main_~x~0_7 v_main_~y~0_6) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_6} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-15 01:34:33,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#true} [57] L23-2-->L23-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-15 01:34:33,678 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} [60] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~x~0_8 v_main_~y~0_7) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {24#false} is VALID [2022-04-15 01:34:33,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} [62] __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-15 01:34:33,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} [63] 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-15 01:34:33,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-15 01:34:33,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:34:33,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:34:33,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354023273] [2022-04-15 01:34:33,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354023273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 01:34:33,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 01:34:33,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 01:34:33,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742459849] [2022-04-15 01:34:33,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:34:33,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 01:34:33,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:34:33,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:33,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:34:33,725 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 01:34:33,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:34:33,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 01:34:33,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 01:34:33,751 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:33,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:33,843 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-15 01:34:33,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 01:34:33,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 01:34:33,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:34:33,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:33,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-15 01:34:33,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:33,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-15 01:34:33,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2022-04-15 01:34:33,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:34:33,923 INFO L225 Difference]: With dead ends: 32 [2022-04-15 01:34:33,924 INFO L226 Difference]: Without dead ends: 13 [2022-04-15 01:34:33,926 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-15 01:34:33,930 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-15 01:34:33,931 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-15 01:34:33,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-15 01:34:33,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-15 01:34:33,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:34:33,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:33,961 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:33,962 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:33,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:33,968 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 01:34:33,968 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 01:34:33,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:34:33,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:34:33,969 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 01:34:33,969 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 01:34:33,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:33,972 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 01:34:33,973 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 01:34:33,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:34:33,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:34:33,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:34:33,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:34:33,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:33,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-15 01:34:33,979 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 12 [2022-04-15 01:34:33,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:34:33,984 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-15 01:34:33,986 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:33,986 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 01:34:33,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 01:34:33,987 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:34:33,987 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:34:33,988 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 01:34:33,988 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:34:33,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:34:33,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1810140636, now seen corresponding path program 1 times [2022-04-15 01:34:33,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:34:33,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495539953] [2022-04-15 01:34:33,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:34:33,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:34:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:34,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:34:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:34,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] 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) 21) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {118#true} is VALID [2022-04-15 01:34:34,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-15 01:34:34,065 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118#true} {118#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-15 01:34:34,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {118#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:34:34,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] 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) 21) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {118#true} is VALID [2022-04-15 01:34:34,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {118#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-15 01:34:34,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118#true} {118#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-15 01:34:34,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {118#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-15 01:34:34,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {118#true} [52] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~y~0_3 |v_main_#t~nondet2_2|) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet2, main_~y~0] {118#true} is VALID [2022-04-15 01:34:34,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {118#true} [55] L22-->L23-2: Formula: (< v_main_~x~0_7 v_main_~y~0_6) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_6} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {123#(<= (+ main_~x~0 1) main_~y~0)} is VALID [2022-04-15 01:34:34,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {123#(<= (+ main_~x~0 1) main_~y~0)} [58] L23-2-->L23-3: Formula: (not (< v_main_~x~0_1 v_main_~y~0_1)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {119#false} is VALID [2022-04-15 01:34:34,069 INFO L272 TraceCheckUtils]: 8: Hoare triple {119#false} [60] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~x~0_8 v_main_~y~0_7) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {119#false} is VALID [2022-04-15 01:34:34,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {119#false} [62] __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] {119#false} is VALID [2022-04-15 01:34:34,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {119#false} [63] 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[] {119#false} is VALID [2022-04-15 01:34:34,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {119#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {119#false} is VALID [2022-04-15 01:34:34,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:34:34,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:34:34,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495539953] [2022-04-15 01:34:34,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495539953] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 01:34:34,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 01:34:34,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 01:34:34,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340837027] [2022-04-15 01:34:34,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:34:34,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 01:34:34,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:34:34,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:34,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:34:34,088 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 01:34:34,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:34:34,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 01:34:34,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 01:34:34,090 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:34,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:34,162 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 01:34:34,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 01:34:34,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 01:34:34,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:34:34,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:34,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-15 01:34:34,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:34,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-15 01:34:34,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 19 transitions. [2022-04-15 01:34:34,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:34:34,185 INFO L225 Difference]: With dead ends: 19 [2022-04-15 01:34:34,185 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 01:34:34,185 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-15 01:34:34,186 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 01:34:34,187 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 01:34:34,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 01:34:34,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 01:34:34,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:34:34,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:34,196 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:34,197 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:34,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:34,198 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 01:34:34,198 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 01:34:34,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:34:34,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:34:34,199 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 01:34:34,200 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 01:34:34,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:34,201 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 01:34:34,202 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 01:34:34,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:34:34,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:34:34,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:34:34,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:34:34,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:34,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-15 01:34:34,204 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-15 01:34:34,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:34:34,205 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-15 01:34:34,205 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:34,205 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 01:34:34,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 01:34:34,206 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:34:34,206 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:34:34,206 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 01:34:34,207 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:34:34,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:34:34,207 INFO L85 PathProgramCache]: Analyzing trace with hash 306506437, now seen corresponding path program 1 times [2022-04-15 01:34:34,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:34:34,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177491689] [2022-04-15 01:34:34,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:34:34,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:34:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:34,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:34:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:34,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {218#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] 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) 21) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {208#true} is VALID [2022-04-15 01:34:34,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:34:34,324 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {208#true} {208#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:34:34,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:34:34,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] 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) 21) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {208#true} is VALID [2022-04-15 01:34:34,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:34:34,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:34:34,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:34:34,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} [52] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~y~0_3 |v_main_#t~nondet2_2|) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet2, main_~y~0] {208#true} is VALID [2022-04-15 01:34:34,326 INFO L290 TraceCheckUtils]: 6: Hoare triple {208#true} [55] L22-->L23-2: Formula: (< v_main_~x~0_7 v_main_~y~0_6) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_6} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {213#(<= (+ main_~x~0 1) main_~y~0)} is VALID [2022-04-15 01:34:34,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {213#(<= (+ main_~x~0 1) main_~y~0)} [59] L23-2-->L23-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_2) (< v_main_~x~0_3 v_main_~y~0_2)) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~x~0] {214#(< main_~x~0 (+ main_~y~0 1))} is VALID [2022-04-15 01:34:34,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {214#(< main_~x~0 (+ main_~y~0 1))} [58] L23-2-->L23-3: Formula: (not (< v_main_~x~0_1 v_main_~y~0_1)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {215#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 01:34:34,328 INFO L272 TraceCheckUtils]: 9: Hoare triple {215#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} [60] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~x~0_8 v_main_~y~0_7) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {216#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 01:34:34,329 INFO L290 TraceCheckUtils]: 10: Hoare triple {216#(not (= |__VERIFIER_assert_#in~cond| 0))} [62] __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] {217#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 01:34:34,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {217#(not (= __VERIFIER_assert_~cond 0))} [63] 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[] {209#false} is VALID [2022-04-15 01:34:34,330 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-15 01:34:34,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:34:34,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:34:34,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177491689] [2022-04-15 01:34:34,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177491689] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:34:34,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169317342] [2022-04-15 01:34:34,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:34:34,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:34:34,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:34:34,333 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:34:34,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 01:34:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:34,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 01:34:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:34,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:34:34,819 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:34:34,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#true} [50] 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) 21) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {208#true} is VALID [2022-04-15 01:34:34,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:34:34,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:34:34,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:34:34,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} [52] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~y~0_3 |v_main_#t~nondet2_2|) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet2, main_~y~0] {208#true} is VALID [2022-04-15 01:34:34,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {208#true} [55] L22-->L23-2: Formula: (< v_main_~x~0_7 v_main_~y~0_6) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_6} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {213#(<= (+ main_~x~0 1) main_~y~0)} is VALID [2022-04-15 01:34:34,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {213#(<= (+ main_~x~0 1) main_~y~0)} [59] L23-2-->L23-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_2) (< v_main_~x~0_3 v_main_~y~0_2)) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~x~0] {214#(< main_~x~0 (+ main_~y~0 1))} is VALID [2022-04-15 01:34:34,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {214#(< main_~x~0 (+ main_~y~0 1))} [58] L23-2-->L23-3: Formula: (not (< v_main_~x~0_1 v_main_~y~0_1)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {215#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 01:34:34,828 INFO L272 TraceCheckUtils]: 9: Hoare triple {215#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} [60] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~x~0_8 v_main_~y~0_7) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {249#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:34:34,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {249#(<= 1 |__VERIFIER_assert_#in~cond|)} [62] __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] {253#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:34:34,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {253#(<= 1 __VERIFIER_assert_~cond)} [63] 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[] {209#false} is VALID [2022-04-15 01:34:34,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-15 01:34:34,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:34:34,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:34:34,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-15 01:34:34,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {253#(<= 1 __VERIFIER_assert_~cond)} [63] 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[] {209#false} is VALID [2022-04-15 01:34:34,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {249#(<= 1 |__VERIFIER_assert_#in~cond|)} [62] __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] {253#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:34:34,972 INFO L272 TraceCheckUtils]: 9: Hoare triple {215#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} [60] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~x~0_8 v_main_~y~0_7) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {249#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:34:34,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {214#(< main_~x~0 (+ main_~y~0 1))} [58] L23-2-->L23-3: Formula: (not (< v_main_~x~0_1 v_main_~y~0_1)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {215#(and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 01:34:34,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {213#(<= (+ main_~x~0 1) main_~y~0)} [59] L23-2-->L23-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_2) (< v_main_~x~0_3 v_main_~y~0_2)) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~x~0] {214#(< main_~x~0 (+ main_~y~0 1))} is VALID [2022-04-15 01:34:34,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {208#true} [55] L22-->L23-2: Formula: (< v_main_~x~0_7 v_main_~y~0_6) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_6} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {213#(<= (+ main_~x~0 1) main_~y~0)} is VALID [2022-04-15 01:34:34,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} [52] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~y~0_3 |v_main_#t~nondet2_2|) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet2, main_~y~0] {208#true} is VALID [2022-04-15 01:34:34,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:34:34,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:34:34,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:34:34,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#true} [50] 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) 21) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {208#true} is VALID [2022-04-15 01:34:34,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-15 01:34:34,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:34:34,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169317342] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:34:34,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 01:34:34,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2022-04-15 01:34:34,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85850663] [2022-04-15 01:34:34,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 01:34:34,977 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 01:34:34,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:34:34,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:34,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:34:34,990 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 01:34:34,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:34:34,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 01:34:34,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-15 01:34:34,991 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:35,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:35,111 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 01:34:35,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 01:34:35,112 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 01:34:35,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:34:35,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:35,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2022-04-15 01:34:35,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:35,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2022-04-15 01:34:35,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 14 transitions. [2022-04-15 01:34:35,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:34:35,127 INFO L225 Difference]: With dead ends: 14 [2022-04-15 01:34:35,127 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 01:34:35,127 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-04-15 01:34:35,128 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 01:34:35,129 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 01:34:35,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 01:34:35,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 01:34:35,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:34:35,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 01:34:35,130 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 01:34:35,130 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 01:34:35,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:35,130 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 01:34:35,130 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 01:34:35,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:34:35,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:34:35,131 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 01:34:35,131 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 01:34:35,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:35,131 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 01:34:35,131 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 01:34:35,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:34:35,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:34:35,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:34:35,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:34:35,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 01:34:35,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 01:34:35,132 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-04-15 01:34:35,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:34:35,132 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 01:34:35,132 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:35,132 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 01:34:35,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:34:35,134 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 01:34:35,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 01:34:35,352 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-15 01:34:35,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 01:34:35,377 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 01:34:35,377 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 01:34:35,378 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 01:34:35,378 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 01:34:35,378 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 01:34:35,378 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 01:34:35,378 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 01:34:35,378 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 19 28) the Hoare annotation is: true [2022-04-15 01:34:35,378 INFO L882 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2022-04-15 01:34:35,378 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 19 28) no Hoare annotation was computed. [2022-04-15 01:34:35,378 INFO L878 garLoopResultBuilder]: At program point L23-2(lines 23 25) the Hoare annotation is: (< main_~x~0 (+ main_~y~0 1)) [2022-04-15 01:34:35,378 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 19 28) no Hoare annotation was computed. [2022-04-15 01:34:35,379 INFO L878 garLoopResultBuilder]: At program point L23-3(lines 23 25) the Hoare annotation is: (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)) [2022-04-15 01:34:35,379 INFO L882 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2022-04-15 01:34:35,379 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-15 01:34:35,379 INFO L882 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-04-15 01:34:35,379 INFO L882 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-15 01:34:35,379 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 18) no Hoare annotation was computed. [2022-04-15 01:34:35,379 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-04-15 01:34:35,379 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 18) no Hoare annotation was computed. [2022-04-15 01:34:35,382 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-15 01:34:35,383 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 01:34:35,391 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 01:34:35,391 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-15 01:34:35,392 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 01:34:35,392 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 01:34:35,392 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-15 01:34:35,392 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-15 01:34:35,392 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 01:34:35,392 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 01:34:35,392 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 01:34:35,392 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 01:34:35,394 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 01:34:35,394 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 01:34:35,394 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-15 01:34:35,394 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 01:34:35,394 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 01:34:35,395 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 01:34:35,395 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-15 01:34:35,395 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 01:34:35,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:34:35 BasicIcfg [2022-04-15 01:34:35,402 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 01:34:35,403 INFO L158 Benchmark]: Toolchain (without parser) took 2718.02ms. Allocated memory was 184.5MB in the beginning and 248.5MB in the end (delta: 64.0MB). Free memory was 125.2MB in the beginning and 166.6MB in the end (delta: -41.4MB). Peak memory consumption was 21.9MB. Max. memory is 8.0GB. [2022-04-15 01:34:35,403 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 184.5MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 01:34:35,403 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.58ms. Allocated memory was 184.5MB in the beginning and 248.5MB in the end (delta: 64.0MB). Free memory was 125.1MB in the beginning and 219.0MB in the end (delta: -93.9MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. [2022-04-15 01:34:35,404 INFO L158 Benchmark]: Boogie Preprocessor took 22.84ms. Allocated memory is still 248.5MB. Free memory was 219.0MB in the beginning and 217.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 01:34:35,404 INFO L158 Benchmark]: RCFGBuilder took 331.69ms. Allocated memory is still 248.5MB. Free memory was 217.4MB in the beginning and 206.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 01:34:35,404 INFO L158 Benchmark]: IcfgTransformer took 45.36ms. Allocated memory is still 248.5MB. Free memory was 206.9MB in the beginning and 205.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 01:34:35,405 INFO L158 Benchmark]: TraceAbstraction took 2091.83ms. Allocated memory is still 248.5MB. Free memory was 204.8MB in the beginning and 166.6MB in the end (delta: 38.2MB). Peak memory consumption was 38.2MB. Max. memory is 8.0GB. [2022-04-15 01:34:35,407 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 184.5MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 219.58ms. Allocated memory was 184.5MB in the beginning and 248.5MB in the end (delta: 64.0MB). Free memory was 125.1MB in the beginning and 219.0MB in the end (delta: -93.9MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.84ms. Allocated memory is still 248.5MB. Free memory was 219.0MB in the beginning and 217.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 331.69ms. Allocated memory is still 248.5MB. Free memory was 217.4MB in the beginning and 206.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 45.36ms. Allocated memory is still 248.5MB. Free memory was 206.9MB in the beginning and 205.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 2091.83ms. Allocated memory is still 248.5MB. Free memory was 204.8MB in the beginning and 166.6MB in the end (delta: 38.2MB). Peak memory consumption was 38.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 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 77 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41 IncrementalHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 40 mSDtfsCounter, 41 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 15, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 11 NumberOfFragments, 25 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 6 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 142 SizeOfPredicates, 3 NumberOfNonLiveVariables, 57 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: x < y + 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 01:34:35,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...