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-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:47:36,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:47:36,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:47:36,569 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:47:36,570 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:47:36,571 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:47:36,572 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:47:36,574 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:47:36,576 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:47:36,577 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:47:36,578 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:47:36,579 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:47:36,579 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:47:36,580 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:47:36,581 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:47:36,583 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:47:36,583 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:47:36,587 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:47:36,589 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:47:36,591 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:47:36,595 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:47:36,597 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:47:36,600 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:47:36,601 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:47:36,607 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:47:36,607 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:47:36,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:47:36,609 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:47:36,610 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:47:36,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:47:36,612 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:47:36,614 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:47:36,615 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:47:36,617 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:47:36,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:47:36,620 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:47:36,621 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:47:36,621 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:47:36,621 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:47:36,622 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:47:36,623 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:47:36,627 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-07 13:47:36,641 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:47:36,641 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:47:36,642 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:47:36,642 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:47:36,642 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:47:36,643 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:47:36,643 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:47:36,643 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:47:36,643 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:47:36,644 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:47:36,644 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:47:36,644 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:47:36,644 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:47:36,644 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:47:36,645 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:47:36,645 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:47:36,645 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:47:36,645 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:47:36,645 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:47:36,646 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:47:36,646 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:47:36,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:47:36,646 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:47:36,646 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:47:36,647 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:47:36,647 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:47:36,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:47:36,647 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:47:36,647 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-07 13:47:36,978 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:47:36,998 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:47:37,002 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:47:37,003 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:47:37,004 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:47:37,004 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/vogal-1.i [2019-10-07 13:47:37,075 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/089ce8d78/14eb017a2ad44a1192573046115a5bd3/FLAGfc72e1ff7 [2019-10-07 13:47:37,531 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:47:37,531 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/vogal-1.i [2019-10-07 13:47:37,538 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/089ce8d78/14eb017a2ad44a1192573046115a5bd3/FLAGfc72e1ff7 [2019-10-07 13:47:37,894 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/089ce8d78/14eb017a2ad44a1192573046115a5bd3 [2019-10-07 13:47:37,904 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:47:37,905 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:47:37,906 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:47:37,906 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:47:37,910 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:47:37,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:47:37" (1/1) ... [2019-10-07 13:47:37,914 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ae83f00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:47:37, skipping insertion in model container [2019-10-07 13:47:37,914 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:47:37" (1/1) ... [2019-10-07 13:47:37,921 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:47:37,942 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:47:38,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:47:38,127 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:47:38,165 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:47:38,181 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:47:38,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:47:38 WrapperNode [2019-10-07 13:47:38,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:47:38,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:47:38,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:47:38,183 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:47:38,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:47:38" (1/1) ... [2019-10-07 13:47:38,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:47:38" (1/1) ... [2019-10-07 13:47:38,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:47:38" (1/1) ... [2019-10-07 13:47:38,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:47:38" (1/1) ... [2019-10-07 13:47:38,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:47:38" (1/1) ... [2019-10-07 13:47:38,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:47:38" (1/1) ... [2019-10-07 13:47:38,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:47:38" (1/1) ... [2019-10-07 13:47:38,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:47:38,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:47:38,302 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:47:38,302 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:47:38,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:47:38" (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-07 13:47:38,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:47:38,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:47:38,368 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 13:47:38,368 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:47:38,368 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:47:38,368 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-07 13:47:38,368 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 13:47:38,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-07 13:47:38,369 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:47:38,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 13:47:38,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-07 13:47:38,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 13:47:38,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 13:47:38,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 13:47:38,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:47:38,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:47:38,837 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:47:38,838 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-07 13:47:38,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:47:38 BoogieIcfgContainer [2019-10-07 13:47:38,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:47:38,840 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:47:38,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:47:38,844 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:47:38,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:47:37" (1/3) ... [2019-10-07 13:47:38,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aede4f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:47:38, skipping insertion in model container [2019-10-07 13:47:38,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:47:38" (2/3) ... [2019-10-07 13:47:38,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aede4f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:47:38, skipping insertion in model container [2019-10-07 13:47:38,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:47:38" (3/3) ... [2019-10-07 13:47:38,847 INFO L109 eAbstractionObserver]: Analyzing ICFG vogal-1.i [2019-10-07 13:47:38,856 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:47:38,864 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:47:38,874 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:47:38,902 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:47:38,902 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:47:38,902 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:47:38,902 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:47:38,902 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:47:38,902 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:47:38,902 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:47:38,903 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:47:38,917 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-10-07 13:47:38,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 13:47:38,922 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:47:38,923 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:47:38,925 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:47:38,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:47:38,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1006628031, now seen corresponding path program 1 times [2019-10-07 13:47:38,937 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:47:38,937 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:38,937 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:38,937 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:38,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:47:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:47:39,085 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-07 13:47:39,085 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:39,086 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:47:39,086 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-07 13:47:39,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-07 13:47:39,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-07 13:47:39,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 13:47:39,109 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-10-07 13:47:39,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:47:39,135 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2019-10-07 13:47:39,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-07 13:47:39,137 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-10-07 13:47:39,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:47:39,145 INFO L225 Difference]: With dead ends: 45 [2019-10-07 13:47:39,146 INFO L226 Difference]: Without dead ends: 20 [2019-10-07 13:47:39,149 INFO L606 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-07 13:47:39,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-07 13:47:39,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-07 13:47:39,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-07 13:47:39,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-10-07 13:47:39,187 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 15 [2019-10-07 13:47:39,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:47:39,187 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-10-07 13:47:39,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-07 13:47:39,188 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2019-10-07 13:47:39,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-07 13:47:39,189 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:47:39,189 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:47:39,189 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:47:39,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:47:39,190 INFO L82 PathProgramCache]: Analyzing trace with hash 154465315, now seen corresponding path program 1 times [2019-10-07 13:47:39,190 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:47:39,191 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:39,191 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:39,191 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:39,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:47:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:47:39,288 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-07 13:47:39,288 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:39,289 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:47:39,289 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:47:39,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:47:39,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:47:39,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:47:39,292 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand 3 states. [2019-10-07 13:47:39,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:47:39,362 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2019-10-07 13:47:39,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:47:39,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-07 13:47:39,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:47:39,366 INFO L225 Difference]: With dead ends: 41 [2019-10-07 13:47:39,366 INFO L226 Difference]: Without dead ends: 27 [2019-10-07 13:47:39,367 INFO L606 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-07 13:47:39,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-07 13:47:39,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2019-10-07 13:47:39,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-07 13:47:39,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2019-10-07 13:47:39,375 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 17 [2019-10-07 13:47:39,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:47:39,375 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-10-07 13:47:39,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:47:39,376 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2019-10-07 13:47:39,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-07 13:47:39,377 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:47:39,377 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:47:39,377 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:47:39,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:47:39,378 INFO L82 PathProgramCache]: Analyzing trace with hash -415101532, now seen corresponding path program 1 times [2019-10-07 13:47:39,378 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:47:39,378 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:39,378 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:39,379 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:39,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:47:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:47:39,485 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-07 13:47:39,486 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:39,486 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:47:39,486 INFO L95 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-07 13:47:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:47:39,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-07 13:47:39,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:47:39,618 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-07 13:47:39,618 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:47:39,703 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-07 13:47:39,704 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 13:47:39,704 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [4] total 12 [2019-10-07 13:47:39,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-07 13:47:39,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-07 13:47:39,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-10-07 13:47:39,706 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand 10 states. [2019-10-07 13:47:39,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:47:39,778 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2019-10-07 13:47:39,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:47:39,784 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-10-07 13:47:39,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:47:39,803 INFO L225 Difference]: With dead ends: 35 [2019-10-07 13:47:39,803 INFO L226 Difference]: Without dead ends: 30 [2019-10-07 13:47:39,804 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 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-07 13:47:39,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-07 13:47:39,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2019-10-07 13:47:39,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-07 13:47:39,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2019-10-07 13:47:39,810 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 18 [2019-10-07 13:47:39,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:47:39,811 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-10-07 13:47:39,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-07 13:47:39,811 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2019-10-07 13:47:39,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 13:47:39,812 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:47:39,812 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:47:40,017 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:47:40,018 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:47:40,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:47:40,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1072112129, now seen corresponding path program 1 times [2019-10-07 13:47:40,020 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:47:40,020 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:40,021 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:40,021 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:40,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:47:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:47:40,137 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-07 13:47:40,137 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:40,137 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:47:40,138 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:47:40,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:47:40,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:47:40,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:47:40,139 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 3 states. [2019-10-07 13:47:40,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:47:40,166 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2019-10-07 13:47:40,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:47:40,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-07 13:47:40,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:47:40,168 INFO L225 Difference]: With dead ends: 52 [2019-10-07 13:47:40,168 INFO L226 Difference]: Without dead ends: 37 [2019-10-07 13:47:40,168 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:47:40,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-07 13:47:40,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2019-10-07 13:47:40,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-07 13:47:40,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2019-10-07 13:47:40,175 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 21 [2019-10-07 13:47:40,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:47:40,176 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-10-07 13:47:40,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:47:40,176 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2019-10-07 13:47:40,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-07 13:47:40,177 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:47:40,177 INFO L385 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-07 13:47:40,177 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:47:40,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:47:40,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1398520043, now seen corresponding path program 1 times [2019-10-07 13:47:40,178 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:47:40,178 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:40,179 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:40,179 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:40,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:47:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:47:40,283 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-07 13:47:40,283 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:40,284 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:47:40,284 INFO L95 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-07 13:47:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:47:40,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-07 13:47:40,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:47:40,437 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-07 13:47:40,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 13:47:40,451 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 13:47:40,451 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-07 13:47:40,452 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-07 13:47:40,531 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-07 13:47:40,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 13:47:40,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 13:47:40,535 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-07 13:47:40,535 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-07 13:47:40,547 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-07 13:47:40,547 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:47:40,675 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-07 13:47:40,675 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 13:47:40,675 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 9] total 15 [2019-10-07 13:47:40,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:47:40,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:47:40,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-10-07 13:47:40,677 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand 7 states. [2019-10-07 13:47:40,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:47:40,870 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2019-10-07 13:47:40,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 13:47:40,871 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-10-07 13:47:40,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:47:40,872 INFO L225 Difference]: With dead ends: 43 [2019-10-07 13:47:40,873 INFO L226 Difference]: Without dead ends: 28 [2019-10-07 13:47:40,875 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-10-07 13:47:40,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-07 13:47:40,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-10-07 13:47:40,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-07 13:47:40,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-10-07 13:47:40,886 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 22 [2019-10-07 13:47:40,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:47:40,886 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-10-07 13:47:40,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:47:40,887 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2019-10-07 13:47:40,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-07 13:47:40,887 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:47:40,888 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:47:41,088 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:47:41,088 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:47:41,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:47:41,089 INFO L82 PathProgramCache]: Analyzing trace with hash -392356454, now seen corresponding path program 1 times [2019-10-07 13:47:41,090 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:47:41,090 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:41,090 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:41,090 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:41,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:47:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:47:41,185 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 13:47:41,186 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:41,186 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:47:41,186 INFO L95 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-07 13:47:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:47:41,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-07 13:47:41,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:47:41,271 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-07 13:47:41,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 13:47:41,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 13:47:41,279 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-07 13:47:41,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-07 13:47:41,352 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-07 13:47:41,353 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 13:47:41,355 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 13:47:41,355 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-07 13:47:41,356 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-10-07 13:47:41,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-07 13:47:41,369 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:47:41,490 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-07 13:47:41,490 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 13:47:41,490 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 9] total 15 [2019-10-07 13:47:41,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:47:41,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:47:41,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-10-07 13:47:41,491 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand 7 states. [2019-10-07 13:47:41,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:47:41,667 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2019-10-07 13:47:41,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 13:47:41,667 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-10-07 13:47:41,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:47:41,668 INFO L225 Difference]: With dead ends: 42 [2019-10-07 13:47:41,668 INFO L226 Difference]: Without dead ends: 37 [2019-10-07 13:47:41,669 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-10-07 13:47:41,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-07 13:47:41,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2019-10-07 13:47:41,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-07 13:47:41,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2019-10-07 13:47:41,676 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 23 [2019-10-07 13:47:41,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:47:41,676 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-10-07 13:47:41,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:47:41,676 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2019-10-07 13:47:41,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-07 13:47:41,677 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:47:41,677 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:47:41,881 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:47:41,881 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:47:41,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:47:41,882 INFO L82 PathProgramCache]: Analyzing trace with hash 996109488, now seen corresponding path program 1 times [2019-10-07 13:47:41,882 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:47:41,882 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:41,882 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:41,882 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:41,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:47:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:47:41,951 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-07 13:47:41,951 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:41,951 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:47:41,952 INFO L95 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-07 13:47:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:47:42,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-07 13:47:42,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:47:42,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-07 13:47:42,026 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:47:42,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 13:47:42,062 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:47:42,089 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-07 13:47:42,089 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:47:42,100 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:47:42,109 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:47:42,111 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:47:42,221 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:47:42,484 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:47:42,995 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-07 13:47:43,005 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:47:43,011 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:47:43,011 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:47:43,012 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 459#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:47:43,012 INFO L193 IcfgInterpreter]: Reachable states at location L24-1 satisfy 120#(and (= |main_#t~mem4| (select (select |#memory_int| |main_~#input_string~0.base|) (+ (ite (<= (mod main_~n_caracter~0 4294967296) 2147483647) (mod main_~n_caracter~0 4294967296) (+ (mod main_~n_caracter~0 4294967296) (- 4294967296))) |main_~#input_string~0.offset|))) (<= 0 main_~n_caracter~0)) [2019-10-07 13:47:43,012 INFO L193 IcfgInterpreter]: Reachable states at location L35-1 satisfy 317#(and (<= 0 main_~i~0) (= |main_#t~mem11| (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (ite (<= (mod main_~i~0 4294967296) 2147483647) (mod main_~i~0 4294967296) (+ (mod main_~i~0 4294967296) (- 4294967296)))))) (<= 0 main_~cont~0) (= main_~cont~0 0) (<= main_~cont~0 0) (<= 0 main_~n_caracter~0) (<= 0 main_~cont_aux~0)) [2019-10-07 13:47:43,013 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 436#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= 0 main_~cont~0) (= main_~cont~0 0) (<= main_~cont~0 0) (<= 0 main_~n_caracter~0) (<= 0 main_~cont_aux~0)) [2019-10-07 13:47:43,013 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 130#(and (<= 0 main_~i~0) (<= 0 main_~cont~0) (or (and (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#input_string~0.offset|))) (= main_~cont~0 0) (<= (mod main_~n_caracter~0 4294967296) 2147483647) (= main_~i~0 0)) (and (= main_~cont~0 0) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (not (<= (mod main_~n_caracter~0 4294967296) 2147483647)) (= main_~i~0 0))) (<= main_~cont~0 0) (<= main_~i~0 0) (<= 0 main_~n_caracter~0)) [2019-10-07 13:47:43,013 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 68#true [2019-10-07 13:47:43,013 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-07 13:47:43,014 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-07 13:47:43,014 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 464#(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-07 13:47:43,014 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:47:43,014 INFO L193 IcfgInterpreter]: Reachable states at location L6 satisfy 450#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#input_string~0.offset_BEFORE_CALL_1| Int) (v_main_~i~0_BEFORE_CALL_1 Int) (|v_main_~#input_string~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~i~0_BEFORE_CALL_1) (= 0 (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_1|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_1| (mod v_main_~i~0_BEFORE_CALL_1 4294967296)))) (<= (mod v_main_~i~0_BEFORE_CALL_1 4294967296) 2147483647)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (mod v_main_~i~0_BEFORE_CALL_1 4294967296) 2147483647)) (<= 0 v_main_~i~0_BEFORE_CALL_1) (= 0 (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_1|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_1| (mod v_main_~i~0_BEFORE_CALL_1 4294967296) (- 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 1) (not (<= (mod v_main_~i~0_BEFORE_CALL_1 4294967296) 2147483647)) (<= 0 v_main_~i~0_BEFORE_CALL_1) (= 0 (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_1|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_1| (mod v_main_~i~0_BEFORE_CALL_1 4294967296) (- 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~i~0_BEFORE_CALL_1) (= 0 (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_1|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_1| (mod v_main_~i~0_BEFORE_CALL_1 4294967296)))) (<= (mod v_main_~i~0_BEFORE_CALL_1 4294967296) 2147483647)))) (<= 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-07 13:47:43,015 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 445#(and (exists ((|v_main_~#input_string~0.offset_BEFORE_CALL_1| Int) (v_main_~i~0_BEFORE_CALL_1 Int) (|v_main_~#input_string~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~i~0_BEFORE_CALL_1) (= 0 (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_1|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_1| (mod v_main_~i~0_BEFORE_CALL_1 4294967296)))) (<= (mod v_main_~i~0_BEFORE_CALL_1 4294967296) 2147483647)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (mod v_main_~i~0_BEFORE_CALL_1 4294967296) 2147483647)) (<= 0 v_main_~i~0_BEFORE_CALL_1) (= 0 (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_1|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_1| (mod v_main_~i~0_BEFORE_CALL_1 4294967296) (- 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 1) (not (<= (mod v_main_~i~0_BEFORE_CALL_1 4294967296) 2147483647)) (<= 0 v_main_~i~0_BEFORE_CALL_1) (= 0 (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_1|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_1| (mod v_main_~i~0_BEFORE_CALL_1 4294967296) (- 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~i~0_BEFORE_CALL_1) (= 0 (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_1|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_1| (mod v_main_~i~0_BEFORE_CALL_1 4294967296)))) (<= (mod v_main_~i~0_BEFORE_CALL_1 4294967296) 2147483647)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:47:43,015 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 440#(exists ((|v_main_~#input_string~0.offset_BEFORE_CALL_1| Int) (v_main_~i~0_BEFORE_CALL_1 Int) (|v_main_~#input_string~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~i~0_BEFORE_CALL_1) (= 0 (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_1|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_1| (mod v_main_~i~0_BEFORE_CALL_1 4294967296)))) (<= (mod v_main_~i~0_BEFORE_CALL_1 4294967296) 2147483647)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (mod v_main_~i~0_BEFORE_CALL_1 4294967296) 2147483647)) (<= 0 v_main_~i~0_BEFORE_CALL_1) (= 0 (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_1|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_1| (mod v_main_~i~0_BEFORE_CALL_1 4294967296) (- 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 1) (not (<= (mod v_main_~i~0_BEFORE_CALL_1 4294967296) 2147483647)) (<= 0 v_main_~i~0_BEFORE_CALL_1) (= 0 (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_1|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_1| (mod v_main_~i~0_BEFORE_CALL_1 4294967296) (- 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~i~0_BEFORE_CALL_1) (= 0 (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_1|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_1| (mod v_main_~i~0_BEFORE_CALL_1 4294967296)))) (<= (mod v_main_~i~0_BEFORE_CALL_1 4294967296) 2147483647)))) [2019-10-07 13:47:43,015 INFO L193 IcfgInterpreter]: Reachable states at location L24-4 satisfy 125#(and (or (and (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (not (<= (mod main_~n_caracter~0 4294967296) 2147483647))) (and (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#input_string~0.offset|))) (<= (mod main_~n_caracter~0 4294967296) 2147483647))) (<= 0 main_~n_caracter~0)) [2019-10-07 13:47:43,015 INFO L193 IcfgInterpreter]: Reachable states at location L35-4 satisfy 322#(and (or (and (<= 0 main_~i~0) (= main_~cont~0 0) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|))) (<= (mod main_~i~0 4294967296) 2147483647)) (and (not (<= (mod main_~i~0 4294967296) 2147483647)) (<= 0 main_~i~0) (= main_~cont~0 0) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))))) (<= 0 main_~cont~0) (<= main_~cont~0 0) (<= 0 main_~n_caracter~0) (<= 0 main_~cont_aux~0)) [2019-10-07 13:47:43,016 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 455#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#input_string~0.offset_BEFORE_CALL_1| Int) (v_main_~i~0_BEFORE_CALL_1 Int) (|v_main_~#input_string~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~i~0_BEFORE_CALL_1) (= 0 (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_1|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_1| (mod v_main_~i~0_BEFORE_CALL_1 4294967296)))) (<= (mod v_main_~i~0_BEFORE_CALL_1 4294967296) 2147483647)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (mod v_main_~i~0_BEFORE_CALL_1 4294967296) 2147483647)) (<= 0 v_main_~i~0_BEFORE_CALL_1) (= 0 (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_1|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_1| (mod v_main_~i~0_BEFORE_CALL_1 4294967296) (- 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 1) (not (<= (mod v_main_~i~0_BEFORE_CALL_1 4294967296) 2147483647)) (<= 0 v_main_~i~0_BEFORE_CALL_1) (= 0 (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_1|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_1| (mod v_main_~i~0_BEFORE_CALL_1 4294967296) (- 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~i~0_BEFORE_CALL_1) (= 0 (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_1|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_1| (mod v_main_~i~0_BEFORE_CALL_1 4294967296)))) (<= (mod v_main_~i~0_BEFORE_CALL_1 4294967296) 2147483647)))) (<= 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-07 13:47:43,016 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 115#(<= 0 main_~n_caracter~0) [2019-10-07 13:47:43,016 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 73#(and (not (< (mod main_~i~0 4294967296) 5)) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 4)) |main_#t~mem3|)) [2019-10-07 13:47:43,017 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 312#(and (<= 0 main_~i~0) (<= 0 main_~cont~0) (= main_~cont~0 0) (<= main_~cont~0 0) (<= 0 main_~n_caracter~0) (<= 0 main_~cont_aux~0)) [2019-10-07 13:47:43,817 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:47:43,818 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5, 17] total 24 [2019-10-07 13:47:43,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-07 13:47:43,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-07 13:47:43,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2019-10-07 13:47:43,821 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand 24 states. [2019-10-07 13:47:44,856 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-10-07 13:47:45,181 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-10-07 13:47:46,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:47:46,105 INFO L93 Difference]: Finished difference Result 98 states and 136 transitions. [2019-10-07 13:47:46,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-07 13:47:46,105 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-10-07 13:47:46,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:47:46,106 INFO L225 Difference]: With dead ends: 98 [2019-10-07 13:47:46,107 INFO L226 Difference]: Without dead ends: 73 [2019-10-07 13:47:46,108 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=338, Invalid=2112, Unknown=0, NotChecked=0, Total=2450 [2019-10-07 13:47:46,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-07 13:47:46,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 32. [2019-10-07 13:47:46,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-07 13:47:46,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2019-10-07 13:47:46,118 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 24 [2019-10-07 13:47:46,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:47:46,118 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2019-10-07 13:47:46,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-07 13:47:46,118 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2019-10-07 13:47:46,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-07 13:47:46,119 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:47:46,119 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:47:46,332 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:47:46,332 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:47:46,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:47:46,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1447556309, now seen corresponding path program 1 times [2019-10-07 13:47:46,333 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:47:46,333 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:46,334 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:46,334 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:46,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:47:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:47:46,425 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 13:47:46,425 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:46,425 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:47:46,425 INFO L95 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-07 13:47:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:47:46,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-07 13:47:46,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:47:46,525 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 13:47:46,526 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:47:46,540 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-07 13:47:46,540 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 13:47:46,540 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 7 [2019-10-07 13:47:46,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:47:46,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:47:46,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:47:46,544 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 3 states. [2019-10-07 13:47:46,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:47:46,575 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2019-10-07 13:47:46,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:47:46,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-07 13:47:46,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:47:46,576 INFO L225 Difference]: With dead ends: 47 [2019-10-07 13:47:46,576 INFO L226 Difference]: Without dead ends: 30 [2019-10-07 13:47:46,577 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:47:46,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-07 13:47:46,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-07 13:47:46,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-07 13:47:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-10-07 13:47:46,588 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 27 [2019-10-07 13:47:46,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:47:46,590 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-10-07 13:47:46,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:47:46,590 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-10-07 13:47:46,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-07 13:47:46,593 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:47:46,593 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:47:46,797 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:47:46,798 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:47:46,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:47:46,798 INFO L82 PathProgramCache]: Analyzing trace with hash -559822302, now seen corresponding path program 1 times [2019-10-07 13:47:46,798 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:47:46,798 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:46,798 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:46,799 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:47:46,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:47:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:47:46,857 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-07 13:47:46,858 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:47:46,858 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:47:46,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-07 13:47:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:47:46,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-07 13:47:46,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:47:47,173 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-07 13:47:47,174 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:47:47,437 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-10-07 13:47:47,692 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:47:47,864 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:47:48,129 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 57 [2019-10-07 13:47:48,602 WARN L191 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-10-07 13:47:49,003 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2019-10-07 13:49:08,823 WARN L191 SmtUtils]: Spent 1.33 m on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2019-10-07 13:49:08,863 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-07 13:49:08,864 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:49:08,866 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-07 13:49:08,866 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:49:08,866 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:49:08,867 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:49:08,867 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:49:08,897 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:49:09,046 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:49:09,544 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 34 for LOIs [2019-10-07 13:49:09,555 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:49:09,559 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:49:09,560 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:49:09,560 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 765#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:49:09,560 INFO L193 IcfgInterpreter]: Reachable states at location L24-1 satisfy 120#(and (= |main_#t~mem4| (select (select |#memory_int| |main_~#input_string~0.base|) (+ (ite (<= (mod main_~n_caracter~0 4294967296) 2147483647) (mod main_~n_caracter~0 4294967296) (+ (mod main_~n_caracter~0 4294967296) (- 4294967296))) |main_~#input_string~0.offset|))) (<= 0 main_~n_caracter~0)) [2019-10-07 13:49:09,561 INFO L193 IcfgInterpreter]: Reachable states at location L35-1 satisfy 700#(= |main_#t~mem11| (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (ite (<= (mod main_~i~0 4294967296) 2147483647) (mod main_~i~0 4294967296) (+ (mod main_~i~0 4294967296) (- 4294967296)))))) [2019-10-07 13:49:09,561 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 614#(<= 0 main_~j~0) [2019-10-07 13:49:09,561 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 439#(and (<= 0 main_~i~0) (<= 0 main_~cont~0) (<= 0 main_~n_caracter~0)) [2019-10-07 13:49:09,561 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 431#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= 0 main_~cont~0) (<= 0 main_~n_caracter~0)) [2019-10-07 13:49:09,562 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 68#true [2019-10-07 13:49:09,562 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-07 13:49:09,562 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-07 13:49:09,562 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 770#(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-07 13:49:09,562 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:49:09,563 INFO L193 IcfgInterpreter]: Reachable states at location L6 satisfy 756#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#input_string~0.offset_BEFORE_CALL_2| Int) (v_prenex_18 Int) (v_prenex_20 Int) (|v_main_~#input_string~0.base_BEFORE_CALL_2| Int) (v_prenex_19 Int) (v_main_~i~0_BEFORE_CALL_2 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (<= (mod v_main_~i~0_BEFORE_CALL_2 4294967296) 2147483647)) (= 0 (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_2|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_2| (mod v_main_~i~0_BEFORE_CALL_2 4294967296) (- 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (mod v_main_~i~0_BEFORE_CALL_2 4294967296) 2147483647)) (= 0 (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_2|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_2| (mod v_main_~i~0_BEFORE_CALL_2 4294967296) (- 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= (mod v_prenex_20 4294967296) 2147483647) (= 0 (select (select |#memory_int| v_prenex_19) (+ v_prenex_18 (mod v_prenex_20 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (mod v_prenex_20 4294967296) 2147483647) (= 0 (select (select |#memory_int| v_prenex_19) (+ v_prenex_18 (mod v_prenex_20 4294967296))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:49:09,563 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 751#(and (exists ((|v_main_~#input_string~0.offset_BEFORE_CALL_2| Int) (v_prenex_18 Int) (v_prenex_20 Int) (|v_main_~#input_string~0.base_BEFORE_CALL_2| Int) (v_prenex_19 Int) (v_main_~i~0_BEFORE_CALL_2 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (<= (mod v_main_~i~0_BEFORE_CALL_2 4294967296) 2147483647)) (= 0 (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_2|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_2| (mod v_main_~i~0_BEFORE_CALL_2 4294967296) (- 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (mod v_main_~i~0_BEFORE_CALL_2 4294967296) 2147483647)) (= 0 (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_2|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_2| (mod v_main_~i~0_BEFORE_CALL_2 4294967296) (- 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= (mod v_prenex_20 4294967296) 2147483647) (= 0 (select (select |#memory_int| v_prenex_19) (+ v_prenex_18 (mod v_prenex_20 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (mod v_prenex_20 4294967296) 2147483647) (= 0 (select (select |#memory_int| v_prenex_19) (+ v_prenex_18 (mod v_prenex_20 4294967296))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:49:09,563 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 746#(exists ((|v_main_~#input_string~0.offset_BEFORE_CALL_2| Int) (v_prenex_18 Int) (v_prenex_20 Int) (|v_main_~#input_string~0.base_BEFORE_CALL_2| Int) (v_prenex_19 Int) (v_main_~i~0_BEFORE_CALL_2 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (<= (mod v_main_~i~0_BEFORE_CALL_2 4294967296) 2147483647)) (= 0 (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_2|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_2| (mod v_main_~i~0_BEFORE_CALL_2 4294967296) (- 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (mod v_main_~i~0_BEFORE_CALL_2 4294967296) 2147483647)) (= 0 (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_2|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_2| (mod v_main_~i~0_BEFORE_CALL_2 4294967296) (- 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= (mod v_prenex_20 4294967296) 2147483647) (= 0 (select (select |#memory_int| v_prenex_19) (+ v_prenex_18 (mod v_prenex_20 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (mod v_prenex_20 4294967296) 2147483647) (= 0 (select (select |#memory_int| v_prenex_19) (+ v_prenex_18 (mod v_prenex_20 4294967296))))))) [2019-10-07 13:49:09,563 INFO L193 IcfgInterpreter]: Reachable states at location L24-4 satisfy 125#(and (or (and (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (not (<= (mod main_~n_caracter~0 4294967296) 2147483647))) (and (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#input_string~0.offset|))) (<= (mod main_~n_caracter~0 4294967296) 2147483647))) (<= 0 main_~n_caracter~0)) [2019-10-07 13:49:09,564 INFO L193 IcfgInterpreter]: Reachable states at location L35-4 satisfy 653#(or (and (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|))) (<= (mod main_~i~0 4294967296) 2147483647)) (and (not (<= (mod main_~i~0 4294967296) 2147483647)) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))))) [2019-10-07 13:49:09,564 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 761#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#input_string~0.offset_BEFORE_CALL_2| Int) (v_prenex_18 Int) (v_prenex_20 Int) (|v_main_~#input_string~0.base_BEFORE_CALL_2| Int) (v_prenex_19 Int) (v_main_~i~0_BEFORE_CALL_2 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (<= (mod v_main_~i~0_BEFORE_CALL_2 4294967296) 2147483647)) (= 0 (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_2|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_2| (mod v_main_~i~0_BEFORE_CALL_2 4294967296) (- 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (mod v_main_~i~0_BEFORE_CALL_2 4294967296) 2147483647)) (= 0 (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_2|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_2| (mod v_main_~i~0_BEFORE_CALL_2 4294967296) (- 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= (mod v_prenex_20 4294967296) 2147483647) (= 0 (select (select |#memory_int| v_prenex_19) (+ v_prenex_18 (mod v_prenex_20 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (mod v_prenex_20 4294967296) 2147483647) (= 0 (select (select |#memory_int| v_prenex_19) (+ v_prenex_18 (mod v_prenex_20 4294967296))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:49:09,564 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 115#(<= 0 main_~n_caracter~0) [2019-10-07 13:49:09,564 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 73#(and (not (< (mod main_~i~0 4294967296) 5)) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 4)) |main_#t~mem3|)) [2019-10-07 13:49:09,565 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 742#true [2019-10-07 13:49:10,595 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:49:10,595 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 12, 10, 17] total 38 [2019-10-07 13:49:10,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-07 13:49:10,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-07 13:49:10,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1286, Unknown=0, NotChecked=0, Total=1406 [2019-10-07 13:49:10,599 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 38 states. [2019-10-07 13:49:11,695 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-10-07 13:50:04,298 WARN L191 SmtUtils]: Spent 52.34 s on a formula simplification. DAG size of input: 110 DAG size of output: 99 [2019-10-07 13:51:29,167 WARN L191 SmtUtils]: Spent 1.35 m on a formula simplification. DAG size of input: 116 DAG size of output: 106 [2019-10-07 13:51:31,260 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-10-07 13:51:31,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:51:31,668 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2019-10-07 13:51:31,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-07 13:51:31,669 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 28 [2019-10-07 13:51:31,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:51:31,669 INFO L225 Difference]: With dead ends: 51 [2019-10-07 13:51:31,670 INFO L226 Difference]: Without dead ends: 37 [2019-10-07 13:51:31,674 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 218.4s TimeCoverageRelationStatistics Valid=415, Invalid=3244, Unknown=1, NotChecked=0, Total=3660 [2019-10-07 13:51:31,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-07 13:51:31,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2019-10-07 13:51:31,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-07 13:51:31,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-10-07 13:51:31,683 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 28 [2019-10-07 13:51:31,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:51:31,683 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-10-07 13:51:31,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-07 13:51:31,683 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-10-07 13:51:31,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-07 13:51:31,684 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:51:31,684 INFO L385 BasicCegarLoop]: trace histogram [2, 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-07 13:51:31,888 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:51:31,888 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:51:31,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:51:31,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1106413623, now seen corresponding path program 2 times [2019-10-07 13:51:31,889 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:51:31,890 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:51:31,890 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:51:31,890 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:51:31,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:51:31,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:51:31,971 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-07 13:51:31,972 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:51:31,972 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:51:31,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:51:32,068 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-07 13:51:32,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:51:32,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-07 13:51:32,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:51:32,087 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-07 13:51:32,088 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:51:32,129 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-07 13:51:32,129 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:51:32,131 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-07 13:51:32,131 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:51:32,131 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:51:32,133 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:51:32,133 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:51:32,151 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:51:32,235 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:51:32,677 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 34 for LOIs [2019-10-07 13:51:32,683 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:51:32,686 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:51:32,686 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:51:32,687 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 752#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:51:32,687 INFO L193 IcfgInterpreter]: Reachable states at location L24-1 satisfy 120#(and (= |main_#t~mem4| (select (select |#memory_int| |main_~#input_string~0.base|) (+ (ite (<= (mod main_~n_caracter~0 4294967296) 2147483647) (mod main_~n_caracter~0 4294967296) (+ (mod main_~n_caracter~0 4294967296) (- 4294967296))) |main_~#input_string~0.offset|))) (<= 0 main_~n_caracter~0)) [2019-10-07 13:51:32,688 INFO L193 IcfgInterpreter]: Reachable states at location L35-1 satisfy 700#(= |main_#t~mem11| (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (ite (<= (mod main_~i~0 4294967296) 2147483647) (mod main_~i~0 4294967296) (+ (mod main_~i~0 4294967296) (- 4294967296)))))) [2019-10-07 13:51:32,690 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 601#(<= 0 main_~j~0) [2019-10-07 13:51:32,691 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 439#(and (<= 0 main_~i~0) (<= 0 main_~cont~0) (<= 0 main_~n_caracter~0)) [2019-10-07 13:51:32,691 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 431#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= 0 main_~cont~0) (<= 0 main_~n_caracter~0)) [2019-10-07 13:51:32,691 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 68#true [2019-10-07 13:51:32,691 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-07 13:51:32,691 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-07 13:51:32,692 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 757#(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-07 13:51:32,692 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:51:32,692 INFO L193 IcfgInterpreter]: Reachable states at location L6 satisfy 743#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#input_string~0.base_BEFORE_CALL_3| Int) (|v_main_~#input_string~0.offset_BEFORE_CALL_3| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_21 Int) (v_main_~i~0_BEFORE_CALL_3 Int)) (or (and (= 0 (select (select |#memory_int| v_prenex_21) (+ v_prenex_22 (mod v_prenex_23 4294967296) (- 4294967296)))) (not (<= (mod v_prenex_23 4294967296) 2147483647)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_3|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_3| (mod v_main_~i~0_BEFORE_CALL_3 4294967296))) 0) (<= (mod v_main_~i~0_BEFORE_CALL_3 4294967296) 2147483647)) (and (= 0 (select (select |#memory_int| v_prenex_21) (+ v_prenex_22 (mod v_prenex_23 4294967296) (- 4294967296)))) (not (<= (mod v_prenex_23 4294967296) 2147483647)) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_3|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_3| (mod v_main_~i~0_BEFORE_CALL_3 4294967296))) 0) (<= (mod v_main_~i~0_BEFORE_CALL_3 4294967296) 2147483647)))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:51:32,692 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 738#(and (exists ((|v_main_~#input_string~0.base_BEFORE_CALL_3| Int) (|v_main_~#input_string~0.offset_BEFORE_CALL_3| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_21 Int) (v_main_~i~0_BEFORE_CALL_3 Int)) (or (and (= 0 (select (select |#memory_int| v_prenex_21) (+ v_prenex_22 (mod v_prenex_23 4294967296) (- 4294967296)))) (not (<= (mod v_prenex_23 4294967296) 2147483647)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_3|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_3| (mod v_main_~i~0_BEFORE_CALL_3 4294967296))) 0) (<= (mod v_main_~i~0_BEFORE_CALL_3 4294967296) 2147483647)) (and (= 0 (select (select |#memory_int| v_prenex_21) (+ v_prenex_22 (mod v_prenex_23 4294967296) (- 4294967296)))) (not (<= (mod v_prenex_23 4294967296) 2147483647)) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_3|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_3| (mod v_main_~i~0_BEFORE_CALL_3 4294967296))) 0) (<= (mod v_main_~i~0_BEFORE_CALL_3 4294967296) 2147483647)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:51:32,693 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 733#(exists ((|v_main_~#input_string~0.base_BEFORE_CALL_3| Int) (|v_main_~#input_string~0.offset_BEFORE_CALL_3| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_21 Int) (v_main_~i~0_BEFORE_CALL_3 Int)) (or (and (= 0 (select (select |#memory_int| v_prenex_21) (+ v_prenex_22 (mod v_prenex_23 4294967296) (- 4294967296)))) (not (<= (mod v_prenex_23 4294967296) 2147483647)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_3|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_3| (mod v_main_~i~0_BEFORE_CALL_3 4294967296))) 0) (<= (mod v_main_~i~0_BEFORE_CALL_3 4294967296) 2147483647)) (and (= 0 (select (select |#memory_int| v_prenex_21) (+ v_prenex_22 (mod v_prenex_23 4294967296) (- 4294967296)))) (not (<= (mod v_prenex_23 4294967296) 2147483647)) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_3|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_3| (mod v_main_~i~0_BEFORE_CALL_3 4294967296))) 0) (<= (mod v_main_~i~0_BEFORE_CALL_3 4294967296) 2147483647)))) [2019-10-07 13:51:32,693 INFO L193 IcfgInterpreter]: Reachable states at location L24-4 satisfy 125#(and (or (and (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (not (<= (mod main_~n_caracter~0 4294967296) 2147483647))) (and (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#input_string~0.offset|))) (<= (mod main_~n_caracter~0 4294967296) 2147483647))) (<= 0 main_~n_caracter~0)) [2019-10-07 13:51:32,693 INFO L193 IcfgInterpreter]: Reachable states at location L35-4 satisfy 653#(or (and (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|))) (<= (mod main_~i~0 4294967296) 2147483647)) (and (not (<= (mod main_~i~0 4294967296) 2147483647)) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))))) [2019-10-07 13:51:32,693 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 748#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#input_string~0.base_BEFORE_CALL_3| Int) (|v_main_~#input_string~0.offset_BEFORE_CALL_3| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_21 Int) (v_main_~i~0_BEFORE_CALL_3 Int)) (or (and (= 0 (select (select |#memory_int| v_prenex_21) (+ v_prenex_22 (mod v_prenex_23 4294967296) (- 4294967296)))) (not (<= (mod v_prenex_23 4294967296) 2147483647)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_3|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_3| (mod v_main_~i~0_BEFORE_CALL_3 4294967296))) 0) (<= (mod v_main_~i~0_BEFORE_CALL_3 4294967296) 2147483647)) (and (= 0 (select (select |#memory_int| v_prenex_21) (+ v_prenex_22 (mod v_prenex_23 4294967296) (- 4294967296)))) (not (<= (mod v_prenex_23 4294967296) 2147483647)) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_3|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_3| (mod v_main_~i~0_BEFORE_CALL_3 4294967296))) 0) (<= (mod v_main_~i~0_BEFORE_CALL_3 4294967296) 2147483647)))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:51:32,694 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 115#(<= 0 main_~n_caracter~0) [2019-10-07 13:51:32,694 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 73#(and (not (< (mod main_~i~0 4294967296) 5)) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 4)) |main_#t~mem3|)) [2019-10-07 13:51:32,694 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 729#true [2019-10-07 13:51:33,172 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:51:33,172 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 17] total 25 [2019-10-07 13:51:33,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-07 13:51:33,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-07 13:51:33,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2019-10-07 13:51:33,175 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 25 states. [2019-10-07 13:51:34,761 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-10-07 13:51:34,978 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-10-07 13:51:36,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:51:36,605 INFO L93 Difference]: Finished difference Result 103 states and 133 transitions. [2019-10-07 13:51:36,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-07 13:51:36,605 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 30 [2019-10-07 13:51:36,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:51:36,608 INFO L225 Difference]: With dead ends: 103 [2019-10-07 13:51:36,608 INFO L226 Difference]: Without dead ends: 80 [2019-10-07 13:51:36,610 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=516, Invalid=2564, Unknown=0, NotChecked=0, Total=3080 [2019-10-07 13:51:36,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-07 13:51:36,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 34. [2019-10-07 13:51:36,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-07 13:51:36,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-10-07 13:51:36,620 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 30 [2019-10-07 13:51:36,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:51:36,620 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-10-07 13:51:36,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-07 13:51:36,621 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-10-07 13:51:36,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-07 13:51:36,621 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:51:36,621 INFO L385 BasicCegarLoop]: trace histogram [5, 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-07 13:51:36,822 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:51:36,823 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:51:36,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:51:36,823 INFO L82 PathProgramCache]: Analyzing trace with hash -499834762, now seen corresponding path program 3 times [2019-10-07 13:51:36,824 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:51:36,824 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:51:36,824 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:51:36,824 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:51:36,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:51:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:51:37,716 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 37 [2019-10-07 13:51:38,254 WARN L191 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 62 [2019-10-07 13:51:38,704 WARN L191 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 53 [2019-10-07 13:51:38,924 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 40 [2019-10-07 13:51:39,248 WARN L191 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 45 [2019-10-07 13:51:39,845 WARN L191 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 51 [2019-10-07 13:51:40,559 WARN L191 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 86 [2019-10-07 13:51:40,773 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 24 [2019-10-07 13:51:41,139 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 13:51:41,139 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:51:41,139 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:51:41,140 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:51:41,271 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 13:51:41,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:51:41,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-07 13:51:41,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:51:42,319 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 57 [2019-10-07 13:51:42,469 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 13:51:42,469 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:51:42,730 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-10-07 13:51:43,181 WARN L191 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2019-10-07 13:51:43,374 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-10-07 13:51:43,905 WARN L191 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 [2019-10-07 13:51:45,943 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:51:46,377 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:51:46,762 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:51:46,832 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:51:46,922 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:51:47,002 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:51:56,986 WARN L191 SmtUtils]: Spent 9.98 s on a formula simplification. DAG size of input: 803 DAG size of output: 286 [2019-10-07 13:51:59,202 WARN L191 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 277 DAG size of output: 268 [2019-10-07 13:52:01,412 WARN L191 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 261 DAG size of output: 247 [2019-10-07 13:52:03,054 WARN L191 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 236 DAG size of output: 209 [2019-10-07 13:52:04,314 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 196 DAG size of output: 171 [2019-10-07 13:52:04,936 WARN L191 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 113 [2019-10-07 13:52:05,512 WARN L191 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 110 [2019-10-07 13:52:06,008 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 76 [2019-10-07 13:52:06,387 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 41 [2019-10-07 13:52:06,761 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-07 13:52:06,761 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:52:06,763 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-07 13:52:06,763 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:52:06,763 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:52:06,764 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:52:06,764 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:52:06,796 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:52:06,873 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:52:07,267 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 34 for LOIs [2019-10-07 13:52:07,274 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:52:07,277 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:52:07,277 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:52:07,277 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 765#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:52:07,278 INFO L193 IcfgInterpreter]: Reachable states at location L24-1 satisfy 120#(and (= |main_#t~mem4| (select (select |#memory_int| |main_~#input_string~0.base|) (+ (ite (<= (mod main_~n_caracter~0 4294967296) 2147483647) (mod main_~n_caracter~0 4294967296) (+ (mod main_~n_caracter~0 4294967296) (- 4294967296))) |main_~#input_string~0.offset|))) (<= 0 main_~n_caracter~0)) [2019-10-07 13:52:07,278 INFO L193 IcfgInterpreter]: Reachable states at location L35-1 satisfy 700#(= |main_#t~mem11| (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (ite (<= (mod main_~i~0 4294967296) 2147483647) (mod main_~i~0 4294967296) (+ (mod main_~i~0 4294967296) (- 4294967296)))))) [2019-10-07 13:52:07,278 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 627#(<= 0 main_~j~0) [2019-10-07 13:52:07,278 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 439#(and (<= 0 main_~i~0) (<= 0 main_~cont~0) (<= 0 main_~n_caracter~0)) [2019-10-07 13:52:07,278 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 431#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= 0 main_~cont~0) (<= 0 main_~n_caracter~0)) [2019-10-07 13:52:07,279 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 68#true [2019-10-07 13:52:07,279 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-07 13:52:07,279 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-07 13:52:07,279 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 770#(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-07 13:52:07,279 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:52:07,279 INFO L193 IcfgInterpreter]: Reachable states at location L6 satisfy 756#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#input_string~0.offset_BEFORE_CALL_4| Int) (|v_main_~#input_string~0.base_BEFORE_CALL_4| Int) (v_prenex_45 Int) (v_prenex_44 Int) (v_prenex_46 Int) (v_main_~i~0_BEFORE_CALL_4 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_45) (+ v_prenex_44 (mod v_prenex_46 4294967296))) 0) (<= (mod v_prenex_46 4294967296) 2147483647)) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_4|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_4| (mod v_main_~i~0_BEFORE_CALL_4 4294967296) (- 4294967296))) 0) (not (<= (mod v_main_~i~0_BEFORE_CALL_4 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_45) (+ v_prenex_44 (mod v_prenex_46 4294967296))) 0) (<= (mod v_prenex_46 4294967296) 2147483647)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_4|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_4| (mod v_main_~i~0_BEFORE_CALL_4 4294967296) (- 4294967296))) 0) (not (<= (mod v_main_~i~0_BEFORE_CALL_4 4294967296) 2147483647))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:52:07,280 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 751#(and (exists ((|v_main_~#input_string~0.offset_BEFORE_CALL_4| Int) (|v_main_~#input_string~0.base_BEFORE_CALL_4| Int) (v_prenex_45 Int) (v_prenex_44 Int) (v_prenex_46 Int) (v_main_~i~0_BEFORE_CALL_4 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_45) (+ v_prenex_44 (mod v_prenex_46 4294967296))) 0) (<= (mod v_prenex_46 4294967296) 2147483647)) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_4|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_4| (mod v_main_~i~0_BEFORE_CALL_4 4294967296) (- 4294967296))) 0) (not (<= (mod v_main_~i~0_BEFORE_CALL_4 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_45) (+ v_prenex_44 (mod v_prenex_46 4294967296))) 0) (<= (mod v_prenex_46 4294967296) 2147483647)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_4|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_4| (mod v_main_~i~0_BEFORE_CALL_4 4294967296) (- 4294967296))) 0) (not (<= (mod v_main_~i~0_BEFORE_CALL_4 4294967296) 2147483647))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:52:07,280 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 746#(exists ((|v_main_~#input_string~0.offset_BEFORE_CALL_4| Int) (|v_main_~#input_string~0.base_BEFORE_CALL_4| Int) (v_prenex_45 Int) (v_prenex_44 Int) (v_prenex_46 Int) (v_main_~i~0_BEFORE_CALL_4 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_45) (+ v_prenex_44 (mod v_prenex_46 4294967296))) 0) (<= (mod v_prenex_46 4294967296) 2147483647)) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_4|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_4| (mod v_main_~i~0_BEFORE_CALL_4 4294967296) (- 4294967296))) 0) (not (<= (mod v_main_~i~0_BEFORE_CALL_4 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_45) (+ v_prenex_44 (mod v_prenex_46 4294967296))) 0) (<= (mod v_prenex_46 4294967296) 2147483647)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_4|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_4| (mod v_main_~i~0_BEFORE_CALL_4 4294967296) (- 4294967296))) 0) (not (<= (mod v_main_~i~0_BEFORE_CALL_4 4294967296) 2147483647))))) [2019-10-07 13:52:07,280 INFO L193 IcfgInterpreter]: Reachable states at location L24-4 satisfy 125#(and (or (and (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (not (<= (mod main_~n_caracter~0 4294967296) 2147483647))) (and (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#input_string~0.offset|))) (<= (mod main_~n_caracter~0 4294967296) 2147483647))) (<= 0 main_~n_caracter~0)) [2019-10-07 13:52:07,280 INFO L193 IcfgInterpreter]: Reachable states at location L35-4 satisfy 666#(or (and (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|))) (<= (mod main_~i~0 4294967296) 2147483647)) (and (not (<= (mod main_~i~0 4294967296) 2147483647)) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))))) [2019-10-07 13:52:07,281 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 761#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#input_string~0.offset_BEFORE_CALL_4| Int) (|v_main_~#input_string~0.base_BEFORE_CALL_4| Int) (v_prenex_45 Int) (v_prenex_44 Int) (v_prenex_46 Int) (v_main_~i~0_BEFORE_CALL_4 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_45) (+ v_prenex_44 (mod v_prenex_46 4294967296))) 0) (<= (mod v_prenex_46 4294967296) 2147483647)) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_4|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_4| (mod v_main_~i~0_BEFORE_CALL_4 4294967296) (- 4294967296))) 0) (not (<= (mod v_main_~i~0_BEFORE_CALL_4 4294967296) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_45) (+ v_prenex_44 (mod v_prenex_46 4294967296))) 0) (<= (mod v_prenex_46 4294967296) 2147483647)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_4|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_4| (mod v_main_~i~0_BEFORE_CALL_4 4294967296) (- 4294967296))) 0) (not (<= (mod v_main_~i~0_BEFORE_CALL_4 4294967296) 2147483647))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:52:07,281 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 115#(<= 0 main_~n_caracter~0) [2019-10-07 13:52:07,281 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 73#(and (not (< (mod main_~i~0 4294967296) 5)) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 4)) |main_#t~mem3|)) [2019-10-07 13:52:07,281 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 742#true [2019-10-07 13:52:08,476 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:52:08,476 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 12, 17] total 58 [2019-10-07 13:52:08,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-07 13:52:08,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-07 13:52:08,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=3087, Unknown=0, NotChecked=0, Total=3306 [2019-10-07 13:52:08,479 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 58 states. [2019-10-07 13:52:09,925 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-10-07 13:52:11,077 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 51 [2019-10-07 13:52:11,338 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 59 [2019-10-07 13:52:11,511 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-10-07 13:52:12,196 WARN L191 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 81 [2019-10-07 13:52:12,462 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 66 [2019-10-07 13:52:13,384 WARN L191 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 272 DAG size of output: 91 [2019-10-07 13:52:14,153 WARN L191 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 265 DAG size of output: 70 [2019-10-07 13:52:14,852 WARN L191 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 90 [2019-10-07 13:52:15,739 WARN L191 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 280 DAG size of output: 74 [2019-10-07 13:52:16,503 WARN L191 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 85 [2019-10-07 13:52:17,464 WARN L191 SmtUtils]: Spent 729.00 ms on a formula simplification. DAG size of input: 270 DAG size of output: 99 [2019-10-07 13:52:18,227 WARN L191 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 251 DAG size of output: 79 [2019-10-07 13:52:19,056 WARN L191 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 93 [2019-10-07 13:52:19,999 WARN L191 SmtUtils]: Spent 675.00 ms on a formula simplification. DAG size of input: 266 DAG size of output: 83 [2019-10-07 13:52:20,803 WARN L191 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 93 [2019-10-07 13:52:21,128 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2019-10-07 13:52:21,475 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 72 [2019-10-07 13:52:21,883 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 82 [2019-10-07 13:52:22,699 WARN L191 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 101 [2019-10-07 13:52:23,147 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 59 [2019-10-07 13:52:23,613 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 78 [2019-10-07 13:52:24,048 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 81 [2019-10-07 13:52:24,676 WARN L191 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 61 [2019-10-07 13:52:25,365 WARN L191 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 84 [2019-10-07 13:52:25,839 WARN L191 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 87 [2019-10-07 13:52:26,655 WARN L191 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 96 [2019-10-07 13:52:27,524 WARN L191 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 93 [2019-10-07 13:52:28,714 WARN L191 SmtUtils]: Spent 922.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 95 [2019-10-07 13:52:29,796 WARN L191 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 286 DAG size of output: 83 [2019-10-07 13:52:31,097 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 164 DAG size of output: 102 [2019-10-07 13:52:31,997 WARN L191 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 89 [2019-10-07 13:52:33,028 WARN L191 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 272 DAG size of output: 91 [2019-10-07 13:52:33,250 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-10-07 13:52:34,355 WARN L191 SmtUtils]: Spent 813.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 120 [2019-10-07 13:52:35,383 WARN L191 SmtUtils]: Spent 698.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 87 [2019-10-07 13:52:36,069 WARN L191 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 87 [2019-10-07 13:52:37,127 WARN L191 SmtUtils]: Spent 774.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 98 [2019-10-07 13:52:38,689 WARN L191 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 160 DAG size of output: 121 [2019-10-07 13:52:39,419 WARN L191 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 77 [2019-10-07 13:52:40,133 WARN L191 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 85 [2019-10-07 13:52:41,262 WARN L191 SmtUtils]: Spent 813.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 99 [2019-10-07 13:52:41,601 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-10-07 13:52:42,334 WARN L191 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 86 [2019-10-07 13:52:43,368 WARN L191 SmtUtils]: Spent 822.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 114 [2019-10-07 13:52:44,432 WARN L191 SmtUtils]: Spent 796.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 106 [2019-10-07 13:52:45,354 WARN L191 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 93 [2019-10-07 13:52:45,658 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-10-07 13:52:45,944 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2019-10-07 13:52:46,892 WARN L191 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 102 [2019-10-07 13:52:47,598 WARN L191 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 92 [2019-10-07 13:52:48,480 WARN L191 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 93 [2019-10-07 13:52:49,432 WARN L191 SmtUtils]: Spent 753.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 120 [2019-10-07 13:52:50,428 WARN L191 SmtUtils]: Spent 724.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 100 [2019-10-07 13:52:51,335 WARN L191 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 256 DAG size of output: 109 [2019-10-07 13:52:52,260 WARN L191 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 95 [2019-10-07 13:52:53,168 WARN L191 SmtUtils]: Spent 661.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 100 [2019-10-07 13:52:54,263 WARN L191 SmtUtils]: Spent 861.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 115 [2019-10-07 13:52:54,453 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-10-07 13:52:54,783 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-10-07 13:52:55,582 WARN L191 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 83 [2019-10-07 13:52:56,493 WARN L191 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 255 DAG size of output: 111 [2019-10-07 13:52:56,808 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 70 [2019-10-07 13:52:57,695 WARN L191 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 91 [2019-10-07 13:52:58,620 WARN L191 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 94 [2019-10-07 13:52:58,858 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-10-07 13:53:01,128 WARN L191 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 92 [2019-10-07 13:53:01,867 WARN L191 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 88 [2019-10-07 13:53:02,804 WARN L191 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 98 [2019-10-07 13:53:03,956 WARN L191 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 105 [2019-10-07 13:53:04,793 WARN L191 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 92 [2019-10-07 13:53:05,100 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2019-10-07 13:53:07,376 WARN L191 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 109 [2019-10-07 13:53:07,877 WARN L191 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 72 [2019-10-07 13:53:08,724 WARN L191 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 102 [2019-10-07 13:53:09,665 WARN L191 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 111 [2019-10-07 13:53:10,411 WARN L191 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 74 [2019-10-07 13:53:11,276 WARN L191 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 104 [2019-10-07 13:53:12,193 WARN L191 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 115 [2019-10-07 13:53:13,160 WARN L191 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 110 [2019-10-07 13:53:14,189 WARN L191 SmtUtils]: Spent 730.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 98 [2019-10-07 13:53:15,189 WARN L191 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 114 [2019-10-07 13:53:15,571 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 79 [2019-10-07 13:53:16,616 WARN L191 SmtUtils]: Spent 767.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 105 [2019-10-07 13:53:17,602 WARN L191 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 98 [2019-10-07 13:53:18,698 WARN L191 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 107 [2019-10-07 13:53:19,329 WARN L191 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 97 [2019-10-07 13:53:20,052 WARN L191 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 82 [2019-10-07 13:53:20,895 WARN L191 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 108 [2019-10-07 13:53:22,440 WARN L191 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 166 DAG size of output: 127 [2019-10-07 13:53:23,315 WARN L191 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 114 [2019-10-07 13:53:24,902 WARN L191 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 165 DAG size of output: 126 [2019-10-07 13:53:25,826 WARN L191 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 113 [2019-10-07 13:53:26,053 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-10-07 13:53:27,173 WARN L191 SmtUtils]: Spent 851.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 105 [2019-10-07 13:53:28,208 WARN L191 SmtUtils]: Spent 793.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 112 [2019-10-07 13:53:29,342 WARN L191 SmtUtils]: Spent 899.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 104 [2019-10-07 13:53:30,412 WARN L191 SmtUtils]: Spent 844.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 111 [2019-10-07 13:53:30,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:53:30,415 INFO L93 Difference]: Finished difference Result 166 states and 220 transitions. [2019-10-07 13:53:30,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-10-07 13:53:30,416 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 33 [2019-10-07 13:53:30,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:53:30,417 INFO L225 Difference]: With dead ends: 166 [2019-10-07 13:53:30,417 INFO L226 Difference]: Without dead ends: 125 [2019-10-07 13:53:30,426 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9167 ImplicationChecksByTransitivity, 85.7s TimeCoverageRelationStatistics Valid=3986, Invalid=26814, Unknown=0, NotChecked=0, Total=30800 [2019-10-07 13:53:30,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-10-07 13:53:30,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 63. [2019-10-07 13:53:30,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-07 13:53:30,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2019-10-07 13:53:30,451 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 33 [2019-10-07 13:53:30,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:53:30,452 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2019-10-07 13:53:30,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-07 13:53:30,452 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2019-10-07 13:53:30,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-07 13:53:30,453 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:53:30,453 INFO L385 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:53:30,656 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:53:30,656 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:53:30,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:53:30,657 INFO L82 PathProgramCache]: Analyzing trace with hash 30444042, now seen corresponding path program 4 times [2019-10-07 13:53:30,657 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:53:30,657 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:53:30,657 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:53:30,657 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:53:30,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:53:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:53:31,017 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 15 [2019-10-07 13:53:31,168 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 26 [2019-10-07 13:53:31,338 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-07 13:53:31,338 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:53:31,338 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:53:31,338 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:53:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:53:31,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-07 13:53:31,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:53:31,657 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-07 13:53:31,657 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:53:31,773 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:53:31,816 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-07 13:53:31,817 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:53:31,818 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-07 13:53:31,818 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:53:31,819 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:53:31,819 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:53:31,819 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:53:31,849 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:53:31,916 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:32,331 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 34 for LOIs [2019-10-07 13:53:32,336 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:53:32,339 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:53:32,339 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:53:32,339 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 752#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:53:32,340 INFO L193 IcfgInterpreter]: Reachable states at location L24-1 satisfy 120#(and (= |main_#t~mem4| (select (select |#memory_int| |main_~#input_string~0.base|) (+ (ite (<= (mod main_~n_caracter~0 4294967296) 2147483647) (mod main_~n_caracter~0 4294967296) (+ (mod main_~n_caracter~0 4294967296) (- 4294967296))) |main_~#input_string~0.offset|))) (<= 0 main_~n_caracter~0)) [2019-10-07 13:53:32,340 INFO L193 IcfgInterpreter]: Reachable states at location L35-1 satisfy 700#(= |main_#t~mem11| (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (ite (<= (mod main_~i~0 4294967296) 2147483647) (mod main_~i~0 4294967296) (+ (mod main_~i~0 4294967296) (- 4294967296)))))) [2019-10-07 13:53:32,340 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 614#(<= 0 main_~j~0) [2019-10-07 13:53:32,340 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 439#(and (<= 0 main_~i~0) (<= 0 main_~cont~0) (<= 0 main_~n_caracter~0)) [2019-10-07 13:53:32,340 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 431#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= 0 main_~cont~0) (<= 0 main_~n_caracter~0)) [2019-10-07 13:53:32,341 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 68#true [2019-10-07 13:53:32,341 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-07 13:53:32,341 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 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-07 13:53:32,341 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 757#(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-07 13:53:32,341 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:53:32,341 INFO L193 IcfgInterpreter]: Reachable states at location L6 satisfy 743#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_49 Int) (|v_main_~#input_string~0.base_BEFORE_CALL_5| Int) (v_prenex_48 Int) (|v_main_~#input_string~0.offset_BEFORE_CALL_5| Int) (v_prenex_47 Int) (v_main_~i~0_BEFORE_CALL_5 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (mod v_prenex_49 4294967296) 2147483647) (= (select (select |#memory_int| v_prenex_47) (+ (mod v_prenex_49 4294967296) v_prenex_48)) 0)) (and (not (<= (mod v_main_~i~0_BEFORE_CALL_5 4294967296) 2147483647)) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_5|) (+ (mod v_main_~i~0_BEFORE_CALL_5 4294967296) |v_main_~#input_string~0.offset_BEFORE_CALL_5| (- 4294967296))) 0)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= (mod v_prenex_49 4294967296) 2147483647) (= (select (select |#memory_int| v_prenex_47) (+ (mod v_prenex_49 4294967296) v_prenex_48)) 0)) (and (not (<= (mod v_main_~i~0_BEFORE_CALL_5 4294967296) 2147483647)) (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_5|) (+ (mod v_main_~i~0_BEFORE_CALL_5 4294967296) |v_main_~#input_string~0.offset_BEFORE_CALL_5| (- 4294967296))) 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:53:32,342 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 738#(and (exists ((v_prenex_49 Int) (|v_main_~#input_string~0.base_BEFORE_CALL_5| Int) (v_prenex_48 Int) (|v_main_~#input_string~0.offset_BEFORE_CALL_5| Int) (v_prenex_47 Int) (v_main_~i~0_BEFORE_CALL_5 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (mod v_prenex_49 4294967296) 2147483647) (= (select (select |#memory_int| v_prenex_47) (+ (mod v_prenex_49 4294967296) v_prenex_48)) 0)) (and (not (<= (mod v_main_~i~0_BEFORE_CALL_5 4294967296) 2147483647)) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_5|) (+ (mod v_main_~i~0_BEFORE_CALL_5 4294967296) |v_main_~#input_string~0.offset_BEFORE_CALL_5| (- 4294967296))) 0)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= (mod v_prenex_49 4294967296) 2147483647) (= (select (select |#memory_int| v_prenex_47) (+ (mod v_prenex_49 4294967296) v_prenex_48)) 0)) (and (not (<= (mod v_main_~i~0_BEFORE_CALL_5 4294967296) 2147483647)) (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_5|) (+ (mod v_main_~i~0_BEFORE_CALL_5 4294967296) |v_main_~#input_string~0.offset_BEFORE_CALL_5| (- 4294967296))) 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:53:32,342 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 733#(exists ((v_prenex_49 Int) (|v_main_~#input_string~0.base_BEFORE_CALL_5| Int) (v_prenex_48 Int) (|v_main_~#input_string~0.offset_BEFORE_CALL_5| Int) (v_prenex_47 Int) (v_main_~i~0_BEFORE_CALL_5 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (mod v_prenex_49 4294967296) 2147483647) (= (select (select |#memory_int| v_prenex_47) (+ (mod v_prenex_49 4294967296) v_prenex_48)) 0)) (and (not (<= (mod v_main_~i~0_BEFORE_CALL_5 4294967296) 2147483647)) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_5|) (+ (mod v_main_~i~0_BEFORE_CALL_5 4294967296) |v_main_~#input_string~0.offset_BEFORE_CALL_5| (- 4294967296))) 0)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= (mod v_prenex_49 4294967296) 2147483647) (= (select (select |#memory_int| v_prenex_47) (+ (mod v_prenex_49 4294967296) v_prenex_48)) 0)) (and (not (<= (mod v_main_~i~0_BEFORE_CALL_5 4294967296) 2147483647)) (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_5|) (+ (mod v_main_~i~0_BEFORE_CALL_5 4294967296) |v_main_~#input_string~0.offset_BEFORE_CALL_5| (- 4294967296))) 0)))) [2019-10-07 13:53:32,342 INFO L193 IcfgInterpreter]: Reachable states at location L24-4 satisfy 125#(and (or (and (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (not (<= (mod main_~n_caracter~0 4294967296) 2147483647))) (and (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#input_string~0.offset|))) (<= (mod main_~n_caracter~0 4294967296) 2147483647))) (<= 0 main_~n_caracter~0)) [2019-10-07 13:53:32,342 INFO L193 IcfgInterpreter]: Reachable states at location L35-4 satisfy 666#(or (and (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|))) (<= (mod main_~i~0 4294967296) 2147483647)) (and (not (<= (mod main_~i~0 4294967296) 2147483647)) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))))) [2019-10-07 13:53:32,342 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 748#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_49 Int) (|v_main_~#input_string~0.base_BEFORE_CALL_5| Int) (v_prenex_48 Int) (|v_main_~#input_string~0.offset_BEFORE_CALL_5| Int) (v_prenex_47 Int) (v_main_~i~0_BEFORE_CALL_5 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (mod v_prenex_49 4294967296) 2147483647) (= (select (select |#memory_int| v_prenex_47) (+ (mod v_prenex_49 4294967296) v_prenex_48)) 0)) (and (not (<= (mod v_main_~i~0_BEFORE_CALL_5 4294967296) 2147483647)) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_5|) (+ (mod v_main_~i~0_BEFORE_CALL_5 4294967296) |v_main_~#input_string~0.offset_BEFORE_CALL_5| (- 4294967296))) 0)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= (mod v_prenex_49 4294967296) 2147483647) (= (select (select |#memory_int| v_prenex_47) (+ (mod v_prenex_49 4294967296) v_prenex_48)) 0)) (and (not (<= (mod v_main_~i~0_BEFORE_CALL_5 4294967296) 2147483647)) (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_5|) (+ (mod v_main_~i~0_BEFORE_CALL_5 4294967296) |v_main_~#input_string~0.offset_BEFORE_CALL_5| (- 4294967296))) 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:53:32,343 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 115#(<= 0 main_~n_caracter~0) [2019-10-07 13:53:32,343 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 73#(and (not (< (mod main_~i~0 4294967296) 5)) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 4)) |main_#t~mem3|)) [2019-10-07 13:53:32,343 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 729#true [2019-10-07 13:53:33,323 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:53:33,323 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 9, 17] total 36 [2019-10-07 13:53:33,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-07 13:53:33,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-07 13:53:33,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1140, Unknown=0, NotChecked=0, Total=1260 [2019-10-07 13:53:33,325 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand 36 states. [2019-10-07 13:53:36,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:53:36,103 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2019-10-07 13:53:36,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-07 13:53:36,103 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 39 [2019-10-07 13:53:36,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:53:36,104 INFO L225 Difference]: With dead ends: 86 [2019-10-07 13:53:36,104 INFO L226 Difference]: Without dead ends: 63 [2019-10-07 13:53:36,107 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 933 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=502, Invalid=3404, Unknown=0, NotChecked=0, Total=3906 [2019-10-07 13:53:36,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-07 13:53:36,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2019-10-07 13:53:36,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-07 13:53:36,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2019-10-07 13:53:36,128 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 39 [2019-10-07 13:53:36,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:53:36,128 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2019-10-07 13:53:36,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-07 13:53:36,129 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2019-10-07 13:53:36,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-07 13:53:36,129 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:53:36,130 INFO L385 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:53:36,334 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:53:36,334 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:53:36,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:53:36,335 INFO L82 PathProgramCache]: Analyzing trace with hash -22992964, now seen corresponding path program 5 times [2019-10-07 13:53:36,335 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:53:36,335 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:53:36,335 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:53:36,336 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:53:36,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:53:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:53:37,325 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 50 [2019-10-07 13:53:37,660 WARN L191 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 45 [2019-10-07 13:53:38,003 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 51 [2019-10-07 13:53:38,393 WARN L191 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 59 [2019-10-07 13:53:39,508 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 197 DAG size of output: 114 [2019-10-07 13:53:40,658 WARN L191 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 177 DAG size of output: 80 [2019-10-07 13:53:41,263 WARN L191 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-10-07 13:53:42,066 WARN L191 SmtUtils]: Spent 739.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 73 [2019-10-07 13:53:43,085 WARN L191 SmtUtils]: Spent 844.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 79 [2019-10-07 13:53:44,234 WARN L191 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 212 DAG size of output: 90 [2019-10-07 13:53:44,495 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 41 [2019-10-07 13:53:45,074 WARN L191 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 65 [2019-10-07 13:53:46,080 WARN L191 SmtUtils]: Spent 796.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 88 [2019-10-07 13:53:46,909 WARN L191 SmtUtils]: Spent 733.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 84 [2019-10-07 13:53:47,228 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 31 [2019-10-07 13:53:47,428 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 21 [2019-10-07 13:53:47,606 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 17 [2019-10-07 13:53:47,697 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-07 13:53:47,697 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:53:47,697 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:53:47,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:53:47,973 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-07 13:53:47,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:53:47,975 WARN L254 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 103 conjunts are in the unsatisfiable core [2019-10-07 13:53:47,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:53:48,075 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:48,370 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:48,565 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:49,586 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-10-07 13:53:49,909 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-10-07 13:53:50,437 WARN L191 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 98 [2019-10-07 13:53:50,995 WARN L191 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2019-10-07 13:53:51,234 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-10-07 13:53:51,489 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-10-07 13:53:51,742 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-10-07 13:53:52,197 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2019-10-07 13:53:52,713 WARN L191 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 88 [2019-10-07 13:53:53,009 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-10-07 13:53:53,479 WARN L191 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-10-07 13:53:53,791 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-10-07 13:53:54,480 WARN L191 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 105 [2019-10-07 13:53:55,269 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:55,330 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:55,393 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:55,531 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:55,577 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:55,616 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:55,815 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:55,857 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:55,904 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:55,943 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:56,083 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:56,144 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:56,233 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:56,314 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:56,380 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:56,442 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:56,734 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:56,783 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:56,954 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:57,001 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:57,044 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:57,087 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:57,262 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:57,306 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:57,349 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:57,387 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:57,428 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:57,465 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:57,506 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:57,551 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:57,593 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:57,633 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:57,671 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:57,707 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:57,753 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:57,802 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:57,840 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:57,880 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:57,918 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:57,955 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:58,003 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:58,060 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:58,192 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:58,230 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:58,382 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:58,427 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:58,471 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:58,514 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:58,551 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:58,589 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:58,772 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:58,807 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:58,847 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:59,002 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:59,046 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:59,158 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:59,198 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:59,241 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:59,302 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:59,370 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:59,421 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:59,467 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:59,502 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:59,659 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:59,697 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:59,733 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:59,769 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:59,801 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:59,838 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:59,871 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:59,903 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:59,946 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:53:59,982 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:00,021 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:00,056 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:00,095 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:00,139 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:00,172 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:00,204 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:00,338 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:00,451 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:00,603 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:00,636 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:00,673 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:00,711 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:00,868 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:00,899 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:00,935 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:01,098 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:01,133 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:01,166 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:01,196 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:01,317 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:01,353 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:01,388 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:01,423 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:01,460 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:01,500 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:01,530 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:01,565 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:01,813 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:02,128 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:02,235 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:02,420 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:02,461 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:02,826 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:02,859 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:02,890 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:02,922 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:02,956 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:02,986 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:03,017 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:03,048 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:03,079 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:03,110 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:03,151 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:03,506 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:03,537 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:03,571 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:03,603 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:03,632 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:03,662 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:03,797 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:03,835 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:03,868 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:03,898 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:03,928 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:03,966 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:03,993 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:04,021 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:04,050 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:04,077 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:04,107 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:04,344 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:04,498 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:04,529 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:04,628 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:04,655 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:04,682 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:04,709 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:04,808 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:04,832 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:04,858 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:04,949 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:04,978 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:05,131 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:05,334 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:05,356 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:05,385 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:05,596 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:05,617 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:05,640 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:05,670 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:05,699 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:05,834 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:05,859 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:05,886 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:05,912 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:05,940 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:05,960 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:05,981 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:06,004 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:06,031 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:06,143 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:06,539 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:06,560 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:06,586 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:06,610 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:06,813 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:07,004 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:07,029 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:07,351 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:07,371 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:07,516 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:07,540 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:07,749 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:07,859 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:07,888 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:07,909 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:07,931 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:07,949 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:07,971 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:07,996 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:08,282 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:08,302 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:08,326 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:08,346 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:08,363 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:08,608 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:08,631 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:08,658 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:08,675 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:08,804 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:08,826 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:08,845 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:09,094 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:09,114 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:09,184 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:09,202 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:09,224 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:09,292 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:09,314 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:09,340 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:09,465 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:09,486 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:09,500 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:09,586 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:09,605 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:09,620 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:09,789 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:09,943 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:09,964 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,127 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,147 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,245 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,259 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,278 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,293 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,307 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,400 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,415 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,429 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,442 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,458 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,473 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,487 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,502 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,520 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,627 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,641 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,724 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,738 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,750 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,767 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,779 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,791 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,804 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,815 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,827 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,839 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,854 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,868 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,879 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,890 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,900 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,910 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,922 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:10,933 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:11,035 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:11,046 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:11,055 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:11,065 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:11,135 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:11,144 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:11,155 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:11,315 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:11,324 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:11,339 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:11,391 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:11,401 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:11,457 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:11,529 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:11,536 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:11,647 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:11,652 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:11,659 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:11,664 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:11,670 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:11,758 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:11,763 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:11,770 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:11,776 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:11,781 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:11,826 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:11,831 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:11,837 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:11,841 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:12,238 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:54:12,238 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:54:12,649 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-10-07 13:54:13,189 WARN L191 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2019-10-07 13:54:13,428 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-10-07 13:54:13,722 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-10-07 13:54:14,001 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-10-07 13:54:14,903 WARN L191 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 102 [2019-10-07 13:54:16,331 WARN L191 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 152 DAG size of output: 129 [2019-10-07 13:54:16,986 WARN L191 SmtUtils]: Spent 397.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-10-07 13:54:17,238 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-10-07 13:54:17,485 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-10-07 13:54:18,583 WARN L191 SmtUtils]: Spent 854.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 127 [2019-10-07 13:54:21,003 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 222 DAG size of output: 186 [2019-10-07 13:54:21,915 WARN L191 SmtUtils]: Spent 615.00 ms on a formula simplification that was a NOOP. DAG size: 177 [2019-10-07 13:54:22,881 WARN L191 SmtUtils]: Spent 644.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-10-07 13:54:26,612 WARN L191 SmtUtils]: Spent 3.25 s on a formula simplification. DAG size of input: 293 DAG size of output: 273 [2019-10-07 13:54:37,057 WARN L191 SmtUtils]: Spent 9.67 s on a formula simplification. DAG size of input: 443 DAG size of output: 376 [2019-10-07 13:54:43,719 WARN L191 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 345 DAG size of output: 333 [2019-10-07 13:54:43,776 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-07 13:54:43,776 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:54:43,778 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-07 13:54:43,779 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:54:43,779 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:54:43,779 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:54:43,780 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:54:43,800 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:54:43,864 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:54:44,254 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 34 for LOIs [2019-10-07 13:54:44,263 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:54:44,267 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:54:44,267 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:54:44,267 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 726#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:54:44,268 INFO L193 IcfgInterpreter]: Reachable states at location L24-1 satisfy 120#(and (= |main_#t~mem4| (select (select |#memory_int| |main_~#input_string~0.base|) (+ (ite (<= (mod main_~n_caracter~0 4294967296) 2147483647) (mod main_~n_caracter~0 4294967296) (+ (mod main_~n_caracter~0 4294967296) (- 4294967296))) |main_~#input_string~0.offset|))) (<= 0 main_~n_caracter~0)) [2019-10-07 13:54:44,268 INFO L193 IcfgInterpreter]: Reachable states at location L35-1 satisfy 674#(= |main_#t~mem11| (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| (ite (<= (mod main_~i~0 4294967296) 2147483647) (mod main_~i~0 4294967296) (+ (mod main_~i~0 4294967296) (- 4294967296)))))) [2019-10-07 13:54:44,268 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 588#(<= 0 main_~j~0) [2019-10-07 13:54:44,269 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 439#(and (<= 0 main_~i~0) (<= 0 main_~cont~0) (<= 0 main_~n_caracter~0)) [2019-10-07 13:54:44,269 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 431#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= 0 main_~cont~0) (<= 0 main_~n_caracter~0)) [2019-10-07 13:54:44,269 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 68#true [2019-10-07 13:54:44,269 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-07 13:54:44,270 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-07 13:54:44,270 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 731#(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-07 13:54:44,270 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:54:44,270 INFO L193 IcfgInterpreter]: Reachable states at location L6 satisfy 717#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#input_string~0.base_BEFORE_CALL_6| Int) (v_main_~i~0_BEFORE_CALL_6 Int) (|v_main_~#input_string~0.offset_BEFORE_CALL_6| Int) (v_prenex_52 Int) (v_prenex_51 Int) (v_prenex_50 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (<= (mod v_prenex_51 4294967296) 2147483647)) (= 0 (select (select |#memory_int| v_prenex_50) (+ v_prenex_52 (mod v_prenex_51 4294967296) (- 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (mod v_prenex_51 4294967296) 2147483647)) (= 0 (select (select |#memory_int| v_prenex_50) (+ v_prenex_52 (mod v_prenex_51 4294967296) (- 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= (mod v_main_~i~0_BEFORE_CALL_6 4294967296) 2147483647) (= (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_6|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_6| (mod v_main_~i~0_BEFORE_CALL_6 4294967296))) 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (mod v_main_~i~0_BEFORE_CALL_6 4294967296) 2147483647) (= (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_6|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_6| (mod v_main_~i~0_BEFORE_CALL_6 4294967296))) 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:54:44,270 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 712#(and (exists ((|v_main_~#input_string~0.base_BEFORE_CALL_6| Int) (v_main_~i~0_BEFORE_CALL_6 Int) (|v_main_~#input_string~0.offset_BEFORE_CALL_6| Int) (v_prenex_52 Int) (v_prenex_51 Int) (v_prenex_50 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (<= (mod v_prenex_51 4294967296) 2147483647)) (= 0 (select (select |#memory_int| v_prenex_50) (+ v_prenex_52 (mod v_prenex_51 4294967296) (- 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (mod v_prenex_51 4294967296) 2147483647)) (= 0 (select (select |#memory_int| v_prenex_50) (+ v_prenex_52 (mod v_prenex_51 4294967296) (- 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= (mod v_main_~i~0_BEFORE_CALL_6 4294967296) 2147483647) (= (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_6|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_6| (mod v_main_~i~0_BEFORE_CALL_6 4294967296))) 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (mod v_main_~i~0_BEFORE_CALL_6 4294967296) 2147483647) (= (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_6|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_6| (mod v_main_~i~0_BEFORE_CALL_6 4294967296))) 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:54:44,271 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 707#(exists ((|v_main_~#input_string~0.base_BEFORE_CALL_6| Int) (v_main_~i~0_BEFORE_CALL_6 Int) (|v_main_~#input_string~0.offset_BEFORE_CALL_6| Int) (v_prenex_52 Int) (v_prenex_51 Int) (v_prenex_50 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (<= (mod v_prenex_51 4294967296) 2147483647)) (= 0 (select (select |#memory_int| v_prenex_50) (+ v_prenex_52 (mod v_prenex_51 4294967296) (- 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (mod v_prenex_51 4294967296) 2147483647)) (= 0 (select (select |#memory_int| v_prenex_50) (+ v_prenex_52 (mod v_prenex_51 4294967296) (- 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= (mod v_main_~i~0_BEFORE_CALL_6 4294967296) 2147483647) (= (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_6|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_6| (mod v_main_~i~0_BEFORE_CALL_6 4294967296))) 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (mod v_main_~i~0_BEFORE_CALL_6 4294967296) 2147483647) (= (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_6|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_6| (mod v_main_~i~0_BEFORE_CALL_6 4294967296))) 0)))) [2019-10-07 13:54:44,271 INFO L193 IcfgInterpreter]: Reachable states at location L24-4 satisfy 125#(and (or (and (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (not (<= (mod main_~n_caracter~0 4294967296) 2147483647))) (and (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#input_string~0.offset|))) (<= (mod main_~n_caracter~0 4294967296) 2147483647))) (<= 0 main_~n_caracter~0)) [2019-10-07 13:54:44,271 INFO L193 IcfgInterpreter]: Reachable states at location L35-4 satisfy 640#(or (and (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|))) (<= (mod main_~i~0 4294967296) 2147483647)) (and (not (<= (mod main_~i~0 4294967296) 2147483647)) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))))) [2019-10-07 13:54:44,271 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 722#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#input_string~0.base_BEFORE_CALL_6| Int) (v_main_~i~0_BEFORE_CALL_6 Int) (|v_main_~#input_string~0.offset_BEFORE_CALL_6| Int) (v_prenex_52 Int) (v_prenex_51 Int) (v_prenex_50 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (<= (mod v_prenex_51 4294967296) 2147483647)) (= 0 (select (select |#memory_int| v_prenex_50) (+ v_prenex_52 (mod v_prenex_51 4294967296) (- 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (mod v_prenex_51 4294967296) 2147483647)) (= 0 (select (select |#memory_int| v_prenex_50) (+ v_prenex_52 (mod v_prenex_51 4294967296) (- 4294967296))))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= (mod v_main_~i~0_BEFORE_CALL_6 4294967296) 2147483647) (= (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_6|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_6| (mod v_main_~i~0_BEFORE_CALL_6 4294967296))) 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (mod v_main_~i~0_BEFORE_CALL_6 4294967296) 2147483647) (= (select (select |#memory_int| |v_main_~#input_string~0.base_BEFORE_CALL_6|) (+ |v_main_~#input_string~0.offset_BEFORE_CALL_6| (mod v_main_~i~0_BEFORE_CALL_6 4294967296))) 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:54:44,272 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 115#(<= 0 main_~n_caracter~0) [2019-10-07 13:54:44,272 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 73#(and (not (< (mod main_~i~0 4294967296) 5)) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 4)) |main_#t~mem3|)) [2019-10-07 13:54:44,272 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 703#true [2019-10-07 13:54:47,004 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:54:47,005 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 33, 23, 17] total 90 [2019-10-07 13:54:47,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-10-07 13:54:47,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-10-07 13:54:47,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=562, Invalid=7448, Unknown=0, NotChecked=0, Total=8010 [2019-10-07 13:54:47,010 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 90 states. [2019-10-07 13:54:52,865 WARN L191 SmtUtils]: Spent 925.00 ms on a formula simplification. DAG size of input: 463 DAG size of output: 47 [2019-10-07 13:54:54,681 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 471 DAG size of output: 57 [2019-10-07 13:54:56,401 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 463 DAG size of output: 48 [2019-10-07 13:54:58,072 WARN L191 SmtUtils]: Spent 937.00 ms on a formula simplification. DAG size of input: 471 DAG size of output: 58 [2019-10-07 13:55:08,975 WARN L191 SmtUtils]: Spent 10.03 s on a formula simplification. DAG size of input: 428 DAG size of output: 153 [2019-10-07 13:55:10,767 WARN L191 SmtUtils]: Spent 990.00 ms on a formula simplification. DAG size of input: 475 DAG size of output: 52 [2019-10-07 13:55:18,906 WARN L191 SmtUtils]: Spent 7.02 s on a formula simplification. DAG size of input: 435 DAG size of output: 162 [2019-10-07 13:55:28,515 WARN L191 SmtUtils]: Spent 8.27 s on a formula simplification. DAG size of input: 439 DAG size of output: 166 [2019-10-07 13:55:29,196 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-10-07 13:55:29,521 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-10-07 13:55:29,991 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-10-07 13:55:30,922 WARN L191 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 71 [2019-10-07 13:55:31,647 WARN L191 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 128 [2019-10-07 13:55:33,358 WARN L191 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 335 DAG size of output: 73 [2019-10-07 13:55:35,250 WARN L191 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 414 DAG size of output: 127 [2019-10-07 13:55:36,150 WARN L191 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 64 [2019-10-07 13:55:38,805 WARN L191 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 413 DAG size of output: 170 [2019-10-07 13:55:40,350 WARN L191 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 423 DAG size of output: 89 [2019-10-07 13:55:43,577 WARN L191 SmtUtils]: Spent 2.54 s on a formula simplification. DAG size of input: 557 DAG size of output: 80 [2019-10-07 13:55:46,625 WARN L191 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 463 DAG size of output: 147 [2019-10-07 13:55:47,111 WARN L191 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-10-07 13:55:49,112 WARN L191 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 552 DAG size of output: 92 [2019-10-07 13:55:52,032 WARN L191 SmtUtils]: Spent 2.36 s on a formula simplification. DAG size of input: 314 DAG size of output: 110 [2019-10-07 13:55:53,513 WARN L191 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 196 DAG size of output: 144 [2019-10-07 13:55:55,781 WARN L191 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 484 DAG size of output: 112 [2019-10-07 13:56:05,309 WARN L191 SmtUtils]: Spent 8.56 s on a formula simplification. DAG size of input: 589 DAG size of output: 181 [2019-10-07 13:56:07,393 WARN L191 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 442 DAG size of output: 111 [2019-10-07 13:56:08,126 WARN L191 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 114 [2019-10-07 13:56:19,720 WARN L191 SmtUtils]: Spent 10.56 s on a formula simplification. DAG size of input: 641 DAG size of output: 195 [2019-10-07 13:56:21,558 WARN L191 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 434 DAG size of output: 107 [2019-10-07 13:56:22,308 WARN L191 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 122 [2019-10-07 13:56:31,067 WARN L191 SmtUtils]: Spent 7.91 s on a formula simplification. DAG size of input: 577 DAG size of output: 173 [2019-10-07 13:56:32,867 WARN L191 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 427 DAG size of output: 129 [2019-10-07 13:56:34,611 WARN L191 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 222 DAG size of output: 131 [2019-10-07 13:56:35,144 WARN L191 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 91 [2019-10-07 13:56:36,509 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 201 DAG size of output: 150 [2019-10-07 13:56:37,950 WARN L191 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 176 DAG size of output: 131 [2019-10-07 13:56:39,786 WARN L191 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 433 DAG size of output: 136 [2019-10-07 13:56:50,320 WARN L191 SmtUtils]: Spent 9.66 s on a formula simplification. DAG size of input: 521 DAG size of output: 232 [2019-10-07 13:56:50,961 WARN L191 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 100 [2019-10-07 13:56:52,308 WARN L191 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 207 DAG size of output: 157 [2019-10-07 13:56:52,873 WARN L191 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 99 [2019-10-07 13:57:06,134 WARN L191 SmtUtils]: Spent 12.36 s on a formula simplification. DAG size of input: 565 DAG size of output: 251 [2019-10-07 13:57:07,012 WARN L191 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 128 [2019-10-07 13:57:09,677 WARN L191 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 261 DAG size of output: 166 [2019-10-07 13:57:10,776 WARN L191 SmtUtils]: Spent 863.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 150 [2019-10-07 13:57:22,479 WARN L191 SmtUtils]: Spent 10.74 s on a formula simplification. DAG size of input: 568 DAG size of output: 244 [2019-10-07 13:57:55,740 WARN L191 SmtUtils]: Spent 32.00 s on a formula simplification. DAG size of input: 584 DAG size of output: 231 [2019-10-07 13:57:57,881 WARN L191 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 529 DAG size of output: 108 [2019-10-07 13:58:03,644 WARN L191 SmtUtils]: Spent 5.02 s on a formula simplification. DAG size of input: 532 DAG size of output: 161 [2019-10-07 13:58:05,796 WARN L191 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 436 DAG size of output: 135 [2019-10-07 13:58:26,634 WARN L191 SmtUtils]: Spent 18.96 s on a formula simplification. DAG size of input: 635 DAG size of output: 163 [2019-10-07 13:58:26,967 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-10-07 13:58:28,855 WARN L191 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 184 DAG size of output: 169 [2019-10-07 13:58:30,904 WARN L191 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 531 DAG size of output: 113 [2019-10-07 13:58:35,153 WARN L191 SmtUtils]: Spent 3.49 s on a formula simplification. DAG size of input: 581 DAG size of output: 149 [2019-10-07 13:58:37,155 WARN L191 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 471 DAG size of output: 104 [2019-10-07 13:58:39,989 WARN L191 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 461 DAG size of output: 124 [2019-10-07 13:58:44,705 WARN L191 SmtUtils]: Spent 3.79 s on a formula simplification. DAG size of input: 305 DAG size of output: 147 [2019-10-07 13:58:44,964 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-10-07 13:59:00,869 WARN L191 SmtUtils]: Spent 14.82 s on a formula simplification. DAG size of input: 529 DAG size of output: 216 [2019-10-07 13:59:04,398 WARN L191 SmtUtils]: Spent 2.83 s on a formula simplification. DAG size of input: 540 DAG size of output: 98 [2019-10-07 13:59:09,099 WARN L191 SmtUtils]: Spent 3.92 s on a formula simplification. DAG size of input: 584 DAG size of output: 127 [2019-10-07 13:59:19,840 WARN L191 SmtUtils]: Spent 9.88 s on a formula simplification. DAG size of input: 609 DAG size of output: 185 [2019-10-07 13:59:22,290 WARN L191 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 493 DAG size of output: 100 [2019-10-07 13:59:25,167 WARN L191 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 467 DAG size of output: 132 [2019-10-07 13:59:47,457 WARN L191 SmtUtils]: Spent 20.94 s on a formula simplification. DAG size of input: 583 DAG size of output: 160 [2019-10-07 13:59:49,171 WARN L191 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 176 DAG size of output: 140 [2019-10-07 14:00:23,285 WARN L191 SmtUtils]: Spent 32.33 s on a formula simplification. DAG size of input: 573 DAG size of output: 230 [2019-10-07 14:00:27,939 WARN L191 SmtUtils]: Spent 3.76 s on a formula simplification. DAG size of input: 557 DAG size of output: 115 [2019-10-07 14:00:35,741 WARN L191 SmtUtils]: Spent 6.97 s on a formula simplification. DAG size of input: 641 DAG size of output: 128 [2019-10-07 14:00:46,382 WARN L191 SmtUtils]: Spent 9.86 s on a formula simplification. DAG size of input: 617 DAG size of output: 191 [2019-10-07 14:00:48,867 WARN L191 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 499 DAG size of output: 108 [2019-10-07 14:00:50,074 WARN L191 SmtUtils]: Spent 970.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 112 [2019-10-07 14:01:09,324 WARN L191 SmtUtils]: Spent 17.63 s on a formula simplification. DAG size of input: 624 DAG size of output: 160 [2019-10-07 14:01:16,156 WARN L191 SmtUtils]: Spent 6.04 s on a formula simplification. DAG size of input: 515 DAG size of output: 105