java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/loops/vogal-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 23:00:26,329 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:00:26,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:00:26,349 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:00:26,349 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:00:26,351 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:00:26,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:00:26,361 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:00:26,366 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:00:26,368 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:00:26,369 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:00:26,371 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:00:26,371 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:00:26,373 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:00:26,375 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:00:26,376 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:00:26,377 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:00:26,378 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:00:26,379 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:00:26,384 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:00:26,389 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:00:26,392 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:00:26,394 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:00:26,395 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:00:26,397 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:00:26,397 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:00:26,397 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:00:26,399 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:00:26,400 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:00:26,401 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:00:26,401 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:00:26,402 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:00:26,403 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:00:26,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:00:26,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:00:26,405 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:00:26,405 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:00:26,406 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:00:26,406 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:00:26,406 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:00:26,408 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:00:26,408 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 23:00:26,441 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:00:26,441 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:00:26,442 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:00:26,442 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:00:26,443 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:00:26,443 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:00:26,443 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:00:26,446 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:00:26,446 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:00:26,447 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:00:26,447 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:00:26,447 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:00:26,447 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:00:26,447 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:00:26,448 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:00:26,448 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:00:26,448 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:00:26,448 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:00:26,448 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:00:26,449 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:00:26,449 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:00:26,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:00:26,452 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:00:26,452 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:00:26,452 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:00:26,452 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:00:26,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:00:26,453 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:00:26,453 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 23:00:26,730 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:00:26,742 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:00:26,745 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:00:26,747 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:00:26,747 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:00:26,748 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/vogal-2.i [2019-10-13 23:00:26,805 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aefd7486/01d1fadf43b84ce587db9f59addc6134/FLAG4d671284f [2019-10-13 23:00:27,185 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:00:27,186 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/vogal-2.i [2019-10-13 23:00:27,192 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aefd7486/01d1fadf43b84ce587db9f59addc6134/FLAG4d671284f [2019-10-13 23:00:27,605 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aefd7486/01d1fadf43b84ce587db9f59addc6134 [2019-10-13 23:00:27,616 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:00:27,618 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:00:27,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:00:27,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:00:27,625 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:00:27,626 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:00:27" (1/1) ... [2019-10-13 23:00:27,629 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bfc0887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:00:27, skipping insertion in model container [2019-10-13 23:00:27,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:00:27" (1/1) ... [2019-10-13 23:00:27,637 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:00:27,657 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:00:27,889 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:00:27,893 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:00:27,918 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:00:28,033 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:00:28,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:00:28 WrapperNode [2019-10-13 23:00:28,033 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:00:28,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:00:28,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:00:28,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:00:28,044 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:00:28" (1/1) ... [2019-10-13 23:00:28,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:00:28" (1/1) ... [2019-10-13 23:00:28,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:00:28" (1/1) ... [2019-10-13 23:00:28,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:00:28" (1/1) ... [2019-10-13 23:00:28,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:00:28" (1/1) ... [2019-10-13 23:00:28,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:00:28" (1/1) ... [2019-10-13 23:00:28,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:00:28" (1/1) ... [2019-10-13 23:00:28,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:00:28,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:00:28,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:00:28,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:00:28,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:00:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:00:28,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:00:28,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:00:28,137 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 23:00:28,137 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:00:28,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:00:28,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 23:00:28,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 23:00:28,138 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:00:28,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 23:00:28,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 23:00:28,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 23:00:28,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 23:00:28,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 23:00:28,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:00:28,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:00:28,581 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:00:28,581 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-13 23:00:28,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:00:28 BoogieIcfgContainer [2019-10-13 23:00:28,583 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:00:28,584 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:00:28,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:00:28,587 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:00:28,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:00:27" (1/3) ... [2019-10-13 23:00:28,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0a1b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:00:28, skipping insertion in model container [2019-10-13 23:00:28,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:00:28" (2/3) ... [2019-10-13 23:00:28,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0a1b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:00:28, skipping insertion in model container [2019-10-13 23:00:28,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:00:28" (3/3) ... [2019-10-13 23:00:28,590 INFO L109 eAbstractionObserver]: Analyzing ICFG vogal-2.i [2019-10-13 23:00:28,600 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:00:28,607 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 23:00:28,618 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 23:00:28,639 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:00:28,639 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:00:28,640 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:00:28,640 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:00:28,640 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:00:28,640 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:00:28,640 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:00:28,640 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:00:28,653 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-10-13 23:00:28,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 23:00:28,658 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:00:28,659 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:00:28,661 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:00:28,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:00:28,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1300943193, now seen corresponding path program 1 times [2019-10-13 23:00:28,673 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:00:28,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630565242] [2019-10-13 23:00:28,673 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:00:28,674 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:00:28,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:00:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:00:28,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:00:28,810 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630565242] [2019-10-13 23:00:28,811 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:00:28,811 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-13 23:00:28,811 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373312823] [2019-10-13 23:00:28,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 23:00:28,816 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:00:28,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 23:00:28,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 23:00:28,834 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-10-13 23:00:28,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:00:28,857 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2019-10-13 23:00:28,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 23:00:28,858 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-10-13 23:00:28,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:00:28,865 INFO L225 Difference]: With dead ends: 42 [2019-10-13 23:00:28,865 INFO L226 Difference]: Without dead ends: 19 [2019-10-13 23:00:28,868 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 23:00:28,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-13 23:00:28,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-13 23:00:28,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-13 23:00:28,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-10-13 23:00:28,900 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 14 [2019-10-13 23:00:28,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:00:28,900 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-10-13 23:00:28,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 23:00:28,900 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-10-13 23:00:28,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 23:00:28,901 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:00:28,902 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:00:28,902 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:00:28,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:00:28,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1331812321, now seen corresponding path program 1 times [2019-10-13 23:00:28,903 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:00:28,903 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826671613] [2019-10-13 23:00:28,904 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:00:28,904 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:00:28,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:00:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:00:29,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:00:29,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826671613] [2019-10-13 23:00:29,007 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:00:29,008 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:00:29,008 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000854943] [2019-10-13 23:00:29,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:00:29,010 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:00:29,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:00:29,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:00:29,011 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 3 states. [2019-10-13 23:00:29,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:00:29,064 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2019-10-13 23:00:29,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:00:29,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-13 23:00:29,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:00:29,068 INFO L225 Difference]: With dead ends: 39 [2019-10-13 23:00:29,068 INFO L226 Difference]: Without dead ends: 26 [2019-10-13 23:00:29,069 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:00:29,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-13 23:00:29,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2019-10-13 23:00:29,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-13 23:00:29,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-10-13 23:00:29,076 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 16 [2019-10-13 23:00:29,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:00:29,077 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-10-13 23:00:29,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:00:29,077 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2019-10-13 23:00:29,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 23:00:29,078 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:00:29,078 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:00:29,078 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:00:29,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:00:29,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1442987554, now seen corresponding path program 1 times [2019-10-13 23:00:29,079 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:00:29,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857722977] [2019-10-13 23:00:29,080 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:00:29,080 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:00:29,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:00:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:00:29,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:00:29,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857722977] [2019-10-13 23:00:29,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902906937] [2019-10-13 23:00:29,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:00:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:00:29,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 23:00:29,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:00:29,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 23:00:29,350 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:00:29,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 23:00:29,440 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 23:00:29,441 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [4] total 12 [2019-10-13 23:00:29,441 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047066964] [2019-10-13 23:00:29,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 23:00:29,443 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:00:29,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 23:00:29,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:00:29,445 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand 10 states. [2019-10-13 23:00:29,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:00:29,553 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2019-10-13 23:00:29,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 23:00:29,554 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-10-13 23:00:29,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:00:29,555 INFO L225 Difference]: With dead ends: 34 [2019-10-13 23:00:29,555 INFO L226 Difference]: Without dead ends: 29 [2019-10-13 23:00:29,556 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-10-13 23:00:29,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-13 23:00:29,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2019-10-13 23:00:29,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-13 23:00:29,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-10-13 23:00:29,562 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 17 [2019-10-13 23:00:29,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:00:29,562 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-10-13 23:00:29,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 23:00:29,563 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2019-10-13 23:00:29,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 23:00:29,564 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:00:29,564 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:00:29,767 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:00:29,768 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:00:29,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:00:29,769 INFO L82 PathProgramCache]: Analyzing trace with hash -68639491, now seen corresponding path program 1 times [2019-10-13 23:00:29,770 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:00:29,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244356855] [2019-10-13 23:00:29,771 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:00:29,771 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:00:29,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:00:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:00:29,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 23:00:29,901 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244356855] [2019-10-13 23:00:29,902 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346892749] [2019-10-13 23:00:29,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:00:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:00:29,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 23:00:29,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:00:29,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 23:00:29,991 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:00:30,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 23:00:30,022 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 23:00:30,022 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 8 [2019-10-13 23:00:30,023 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47303337] [2019-10-13 23:00:30,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:00:30,024 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:00:30,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:00:30,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:00:30,025 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 6 states. [2019-10-13 23:00:30,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:00:30,091 INFO L93 Difference]: Finished difference Result 55 states and 76 transitions. [2019-10-13 23:00:30,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:00:30,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-13 23:00:30,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:00:30,093 INFO L225 Difference]: With dead ends: 55 [2019-10-13 23:00:30,093 INFO L226 Difference]: Without dead ends: 40 [2019-10-13 23:00:30,094 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:00:30,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-13 23:00:30,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 29. [2019-10-13 23:00:30,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-13 23:00:30,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2019-10-13 23:00:30,101 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 20 [2019-10-13 23:00:30,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:00:30,101 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-10-13 23:00:30,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:00:30,102 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2019-10-13 23:00:30,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 23:00:30,102 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:00:30,103 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:00:30,310 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:00:30,310 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:00:30,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:00:30,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1439104631, now seen corresponding path program 1 times [2019-10-13 23:00:30,311 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:00:30,311 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572823456] [2019-10-13 23:00:30,312 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:00:30,312 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:00:30,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:00:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:00:30,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 23:00:30,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572823456] [2019-10-13 23:00:30,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700287462] [2019-10-13 23:00:30,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:00:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:00:30,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-13 23:00:30,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:00:30,568 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-13 23:00:30,575 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 23:00:30,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 23:00:30,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 23:00:30,584 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-13 23:00:30,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 23:00:30,593 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:00:30,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:00:30,668 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 23:00:30,672 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 13 [2019-10-13 23:00:30,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 23:00:30,683 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 23:00:30,684 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2019-10-13 23:00:30,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:00:30,686 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 23:00:30,696 INFO L567 ElimStorePlain]: treesize reduction 13, result has 35.0 percent of original size [2019-10-13 23:00:30,696 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 23:00:30,696 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:7 [2019-10-13 23:00:30,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 23:00:30,724 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 23:00:30,724 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 9] total 15 [2019-10-13 23:00:30,724 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543467874] [2019-10-13 23:00:30,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:00:30,725 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:00:30,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:00:30,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-10-13 23:00:30,726 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand 7 states. [2019-10-13 23:00:30,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:00:30,887 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2019-10-13 23:00:30,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 23:00:30,887 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-10-13 23:00:30,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:00:30,888 INFO L225 Difference]: With dead ends: 42 [2019-10-13 23:00:30,888 INFO L226 Difference]: Without dead ends: 27 [2019-10-13 23:00:30,889 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-13 23:00:30,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-13 23:00:30,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-13 23:00:30,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-13 23:00:30,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-10-13 23:00:30,894 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 21 [2019-10-13 23:00:30,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:00:30,895 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-10-13 23:00:30,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:00:30,895 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2019-10-13 23:00:30,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 23:00:30,896 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:00:30,896 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:00:31,099 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:00:31,101 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:00:31,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:00:31,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1784666200, now seen corresponding path program 1 times [2019-10-13 23:00:31,102 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:00:31,102 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335808427] [2019-10-13 23:00:31,103 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:00:31,103 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:00:31,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:00:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:00:31,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 23:00:31,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335808427] [2019-10-13 23:00:31,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778508837] [2019-10-13 23:00:31,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:00:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:00:31,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-13 23:00:31,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:00:31,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-10-13 23:00:31,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 23:00:31,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 23:00:31,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 23:00:31,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-10-13 23:00:31,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 23:00:31,369 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:00:31,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:00:31,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:00:31,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:00:31,444 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 23:00:31,445 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2019-10-13 23:00:31,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:00:31,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 23:00:31,452 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 23:00:31,455 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 13 [2019-10-13 23:00:31,455 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 23:00:31,459 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 23:00:31,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 23:00:31,465 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 23:00:31,465 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 15 [2019-10-13 23:00:31,466 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 23:00:31,477 INFO L567 ElimStorePlain]: treesize reduction 13, result has 35.0 percent of original size [2019-10-13 23:00:31,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 23:00:31,478 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:85, output treesize:7 [2019-10-13 23:00:31,495 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 23:00:31,496 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [412674754] [2019-10-13 23:00:31,523 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-13 23:00:31,524 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:00:31,537 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:00:31,545 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:00:31,545 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:00:31,669 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 23:00:31,925 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:32,327 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 34 for LOIs [2019-10-13 23:00:32,340 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 23:00:32,345 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 23:00:32,346 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 23:00:32,346 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 455#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 23:00:32,346 INFO L193 IcfgInterpreter]: Reachable states at location L24-1 satisfy 101#(and (= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ |main_~#string_entrada~0.offset| (ite (<= (mod main_~n_caracter~0 4294967296) 2147483647) (mod main_~n_caracter~0 4294967296) (+ (mod main_~n_caracter~0 4294967296) (- 4294967296))))) |main_#t~mem2|) (<= 0 main_~n_caracter~0)) [2019-10-13 23:00:32,346 INFO L193 IcfgInterpreter]: Reachable states at location L35-1 satisfy 432#(= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ |main_~#string_entrada~0.offset| (ite (<= (mod main_~i~0 4294967296) 2147483647) (mod main_~i~0 4294967296) (+ (mod main_~i~0 4294967296) (- 4294967296))))) |main_#t~mem9|) [2019-10-13 23:00:32,347 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 372#(and (<= 0 main_~i~0) (<= 0 main_~cont~0) (<= 0 main_~n_caracter~0)) [2019-10-13 23:00:32,347 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 441#(and (exists ((|v_main_~#string_entrada~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_main_~i~0_BEFORE_CALL_1 Int) (|v_main_~#string_entrada~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= (mod v_main_~i~0_BEFORE_CALL_1 4294967296) 2147483647) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_1|) (+ (mod v_main_~i~0_BEFORE_CALL_1 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_1|)) 0)) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_2) (+ (mod v_prenex_3 4294967296) v_prenex_4 (- 4294967296))) 0) (not (<= (mod v_prenex_3 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_2) (+ (mod v_prenex_3 4294967296) v_prenex_4 (- 4294967296))) 0) (not (<= (mod v_prenex_3 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (mod v_main_~i~0_BEFORE_CALL_1 4294967296) 2147483647) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_1|) (+ (mod v_main_~i~0_BEFORE_CALL_1 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_1|)) 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 23:00:32,347 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 68#true [2019-10-13 23:00:32,347 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 364#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= 0 main_~cont~0) (<= 0 main_~n_caracter~0)) [2019-10-13 23:00:32,348 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 23:00:32,348 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 23:00:32,348 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 460#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 23:00:32,348 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 23:00:32,349 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 451#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#string_entrada~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_main_~i~0_BEFORE_CALL_1 Int) (|v_main_~#string_entrada~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= (mod v_main_~i~0_BEFORE_CALL_1 4294967296) 2147483647) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_1|) (+ (mod v_main_~i~0_BEFORE_CALL_1 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_1|)) 0)) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_2) (+ (mod v_prenex_3 4294967296) v_prenex_4 (- 4294967296))) 0) (not (<= (mod v_prenex_3 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_2) (+ (mod v_prenex_3 4294967296) v_prenex_4 (- 4294967296))) 0) (not (<= (mod v_prenex_3 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (mod v_main_~i~0_BEFORE_CALL_1 4294967296) 2147483647) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_1|) (+ (mod v_main_~i~0_BEFORE_CALL_1 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_1|)) 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 23:00:32,349 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 446#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#string_entrada~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_main_~i~0_BEFORE_CALL_1 Int) (|v_main_~#string_entrada~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= (mod v_main_~i~0_BEFORE_CALL_1 4294967296) 2147483647) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_1|) (+ (mod v_main_~i~0_BEFORE_CALL_1 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_1|)) 0)) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_2) (+ (mod v_prenex_3 4294967296) v_prenex_4 (- 4294967296))) 0) (not (<= (mod v_prenex_3 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_2) (+ (mod v_prenex_3 4294967296) v_prenex_4 (- 4294967296))) 0) (not (<= (mod v_prenex_3 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (mod v_main_~i~0_BEFORE_CALL_1 4294967296) 2147483647) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_1|) (+ (mod v_main_~i~0_BEFORE_CALL_1 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_1|)) 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 23:00:32,349 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 436#(exists ((|v_main_~#string_entrada~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_main_~i~0_BEFORE_CALL_1 Int) (|v_main_~#string_entrada~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= (mod v_main_~i~0_BEFORE_CALL_1 4294967296) 2147483647) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_1|) (+ (mod v_main_~i~0_BEFORE_CALL_1 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_1|)) 0)) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_2) (+ (mod v_prenex_3 4294967296) v_prenex_4 (- 4294967296))) 0) (not (<= (mod v_prenex_3 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_2) (+ (mod v_prenex_3 4294967296) v_prenex_4 (- 4294967296))) 0) (not (<= (mod v_prenex_3 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (mod v_main_~i~0_BEFORE_CALL_1 4294967296) 2147483647) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_1|) (+ (mod v_main_~i~0_BEFORE_CALL_1 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_1|)) 0)))) [2019-10-13 23:00:32,350 INFO L193 IcfgInterpreter]: Reachable states at location L24-4 satisfy 106#(and (or (and (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#string_entrada~0.offset| (- 4294967296)))) (not (<= (mod main_~n_caracter~0 4294967296) 2147483647))) (and (<= (mod main_~n_caracter~0 4294967296) 2147483647) (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#string_entrada~0.offset|))))) (<= 0 main_~n_caracter~0)) [2019-10-13 23:00:32,350 INFO L193 IcfgInterpreter]: Reachable states at location L35-4 satisfy 427#(or (and (not (<= (mod main_~i~0 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ |main_~#string_entrada~0.offset| (mod main_~i~0 4294967296) (- 4294967296))) 0)) (and (= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ |main_~#string_entrada~0.offset| (mod main_~i~0 4294967296))) 0) (<= (mod main_~i~0 4294967296) 2147483647))) [2019-10-13 23:00:32,350 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 96#(<= 0 main_~n_caracter~0) [2019-10-13 23:00:32,351 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 385#true [2019-10-13 23:00:33,183 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 23:00:33,184 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 7, 15] total 29 [2019-10-13 23:00:33,184 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933523487] [2019-10-13 23:00:33,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-13 23:00:33,186 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:00:33,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-13 23:00:33,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=729, Unknown=0, NotChecked=0, Total=812 [2019-10-13 23:00:33,187 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 29 states. [2019-10-13 23:00:35,116 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-10-13 23:00:35,371 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-10-13 23:00:35,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:00:35,660 INFO L93 Difference]: Finished difference Result 50 states and 73 transitions. [2019-10-13 23:00:35,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-13 23:00:35,661 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 22 [2019-10-13 23:00:35,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:00:35,661 INFO L225 Difference]: With dead ends: 50 [2019-10-13 23:00:35,661 INFO L226 Difference]: Without dead ends: 35 [2019-10-13 23:00:35,663 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=434, Invalid=2322, Unknown=0, NotChecked=0, Total=2756 [2019-10-13 23:00:35,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-13 23:00:35,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-10-13 23:00:35,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-13 23:00:35,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-10-13 23:00:35,670 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 22 [2019-10-13 23:00:35,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:00:35,671 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-10-13 23:00:35,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-13 23:00:35,671 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-10-13 23:00:35,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 23:00:35,672 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:00:35,672 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:00:35,884 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:00:35,884 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:00:35,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:00:35,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1863962312, now seen corresponding path program 1 times [2019-10-13 23:00:35,885 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:00:35,885 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390551566] [2019-10-13 23:00:35,885 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:00:35,885 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:00:35,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:00:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:00:35,996 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 23:00:35,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390551566] [2019-10-13 23:00:35,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258613872] [2019-10-13 23:00:35,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:00:36,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:00:36,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-13 23:00:36,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:00:36,098 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-13 23:00:36,099 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:00:36,159 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 23:00:36,160 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2091633079] [2019-10-13 23:00:36,162 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 23:00:36,162 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:00:36,163 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:00:36,163 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:00:36,164 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:00:36,202 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 23:00:36,355 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:37,003 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 34 for LOIs [2019-10-13 23:00:37,010 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 23:00:37,014 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 23:00:37,014 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 23:00:37,014 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 773#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 23:00:37,015 INFO L193 IcfgInterpreter]: Reachable states at location L24-1 satisfy 115#(and (= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ |main_~#string_entrada~0.offset| (ite (<= (mod main_~n_caracter~0 4294967296) 2147483647) (mod main_~n_caracter~0 4294967296) (+ (mod main_~n_caracter~0 4294967296) (- 4294967296))))) |main_#t~mem2|) (<= 0 main_~n_caracter~0)) [2019-10-13 23:00:37,015 INFO L193 IcfgInterpreter]: Reachable states at location L35-1 satisfy 708#(= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ |main_~#string_entrada~0.offset| (ite (<= (mod main_~i~0 4294967296) 2147483647) (mod main_~i~0 4294967296) (+ (mod main_~i~0 4294967296) (- 4294967296))))) |main_#t~mem9|) [2019-10-13 23:00:37,015 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 609#(<= 0 main_~j~0) [2019-10-13 23:00:37,015 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 759#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#string_entrada~0.base_BEFORE_CALL_2| Int) (v_main_~i~0_BEFORE_CALL_2 Int) (|v_main_~#string_entrada~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (mod v_prenex_6 4294967296) 2147483647)) (= 0 (select (select |#memory_int| v_prenex_5) (+ (mod v_prenex_6 4294967296) v_prenex_7 (- 4294967296))))) (and (<= (mod v_main_~i~0_BEFORE_CALL_2 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_2|) (+ (mod v_main_~i~0_BEFORE_CALL_2 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_2|)) 0)) (and (<= (mod v_main_~i~0_BEFORE_CALL_2 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_2|) (+ (mod v_main_~i~0_BEFORE_CALL_2 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_2|)) 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (not (<= (mod v_prenex_6 4294967296) 2147483647)) (= 0 (select (select |#memory_int| v_prenex_5) (+ (mod v_prenex_6 4294967296) v_prenex_7 (- 4294967296))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 23:00:37,016 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 434#(and (<= 0 main_~i~0) (<= 0 main_~cont~0) (<= 0 main_~n_caracter~0)) [2019-10-13 23:00:37,017 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 68#true [2019-10-13 23:00:37,017 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 426#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= 0 main_~cont~0) (<= 0 main_~n_caracter~0)) [2019-10-13 23:00:37,018 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 23:00:37,018 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 23:00:37,018 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 778#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 23:00:37,018 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 23:00:37,019 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 769#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#string_entrada~0.base_BEFORE_CALL_2| Int) (v_main_~i~0_BEFORE_CALL_2 Int) (|v_main_~#string_entrada~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (mod v_prenex_6 4294967296) 2147483647)) (= 0 (select (select |#memory_int| v_prenex_5) (+ (mod v_prenex_6 4294967296) v_prenex_7 (- 4294967296))))) (and (<= (mod v_main_~i~0_BEFORE_CALL_2 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_2|) (+ (mod v_main_~i~0_BEFORE_CALL_2 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_2|)) 0)) (and (<= (mod v_main_~i~0_BEFORE_CALL_2 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_2|) (+ (mod v_main_~i~0_BEFORE_CALL_2 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_2|)) 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (not (<= (mod v_prenex_6 4294967296) 2147483647)) (= 0 (select (select |#memory_int| v_prenex_5) (+ (mod v_prenex_6 4294967296) v_prenex_7 (- 4294967296))))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 23:00:37,019 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 764#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#string_entrada~0.base_BEFORE_CALL_2| Int) (v_main_~i~0_BEFORE_CALL_2 Int) (|v_main_~#string_entrada~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (mod v_prenex_6 4294967296) 2147483647)) (= 0 (select (select |#memory_int| v_prenex_5) (+ (mod v_prenex_6 4294967296) v_prenex_7 (- 4294967296))))) (and (<= (mod v_main_~i~0_BEFORE_CALL_2 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_2|) (+ (mod v_main_~i~0_BEFORE_CALL_2 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_2|)) 0)) (and (<= (mod v_main_~i~0_BEFORE_CALL_2 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_2|) (+ (mod v_main_~i~0_BEFORE_CALL_2 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_2|)) 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (not (<= (mod v_prenex_6 4294967296) 2147483647)) (= 0 (select (select |#memory_int| v_prenex_5) (+ (mod v_prenex_6 4294967296) v_prenex_7 (- 4294967296))))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 23:00:37,019 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 754#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#string_entrada~0.base_BEFORE_CALL_2| Int) (v_main_~i~0_BEFORE_CALL_2 Int) (|v_main_~#string_entrada~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (mod v_prenex_6 4294967296) 2147483647)) (= 0 (select (select |#memory_int| v_prenex_5) (+ (mod v_prenex_6 4294967296) v_prenex_7 (- 4294967296))))) (and (<= (mod v_main_~i~0_BEFORE_CALL_2 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_2|) (+ (mod v_main_~i~0_BEFORE_CALL_2 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_2|)) 0)) (and (<= (mod v_main_~i~0_BEFORE_CALL_2 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_2|) (+ (mod v_main_~i~0_BEFORE_CALL_2 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_2|)) 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (not (<= (mod v_prenex_6 4294967296) 2147483647)) (= 0 (select (select |#memory_int| v_prenex_5) (+ (mod v_prenex_6 4294967296) v_prenex_7 (- 4294967296))))))) [2019-10-13 23:00:37,019 INFO L193 IcfgInterpreter]: Reachable states at location L24-4 satisfy 120#(and (or (and (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#string_entrada~0.offset| (- 4294967296)))) (not (<= (mod main_~n_caracter~0 4294967296) 2147483647))) (and (<= (mod main_~n_caracter~0 4294967296) 2147483647) (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#string_entrada~0.offset|))))) (<= 0 main_~n_caracter~0)) [2019-10-13 23:00:37,019 INFO L193 IcfgInterpreter]: Reachable states at location L35-4 satisfy 661#(or (and (not (<= (mod main_~i~0 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ |main_~#string_entrada~0.offset| (mod main_~i~0 4294967296) (- 4294967296))) 0)) (and (= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ |main_~#string_entrada~0.offset| (mod main_~i~0 4294967296))) 0) (<= (mod main_~i~0 4294967296) 2147483647))) [2019-10-13 23:00:37,020 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 110#(<= 0 main_~n_caracter~0) [2019-10-13 23:00:37,020 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 750#true [2019-10-13 23:00:37,551 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 23:00:37,551 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 6, 16] total 26 [2019-10-13 23:00:37,552 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271730157] [2019-10-13 23:00:37,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-13 23:00:37,553 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:00:37,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-13 23:00:37,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2019-10-13 23:00:37,554 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 26 states. [2019-10-13 23:00:38,901 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-10-13 23:00:39,983 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-10-13 23:00:41,510 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-10-13 23:00:42,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:00:42,562 INFO L93 Difference]: Finished difference Result 100 states and 136 transitions. [2019-10-13 23:00:42,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-10-13 23:00:42,563 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 28 [2019-10-13 23:00:42,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:00:42,566 INFO L225 Difference]: With dead ends: 100 [2019-10-13 23:00:42,566 INFO L226 Difference]: Without dead ends: 78 [2019-10-13 23:00:42,569 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1151 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=868, Invalid=4244, Unknown=0, NotChecked=0, Total=5112 [2019-10-13 23:00:42,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-13 23:00:42,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 34. [2019-10-13 23:00:42,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-13 23:00:42,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-10-13 23:00:42,578 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 28 [2019-10-13 23:00:42,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:00:42,579 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-10-13 23:00:42,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-13 23:00:42,579 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-10-13 23:00:42,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-13 23:00:42,580 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:00:42,580 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:00:42,783 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:00:42,790 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:00:42,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:00:42,790 INFO L82 PathProgramCache]: Analyzing trace with hash -988618494, now seen corresponding path program 2 times [2019-10-13 23:00:42,790 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:00:42,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328183661] [2019-10-13 23:00:42,790 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:00:42,790 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:00:42,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:00:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:00:42,914 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-13 23:00:42,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328183661] [2019-10-13 23:00:42,915 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817775391] [2019-10-13 23:00:42,915 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:00:43,052 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 23:00:43,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 23:00:43,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-13 23:00:43,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:00:43,086 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-13 23:00:43,087 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:00:43,172 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-13 23:00:43,172 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2108915738] [2019-10-13 23:00:43,174 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 23:00:43,174 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:00:43,174 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:00:43,175 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:00:43,175 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:00:43,191 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 23:00:43,273 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:43,599 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 34 for LOIs [2019-10-13 23:00:43,604 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 23:00:43,607 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 23:00:43,607 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 23:00:43,607 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 712#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 23:00:43,607 INFO L193 IcfgInterpreter]: Reachable states at location L24-1 satisfy 115#(and (= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ |main_~#string_entrada~0.offset| (ite (<= (mod main_~n_caracter~0 4294967296) 2147483647) (mod main_~n_caracter~0 4294967296) (+ (mod main_~n_caracter~0 4294967296) (- 4294967296))))) |main_#t~mem2|) (<= 0 main_~n_caracter~0)) [2019-10-13 23:00:43,608 INFO L193 IcfgInterpreter]: Reachable states at location L35-1 satisfy 647#(= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ |main_~#string_entrada~0.offset| (ite (<= (mod main_~i~0 4294967296) 2147483647) (mod main_~i~0 4294967296) (+ (mod main_~i~0 4294967296) (- 4294967296))))) |main_#t~mem9|) [2019-10-13 23:00:43,608 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 561#(<= 0 main_~j~0) [2019-10-13 23:00:43,608 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 698#(and (exists ((|v_main_~#string_entrada~0.base_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (v_main_~i~0_BEFORE_CALL_3 Int) (|v_main_~#string_entrada~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_3|) (+ (mod v_main_~i~0_BEFORE_CALL_3 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_3| (- 4294967296))) 0) (not (<= (mod v_main_~i~0_BEFORE_CALL_3 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_3|) (+ (mod v_main_~i~0_BEFORE_CALL_3 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_3| (- 4294967296))) 0) (not (<= (mod v_main_~i~0_BEFORE_CALL_3 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) (+ (mod v_prenex_10 4294967296) v_prenex_11)) 0) (<= (mod v_prenex_10 4294967296) 2147483647)) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_9) (+ (mod v_prenex_10 4294967296) v_prenex_11)) 0) (<= (mod v_prenex_10 4294967296) 2147483647)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 23:00:43,608 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 386#(and (<= 0 main_~i~0) (<= 0 main_~cont~0) (<= 0 main_~n_caracter~0)) [2019-10-13 23:00:43,609 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 68#true [2019-10-13 23:00:43,609 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 378#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= 0 main_~cont~0) (<= 0 main_~n_caracter~0)) [2019-10-13 23:00:43,609 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 23:00:43,609 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 23:00:43,609 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 717#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 23:00:43,610 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 23:00:43,610 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 708#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#string_entrada~0.base_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (v_main_~i~0_BEFORE_CALL_3 Int) (|v_main_~#string_entrada~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_3|) (+ (mod v_main_~i~0_BEFORE_CALL_3 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_3| (- 4294967296))) 0) (not (<= (mod v_main_~i~0_BEFORE_CALL_3 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_3|) (+ (mod v_main_~i~0_BEFORE_CALL_3 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_3| (- 4294967296))) 0) (not (<= (mod v_main_~i~0_BEFORE_CALL_3 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) (+ (mod v_prenex_10 4294967296) v_prenex_11)) 0) (<= (mod v_prenex_10 4294967296) 2147483647)) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_9) (+ (mod v_prenex_10 4294967296) v_prenex_11)) 0) (<= (mod v_prenex_10 4294967296) 2147483647)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 23:00:43,610 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 703#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#string_entrada~0.base_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (v_main_~i~0_BEFORE_CALL_3 Int) (|v_main_~#string_entrada~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_3|) (+ (mod v_main_~i~0_BEFORE_CALL_3 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_3| (- 4294967296))) 0) (not (<= (mod v_main_~i~0_BEFORE_CALL_3 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_3|) (+ (mod v_main_~i~0_BEFORE_CALL_3 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_3| (- 4294967296))) 0) (not (<= (mod v_main_~i~0_BEFORE_CALL_3 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) (+ (mod v_prenex_10 4294967296) v_prenex_11)) 0) (<= (mod v_prenex_10 4294967296) 2147483647)) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_9) (+ (mod v_prenex_10 4294967296) v_prenex_11)) 0) (<= (mod v_prenex_10 4294967296) 2147483647)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 23:00:43,610 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 693#(exists ((|v_main_~#string_entrada~0.base_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (v_main_~i~0_BEFORE_CALL_3 Int) (|v_main_~#string_entrada~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_3|) (+ (mod v_main_~i~0_BEFORE_CALL_3 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_3| (- 4294967296))) 0) (not (<= (mod v_main_~i~0_BEFORE_CALL_3 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#string_entrada~0.base_BEFORE_CALL_3|) (+ (mod v_main_~i~0_BEFORE_CALL_3 4294967296) |v_main_~#string_entrada~0.offset_BEFORE_CALL_3| (- 4294967296))) 0) (not (<= (mod v_main_~i~0_BEFORE_CALL_3 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) (+ (mod v_prenex_10 4294967296) v_prenex_11)) 0) (<= (mod v_prenex_10 4294967296) 2147483647)) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_9) (+ (mod v_prenex_10 4294967296) v_prenex_11)) 0) (<= (mod v_prenex_10 4294967296) 2147483647)))) [2019-10-13 23:00:43,611 INFO L193 IcfgInterpreter]: Reachable states at location L24-4 satisfy 120#(and (or (and (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#string_entrada~0.offset| (- 4294967296)))) (not (<= (mod main_~n_caracter~0 4294967296) 2147483647))) (and (<= (mod main_~n_caracter~0 4294967296) 2147483647) (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#string_entrada~0.offset|))))) (<= 0 main_~n_caracter~0)) [2019-10-13 23:00:43,611 INFO L193 IcfgInterpreter]: Reachable states at location L35-4 satisfy 613#(or (and (not (<= (mod main_~i~0 4294967296) 2147483647)) (= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ |main_~#string_entrada~0.offset| (mod main_~i~0 4294967296) (- 4294967296))) 0)) (and (= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ |main_~#string_entrada~0.offset| (mod main_~i~0 4294967296))) 0) (<= (mod main_~i~0 4294967296) 2147483647))) [2019-10-13 23:00:43,611 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 110#(<= 0 main_~n_caracter~0) [2019-10-13 23:00:43,611 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 689#true [2019-10-13 23:00:44,117 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 23:00:44,118 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 16] total 28 [2019-10-13 23:00:44,118 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782412428] [2019-10-13 23:00:44,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-13 23:00:44,119 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:00:44,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-13 23:00:44,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2019-10-13 23:00:44,120 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 28 states. [2019-10-13 23:00:51,340 WARN L191 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-10-13 23:00:51,995 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-10-13 23:00:54,502 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 49 [2019-10-13 23:00:56,788 WARN L191 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-10-13 23:01:01,035 WARN L191 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-10-13 23:01:01,822 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-10-13 23:01:02,051 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48