/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/loopv1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 22:06:50,215 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 22:06:50,217 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 22:06:50,255 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 22:06:50,262 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 22:06:50,263 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 22:06:50,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 22:06:50,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 22:06:50,269 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 22:06:50,270 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 22:06:50,272 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 22:06:50,273 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 22:06:50,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 22:06:50,278 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 22:06:50,278 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 22:06:50,279 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 22:06:50,279 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 22:06:50,280 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 22:06:50,280 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 22:06:50,281 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 22:06:50,282 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 22:06:50,286 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 22:06:50,287 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 22:06:50,287 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 22:06:50,288 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 22:06:50,294 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 22:06:50,294 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 22:06:50,295 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 22:06:50,295 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 22:06:50,296 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 22:06:50,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 22:06:50,297 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 22:06:50,298 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 22:06:50,298 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 22:06:50,299 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 22:06:50,299 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 22:06:50,299 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 22:06:50,299 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 22:06:50,300 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 22:06:50,300 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 22:06:50,300 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 22:06:50,302 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 22:06:50,303 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 22:06:50,327 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 22:06:50,327 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 22:06:50,328 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 22:06:50,328 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 22:06:50,328 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 22:06:50,328 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 22:06:50,328 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 22:06:50,329 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 22:06:50,329 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 22:06:50,329 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 22:06:50,329 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 22:06:50,330 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 22:06:50,330 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 22:06:50,330 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 22:06:50,330 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 22:06:50,330 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 22:06:50,330 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 22:06:50,330 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 22:06:50,330 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 22:06:50,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:06:50,330 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 22:06:50,330 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 22:06:50,331 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 22:06:50,331 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 22:06:50,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 22:06:50,331 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 22:06:50,331 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 22:06:50,331 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 22:06:50,332 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 22:06:50,332 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 22:06:50,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 22:06:50,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 22:06:50,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 22:06:50,493 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 22:06:50,495 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 22:06:50,496 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/loopv1.c [2022-04-27 22:06:50,530 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d9efb109/54d6edfcb4cf4cfabf14af6cc2ca4578/FLAGf7e5d3064 [2022-04-27 22:06:50,868 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 22:06:50,868 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/loopv1.c [2022-04-27 22:06:50,872 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d9efb109/54d6edfcb4cf4cfabf14af6cc2ca4578/FLAGf7e5d3064 [2022-04-27 22:06:51,338 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d9efb109/54d6edfcb4cf4cfabf14af6cc2ca4578 [2022-04-27 22:06:51,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 22:06:51,341 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 22:06:51,342 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 22:06:51,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 22:06:51,345 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 22:06:51,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:06:51" (1/1) ... [2022-04-27 22:06:51,347 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18a0d47f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:06:51, skipping insertion in model container [2022-04-27 22:06:51,347 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:06:51" (1/1) ... [2022-04-27 22:06:51,352 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 22:06:51,362 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 22:06:51,475 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/loopv1.c[456,469] [2022-04-27 22:06:51,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:06:51,496 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 22:06:51,504 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/loopv1.c[456,469] [2022-04-27 22:06:51,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:06:51,514 INFO L208 MainTranslator]: Completed translation [2022-04-27 22:06:51,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:06:51 WrapperNode [2022-04-27 22:06:51,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 22:06:51,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 22:06:51,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 22:06:51,516 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 22:06:51,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:06:51" (1/1) ... [2022-04-27 22:06:51,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:06:51" (1/1) ... [2022-04-27 22:06:51,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:06:51" (1/1) ... [2022-04-27 22:06:51,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:06:51" (1/1) ... [2022-04-27 22:06:51,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:06:51" (1/1) ... [2022-04-27 22:06:51,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:06:51" (1/1) ... [2022-04-27 22:06:51,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:06:51" (1/1) ... [2022-04-27 22:06:51,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 22:06:51,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 22:06:51,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 22:06:51,538 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 22:06:51,540 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:06:51" (1/1) ... [2022-04-27 22:06:51,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:06:51,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:06:51,562 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 22:06:51,572 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 22:06:51,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 22:06:51,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 22:06:51,584 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 22:06:51,584 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 22:06:51,584 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 22:06:51,584 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 22:06:51,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 22:06:51,584 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 22:06:51,584 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 22:06:51,584 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 22:06:51,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 22:06:51,584 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 22:06:51,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 22:06:51,585 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 22:06:51,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 22:06:51,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 22:06:51,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 22:06:51,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 22:06:51,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 22:06:51,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 22:06:51,623 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 22:06:51,624 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 22:06:51,721 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 22:06:51,725 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 22:06:51,725 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 22:06:51,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:06:51 BoogieIcfgContainer [2022-04-27 22:06:51,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 22:06:51,727 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 22:06:51,727 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 22:06:51,744 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 22:06:51,746 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:06:51" (1/1) ... [2022-04-27 22:06:51,748 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 22:06:51,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:06:51 BasicIcfg [2022-04-27 22:06:51,772 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 22:06:51,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 22:06:51,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 22:06:51,775 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 22:06:51,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:06:51" (1/4) ... [2022-04-27 22:06:51,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c894571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:06:51, skipping insertion in model container [2022-04-27 22:06:51,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:06:51" (2/4) ... [2022-04-27 22:06:51,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c894571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:06:51, skipping insertion in model container [2022-04-27 22:06:51,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:06:51" (3/4) ... [2022-04-27 22:06:51,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c894571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:06:51, skipping insertion in model container [2022-04-27 22:06:51,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:06:51" (4/4) ... [2022-04-27 22:06:51,777 INFO L111 eAbstractionObserver]: Analyzing ICFG loopv1.cqvasr [2022-04-27 22:06:51,786 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 22:06:51,787 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 22:06:51,823 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 22:06:51,844 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@1ba50b93, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1da3a152 [2022-04-27 22:06:51,844 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 22:06:51,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 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 22:06:51,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 22:06:51,854 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:06:51,854 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:06:51,855 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:06:51,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:06:51,858 INFO L85 PathProgramCache]: Analyzing trace with hash 959820703, now seen corresponding path program 1 times [2022-04-27 22:06:51,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:06:51,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201129890] [2022-04-27 22:06:51,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:06:51,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:06:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:06:51,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:06:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:06:51,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [60] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {24#true} is VALID [2022-04-27 22:06:51,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 22:06:51,990 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} [80] 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 22:06:51,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:06:51,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [60] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {24#true} is VALID [2022-04-27 22:06:51,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 22:06:51,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} [80] 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 22:06:51,994 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 22:06:51,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} [62] mainENTRY-->L23: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_3, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~j~0, main_~i~0, main_~n~0] {24#true} is VALID [2022-04-27 22:06:51,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} [65] L23-->L27-2: Formula: (and (= v_main_~j~0_2 0) (= v_main_~i~0_9 0) (<= v_main_~n~0_7 v_~SIZE~0_2)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_7} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {24#true} is VALID [2022-04-27 22:06:51,997 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#true} [67] L27-2-->L25-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 22:06:51,997 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} [70] L25-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (mod v_main_~i~0_10 3))) (ite (and (< v_main_~i~0_10 0) (not (= .cse0 0))) (+ (- 3) .cse0) .cse0)) 0) 1 0)) InVars {main_~i~0=v_main_~i~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {25#false} is VALID [2022-04-27 22:06:51,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} [74] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {25#false} is VALID [2022-04-27 22:06:51,998 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} [75] L13-->L14: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 22:06:51,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} [77] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 22:06:51,998 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 22:06:51,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:06:51,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201129890] [2022-04-27 22:06:51,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201129890] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:06:51,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:06:52,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 22:06:52,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903008185] [2022-04-27 22:06:52,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:06:52,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 22:06:52,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:06:52,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:06:52,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:06:52,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 22:06:52,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:06:52,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 22:06:52,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 22:06:52,054 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 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 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:06:52,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:06:52,135 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-27 22:06:52,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 22:06:52,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 22:06:52,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:06:52,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:06:52,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-04-27 22:06:52,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:06:52,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-04-27 22:06:52,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2022-04-27 22:06:52,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:06:52,199 INFO L225 Difference]: With dead ends: 33 [2022-04-27 22:06:52,199 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 22:06:52,201 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 22:06:52,205 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:06:52,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 23 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:06:52,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 22:06:52,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 22:06:52,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:06:52,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:06:52,229 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:06:52,230 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:06:52,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:06:52,234 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 22:06:52,234 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 22:06:52,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:06:52,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:06:52,235 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 22:06:52,235 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 22:06:52,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:06:52,238 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 22:06:52,238 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 22:06:52,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:06:52,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:06:52,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:06:52,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:06:52,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:06:52,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-27 22:06:52,244 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2022-04-27 22:06:52,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:06:52,247 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-27 22:06:52,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:06:52,248 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 22:06:52,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 22:06:52,249 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:06:52,249 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:06:52,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 22:06:52,249 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:06:52,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:06:52,250 INFO L85 PathProgramCache]: Analyzing trace with hash 960744224, now seen corresponding path program 1 times [2022-04-27 22:06:52,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:06:52,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136709209] [2022-04-27 22:06:52,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:06:52,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:06:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:06:52,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:06:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:06:52,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {131#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [60] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {123#true} is VALID [2022-04-27 22:06:52,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {123#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-27 22:06:52,376 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {123#true} {123#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-27 22:06:52,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {123#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {131#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:06:52,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {131#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [60] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {123#true} is VALID [2022-04-27 22:06:52,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {123#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-27 22:06:52,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123#true} {123#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-27 22:06:52,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {123#true} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-27 22:06:52,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {123#true} [62] mainENTRY-->L23: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_3, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~j~0, main_~i~0, main_~n~0] {123#true} is VALID [2022-04-27 22:06:52,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {123#true} [65] L23-->L27-2: Formula: (and (= v_main_~j~0_2 0) (= v_main_~i~0_9 0) (<= v_main_~n~0_7 v_~SIZE~0_2)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_7} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {128#(= main_~i~0 0)} is VALID [2022-04-27 22:06:52,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {128#(= main_~i~0 0)} [68] L27-2-->L25-2: Formula: (not (< v_main_~i~0_2 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {128#(= main_~i~0 0)} is VALID [2022-04-27 22:06:52,381 INFO L272 TraceCheckUtils]: 8: Hoare triple {128#(= main_~i~0 0)} [70] L25-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (mod v_main_~i~0_10 3))) (ite (and (< v_main_~i~0_10 0) (not (= .cse0 0))) (+ (- 3) .cse0) .cse0)) 0) 1 0)) InVars {main_~i~0=v_main_~i~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {129#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 22:06:52,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {129#(not (= |__VERIFIER_assert_#in~cond| 0))} [74] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {130#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 22:06:52,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {130#(not (= __VERIFIER_assert_~cond 0))} [75] L13-->L14: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {124#false} is VALID [2022-04-27 22:06:52,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {124#false} [77] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#false} is VALID [2022-04-27 22:06:52,382 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 22:06:52,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:06:52,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136709209] [2022-04-27 22:06:52,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136709209] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:06:52,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:06:52,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 22:06:52,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343322676] [2022-04-27 22:06:52,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:06:52,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 22:06:52,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:06:52,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:06:52,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:06:52,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 22:06:52,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:06:52,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 22:06:52,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 22:06:52,401 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:06:52,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:06:52,516 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-27 22:06:52,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 22:06:52,517 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 22:06:52,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:06:52,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:06:52,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-04-27 22:06:52,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:06:52,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-04-27 22:06:52,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 23 transitions. [2022-04-27 22:06:52,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:06:52,541 INFO L225 Difference]: With dead ends: 21 [2022-04-27 22:06:52,541 INFO L226 Difference]: Without dead ends: 16 [2022-04-27 22:06:52,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-27 22:06:52,543 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 14 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:06:52,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 26 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:06:52,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-27 22:06:52,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-27 22:06:52,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:06:52,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 22:06:52,549 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 22:06:52,549 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 22:06:52,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:06:52,550 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-27 22:06:52,550 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-27 22:06:52,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:06:52,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:06:52,551 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 22:06:52,551 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 22:06:52,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:06:52,552 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-27 22:06:52,552 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-27 22:06:52,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:06:52,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:06:52,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:06:52,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:06:52,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 22:06:52,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-27 22:06:52,553 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-27 22:06:52,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:06:52,553 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-27 22:06:52,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:06:52,553 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 22:06:52,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 22:06:52,554 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:06:52,554 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:06:52,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 22:06:52,554 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:06:52,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:06:52,554 INFO L85 PathProgramCache]: Analyzing trace with hash 767672894, now seen corresponding path program 1 times [2022-04-27 22:06:52,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:06:52,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955373561] [2022-04-27 22:06:52,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:06:52,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:06:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:06:52,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:06:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:06:52,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {235#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [60] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {226#true} is VALID [2022-04-27 22:06:52,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {226#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 22:06:52,684 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {226#true} {226#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 22:06:52,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {226#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {235#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:06:52,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {235#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [60] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {226#true} is VALID [2022-04-27 22:06:52,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {226#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 22:06:52,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {226#true} {226#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 22:06:52,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {226#true} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 22:06:52,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {226#true} [62] mainENTRY-->L23: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_3, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~j~0, main_~i~0, main_~n~0] {226#true} is VALID [2022-04-27 22:06:52,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {226#true} [65] L23-->L27-2: Formula: (and (= v_main_~j~0_2 0) (= v_main_~i~0_9 0) (<= v_main_~n~0_7 v_~SIZE~0_2)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_7} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {231#(= main_~i~0 0)} is VALID [2022-04-27 22:06:52,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {231#(= main_~i~0 0)} [69] L27-2-->L27: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648)) (< v_main_~i~0_3 v_main_~n~0_2)) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {231#(= main_~i~0 0)} is VALID [2022-04-27 22:06:52,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {231#(= main_~i~0 0)} [71] L27-->L27-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~i~0_5 (+ v_main_~i~0_6 6))) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~i~0] {232#(and (<= main_~i~0 (* 3 (div main_~i~0 3))) (not (<= (div main_~i~0 3) 1)))} is VALID [2022-04-27 22:06:52,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {232#(and (<= main_~i~0 (* 3 (div main_~i~0 3))) (not (<= (div main_~i~0 3) 1)))} [68] L27-2-->L25-2: Formula: (not (< v_main_~i~0_2 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {232#(and (<= main_~i~0 (* 3 (div main_~i~0 3))) (not (<= (div main_~i~0 3) 1)))} is VALID [2022-04-27 22:06:52,688 INFO L272 TraceCheckUtils]: 10: Hoare triple {232#(and (<= main_~i~0 (* 3 (div main_~i~0 3))) (not (<= (div main_~i~0 3) 1)))} [70] L25-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (mod v_main_~i~0_10 3))) (ite (and (< v_main_~i~0_10 0) (not (= .cse0 0))) (+ (- 3) .cse0) .cse0)) 0) 1 0)) InVars {main_~i~0=v_main_~i~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {233#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 22:06:52,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {233#(not (= |__VERIFIER_assert_#in~cond| 0))} [74] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {234#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 22:06:52,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {234#(not (= __VERIFIER_assert_~cond 0))} [75] L13-->L14: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {227#false} is VALID [2022-04-27 22:06:52,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {227#false} [77] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {227#false} is VALID [2022-04-27 22:06:52,690 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 22:06:52,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:06:52,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955373561] [2022-04-27 22:06:52,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955373561] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:06:52,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314173619] [2022-04-27 22:06:52,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:06:52,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:06:52,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:06:52,692 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 22:06:52,693 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 22:06:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:06:52,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 22:06:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:06:52,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:06:52,849 INFO L272 TraceCheckUtils]: 0: Hoare triple {226#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 22:06:52,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {226#true} [60] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {226#true} is VALID [2022-04-27 22:06:52,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {226#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 22:06:52,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {226#true} {226#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 22:06:52,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {226#true} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 22:06:52,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {226#true} [62] mainENTRY-->L23: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_3, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~j~0, main_~i~0, main_~n~0] {226#true} is VALID [2022-04-27 22:06:52,853 INFO L290 TraceCheckUtils]: 6: Hoare triple {226#true} [65] L23-->L27-2: Formula: (and (= v_main_~j~0_2 0) (= v_main_~i~0_9 0) (<= v_main_~n~0_7 v_~SIZE~0_2)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_7} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {231#(= main_~i~0 0)} is VALID [2022-04-27 22:06:52,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {231#(= main_~i~0 0)} [69] L27-2-->L27: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648)) (< v_main_~i~0_3 v_main_~n~0_2)) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {231#(= main_~i~0 0)} is VALID [2022-04-27 22:06:52,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {231#(= main_~i~0 0)} [71] L27-->L27-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~i~0_5 (+ v_main_~i~0_6 6))) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~i~0] {263#(= main_~i~0 6)} is VALID [2022-04-27 22:06:52,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {263#(= main_~i~0 6)} [68] L27-2-->L25-2: Formula: (not (< v_main_~i~0_2 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {263#(= main_~i~0 6)} is VALID [2022-04-27 22:06:52,857 INFO L272 TraceCheckUtils]: 10: Hoare triple {263#(= main_~i~0 6)} [70] L25-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (mod v_main_~i~0_10 3))) (ite (and (< v_main_~i~0_10 0) (not (= .cse0 0))) (+ (- 3) .cse0) .cse0)) 0) 1 0)) InVars {main_~i~0=v_main_~i~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {270#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:06:52,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {270#(<= 1 |__VERIFIER_assert_#in~cond|)} [74] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {274#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:06:52,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {274#(<= 1 __VERIFIER_assert_~cond)} [75] L13-->L14: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {227#false} is VALID [2022-04-27 22:06:52,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {227#false} [77] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {227#false} is VALID [2022-04-27 22:06:52,859 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 22:06:52,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:06:53,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {227#false} [77] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {227#false} is VALID [2022-04-27 22:06:53,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {274#(<= 1 __VERIFIER_assert_~cond)} [75] L13-->L14: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {227#false} is VALID [2022-04-27 22:06:53,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {270#(<= 1 |__VERIFIER_assert_#in~cond|)} [74] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {274#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:06:53,039 INFO L272 TraceCheckUtils]: 10: Hoare triple {290#(= (mod main_~i~0 3) 0)} [70] L25-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (let ((.cse0 (mod v_main_~i~0_10 3))) (ite (and (< v_main_~i~0_10 0) (not (= .cse0 0))) (+ (- 3) .cse0) .cse0)) 0) 1 0)) InVars {main_~i~0=v_main_~i~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {270#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:06:53,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {290#(= (mod main_~i~0 3) 0)} [68] L27-2-->L25-2: Formula: (not (< v_main_~i~0_2 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {290#(= (mod main_~i~0 3) 0)} is VALID [2022-04-27 22:06:53,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {290#(= (mod main_~i~0 3) 0)} [71] L27-->L27-2: Formula: (and (not (= |v_main_#t~nondet5_3| 0)) (= v_main_~i~0_5 (+ v_main_~i~0_6 6))) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|, main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~i~0] {290#(= (mod main_~i~0 3) 0)} is VALID [2022-04-27 22:06:53,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {290#(= (mod main_~i~0 3) 0)} [69] L27-2-->L27: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648)) (< v_main_~i~0_3 v_main_~n~0_2)) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {290#(= (mod main_~i~0 3) 0)} is VALID [2022-04-27 22:06:53,041 INFO L290 TraceCheckUtils]: 6: Hoare triple {226#true} [65] L23-->L27-2: Formula: (and (= v_main_~j~0_2 0) (= v_main_~i~0_9 0) (<= v_main_~n~0_7 v_~SIZE~0_2)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_7} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {290#(= (mod main_~i~0 3) 0)} is VALID [2022-04-27 22:06:53,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {226#true} [62] mainENTRY-->L23: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_3 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_3, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~j~0, main_~i~0, main_~n~0] {226#true} is VALID [2022-04-27 22:06:53,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {226#true} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 22:06:53,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {226#true} {226#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 22:06:53,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {226#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 22:06:53,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {226#true} [60] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {226#true} is VALID [2022-04-27 22:06:53,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {226#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#true} is VALID [2022-04-27 22:06:53,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 22:06:53,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314173619] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 22:06:53,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 22:06:53,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 6] total 11 [2022-04-27 22:06:53,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754536476] [2022-04-27 22:06:53,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:06:53,043 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 22:06:53,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:06:53,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:06:53,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:06:53,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 22:06:53,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:06:53,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 22:06:53,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 22:06:53,054 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:06:53,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:06:53,095 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 22:06:53,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 22:06:53,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 22:06:53,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:06:53,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:06:53,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2022-04-27 22:06:53,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:06:53,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2022-04-27 22:06:53,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 15 transitions. [2022-04-27 22:06:53,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:06:53,107 INFO L225 Difference]: With dead ends: 15 [2022-04-27 22:06:53,107 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 22:06:53,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-27 22:06:53,108 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:06:53,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 27 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:06:53,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 22:06:53,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 22:06:53,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:06:53,109 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 22:06:53,109 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 22:06:53,110 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 22:06:53,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:06:53,110 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 22:06:53,110 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:06:53,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:06:53,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:06:53,110 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 22:06:53,110 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 22:06:53,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:06:53,110 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 22:06:53,110 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:06:53,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:06:53,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:06:53,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:06:53,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:06:53,111 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 22:06:53,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 22:06:53,111 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-27 22:06:53,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:06:53,111 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 22:06:53,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:06:53,111 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:06:53,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:06:53,113 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 22:06:53,147 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 22:06:53,323 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 22:06:53,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 22:06:53,354 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 22:06:53,354 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 22:06:53,354 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 22:06:53,354 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 22:06:53,354 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 22:06:53,354 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 22:06:53,354 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 22:06:53,354 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 20 34) the Hoare annotation is: true [2022-04-27 22:06:53,355 INFO L899 garLoopResultBuilder]: For program point L23(line 23) no Hoare annotation was computed. [2022-04-27 22:06:53,355 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 20 34) no Hoare annotation was computed. [2022-04-27 22:06:53,355 INFO L895 garLoopResultBuilder]: At program point L27-2(lines 25 31) the Hoare annotation is: (= (mod main_~i~0 3) 0) [2022-04-27 22:06:53,355 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 20 34) no Hoare annotation was computed. [2022-04-27 22:06:53,355 INFO L895 garLoopResultBuilder]: At program point L25-2(lines 25 31) the Hoare annotation is: (= (mod main_~i~0 3) 0) [2022-04-27 22:06:53,355 INFO L899 garLoopResultBuilder]: For program point L27(lines 27 30) no Hoare annotation was computed. [2022-04-27 22:06:53,355 INFO L899 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2022-04-27 22:06:53,355 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 12 17) the Hoare annotation is: true [2022-04-27 22:06:53,355 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 15) no Hoare annotation was computed. [2022-04-27 22:06:53,355 INFO L899 garLoopResultBuilder]: For program point L14(line 14) no Hoare annotation was computed. [2022-04-27 22:06:53,355 INFO L899 garLoopResultBuilder]: For program point L13-2(lines 12 17) no Hoare annotation was computed. [2022-04-27 22:06:53,355 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-04-27 22:06:53,356 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 12 17) no Hoare annotation was computed. [2022-04-27 22:06:53,361 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 22:06:53,362 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 22:06:53,367 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 22:06:53,367 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-27 22:06:53,368 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 22:06:53,368 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 22:06:53,368 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-27 22:06:53,368 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-27 22:06:53,368 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 22:06:53,368 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 22:06:53,369 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 22:06:53,369 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 22:06:53,369 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 22:06:53,369 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-27 22:06:53,369 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-27 22:06:53,369 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-27 22:06:53,369 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 22:06:53,369 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 22:06:53,369 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 22:06:53,370 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 22:06:53,370 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 22:06:53,370 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-27 22:06:53,370 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 22:06:53,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:06:53 BasicIcfg [2022-04-27 22:06:53,376 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 22:06:53,377 INFO L158 Benchmark]: Toolchain (without parser) took 2035.87ms. Allocated memory was 198.2MB in the beginning and 238.0MB in the end (delta: 39.8MB). Free memory was 148.7MB in the beginning and 201.2MB in the end (delta: -52.5MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 22:06:53,377 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 198.2MB. Free memory is still 164.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 22:06:53,378 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.87ms. Allocated memory is still 198.2MB. Free memory was 148.4MB in the beginning and 175.8MB in the end (delta: -27.4MB). Peak memory consumption was 8.8MB. Max. memory is 8.0GB. [2022-04-27 22:06:53,378 INFO L158 Benchmark]: Boogie Preprocessor took 22.05ms. Allocated memory is still 198.2MB. Free memory was 175.8MB in the beginning and 174.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 22:06:53,378 INFO L158 Benchmark]: RCFGBuilder took 188.09ms. Allocated memory is still 198.2MB. Free memory was 174.2MB in the beginning and 163.2MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 22:06:53,378 INFO L158 Benchmark]: IcfgTransformer took 45.71ms. Allocated memory is still 198.2MB. Free memory was 163.2MB in the beginning and 161.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 22:06:53,379 INFO L158 Benchmark]: TraceAbstraction took 1603.06ms. Allocated memory was 198.2MB in the beginning and 238.0MB in the end (delta: 39.8MB). Free memory was 161.1MB in the beginning and 201.2MB in the end (delta: -40.0MB). Peak memory consumption was 1.4MB. Max. memory is 8.0GB. [2022-04-27 22:06:53,380 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 198.2MB. Free memory is still 164.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 171.87ms. Allocated memory is still 198.2MB. Free memory was 148.4MB in the beginning and 175.8MB in the end (delta: -27.4MB). Peak memory consumption was 8.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.05ms. Allocated memory is still 198.2MB. Free memory was 175.8MB in the beginning and 174.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 188.09ms. Allocated memory is still 198.2MB. Free memory was 174.2MB in the beginning and 163.2MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 45.71ms. Allocated memory is still 198.2MB. Free memory was 163.2MB in the beginning and 161.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 1603.06ms. Allocated memory was 198.2MB in the beginning and 238.0MB in the end (delta: 39.8MB). Free memory was 161.1MB in the beginning and 201.2MB in the end (delta: -40.0MB). Peak memory consumption was 1.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: 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: 1.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 58 IncrementalHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 37 mSDtfsCounter, 58 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 12 NumberOfFragments, 24 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 14 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 166 SizeOfPredicates, 1 NumberOfNonLiveVariables, 70 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 1/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: i % 3 == 0 RESULT: Ultimate proved your program to be correct! [2022-04-27 22:06:53,411 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...