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/array-crafted/zero_sum2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:30:27,386 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:30:27,389 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:30:27,406 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:30:27,407 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:30:27,409 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:30:27,411 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:30:27,420 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:30:27,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:30:27,428 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:30:27,428 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:30:27,430 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:30:27,431 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:30:27,432 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:30:27,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:30:27,436 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:30:27,437 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:30:27,438 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:30:27,439 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:30:27,444 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:30:27,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:30:27,452 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:30:27,454 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:30:27,455 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:30:27,457 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:30:27,457 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:30:27,457 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:30:27,459 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:30:27,460 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:30:27,461 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:30:27,461 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:30:27,462 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:30:27,463 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:30:27,463 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:30:27,465 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:30:27,465 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:30:27,466 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:30:27,466 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:30:27,466 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:30:27,467 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:30:27,468 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:30:27,469 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-15 01:30:27,501 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:30:27,502 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:30:27,503 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:30:27,503 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:30:27,503 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:30:27,507 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:30:27,508 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:30:27,508 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:30:27,508 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:30:27,508 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:30:27,508 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:30:27,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:30:27,509 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:30:27,509 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:30:27,509 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:30:27,509 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:30:27,509 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:30:27,510 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:30:27,510 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:30:27,510 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:30:27,510 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:30:27,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:30:27,511 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:30:27,511 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:30:27,511 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:30:27,511 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:30:27,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:30:27,512 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:30:27,512 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-15 01:30:27,773 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:30:27,785 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:30:27,788 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:30:27,790 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:30:27,790 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:30:27,791 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/zero_sum2.c [2019-10-15 01:30:27,851 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cb75d873/336acc485f4b46309ebef9da0fd696ef/FLAG5d9153c39 [2019-10-15 01:30:28,280 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:30:28,281 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/zero_sum2.c [2019-10-15 01:30:28,287 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cb75d873/336acc485f4b46309ebef9da0fd696ef/FLAG5d9153c39 [2019-10-15 01:30:28,682 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cb75d873/336acc485f4b46309ebef9da0fd696ef [2019-10-15 01:30:28,692 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:30:28,694 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:30:28,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:30:28,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:30:28,698 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:30:28,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:30:28" (1/1) ... [2019-10-15 01:30:28,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a425a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:28, skipping insertion in model container [2019-10-15 01:30:28,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:30:28" (1/1) ... [2019-10-15 01:30:28,709 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:30:28,727 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:30:28,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:30:28,969 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:30:29,009 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:30:29,187 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:30:29,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:29 WrapperNode [2019-10-15 01:30:29,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:30:29,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:30:29,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:30:29,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:30:29,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:29" (1/1) ... [2019-10-15 01:30:29,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:29" (1/1) ... [2019-10-15 01:30:29,214 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:29" (1/1) ... [2019-10-15 01:30:29,217 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:29" (1/1) ... [2019-10-15 01:30:29,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:29" (1/1) ... [2019-10-15 01:30:29,246 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:29" (1/1) ... [2019-10-15 01:30:29,253 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:29" (1/1) ... [2019-10-15 01:30:29,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:30:29,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:30:29,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:30:29,256 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:30:29,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:29" (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-15 01:30:29,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:30:29,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:30:29,318 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-15 01:30:29,318 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:30:29,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:30:29,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:30:29,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 01:30:29,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2019-10-15 01:30:29,319 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:30:29,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:30:29,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:30:29,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:30:29,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:30:29,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:30:29,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:30:29,750 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:30:29,751 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-15 01:30:29,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:30:29 BoogieIcfgContainer [2019-10-15 01:30:29,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:30:29,753 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:30:29,753 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:30:29,756 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:30:29,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:30:28" (1/3) ... [2019-10-15 01:30:29,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2ac696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:30:29, skipping insertion in model container [2019-10-15 01:30:29,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:30:29" (2/3) ... [2019-10-15 01:30:29,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2ac696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:30:29, skipping insertion in model container [2019-10-15 01:30:29,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:30:29" (3/3) ... [2019-10-15 01:30:29,759 INFO L109 eAbstractionObserver]: Analyzing ICFG zero_sum2.c [2019-10-15 01:30:29,769 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:30:29,777 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:30:29,787 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:30:29,811 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:30:29,812 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:30:29,812 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:30:29,812 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:30:29,812 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:30:29,812 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:30:29,813 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:30:29,813 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:30:29,830 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-15 01:30:29,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-15 01:30:29,836 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:29,837 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:29,839 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:29,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:29,844 INFO L82 PathProgramCache]: Analyzing trace with hash -112684807, now seen corresponding path program 1 times [2019-10-15 01:30:29,854 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:29,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697092344] [2019-10-15 01:30:29,854 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:29,855 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:29,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:30,058 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-15 01:30:30,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697092344] [2019-10-15 01:30:30,060 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:30:30,060 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:30:30,060 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911942773] [2019-10-15 01:30:30,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:30:30,065 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:30,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:30:30,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:30:30,082 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2019-10-15 01:30:30,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:30,158 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2019-10-15 01:30:30,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:30:30,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-15 01:30:30,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:30,169 INFO L225 Difference]: With dead ends: 44 [2019-10-15 01:30:30,170 INFO L226 Difference]: Without dead ends: 20 [2019-10-15 01:30:30,173 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:30:30,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-15 01:30:30,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-15 01:30:30,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-15 01:30:30,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2019-10-15 01:30:30,207 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 15 [2019-10-15 01:30:30,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:30,207 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-10-15 01:30:30,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:30:30,208 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2019-10-15 01:30:30,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-15 01:30:30,208 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:30,209 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:30,209 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:30,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:30,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1049806191, now seen corresponding path program 1 times [2019-10-15 01:30:30,210 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:30,210 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639125591] [2019-10-15 01:30:30,211 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:30,211 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:30,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:30,270 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-15 01:30:30,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639125591] [2019-10-15 01:30:30,271 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:30:30,271 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:30:30,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509493178] [2019-10-15 01:30:30,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:30:30,277 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:30,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:30:30,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:30:30,278 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand 3 states. [2019-10-15 01:30:30,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:30,315 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2019-10-15 01:30:30,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:30:30,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-15 01:30:30,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:30,317 INFO L225 Difference]: With dead ends: 34 [2019-10-15 01:30:30,317 INFO L226 Difference]: Without dead ends: 21 [2019-10-15 01:30:30,318 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:30:30,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-15 01:30:30,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-15 01:30:30,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-15 01:30:30,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-10-15 01:30:30,325 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 16 [2019-10-15 01:30:30,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:30,325 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-10-15 01:30:30,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:30:30,325 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2019-10-15 01:30:30,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 01:30:30,326 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:30,327 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:30,327 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:30,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:30,327 INFO L82 PathProgramCache]: Analyzing trace with hash 2044317511, now seen corresponding path program 1 times [2019-10-15 01:30:30,329 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:30,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930797479] [2019-10-15 01:30:30,330 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:30,330 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:30,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:30,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:30,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 01:30:30,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930797479] [2019-10-15 01:30:30,415 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:30:30,416 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:30:30,416 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573540949] [2019-10-15 01:30:30,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:30:30,417 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:30,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:30:30,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:30:30,418 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand 4 states. [2019-10-15 01:30:30,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:30,463 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2019-10-15 01:30:30,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:30:30,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-15 01:30:30,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:30,465 INFO L225 Difference]: With dead ends: 32 [2019-10-15 01:30:30,465 INFO L226 Difference]: Without dead ends: 21 [2019-10-15 01:30:30,466 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:30:30,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-15 01:30:30,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-15 01:30:30,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-15 01:30:30,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-15 01:30:30,472 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 17 [2019-10-15 01:30:30,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:30,472 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-15 01:30:30,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:30:30,473 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-15 01:30:30,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 01:30:30,473 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:30,473 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:30,474 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:30,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:30,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1165736995, now seen corresponding path program 1 times [2019-10-15 01:30:30,475 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:30,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061443725] [2019-10-15 01:30:30,475 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:30,475 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:30,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:30,554 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-15 01:30:30,554 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061443725] [2019-10-15 01:30:30,555 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411246081] [2019-10-15 01:30:30,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:30,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:30:30,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:30,709 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-15 01:30:30,710 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:30,748 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-15 01:30:30,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1703077515] [2019-10-15 01:30:30,771 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-15 01:30:30,771 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:30,777 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:30,784 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:30,785 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:30,949 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-15 01:30:31,347 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:30:31,365 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:30:31,372 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:31,777 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:31,777 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4, 11] total 19 [2019-10-15 01:30:31,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584156006] [2019-10-15 01:30:31,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-15 01:30:31,779 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:31,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-15 01:30:31,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:30:31,781 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 19 states. [2019-10-15 01:30:32,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:32,156 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2019-10-15 01:30:32,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 01:30:32,157 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 20 [2019-10-15 01:30:32,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:32,158 INFO L225 Difference]: With dead ends: 39 [2019-10-15 01:30:32,158 INFO L226 Difference]: Without dead ends: 26 [2019-10-15 01:30:32,159 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2019-10-15 01:30:32,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-15 01:30:32,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-15 01:30:32,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-15 01:30:32,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-10-15 01:30:32,172 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 20 [2019-10-15 01:30:32,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:32,173 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-10-15 01:30:32,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-15 01:30:32,175 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-10-15 01:30:32,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:30:32,177 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:32,177 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:32,382 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:32,382 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:32,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:32,383 INFO L82 PathProgramCache]: Analyzing trace with hash 513164793, now seen corresponding path program 2 times [2019-10-15 01:30:32,383 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:32,383 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642887451] [2019-10-15 01:30:32,383 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:32,383 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:32,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:32,960 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:30:32,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642887451] [2019-10-15 01:30:32,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776260720] [2019-10-15 01:30:32,961 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 01:30:33,060 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-15 01:30:33,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:33,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-15 01:30:33,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:33,574 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:30:33,575 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:34,752 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 45 [2019-10-15 01:30:35,107 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 36 [2019-10-15 01:30:35,292 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:30:35,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1635643864] [2019-10-15 01:30:35,294 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-15 01:30:35,294 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:35,295 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:35,295 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:35,295 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:35,324 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-15 01:30:35,540 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:30:35,555 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:30:35,560 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:36,365 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:36,366 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 18, 11] total 50 [2019-10-15 01:30:36,366 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032199787] [2019-10-15 01:30:36,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-15 01:30:36,367 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:36,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-15 01:30:36,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2248, Unknown=0, NotChecked=0, Total=2450 [2019-10-15 01:30:36,369 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 50 states. [2019-10-15 01:30:37,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:37,722 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2019-10-15 01:30:37,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-15 01:30:37,723 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 25 [2019-10-15 01:30:37,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:37,725 INFO L225 Difference]: With dead ends: 41 [2019-10-15 01:30:37,725 INFO L226 Difference]: Without dead ends: 36 [2019-10-15 01:30:37,727 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1095 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=313, Invalid=3469, Unknown=0, NotChecked=0, Total=3782 [2019-10-15 01:30:37,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-15 01:30:37,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2019-10-15 01:30:37,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-15 01:30:37,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2019-10-15 01:30:37,734 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 25 [2019-10-15 01:30:37,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:37,735 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-10-15 01:30:37,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-15 01:30:37,735 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2019-10-15 01:30:37,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 01:30:37,736 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:37,736 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:37,940 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:37,941 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:37,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:37,941 INFO L82 PathProgramCache]: Analyzing trace with hash -609919663, now seen corresponding path program 3 times [2019-10-15 01:30:37,941 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:37,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717620388] [2019-10-15 01:30:37,941 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:37,942 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:37,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:38,033 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:30:38,033 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717620388] [2019-10-15 01:30:38,033 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558881125] [2019-10-15 01:30:38,033 INFO L92 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 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-15 01:30:38,090 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 01:30:38,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:38,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-15 01:30:38,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:38,141 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:30:38,141 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:38,178 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:30:38,179 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [789848137] [2019-10-15 01:30:38,181 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-15 01:30:38,181 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:38,182 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:38,184 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:38,185 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:38,222 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-15 01:30:38,434 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:30:38,446 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:30:38,450 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:38,801 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:38,802 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 11] total 24 [2019-10-15 01:30:38,802 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535885770] [2019-10-15 01:30:38,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-15 01:30:38,803 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:38,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-15 01:30:38,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2019-10-15 01:30:38,805 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 24 states. [2019-10-15 01:30:39,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:39,331 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2019-10-15 01:30:39,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-15 01:30:39,332 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 26 [2019-10-15 01:30:39,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:39,344 INFO L225 Difference]: With dead ends: 63 [2019-10-15 01:30:39,345 INFO L226 Difference]: Without dead ends: 42 [2019-10-15 01:30:39,347 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=197, Invalid=1063, Unknown=0, NotChecked=0, Total=1260 [2019-10-15 01:30:39,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-15 01:30:39,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2019-10-15 01:30:39,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-15 01:30:39,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2019-10-15 01:30:39,362 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 26 [2019-10-15 01:30:39,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:39,363 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2019-10-15 01:30:39,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-15 01:30:39,363 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2019-10-15 01:30:39,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 01:30:39,364 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:39,364 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:39,569 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:39,569 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:39,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:39,569 INFO L82 PathProgramCache]: Analyzing trace with hash 63235344, now seen corresponding path program 4 times [2019-10-15 01:30:39,569 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:39,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576175894] [2019-10-15 01:30:39,570 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:39,570 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:39,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:39,639 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:30:39,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576175894] [2019-10-15 01:30:39,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232640424] [2019-10-15 01:30:39,640 INFO L92 rtionOrderModulation]: Changing assertion order to 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-15 01:30:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:39,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-15 01:30:39,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:39,759 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:30:39,759 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:39,792 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:30:39,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [237266482] [2019-10-15 01:30:39,797 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-15 01:30:39,797 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:39,798 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:39,798 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:39,798 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:39,822 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-15 01:30:39,981 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:30:39,995 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:30:40,000 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:40,464 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2019-10-15 01:30:40,730 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:40,731 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 23 [2019-10-15 01:30:40,731 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446021070] [2019-10-15 01:30:40,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-15 01:30:40,734 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:40,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-15 01:30:40,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2019-10-15 01:30:40,736 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 23 states. [2019-10-15 01:30:41,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:41,275 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2019-10-15 01:30:41,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-15 01:30:41,277 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 26 [2019-10-15 01:30:41,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:41,278 INFO L225 Difference]: With dead ends: 62 [2019-10-15 01:30:41,278 INFO L226 Difference]: Without dead ends: 36 [2019-10-15 01:30:41,283 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2019-10-15 01:30:41,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-15 01:30:41,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-15 01:30:41,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-15 01:30:41,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2019-10-15 01:30:41,298 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 26 [2019-10-15 01:30:41,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:41,299 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-10-15 01:30:41,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-15 01:30:41,299 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2019-10-15 01:30:41,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 01:30:41,300 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:41,300 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:41,507 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:41,508 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:41,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:41,508 INFO L82 PathProgramCache]: Analyzing trace with hash 924814918, now seen corresponding path program 5 times [2019-10-15 01:30:41,509 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:41,509 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266066814] [2019-10-15 01:30:41,511 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:41,511 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:41,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:41,588 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:30:41,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266066814] [2019-10-15 01:30:41,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079215822] [2019-10-15 01:30:41,589 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 01:30:41,672 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-15 01:30:41,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:41,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-15 01:30:41,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:41,744 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:30:41,744 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:41,800 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:30:41,801 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1170551202] [2019-10-15 01:30:41,802 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-15 01:30:41,802 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:41,803 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:41,803 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:41,803 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:41,822 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-15 01:30:41,935 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:30:41,944 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:30:41,947 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:42,317 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:42,317 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 11] total 26 [2019-10-15 01:30:42,317 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284927814] [2019-10-15 01:30:42,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-15 01:30:42,318 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:42,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-15 01:30:42,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2019-10-15 01:30:42,320 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 26 states. [2019-10-15 01:30:42,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:42,869 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-10-15 01:30:42,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-15 01:30:42,870 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 27 [2019-10-15 01:30:42,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:42,871 INFO L225 Difference]: With dead ends: 42 [2019-10-15 01:30:42,871 INFO L226 Difference]: Without dead ends: 31 [2019-10-15 01:30:42,872 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=186, Invalid=1074, Unknown=0, NotChecked=0, Total=1260 [2019-10-15 01:30:42,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-15 01:30:42,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-10-15 01:30:42,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-15 01:30:42,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-10-15 01:30:42,878 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 27 [2019-10-15 01:30:42,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:42,879 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-15 01:30:42,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-15 01:30:42,879 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-10-15 01:30:42,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 01:30:42,880 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:42,880 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:43,091 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:43,093 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:43,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:43,093 INFO L82 PathProgramCache]: Analyzing trace with hash -902503389, now seen corresponding path program 6 times [2019-10-15 01:30:43,093 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:43,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467927074] [2019-10-15 01:30:43,093 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:43,093 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:43,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:43,557 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2019-10-15 01:30:43,685 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2019-10-15 01:30:44,699 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:30:44,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467927074] [2019-10-15 01:30:44,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541047200] [2019-10-15 01:30:44,700 INFO L92 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 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-15 01:30:44,798 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 01:30:44,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:44,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-15 01:30:44,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:45,203 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:30:45,203 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:45,868 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 29 [2019-10-15 01:30:45,941 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:30:45,942 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [211226902] [2019-10-15 01:30:45,943 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-15 01:30:45,943 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:45,944 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:45,944 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:45,944 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:45,969 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-15 01:30:46,094 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:30:46,103 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:30:46,105 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:46,735 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:46,735 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 13, 13, 11] total 52 [2019-10-15 01:30:46,735 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050214367] [2019-10-15 01:30:46,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-15 01:30:46,737 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:46,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-15 01:30:46,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2466, Unknown=0, NotChecked=0, Total=2652 [2019-10-15 01:30:46,738 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 52 states. [2019-10-15 01:30:48,486 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-10-15 01:30:49,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:49,350 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2019-10-15 01:30:49,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-15 01:30:49,350 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 30 [2019-10-15 01:30:49,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:49,352 INFO L225 Difference]: With dead ends: 78 [2019-10-15 01:30:49,352 INFO L226 Difference]: Without dead ends: 57 [2019-10-15 01:30:49,355 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1763 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=474, Invalid=5688, Unknown=0, NotChecked=0, Total=6162 [2019-10-15 01:30:49,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-15 01:30:49,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 42. [2019-10-15 01:30:49,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-15 01:30:49,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2019-10-15 01:30:49,364 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 30 [2019-10-15 01:30:49,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:49,364 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2019-10-15 01:30:49,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-15 01:30:49,365 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2019-10-15 01:30:49,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 01:30:49,366 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:49,366 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:49,569 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:49,570 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:49,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:49,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1924146806, now seen corresponding path program 7 times [2019-10-15 01:30:49,571 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:49,571 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327054038] [2019-10-15 01:30:49,571 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:49,571 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:49,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:49,661 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:30:49,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327054038] [2019-10-15 01:30:49,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773296977] [2019-10-15 01:30:49,662 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 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-15 01:30:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:49,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-15 01:30:49,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:49,885 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:30:49,885 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:49,954 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:30:49,954 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [814974368] [2019-10-15 01:30:49,955 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-15 01:30:49,957 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:49,957 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:49,957 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:49,957 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:49,981 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-15 01:30:50,117 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:30:50,125 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:30:50,128 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:50,515 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:50,515 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 30 [2019-10-15 01:30:50,515 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068162125] [2019-10-15 01:30:50,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-15 01:30:50,517 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:50,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-15 01:30:50,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=746, Unknown=0, NotChecked=0, Total=870 [2019-10-15 01:30:50,518 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 30 states. [2019-10-15 01:30:51,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:51,293 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2019-10-15 01:30:51,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-15 01:30:51,294 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 31 [2019-10-15 01:30:51,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:51,295 INFO L225 Difference]: With dead ends: 90 [2019-10-15 01:30:51,295 INFO L226 Difference]: Without dead ends: 46 [2019-10-15 01:30:51,297 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 68 SyntacticMatches, 7 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=322, Invalid=1934, Unknown=0, NotChecked=0, Total=2256 [2019-10-15 01:30:51,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-15 01:30:51,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2019-10-15 01:30:51,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-15 01:30:51,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2019-10-15 01:30:51,305 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 31 [2019-10-15 01:30:51,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:51,305 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-10-15 01:30:51,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-15 01:30:51,305 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2019-10-15 01:30:51,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-15 01:30:51,306 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:51,306 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:51,512 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:51,513 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:51,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:51,514 INFO L82 PathProgramCache]: Analyzing trace with hash 2021025832, now seen corresponding path program 8 times [2019-10-15 01:30:51,514 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:51,514 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025272664] [2019-10-15 01:30:51,515 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:51,515 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:51,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:51,591 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:30:51,592 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025272664] [2019-10-15 01:30:51,592 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670348489] [2019-10-15 01:30:51,592 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 01:30:51,713 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-15 01:30:51,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:51,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-15 01:30:51,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:51,775 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:30:51,775 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:51,822 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:30:51,822 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1279395134] [2019-10-15 01:30:51,823 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-15 01:30:51,823 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:51,823 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:51,824 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:51,824 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:51,850 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-15 01:30:51,968 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:30:51,978 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:30:51,981 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:52,443 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:52,444 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 26 [2019-10-15 01:30:52,444 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845582255] [2019-10-15 01:30:52,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-15 01:30:52,445 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:52,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-15 01:30:52,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2019-10-15 01:30:52,445 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 26 states. [2019-10-15 01:30:52,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:52,961 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-10-15 01:30:52,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-15 01:30:52,961 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 33 [2019-10-15 01:30:52,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:52,962 INFO L225 Difference]: With dead ends: 45 [2019-10-15 01:30:52,962 INFO L226 Difference]: Without dead ends: 36 [2019-10-15 01:30:52,963 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 78 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2019-10-15 01:30:52,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-15 01:30:52,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-15 01:30:52,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-15 01:30:52,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-10-15 01:30:52,977 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 33 [2019-10-15 01:30:52,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:52,978 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-10-15 01:30:52,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-15 01:30:52,978 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-10-15 01:30:52,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-15 01:30:52,979 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:52,979 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:53,179 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:53,180 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:53,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:53,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1919390983, now seen corresponding path program 9 times [2019-10-15 01:30:53,181 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:53,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364033878] [2019-10-15 01:30:53,182 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:53,182 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:53,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:53,729 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 25 [2019-10-15 01:30:53,851 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 27 [2019-10-15 01:30:53,974 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2019-10-15 01:30:54,246 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 34 [2019-10-15 01:30:54,373 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 39 [2019-10-15 01:30:55,598 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:30:55,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364033878] [2019-10-15 01:30:55,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356452526] [2019-10-15 01:30:55,599 INFO L92 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 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-15 01:30:55,724 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 01:30:55,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:55,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 74 conjunts are in the unsatisfiable core [2019-10-15 01:30:55,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:56,365 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:30:56,366 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:31:04,583 WARN L191 SmtUtils]: Spent 5.05 s on a formula simplification. DAG size of input: 2998 DAG size of output: 34 [2019-10-15 01:31:04,665 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:31:04,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [158371322] [2019-10-15 01:31:04,666 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-15 01:31:04,666 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:31:04,667 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:31:04,667 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:31:04,667 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:31:04,694 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-15 01:31:04,802 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:31:04,809 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:31:04,812 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:31:05,513 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:31:05,513 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 15, 15, 11] total 61 [2019-10-15 01:31:05,513 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376097749] [2019-10-15 01:31:05,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-15 01:31:05,514 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:31:05,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-15 01:31:05,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=3428, Unknown=0, NotChecked=0, Total=3660 [2019-10-15 01:31:05,516 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 61 states.