/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loop-lit/gsv2008.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:41:45,233 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:41:45,234 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:41:45,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:41:45,260 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:41:45,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:41:45,262 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:41:45,263 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:41:45,264 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:41:45,264 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:41:45,265 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:41:45,266 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:41:45,266 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:41:45,267 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:41:45,267 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:41:45,268 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:41:45,268 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:41:45,269 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:41:45,270 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:41:45,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:41:45,279 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:41:45,282 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:41:45,284 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:41:45,286 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:41:45,288 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:41:45,294 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:41:45,294 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:41:45,294 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:41:45,294 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:41:45,295 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:41:45,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:41:45,297 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:41:45,298 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:41:45,299 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:41:45,299 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:41:45,299 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:41:45,300 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:41:45,300 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:41:45,300 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:41:45,300 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:41:45,301 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:41:45,304 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:41:45,304 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 21:41:45,325 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:41:45,326 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:41:45,326 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:41:45,326 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:41:45,327 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:41:45,327 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:41:45,327 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:41:45,327 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:41:45,327 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:41:45,328 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:41:45,328 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:41:45,328 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:41:45,328 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:41:45,328 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:41:45,328 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:41:45,329 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:41:45,329 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:41:45,329 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:41:45,329 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:41:45,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:41:45,329 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:41:45,329 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:41:45,329 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:41:45,329 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:41:45,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:41:45,330 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:41:45,330 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:41:45,330 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:41:45,331 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:41:45,331 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 21:41:45,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:41:45,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:41:45,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:41:45,550 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:41:45,551 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:41:45,552 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gsv2008.i [2022-04-27 21:41:45,588 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90cf59096/b229096b71354ef5bcf6122ec2774327/FLAG1970f6e56 [2022-04-27 21:41:45,944 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:41:45,944 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.i [2022-04-27 21:41:45,948 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90cf59096/b229096b71354ef5bcf6122ec2774327/FLAG1970f6e56 [2022-04-27 21:41:45,962 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90cf59096/b229096b71354ef5bcf6122ec2774327 [2022-04-27 21:41:45,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:41:45,965 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:41:45,967 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:41:45,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:41:45,970 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:41:45,973 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:41:45" (1/1) ... [2022-04-27 21:41:45,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6751ddd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:45, skipping insertion in model container [2022-04-27 21:41:45,974 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:41:45" (1/1) ... [2022-04-27 21:41:45,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:41:45,988 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:41:46,133 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.i[895,908] [2022-04-27 21:41:46,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:41:46,155 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:41:46,164 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.i[895,908] [2022-04-27 21:41:46,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:41:46,177 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:41:46,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:46 WrapperNode [2022-04-27 21:41:46,178 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:41:46,179 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:41:46,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:41:46,180 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:41:46,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:46" (1/1) ... [2022-04-27 21:41:46,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:46" (1/1) ... [2022-04-27 21:41:46,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:46" (1/1) ... [2022-04-27 21:41:46,192 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:46" (1/1) ... [2022-04-27 21:41:46,197 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:46" (1/1) ... [2022-04-27 21:41:46,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:46" (1/1) ... [2022-04-27 21:41:46,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:46" (1/1) ... [2022-04-27 21:41:46,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:41:46,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:41:46,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:41:46,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:41:46,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:46" (1/1) ... [2022-04-27 21:41:46,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:41:46,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:41:46,239 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 21:41:46,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 21:41:46,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:41:46,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:41:46,272 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:41:46,272 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 21:41:46,272 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 21:41:46,272 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:41:46,273 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:41:46,273 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:41:46,274 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 21:41:46,274 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 21:41:46,274 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:41:46,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:41:46,274 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 21:41:46,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:41:46,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 21:41:46,274 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:41:46,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:41:46,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:41:46,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:41:46,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:41:46,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:41:46,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:41:46,321 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:41:46,322 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:41:46,436 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:41:46,440 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:41:46,440 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 21:41:46,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:41:46 BoogieIcfgContainer [2022-04-27 21:41:46,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:41:46,442 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:41:46,442 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:41:46,443 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:41:46,445 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:41:46" (1/1) ... [2022-04-27 21:41:46,446 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:41:46,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:41:46 BasicIcfg [2022-04-27 21:41:46,459 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:41:46,460 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:41:46,460 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:41:46,462 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:41:46,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:41:45" (1/4) ... [2022-04-27 21:41:46,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8eed57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:41:46, skipping insertion in model container [2022-04-27 21:41:46,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:46" (2/4) ... [2022-04-27 21:41:46,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8eed57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:41:46, skipping insertion in model container [2022-04-27 21:41:46,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:41:46" (3/4) ... [2022-04-27 21:41:46,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8eed57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:41:46, skipping insertion in model container [2022-04-27 21:41:46,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:41:46" (4/4) ... [2022-04-27 21:41:46,464 INFO L111 eAbstractionObserver]: Analyzing ICFG gsv2008.iqvasr [2022-04-27 21:41:46,472 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:41:46,472 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:41:46,497 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:41:46,502 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7334d66, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@62b8244a [2022-04-27 21:41:46,502 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:41:46,506 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-27 21:41:46,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 21:41:46,510 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:41:46,511 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:41:46,511 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:41:46,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:41:46,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1291699483, now seen corresponding path program 1 times [2022-04-27 21:41:46,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:41:46,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649978993] [2022-04-27 21:41:46,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:41:46,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:41:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:46,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:41:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:46,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-27 21:41:46,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 21:41:46,630 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 21:41:46,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:41:46,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-27 21:41:46,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 21:41:46,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 21:41:46,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 21:41:46,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [61] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 (- 50)) (= v_main_~y~0_6 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_~y~0] {23#true} is VALID [2022-04-27 21:41:46,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} [64] L28-->L29-2: Formula: (and (< 0 (+ v_main_~y~0_3 1000)) (< v_main_~y~0_3 1000000)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 21:41:46,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#true} [66] L29-2-->L29-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-27 21:41:46,637 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} [69] L29-3-->__VERIFIER_assertENTRY: Formula: (= (ite (< 0 v_main_~y~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {24#false} is VALID [2022-04-27 21:41:46,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} [71] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {24#false} is VALID [2022-04-27 21:41:46,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} [72] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-27 21:41:46,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} [74] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-27 21:41:46,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:41:46,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:41:46,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649978993] [2022-04-27 21:41:46,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649978993] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:41:46,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:41:46,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 21:41:46,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791832545] [2022-04-27 21:41:46,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:41:46,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:41:46,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:41:46,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:46,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:41:46,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 21:41:46,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:41:46,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 21:41:46,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:41:46,689 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-27 21:41:46,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:46,750 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-27 21:41:46,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 21:41:46,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:41:46,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:41:46,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:46,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-27 21:41:46,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:46,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-27 21:41:46,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2022-04-27 21:41:46,823 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-27 21:41:46,828 INFO L225 Difference]: With dead ends: 32 [2022-04-27 21:41:46,828 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 21:41:46,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:41:46,837 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:41:46,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:41:46,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 21:41:46,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 21:41:46,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:41:46,865 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-27 21:41:46,866 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-27 21:41:46,867 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-27 21:41:46,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:46,872 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 21:41:46,872 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 21:41:46,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:41:46,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:41:46,872 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-27 21:41:46,873 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-27 21:41:46,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:46,875 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 21:41:46,875 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 21:41:46,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:41:46,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:41:46,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:41:46,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:41:46,879 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-27 21:41:46,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-27 21:41:46,883 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 12 [2022-04-27 21:41:46,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:41:46,883 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-27 21:41:46,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:46,884 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 21:41:46,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 21:41:46,884 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:41:46,884 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:41:46,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:41:46,884 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:41:46,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:41:46,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1292623004, now seen corresponding path program 1 times [2022-04-27 21:41:46,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:41:46,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103022243] [2022-04-27 21:41:46,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:41:46,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:41:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:46,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:41:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:46,956 INFO L290 TraceCheckUtils]: 0: Hoare triple {124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {118#true} is VALID [2022-04-27 21:41:46,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-27 21:41:46,956 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118#true} {118#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-27 21:41:46,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {118#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:41:46,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {118#true} is VALID [2022-04-27 21:41:46,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {118#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-27 21:41:46,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118#true} {118#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-27 21:41:46,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {118#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-27 21:41:46,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {118#true} [61] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 (- 50)) (= v_main_~y~0_6 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_~y~0] {123#(<= (+ main_~x~0 50) 0)} is VALID [2022-04-27 21:41:46,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {123#(<= (+ main_~x~0 50) 0)} [64] L28-->L29-2: Formula: (and (< 0 (+ v_main_~y~0_3 1000)) (< v_main_~y~0_3 1000000)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {123#(<= (+ main_~x~0 50) 0)} is VALID [2022-04-27 21:41:46,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {123#(<= (+ main_~x~0 50) 0)} [67] L29-2-->L29-3: Formula: (not (< v_main_~x~0_1 0)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {119#false} is VALID [2022-04-27 21:41:46,960 INFO L272 TraceCheckUtils]: 8: Hoare triple {119#false} [69] L29-3-->__VERIFIER_assertENTRY: Formula: (= (ite (< 0 v_main_~y~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {119#false} is VALID [2022-04-27 21:41:46,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {119#false} [71] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {119#false} is VALID [2022-04-27 21:41:46,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {119#false} [72] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {119#false} is VALID [2022-04-27 21:41:46,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {119#false} [74] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {119#false} is VALID [2022-04-27 21:41:46,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:41:46,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:41:46,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103022243] [2022-04-27 21:41:46,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103022243] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:41:46,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:41:46,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 21:41:46,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515615567] [2022-04-27 21:41:46,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:41:46,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:41:46,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:41:46,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:46,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:41:46,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 21:41:46,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:41:46,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 21:41:46,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 21:41:46,979 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-27 21:41:47,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:47,036 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-27 21:41:47,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 21:41:47,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:41:47,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:41:47,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:47,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-27 21:41:47,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:47,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-27 21:41:47,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 19 transitions. [2022-04-27 21:41:47,059 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-27 21:41:47,060 INFO L225 Difference]: With dead ends: 19 [2022-04-27 21:41:47,060 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 21:41:47,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:41:47,061 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:41:47,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:41:47,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 21:41:47,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 21:41:47,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:41:47,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:47,065 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:47,065 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:47,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:47,066 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 21:41:47,066 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 21:41:47,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:41:47,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:41:47,066 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 21:41:47,067 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 21:41:47,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:47,067 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 21:41:47,068 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 21:41:47,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:41:47,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:41:47,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:41:47,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:41:47,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:47,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-27 21:41:47,069 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-27 21:41:47,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:41:47,069 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-27 21:41:47,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:47,069 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 21:41:47,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 21:41:47,070 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:41:47,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:41:47,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:41:47,070 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:41:47,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:41:47,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1443329038, now seen corresponding path program 1 times [2022-04-27 21:41:47,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:41:47,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189250465] [2022-04-27 21:41:47,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:41:47,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:41:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:47,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:41:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:47,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {218#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {208#true} is VALID [2022-04-27 21:41:47,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-27 21:41:47,182 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {208#true} {208#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-27 21:41:47,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} [57] 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-27 21:41:47,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {208#true} is VALID [2022-04-27 21:41:47,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-27 21:41:47,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-27 21:41:47,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-27 21:41:47,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} [61] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 (- 50)) (= v_main_~y~0_6 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_~y~0] {213#(<= (+ main_~x~0 50) 0)} is VALID [2022-04-27 21:41:47,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {213#(<= (+ main_~x~0 50) 0)} [64] L28-->L29-2: Formula: (and (< 0 (+ v_main_~y~0_3 1000)) (< v_main_~y~0_3 1000000)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {213#(<= (+ main_~x~0 50) 0)} is VALID [2022-04-27 21:41:47,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {213#(<= (+ main_~x~0 50) 0)} [68] L29-2-->L29-2: Formula: (and (< v_main_~x~0_3 0) (= (+ v_main_~x~0_3 v_main_~y~0_5) v_main_~x~0_2) (= v_main_~y~0_4 (+ v_main_~y~0_5 1))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post2=|v_main_#t~post2_1|, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2] {214#(<= (+ 51 main_~x~0) main_~y~0)} is VALID [2022-04-27 21:41:47,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {214#(<= (+ 51 main_~x~0) main_~y~0)} [67] L29-2-->L29-3: Formula: (not (< v_main_~x~0_1 0)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {215#(<= 51 main_~y~0)} is VALID [2022-04-27 21:41:47,188 INFO L272 TraceCheckUtils]: 9: Hoare triple {215#(<= 51 main_~y~0)} [69] L29-3-->__VERIFIER_assertENTRY: Formula: (= (ite (< 0 v_main_~y~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {216#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:41:47,189 INFO L290 TraceCheckUtils]: 10: Hoare triple {216#(not (= |__VERIFIER_assert_#in~cond| 0))} [71] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {217#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:41:47,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {217#(not (= __VERIFIER_assert_~cond 0))} [72] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-27 21:41:47,189 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} [74] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-27 21:41:47,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:41:47,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:41:47,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189250465] [2022-04-27 21:41:47,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189250465] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:41:47,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568650069] [2022-04-27 21:41:47,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:41:47,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:41:47,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:41:47,194 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:41:47,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 21:41:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:47,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 21:41:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:47,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:41:47,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-27 21:41:47,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {208#true} is VALID [2022-04-27 21:41:47,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-27 21:41:47,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-27 21:41:47,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-27 21:41:47,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} [61] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 (- 50)) (= v_main_~y~0_6 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_~y~0] {213#(<= (+ main_~x~0 50) 0)} is VALID [2022-04-27 21:41:47,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {213#(<= (+ main_~x~0 50) 0)} [64] L28-->L29-2: Formula: (and (< 0 (+ v_main_~y~0_3 1000)) (< v_main_~y~0_3 1000000)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {213#(<= (+ main_~x~0 50) 0)} is VALID [2022-04-27 21:41:47,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {213#(<= (+ main_~x~0 50) 0)} [68] L29-2-->L29-2: Formula: (and (< v_main_~x~0_3 0) (= (+ v_main_~x~0_3 v_main_~y~0_5) v_main_~x~0_2) (= v_main_~y~0_4 (+ v_main_~y~0_5 1))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post2=|v_main_#t~post2_1|, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2] {214#(<= (+ 51 main_~x~0) main_~y~0)} is VALID [2022-04-27 21:41:47,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {214#(<= (+ 51 main_~x~0) main_~y~0)} [67] L29-2-->L29-3: Formula: (not (< v_main_~x~0_1 0)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {215#(<= 51 main_~y~0)} is VALID [2022-04-27 21:41:47,427 INFO L272 TraceCheckUtils]: 9: Hoare triple {215#(<= 51 main_~y~0)} [69] L29-3-->__VERIFIER_assertENTRY: Formula: (= (ite (< 0 v_main_~y~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {249#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:41:47,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {249#(<= 1 |__VERIFIER_assert_#in~cond|)} [71] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {253#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:41:47,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {253#(<= 1 __VERIFIER_assert_~cond)} [72] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-27 21:41:47,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} [74] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-27 21:41:47,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:41:47,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:41:47,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} [74] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-27 21:41:47,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {253#(<= 1 __VERIFIER_assert_~cond)} [72] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-27 21:41:47,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {249#(<= 1 |__VERIFIER_assert_#in~cond|)} [71] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {253#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:41:47,612 INFO L272 TraceCheckUtils]: 9: Hoare triple {269#(< 0 main_~y~0)} [69] L29-3-->__VERIFIER_assertENTRY: Formula: (= (ite (< 0 v_main_~y~0_9) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {249#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:41:47,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {273#(or (< main_~x~0 0) (< 0 main_~y~0))} [67] L29-2-->L29-3: Formula: (not (< v_main_~x~0_1 0)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {269#(< 0 main_~y~0)} is VALID [2022-04-27 21:41:47,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {277#(< main_~x~0 1)} [68] L29-2-->L29-2: Formula: (and (< v_main_~x~0_3 0) (= (+ v_main_~x~0_3 v_main_~y~0_5) v_main_~x~0_2) (= v_main_~y~0_4 (+ v_main_~y~0_5 1))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post2=|v_main_#t~post2_1|, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2] {273#(or (< main_~x~0 0) (< 0 main_~y~0))} is VALID [2022-04-27 21:41:47,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {277#(< main_~x~0 1)} [64] L28-->L29-2: Formula: (and (< 0 (+ v_main_~y~0_3 1000)) (< v_main_~y~0_3 1000000)) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {277#(< main_~x~0 1)} is VALID [2022-04-27 21:41:47,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} [61] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 (- 50)) (= v_main_~y~0_6 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_~y~0] {277#(< main_~x~0 1)} is VALID [2022-04-27 21:41:47,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-27 21:41:47,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-27 21:41:47,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-27 21:41:47,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#true} [59] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {208#true} is VALID [2022-04-27 21:41:47,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-27 21:41:47,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:41:47,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568650069] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:41:47,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:41:47,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-04-27 21:41:47,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404236271] [2022-04-27 21:41:47,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:41:47,621 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 21:41:47,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:41:47,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:47,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:41:47,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 21:41:47,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:41:47,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 21:41:47,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-27 21:41:47,638 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:47,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:47,833 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-27 21:41:47,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 21:41:47,834 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 21:41:47,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:41:47,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:47,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2022-04-27 21:41:47,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:47,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2022-04-27 21:41:47,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 17 transitions. [2022-04-27 21:41:47,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:41:47,848 INFO L225 Difference]: With dead ends: 16 [2022-04-27 21:41:47,848 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 21:41:47,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2022-04-27 21:41:47,849 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:41:47,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 50 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:41:47,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 21:41:47,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 21:41:47,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:41:47,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:41:47,850 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:41:47,850 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:41:47,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:47,851 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:41:47,851 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:41:47,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:41:47,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:41:47,851 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 21:41:47,851 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 21:41:47,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:47,851 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:41:47,851 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:41:47,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:41:47,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:41:47,852 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:41:47,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:41:47,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:41:47,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 21:41:47,852 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-04-27 21:41:47,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:41:47,852 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 21:41:47,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:47,852 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:41:47,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:41:47,854 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 21:41:47,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 21:41:48,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:41:48,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 21:41:48,097 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 21:41:48,097 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:41:48,097 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:41:48,097 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 21:41:48,097 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 21:41:48,097 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:41:48,097 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:41:48,098 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 35) the Hoare annotation is: true [2022-04-27 21:41:48,098 INFO L899 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-04-27 21:41:48,098 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 24 35) no Hoare annotation was computed. [2022-04-27 21:41:48,098 INFO L895 garLoopResultBuilder]: At program point L29-2(lines 29 32) the Hoare annotation is: (or (< main_~x~0 0) (< 0 main_~y~0)) [2022-04-27 21:41:48,098 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 24 35) no Hoare annotation was computed. [2022-04-27 21:41:48,098 INFO L895 garLoopResultBuilder]: At program point L29-3(lines 29 32) the Hoare annotation is: (< 0 main_~y~0) [2022-04-27 21:41:48,098 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-04-27 21:41:48,098 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-27 21:41:48,098 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-27 21:41:48,098 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-27 21:41:48,099 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-27 21:41:48,099 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-27 21:41:48,099 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-27 21:41:48,104 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 21:41:48,106 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:41:48,108 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:41:48,108 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 21:41:48,110 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:41:48,110 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:41:48,111 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 21:41:48,112 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 21:41:48,112 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:41:48,112 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:41:48,112 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:41:48,112 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:41:48,115 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 21:41:48,115 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 21:41:48,115 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 21:41:48,115 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:41:48,115 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:41:48,115 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:41:48,115 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 21:41:48,115 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-27 21:41:48,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:41:48 BasicIcfg [2022-04-27 21:41:48,122 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 21:41:48,122 INFO L158 Benchmark]: Toolchain (without parser) took 2157.32ms. Allocated memory was 196.1MB in the beginning and 306.2MB in the end (delta: 110.1MB). Free memory was 146.3MB in the beginning and 226.2MB in the end (delta: -79.8MB). Peak memory consumption was 31.2MB. Max. memory is 8.0GB. [2022-04-27 21:41:48,123 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 196.1MB. Free memory was 162.5MB in the beginning and 162.4MB in the end (delta: 150.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:41:48,123 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.12ms. Allocated memory is still 196.1MB. Free memory was 146.1MB in the beginning and 173.1MB in the end (delta: -27.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 21:41:48,123 INFO L158 Benchmark]: Boogie Preprocessor took 29.80ms. Allocated memory is still 196.1MB. Free memory was 173.1MB in the beginning and 171.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 21:41:48,123 INFO L158 Benchmark]: RCFGBuilder took 231.96ms. Allocated memory is still 196.1MB. Free memory was 171.5MB in the beginning and 160.7MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 21:41:48,123 INFO L158 Benchmark]: IcfgTransformer took 16.87ms. Allocated memory is still 196.1MB. Free memory was 160.5MB in the beginning and 159.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 21:41:48,124 INFO L158 Benchmark]: TraceAbstraction took 1661.82ms. Allocated memory was 196.1MB in the beginning and 306.2MB in the end (delta: 110.1MB). Free memory was 158.6MB in the beginning and 226.2MB in the end (delta: -67.6MB). Peak memory consumption was 43.4MB. Max. memory is 8.0GB. [2022-04-27 21:41:48,125 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.08ms. Allocated memory is still 196.1MB. Free memory was 162.5MB in the beginning and 162.4MB in the end (delta: 150.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 211.12ms. Allocated memory is still 196.1MB. Free memory was 146.1MB in the beginning and 173.1MB in the end (delta: -27.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.80ms. Allocated memory is still 196.1MB. Free memory was 173.1MB in the beginning and 171.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 231.96ms. Allocated memory is still 196.1MB. Free memory was 171.5MB in the beginning and 160.7MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 16.87ms. Allocated memory is still 196.1MB. Free memory was 160.5MB in the beginning and 159.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 1661.82ms. Allocated memory was 196.1MB in the beginning and 306.2MB in the end (delta: 110.1MB). Free memory was 158.6MB in the beginning and 226.2MB in the end (delta: -67.6MB). Peak memory consumption was 43.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 92 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 58 IncrementalHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 40 mSDtfsCounter, 58 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 14 NumberOfFragments, 21 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 20 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 138 SizeOfPredicates, 3 NumberOfNonLiveVariables, 58 ConjunctsInSsa, 7 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: 29]: Loop Invariant Derived loop invariant: x < 0 || 0 < y RESULT: Ultimate proved your program to be correct! [2022-04-27 21:41:48,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...