/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/jm2006.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:41:56,372 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:41:56,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:41:56,405 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:41:56,406 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:41:56,407 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:41:56,409 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:41:56,411 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:41:56,412 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:41:56,415 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:41:56,415 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:41:56,416 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:41:56,417 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:41:56,418 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:41:56,419 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:41:56,421 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:41:56,421 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:41:56,422 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:41:56,423 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:41:56,427 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:41:56,428 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:41:56,429 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:41:56,429 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:41:56,430 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:41:56,431 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:41:56,435 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:41:56,435 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:41:56,436 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:41:56,436 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:41:56,436 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:41:56,437 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:41:56,437 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:41:56,438 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:41:56,439 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:41:56,439 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:41:56,440 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:41:56,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:41:56,440 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:41:56,440 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:41:56,440 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:41:56,441 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:41:56,443 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:41:56,444 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:56,456 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:41:56,456 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:41:56,457 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:41:56,457 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:41:56,457 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:41:56,457 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:41:56,458 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:41:56,458 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:41:56,458 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:41:56,458 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:41:56,458 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:41:56,458 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:41:56,458 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:41:56,458 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:41:56,458 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:41:56,458 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:41:56,458 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:41:56,459 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:41:56,459 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:41:56,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:41:56,459 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:41:56,459 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:41:56,459 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:41:56,459 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:41:56,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:41:56,459 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:41:56,459 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:41:56,459 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:41:56,460 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:41:56,460 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:56,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:41:56,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:41:56,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:41:56,607 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:41:56,607 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:41:56,608 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/jm2006.i [2022-04-27 21:41:56,651 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/833635c04/893a23a5c8214bf3bd0cbefb99f54b4c/FLAGd733ac873 [2022-04-27 21:41:57,006 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:41:57,006 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006.i [2022-04-27 21:41:57,009 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/833635c04/893a23a5c8214bf3bd0cbefb99f54b4c/FLAGd733ac873 [2022-04-27 21:41:57,017 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/833635c04/893a23a5c8214bf3bd0cbefb99f54b4c [2022-04-27 21:41:57,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:41:57,019 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:41:57,020 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:41:57,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:41:57,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:41:57,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:41:57" (1/1) ... [2022-04-27 21:41:57,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4578b3ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:57, skipping insertion in model container [2022-04-27 21:41:57,024 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:41:57" (1/1) ... [2022-04-27 21:41:57,029 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:41:57,048 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:41:57,155 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/jm2006.i[895,908] [2022-04-27 21:41:57,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:41:57,173 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:41:57,189 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/jm2006.i[895,908] [2022-04-27 21:41:57,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:41:57,200 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:41:57,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:57 WrapperNode [2022-04-27 21:41:57,201 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:41:57,202 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:41:57,202 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:41:57,202 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:41:57,208 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:57" (1/1) ... [2022-04-27 21:41:57,208 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:57" (1/1) ... [2022-04-27 21:41:57,212 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:57" (1/1) ... [2022-04-27 21:41:57,212 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:57" (1/1) ... [2022-04-27 21:41:57,223 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:57" (1/1) ... [2022-04-27 21:41:57,229 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:57" (1/1) ... [2022-04-27 21:41:57,230 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:57" (1/1) ... [2022-04-27 21:41:57,231 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:41:57,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:41:57,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:41:57,232 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:41:57,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:57" (1/1) ... [2022-04-27 21:41:57,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:41:57,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:41:57,262 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:57,268 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:57,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:41:57,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:41:57,296 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:41:57,297 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 21:41:57,297 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 21:41:57,297 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:41:57,297 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:41:57,297 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:41:57,297 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 21:41:57,297 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 21:41:57,297 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:41:57,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:41:57,297 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 21:41:57,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:41:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 21:41:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:41:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:41:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:41:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:41:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:41:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:41:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:41:57,341 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:41:57,343 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:41:57,458 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:41:57,462 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:41:57,462 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 21:41:57,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:41:57 BoogieIcfgContainer [2022-04-27 21:41:57,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:41:57,464 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:41:57,464 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:41:57,464 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:41:57,466 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:41:57" (1/1) ... [2022-04-27 21:41:57,468 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:41:57,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:41:57 BasicIcfg [2022-04-27 21:41:57,483 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:41:57,485 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:41:57,485 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:41:57,486 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:41:57,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:41:57" (1/4) ... [2022-04-27 21:41:57,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f3f2b72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:41:57, skipping insertion in model container [2022-04-27 21:41:57,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:57" (2/4) ... [2022-04-27 21:41:57,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f3f2b72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:41:57, skipping insertion in model container [2022-04-27 21:41:57,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:41:57" (3/4) ... [2022-04-27 21:41:57,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f3f2b72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:41:57, skipping insertion in model container [2022-04-27 21:41:57,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:41:57" (4/4) ... [2022-04-27 21:41:57,488 INFO L111 eAbstractionObserver]: Analyzing ICFG jm2006.iqvasr [2022-04-27 21:41:57,507 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:41:57,507 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:41:57,546 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:41:57,551 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@3d6eb377, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2977750a [2022-04-27 21:41:57,551 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:41:57,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 15 states have internal predecessors, (19), 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:57,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 21:41:57,565 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:41:57,565 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:41:57,566 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:41:57,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:41:57,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1752834070, now seen corresponding path program 1 times [2022-04-27 21:41:57,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:41:57,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483278588] [2022-04-27 21:41:57,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:41:57,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:41:57,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:57,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:41:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:57,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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] {24#true} is VALID [2022-04-27 21:41:57,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 21:41:57,757 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 21:41:57,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:41:57,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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] {24#true} is VALID [2022-04-27 21:41:57,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 21:41:57,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 21:41:57,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 21:41:57,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} [67] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~j~0_5 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_5 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~j~0, main_#t~nondet2, main_~i~0] {24#true} is VALID [2022-04-27 21:41:57,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} [70] L28-->L31-2: Formula: (and (<= 0 v_main_~j~0_3) (<= 0 v_main_~i~0_3) (= v_main_~i~0_3 v_main_~x~0_1) (= v_main_~j~0_3 v_main_~y~0_1)) InVars {main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {24#true} is VALID [2022-04-27 21:41:57,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#true} [72] L31-2-->L31-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 21:41:57,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} [75] L31-3-->L36: Formula: (= v_main_~i~0_2 v_main_~j~0_2) InVars {main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 21:41:57,762 INFO L272 TraceCheckUtils]: 9: Hoare triple {25#false} [77] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~y~0_5 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {25#false} is VALID [2022-04-27 21:41:57,762 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {25#false} is VALID [2022-04-27 21:41:57,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} [80] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 21:41:57,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {25#false} [82] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 21:41:57,763 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:57,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:41:57,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483278588] [2022-04-27 21:41:57,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483278588] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:41:57,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:41:57,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 21:41:57,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626425895] [2022-04-27 21:41:57,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:41:57,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 13 [2022-04-27 21:41:57,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:41:57,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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:57,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:41:57,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 21:41:57,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:41:57,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 21:41:57,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:41:57,810 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 15 states have internal predecessors, (19), 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 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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:57,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:57,857 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-27 21:41:57,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 21:41:57,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 13 [2022-04-27 21:41:57,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:41:57,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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:57,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-04-27 21:41:57,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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:57,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-04-27 21:41:57,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 40 transitions. [2022-04-27 21:41:57,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:41:57,924 INFO L225 Difference]: With dead ends: 34 [2022-04-27 21:41:57,924 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 21:41:57,926 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:57,928 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 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:57,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 25 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:57,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 21:41:57,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 21:41:57,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:41:57,946 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:57,946 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:57,947 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:57,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:57,949 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 21:41:57,949 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 21:41:57,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:41:57,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:41:57,950 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:57,950 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:57,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:57,951 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 21:41:57,951 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 21:41:57,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:41:57,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:41:57,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:41:57,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:41:57,952 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:57,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-27 21:41:57,954 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 13 [2022-04-27 21:41:57,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:41:57,954 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-27 21:41:57,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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:57,955 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 21:41:57,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 21:41:57,955 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:41:57,955 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:41:57,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:41:57,955 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:41:57,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:41:57,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1781463221, now seen corresponding path program 1 times [2022-04-27 21:41:57,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:41:57,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369091471] [2022-04-27 21:41:57,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:41:57,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:41:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:58,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:41:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:58,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {134#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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] {124#true} is VALID [2022-04-27 21:41:58,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {124#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#true} is VALID [2022-04-27 21:41:58,142 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {124#true} {124#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#true} is VALID [2022-04-27 21:41:58,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {124#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {134#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:41:58,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {134#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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] {124#true} is VALID [2022-04-27 21:41:58,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {124#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#true} is VALID [2022-04-27 21:41:58,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {124#true} {124#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#true} is VALID [2022-04-27 21:41:58,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {124#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#true} is VALID [2022-04-27 21:41:58,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {124#true} [67] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~j~0_5 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_5 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~j~0, main_#t~nondet2, main_~i~0] {124#true} is VALID [2022-04-27 21:41:58,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {124#true} [70] L28-->L31-2: Formula: (and (<= 0 v_main_~j~0_3) (<= 0 v_main_~i~0_3) (= v_main_~i~0_3 v_main_~x~0_1) (= v_main_~j~0_3 v_main_~y~0_1)) InVars {main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {129#(and (or (and (or (= main_~i~0 0) (= main_~i~0 main_~x~0)) (or (<= main_~y~0 main_~j~0) (not (= main_~i~0 0)))) (<= main_~y~0 0)) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 21:41:58,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {129#(and (or (and (or (= main_~i~0 0) (= main_~i~0 main_~x~0)) (or (<= main_~y~0 main_~j~0) (not (= main_~i~0 0)))) (<= main_~y~0 0)) (< 0 (+ main_~y~0 1)))} [73] L31-2-->L31-3: Formula: (= v_main_~x~0_2 0) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {130#(and (or (and (<= main_~y~0 main_~j~0) (= main_~i~0 0)) (<= main_~y~0 0)) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 21:41:58,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {130#(and (or (and (<= main_~y~0 main_~j~0) (= main_~i~0 0)) (<= main_~y~0 0)) (< 0 (+ main_~y~0 1)))} [75] L31-3-->L36: Formula: (= v_main_~i~0_2 v_main_~j~0_2) InVars {main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[] {131#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 21:41:58,150 INFO L272 TraceCheckUtils]: 9: Hoare triple {131#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} [77] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~y~0_5 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {132#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:41:58,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {132#(not (= |__VERIFIER_assert_#in~cond| 0))} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {133#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:41:58,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {133#(not (= __VERIFIER_assert_~cond 0))} [80] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {125#false} is VALID [2022-04-27 21:41:58,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {125#false} [82] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {125#false} is VALID [2022-04-27 21:41:58,152 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:58,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:41:58,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369091471] [2022-04-27 21:41:58,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369091471] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:41:58,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:41:58,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 21:41:58,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717772139] [2022-04-27 21:41:58,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:41:58,154 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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 13 [2022-04-27 21:41:58,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:41:58,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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:58,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:41:58,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 21:41:58,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:41:58,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 21:41:58,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-27 21:41:58,172 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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:58,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:58,348 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-27 21:41:58,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 21:41:58,348 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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 13 [2022-04-27 21:41:58,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:41:58,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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:58,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2022-04-27 21:41:58,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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:58,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2022-04-27 21:41:58,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 21 transitions. [2022-04-27 21:41:58,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:41:58,374 INFO L225 Difference]: With dead ends: 21 [2022-04-27 21:41:58,375 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 21:41:58,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-04-27 21:41:58,377 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:41:58,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 32 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:41:58,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 21:41:58,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 21:41:58,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:41:58,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:58,383 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:58,383 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:58,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:58,384 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 21:41:58,385 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 21:41:58,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:41:58,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:41:58,385 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 21:41:58,386 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 21:41:58,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:58,388 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 21:41:58,388 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 21:41:58,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:41:58,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:41:58,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:41:58,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:41:58,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:58,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-27 21:41:58,389 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-27 21:41:58,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:41:58,390 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-27 21:41:58,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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:58,390 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 21:41:58,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 21:41:58,391 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:41:58,391 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:41:58,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:41:58,391 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:41:58,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:41:58,393 INFO L85 PathProgramCache]: Analyzing trace with hash 219122817, now seen corresponding path program 1 times [2022-04-27 21:41:58,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:41:58,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516628652] [2022-04-27 21:41:58,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:41:58,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:41:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:58,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:41:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:58,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {242#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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] {231#true} is VALID [2022-04-27 21:41:58,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {231#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-27 21:41:58,615 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {231#true} {231#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-27 21:41:58,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {231#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {242#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:41:58,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {242#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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] {231#true} is VALID [2022-04-27 21:41:58,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {231#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-27 21:41:58,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-27 21:41:58,616 INFO L272 TraceCheckUtils]: 4: Hoare triple {231#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-27 21:41:58,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#true} [67] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~j~0_5 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_5 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~j~0, main_#t~nondet2, main_~i~0] {231#true} is VALID [2022-04-27 21:41:58,617 INFO L290 TraceCheckUtils]: 6: Hoare triple {231#true} [70] L28-->L31-2: Formula: (and (<= 0 v_main_~j~0_3) (<= 0 v_main_~i~0_3) (= v_main_~i~0_3 v_main_~x~0_1) (= v_main_~j~0_3 v_main_~y~0_1)) InVars {main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {236#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-27 21:41:58,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {236#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} [74] L31-2-->L31-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (not (= v_main_~x~0_4 0)) (= v_main_~y~0_4 (+ v_main_~y~0_3 1))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_3, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post3] {237#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (or (<= main_~j~0 (+ main_~y~0 1)) (not (<= (+ main_~y~0 1) 0))) (or (<= (+ main_~y~0 1) main_~j~0) (<= main_~y~0 0)))} is VALID [2022-04-27 21:41:58,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {237#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (or (<= main_~j~0 (+ main_~y~0 1)) (not (<= (+ main_~y~0 1) 0))) (or (<= (+ main_~y~0 1) main_~j~0) (<= main_~y~0 0)))} [73] L31-2-->L31-3: Formula: (= v_main_~x~0_2 0) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {238#(and (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= main_~y~0 0) (<= (+ main_~i~0 main_~y~0) main_~j~0)))} is VALID [2022-04-27 21:41:58,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {238#(and (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= main_~y~0 0) (<= (+ main_~i~0 main_~y~0) main_~j~0)))} [75] L31-3-->L36: Formula: (= v_main_~i~0_2 v_main_~j~0_2) InVars {main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[] {239#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 21:41:58,620 INFO L272 TraceCheckUtils]: 10: Hoare triple {239#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} [77] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~y~0_5 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {240#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:41:58,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {240#(not (= |__VERIFIER_assert_#in~cond| 0))} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {241#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:41:58,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {241#(not (= __VERIFIER_assert_~cond 0))} [80] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {232#false} is VALID [2022-04-27 21:41:58,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {232#false} [82] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232#false} is VALID [2022-04-27 21:41:58,623 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:58,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:41:58,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516628652] [2022-04-27 21:41:58,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516628652] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:41:58,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655047247] [2022-04-27 21:41:58,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:41:58,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:41:58,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:41:58,625 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:58,631 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:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:58,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 21:41:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:58,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:41:58,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {231#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-27 21:41:58,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {231#true} [65] 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] {231#true} is VALID [2022-04-27 21:41:58,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {231#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-27 21:41:58,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-27 21:41:58,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {231#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-27 21:41:58,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#true} [67] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~j~0_5 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_5 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~j~0, main_#t~nondet2, main_~i~0] {231#true} is VALID [2022-04-27 21:41:58,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {231#true} [70] L28-->L31-2: Formula: (and (<= 0 v_main_~j~0_3) (<= 0 v_main_~i~0_3) (= v_main_~i~0_3 v_main_~x~0_1) (= v_main_~j~0_3 v_main_~y~0_1)) InVars {main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {236#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-27 21:41:58,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {236#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} [74] L31-2-->L31-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (not (= v_main_~x~0_4 0)) (= v_main_~y~0_4 (+ v_main_~y~0_3 1))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_3, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post3] {267#(and (= (+ main_~x~0 1) main_~i~0) (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)))} is VALID [2022-04-27 21:41:58,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {267#(and (= (+ main_~x~0 1) main_~i~0) (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)))} [73] L31-2-->L31-3: Formula: (= v_main_~x~0_2 0) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {271#(and (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)) (= main_~i~0 1))} is VALID [2022-04-27 21:41:58,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {271#(and (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)) (= main_~i~0 1))} [75] L31-3-->L36: Formula: (= v_main_~i~0_2 v_main_~j~0_2) InVars {main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[] {239#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 21:41:58,961 INFO L272 TraceCheckUtils]: 10: Hoare triple {239#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} [77] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~y~0_5 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {278#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:41:58,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {278#(<= 1 |__VERIFIER_assert_#in~cond|)} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {282#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:41:58,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {282#(<= 1 __VERIFIER_assert_~cond)} [80] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {232#false} is VALID [2022-04-27 21:41:58,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {232#false} [82] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232#false} is VALID [2022-04-27 21:41:58,962 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:58,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:41:59,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {232#false} [82] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232#false} is VALID [2022-04-27 21:41:59,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {282#(<= 1 __VERIFIER_assert_~cond)} [80] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {232#false} is VALID [2022-04-27 21:41:59,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {278#(<= 1 |__VERIFIER_assert_#in~cond|)} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {282#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:41:59,144 INFO L272 TraceCheckUtils]: 10: Hoare triple {239#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} [77] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~y~0_5 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {278#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:41:59,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {301#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))))} [75] L31-3-->L36: Formula: (= v_main_~i~0_2 v_main_~j~0_2) InVars {main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[] {239#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 21:41:59,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {305#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) (not (= main_~x~0 0)))} [73] L31-2-->L31-3: Formula: (= v_main_~x~0_2 0) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {301#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))))} is VALID [2022-04-27 21:41:59,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {309#(or (not (= main_~i~0 main_~j~0)) (and (< 0 main_~y~0) (<= main_~y~0 1)) (not (= (+ (- 1) main_~x~0) 0)))} [74] L31-2-->L31-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (not (= v_main_~x~0_4 0)) (= v_main_~y~0_4 (+ v_main_~y~0_3 1))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_3, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post3] {305#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) (not (= main_~x~0 0)))} is VALID [2022-04-27 21:41:59,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {231#true} [70] L28-->L31-2: Formula: (and (<= 0 v_main_~j~0_3) (<= 0 v_main_~i~0_3) (= v_main_~i~0_3 v_main_~x~0_1) (= v_main_~j~0_3 v_main_~y~0_1)) InVars {main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {309#(or (not (= main_~i~0 main_~j~0)) (and (< 0 main_~y~0) (<= main_~y~0 1)) (not (= (+ (- 1) main_~x~0) 0)))} is VALID [2022-04-27 21:41:59,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#true} [67] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~j~0_5 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_5 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~j~0, main_#t~nondet2, main_~i~0] {231#true} is VALID [2022-04-27 21:41:59,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {231#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-27 21:41:59,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-27 21:41:59,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {231#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-27 21:41:59,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {231#true} [65] 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] {231#true} is VALID [2022-04-27 21:41:59,147 INFO L272 TraceCheckUtils]: 0: Hoare triple {231#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-27 21:41:59,147 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:59,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655047247] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:41:59,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:41:59,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-27 21:41:59,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041432024] [2022-04-27 21:41:59,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:41:59,148 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 21:41:59,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:41:59,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:59,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:41:59,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 21:41:59,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:41:59,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 21:41:59,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-27 21:41:59,167 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:59,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:59,550 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-27 21:41:59,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 21:41:59,550 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 21:41:59,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:41:59,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:59,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-04-27 21:41:59,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:59,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-04-27 21:41:59,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 28 transitions. [2022-04-27 21:41:59,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:41:59,578 INFO L225 Difference]: With dead ends: 26 [2022-04-27 21:41:59,578 INFO L226 Difference]: Without dead ends: 18 [2022-04-27 21:41:59,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2022-04-27 21:41:59,580 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 25 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:41:59,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 52 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:41:59,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-27 21:41:59,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-27 21:41:59,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:41:59,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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:59,591 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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:59,591 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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:59,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:59,592 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-27 21:41:59,592 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-27 21:41:59,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:41:59,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:41:59,593 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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 18 states. [2022-04-27 21:41:59,593 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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 18 states. [2022-04-27 21:41:59,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:59,594 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-27 21:41:59,594 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-27 21:41:59,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:41:59,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:41:59,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:41:59,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:41:59,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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:59,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-27 21:41:59,595 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2022-04-27 21:41:59,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:41:59,595 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-27 21:41:59,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:41:59,596 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-27 21:41:59,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 21:41:59,596 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:41:59,596 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:41:59,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 21:41:59,811 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:59,812 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:41:59,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:41:59,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1738247093, now seen corresponding path program 2 times [2022-04-27 21:41:59,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:41:59,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518338702] [2022-04-27 21:41:59,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:41:59,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:41:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:59,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:41:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:59,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {473#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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] {460#true} is VALID [2022-04-27 21:41:59,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#true} is VALID [2022-04-27 21:41:59,962 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {460#true} {460#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#true} is VALID [2022-04-27 21:41:59,963 INFO L272 TraceCheckUtils]: 0: Hoare triple {460#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {473#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:41:59,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {473#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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] {460#true} is VALID [2022-04-27 21:41:59,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {460#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#true} is VALID [2022-04-27 21:41:59,963 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {460#true} {460#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#true} is VALID [2022-04-27 21:41:59,963 INFO L272 TraceCheckUtils]: 4: Hoare triple {460#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#true} is VALID [2022-04-27 21:41:59,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {460#true} [67] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~j~0_5 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_5 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~j~0, main_#t~nondet2, main_~i~0] {460#true} is VALID [2022-04-27 21:41:59,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {460#true} [70] L28-->L31-2: Formula: (and (<= 0 v_main_~j~0_3) (<= 0 v_main_~i~0_3) (= v_main_~i~0_3 v_main_~x~0_1) (= v_main_~j~0_3 v_main_~y~0_1)) InVars {main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {465#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-27 21:41:59,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {465#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} [74] L31-2-->L31-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (not (= v_main_~x~0_4 0)) (= v_main_~y~0_4 (+ v_main_~y~0_3 1))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_3, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post3] {466#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)))} is VALID [2022-04-27 21:41:59,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {466#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)))} [74] L31-2-->L31-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (not (= v_main_~x~0_4 0)) (= v_main_~y~0_4 (+ v_main_~y~0_3 1))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_3, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post3] {467#(and (<= (+ main_~i~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~y~0)))} is VALID [2022-04-27 21:41:59,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {467#(and (<= (+ main_~i~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~y~0)))} [74] L31-2-->L31-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (not (= v_main_~x~0_4 0)) (= v_main_~y~0_4 (+ v_main_~y~0_3 1))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_3, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post3] {467#(and (<= (+ main_~i~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~y~0)))} is VALID [2022-04-27 21:41:59,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {467#(and (<= (+ main_~i~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~y~0)))} [74] L31-2-->L31-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (not (= v_main_~x~0_4 0)) (= v_main_~y~0_4 (+ v_main_~y~0_3 1))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_3, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post3] {468#(and (or (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= (+ main_~i~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= main_~y~0 0)))} is VALID [2022-04-27 21:41:59,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {468#(and (or (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= (+ main_~i~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= main_~y~0 0)))} [73] L31-2-->L31-3: Formula: (= v_main_~x~0_2 0) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {469#(and (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= main_~y~0 0) (<= (+ main_~i~0 main_~y~0) main_~j~0)))} is VALID [2022-04-27 21:41:59,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {469#(and (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= main_~y~0 0) (<= (+ main_~i~0 main_~y~0) main_~j~0)))} [75] L31-3-->L36: Formula: (= v_main_~i~0_2 v_main_~j~0_2) InVars {main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[] {470#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 21:41:59,972 INFO L272 TraceCheckUtils]: 13: Hoare triple {470#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} [77] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~y~0_5 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {471#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:41:59,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {471#(not (= |__VERIFIER_assert_#in~cond| 0))} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {472#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:41:59,973 INFO L290 TraceCheckUtils]: 15: Hoare triple {472#(not (= __VERIFIER_assert_~cond 0))} [80] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {461#false} is VALID [2022-04-27 21:41:59,973 INFO L290 TraceCheckUtils]: 16: Hoare triple {461#false} [82] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {461#false} is VALID [2022-04-27 21:41:59,974 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 21:41:59,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:41:59,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518338702] [2022-04-27 21:41:59,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518338702] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:41:59,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508930584] [2022-04-27 21:41:59,974 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 21:41:59,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:41:59,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:41:59,975 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:41:59,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 21:42:00,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 21:42:00,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:42:00,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-27 21:42:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:42:00,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:42:00,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {460#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#true} is VALID [2022-04-27 21:42:00,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#true} [65] 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] {460#true} is VALID [2022-04-27 21:42:00,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {460#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#true} is VALID [2022-04-27 21:42:00,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {460#true} {460#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#true} is VALID [2022-04-27 21:42:00,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {460#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#true} is VALID [2022-04-27 21:42:00,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {460#true} [67] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~j~0_5 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_5 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~j~0, main_#t~nondet2, main_~i~0] {460#true} is VALID [2022-04-27 21:42:00,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {460#true} [70] L28-->L31-2: Formula: (and (<= 0 v_main_~j~0_3) (<= 0 v_main_~i~0_3) (= v_main_~i~0_3 v_main_~x~0_1) (= v_main_~j~0_3 v_main_~y~0_1)) InVars {main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {465#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-27 21:42:00,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {465#(and (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} [74] L31-2-->L31-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (not (= v_main_~x~0_4 0)) (= v_main_~y~0_4 (+ v_main_~y~0_3 1))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_3, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post3] {466#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)))} is VALID [2022-04-27 21:42:00,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {466#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= (+ main_~y~0 1) main_~j~0) (<= main_~j~0 (+ main_~y~0 1)))} [74] L31-2-->L31-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (not (= v_main_~x~0_4 0)) (= v_main_~y~0_4 (+ v_main_~y~0_3 1))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_3, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post3] {501#(and (= (+ (- 2) main_~i~0 (* (- 1) main_~x~0)) 0) (<= main_~j~0 (+ main_~y~0 2)) (<= (+ main_~y~0 2) main_~j~0))} is VALID [2022-04-27 21:42:00,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {501#(and (= (+ (- 2) main_~i~0 (* (- 1) main_~x~0)) 0) (<= main_~j~0 (+ main_~y~0 2)) (<= (+ main_~y~0 2) main_~j~0))} [74] L31-2-->L31-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (not (= v_main_~x~0_4 0)) (= v_main_~y~0_4 (+ v_main_~y~0_3 1))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_3, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post3] {505#(and (<= (+ main_~y~0 3) main_~j~0) (<= main_~j~0 (+ main_~y~0 3)) (= (+ main_~i~0 (- 3) (* (- 1) main_~x~0)) 0))} is VALID [2022-04-27 21:42:00,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {505#(and (<= (+ main_~y~0 3) main_~j~0) (<= main_~j~0 (+ main_~y~0 3)) (= (+ main_~i~0 (- 3) (* (- 1) main_~x~0)) 0))} [74] L31-2-->L31-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (not (= v_main_~x~0_4 0)) (= v_main_~y~0_4 (+ v_main_~y~0_3 1))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_3, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post3] {509#(and (= (+ main_~i~0 (- 4) (* (- 1) main_~x~0)) 0) (<= (+ main_~y~0 4) main_~j~0) (<= main_~j~0 (+ main_~y~0 4)))} is VALID [2022-04-27 21:42:00,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {509#(and (= (+ main_~i~0 (- 4) (* (- 1) main_~x~0)) 0) (<= (+ main_~y~0 4) main_~j~0) (<= main_~j~0 (+ main_~y~0 4)))} [73] L31-2-->L31-3: Formula: (= v_main_~x~0_2 0) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {513#(and (= (+ main_~i~0 (- 4)) 0) (<= (+ main_~y~0 4) main_~j~0) (<= main_~j~0 (+ main_~y~0 4)))} is VALID [2022-04-27 21:42:00,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {513#(and (= (+ main_~i~0 (- 4)) 0) (<= (+ main_~y~0 4) main_~j~0) (<= main_~j~0 (+ main_~y~0 4)))} [75] L31-3-->L36: Formula: (= v_main_~i~0_2 v_main_~j~0_2) InVars {main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[] {470#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 21:42:00,297 INFO L272 TraceCheckUtils]: 13: Hoare triple {470#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} [77] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~y~0_5 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {520#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:42:00,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {520#(<= 1 |__VERIFIER_assert_#in~cond|)} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {524#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:42:00,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {524#(<= 1 __VERIFIER_assert_~cond)} [80] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {461#false} is VALID [2022-04-27 21:42:00,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {461#false} [82] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {461#false} is VALID [2022-04-27 21:42:00,299 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:42:00,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:42:00,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {461#false} [82] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {461#false} is VALID [2022-04-27 21:42:00,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {524#(<= 1 __VERIFIER_assert_~cond)} [80] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {461#false} is VALID [2022-04-27 21:42:00,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {520#(<= 1 |__VERIFIER_assert_#in~cond|)} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {524#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:42:00,544 INFO L272 TraceCheckUtils]: 13: Hoare triple {470#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} [77] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~y~0_5 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {520#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:42:00,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {543#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))))} [75] L31-3-->L36: Formula: (= v_main_~i~0_2 v_main_~j~0_2) InVars {main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[] {470#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 21:42:00,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {547#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) (not (= main_~x~0 0)))} [73] L31-2-->L31-3: Formula: (= v_main_~x~0_2 0) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {543#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))))} is VALID [2022-04-27 21:42:00,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {551#(or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 1)) (and (< 0 main_~y~0) (<= main_~y~0 1)))} [74] L31-2-->L31-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (not (= v_main_~x~0_4 0)) (= v_main_~y~0_4 (+ v_main_~y~0_3 1))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_3, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post3] {547#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) (not (= main_~x~0 0)))} is VALID [2022-04-27 21:42:00,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {555#(or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 2)) (and (<= main_~y~0 2) (< 1 main_~y~0)))} [74] L31-2-->L31-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (not (= v_main_~x~0_4 0)) (= v_main_~y~0_4 (+ v_main_~y~0_3 1))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_3, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post3] {551#(or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 1)) (and (< 0 main_~y~0) (<= main_~y~0 1)))} is VALID [2022-04-27 21:42:00,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {559#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 3) (< 2 main_~y~0)) (not (= (+ (- 1) main_~x~0) 2)))} [74] L31-2-->L31-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (not (= v_main_~x~0_4 0)) (= v_main_~y~0_4 (+ v_main_~y~0_3 1))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_3, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post3] {555#(or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 2)) (and (<= main_~y~0 2) (< 1 main_~y~0)))} is VALID [2022-04-27 21:42:00,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {563#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 4) (< 3 main_~y~0)) (not (= main_~x~0 4)))} [74] L31-2-->L31-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (not (= v_main_~x~0_4 0)) (= v_main_~y~0_4 (+ v_main_~y~0_3 1))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_3, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post3] {559#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 3) (< 2 main_~y~0)) (not (= (+ (- 1) main_~x~0) 2)))} is VALID [2022-04-27 21:42:00,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {460#true} [70] L28-->L31-2: Formula: (and (<= 0 v_main_~j~0_3) (<= 0 v_main_~i~0_3) (= v_main_~i~0_3 v_main_~x~0_1) (= v_main_~j~0_3 v_main_~y~0_1)) InVars {main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {563#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 4) (< 3 main_~y~0)) (not (= main_~x~0 4)))} is VALID [2022-04-27 21:42:00,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {460#true} [67] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~j~0_5 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_5 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~j~0, main_#t~nondet2, main_~i~0] {460#true} is VALID [2022-04-27 21:42:00,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {460#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#true} is VALID [2022-04-27 21:42:00,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {460#true} {460#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#true} is VALID [2022-04-27 21:42:00,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {460#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#true} is VALID [2022-04-27 21:42:00,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#true} [65] 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] {460#true} is VALID [2022-04-27 21:42:00,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {460#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {460#true} is VALID [2022-04-27 21:42:00,555 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:42:00,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508930584] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:42:00,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:42:00,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2022-04-27 21:42:00,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327403225] [2022-04-27 21:42:00,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:42:00,560 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 20 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 21:42:00,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:42:00,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 20 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:42:00,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:42:00,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-27 21:42:00,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:42:00,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-27 21:42:00,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2022-04-27 21:42:00,582 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 20 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:42:00,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:42:00,976 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-27 21:42:00,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 21:42:00,976 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 20 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 21:42:00,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:42:00,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 20 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:42:00,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2022-04-27 21:42:00,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 20 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:42:00,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2022-04-27 21:42:00,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 22 transitions. [2022-04-27 21:42:00,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:42:00,994 INFO L225 Difference]: With dead ends: 21 [2022-04-27 21:42:00,994 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 21:42:00,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=945, Unknown=0, NotChecked=0, Total=1190 [2022-04-27 21:42:00,996 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 23 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:42:00,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 55 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:42:00,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 21:42:00,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 21:42:00,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:42:00,999 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:42:00,999 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:42:00,999 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:42:00,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:42:00,999 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:42:01,000 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:42:01,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:42:01,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:42:01,000 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:42:01,000 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:42:01,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:42:01,000 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:42:01,000 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:42:01,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:42:01,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:42:01,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:42:01,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:42:01,000 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:42:01,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 21:42:01,001 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-04-27 21:42:01,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:42:01,001 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 21:42:01,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 20 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:42:01,001 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:42:01,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:42:01,003 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 21:42:01,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 21:42:01,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 21:42:01,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 21:42:01,303 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:42:01,304 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:42:01,304 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:42:01,304 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 21:42:01,304 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 21:42:01,304 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:42:01,304 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:42:01,304 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 39) the Hoare annotation is: true [2022-04-27 21:42:01,304 INFO L899 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-04-27 21:42:01,304 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 24 39) no Hoare annotation was computed. [2022-04-27 21:42:01,304 INFO L895 garLoopResultBuilder]: At program point L31-2(lines 31 34) the Hoare annotation is: (let ((.cse1 (+ main_~j~0 main_~x~0)) (.cse0 (+ main_~i~0 main_~y~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2022-04-27 21:42:01,304 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 24 39) no Hoare annotation was computed. [2022-04-27 21:42:01,304 INFO L899 garLoopResultBuilder]: For program point L31-3(lines 24 39) no Hoare annotation was computed. [2022-04-27 21:42:01,304 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) [2022-04-27 21:42:01,304 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 37) no Hoare annotation was computed. [2022-04-27 21:42:01,304 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-27 21:42:01,305 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-27 21:42:01,305 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-27 21:42:01,305 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-27 21:42:01,305 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-27 21:42:01,305 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-27 21:42:01,307 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-27 21:42:01,308 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:42:01,311 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:42:01,311 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 21:42:01,311 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:42:01,311 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:42:01,311 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 21:42:01,311 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 21:42:01,311 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:42:01,311 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:42:01,311 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:42:01,311 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:42:01,311 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-04-27 21:42:01,311 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-04-27 21:42:01,313 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 21:42:01,313 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 21:42:01,313 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 21:42:01,313 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:42:01,313 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-04-27 21:42:01,313 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-04-27 21:42:01,313 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:42:01,313 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:42:01,313 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 21:42:01,313 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 21:42:01,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:42:01 BasicIcfg [2022-04-27 21:42:01,320 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 21:42:01,321 INFO L158 Benchmark]: Toolchain (without parser) took 4301.44ms. Allocated memory was 178.3MB in the beginning and 254.8MB in the end (delta: 76.5MB). Free memory was 118.3MB in the beginning and 115.5MB in the end (delta: 2.8MB). Peak memory consumption was 79.1MB. Max. memory is 8.0GB. [2022-04-27 21:42:01,321 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 178.3MB. Free memory is still 134.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:42:01,321 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.59ms. Allocated memory was 178.3MB in the beginning and 254.8MB in the end (delta: 76.5MB). Free memory was 118.1MB in the beginning and 225.9MB in the end (delta: -107.8MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. [2022-04-27 21:42:01,322 INFO L158 Benchmark]: Boogie Preprocessor took 29.42ms. Allocated memory is still 254.8MB. Free memory was 225.9MB in the beginning and 224.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 21:42:01,322 INFO L158 Benchmark]: RCFGBuilder took 231.67ms. Allocated memory is still 254.8MB. Free memory was 224.3MB in the beginning and 212.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 21:42:01,322 INFO L158 Benchmark]: IcfgTransformer took 19.73ms. Allocated memory is still 254.8MB. Free memory was 212.8MB in the beginning and 211.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 21:42:01,322 INFO L158 Benchmark]: TraceAbstraction took 3835.64ms. Allocated memory is still 254.8MB. Free memory was 210.7MB in the beginning and 116.0MB in the end (delta: 94.7MB). Peak memory consumption was 95.7MB. Max. memory is 8.0GB. [2022-04-27 21:42:01,323 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 178.3MB. Free memory is still 134.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 180.59ms. Allocated memory was 178.3MB in the beginning and 254.8MB in the end (delta: 76.5MB). Free memory was 118.1MB in the beginning and 225.9MB in the end (delta: -107.8MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.42ms. Allocated memory is still 254.8MB. Free memory was 225.9MB in the beginning and 224.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 231.67ms. Allocated memory is still 254.8MB. Free memory was 224.3MB in the beginning and 212.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 19.73ms. Allocated memory is still 254.8MB. Free memory was 212.8MB in the beginning and 211.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 3835.64ms. Allocated memory is still 254.8MB. Free memory was 210.7MB in the beginning and 116.0MB in the end (delta: 94.7MB). Peak memory consumption was 95.7MB. 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, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 77 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 164 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 114 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 228 IncrementalHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 50 mSDtfsCounter, 228 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 46 SyntacticMatches, 9 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 40, 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 22 NumberOfFragments, 35 HoareAnnotationTreeSize, 12 FomulaSimplifications, 19 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 289 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 111 ConstructedInterpolants, 0 QuantifiedInterpolants, 698 SizeOfPredicates, 12 NumberOfNonLiveVariables, 149 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 1/33 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: 31]: Loop Invariant Derived loop invariant: i + y <= j + x && j + x <= i + y RESULT: Ultimate proved your program to be correct! [2022-04-27 21:42:01,345 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...