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_sum1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:30:27,362 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:30:27,365 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:30:27,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:30:27,378 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:30:27,379 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:30:27,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:30:27,382 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:30:27,384 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:30:27,385 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:30:27,386 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:30:27,388 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:30:27,388 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:30:27,389 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:30:27,390 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:30:27,392 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:30:27,392 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:30:27,394 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:30:27,395 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:30:27,398 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:30:27,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:30:27,401 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:30:27,402 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:30:27,403 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:30:27,405 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:30:27,406 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:30:27,406 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:30:27,407 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:30:27,407 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:30:27,408 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:30:27,408 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:30:27,409 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:30:27,410 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:30:27,411 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:30:27,412 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:30:27,412 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:30:27,413 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:30:27,413 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:30:27,413 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:30:27,414 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:30:27,415 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:30:27,416 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,431 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:30:27,432 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:30:27,434 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:30:27,434 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:30:27,434 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:30:27,435 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:30:27,435 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:30:27,436 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:30:27,436 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:30:27,436 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:30:27,437 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:30:27,437 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:30:27,437 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:30:27,437 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:30:27,437 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:30:27,438 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:30:27,438 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:30:27,439 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:30:27,440 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:30:27,440 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:30:27,440 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:30:27,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:30:27,441 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:30:27,441 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:30:27,441 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:30:27,441 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:30:27,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:30:27,442 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:30:27,442 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,761 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:30:27,776 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:30:27,781 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:30:27,782 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:30:27,783 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:30:27,784 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/zero_sum1.c [2019-10-15 01:30:27,860 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7ad4e537/01948f61bd774d9985c83c88aa073e7c/FLAG9f9dd19c9 [2019-10-15 01:30:28,362 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:30:28,363 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/zero_sum1.c [2019-10-15 01:30:28,370 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7ad4e537/01948f61bd774d9985c83c88aa073e7c/FLAG9f9dd19c9 [2019-10-15 01:30:28,781 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7ad4e537/01948f61bd774d9985c83c88aa073e7c [2019-10-15 01:30:28,792 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:30:28,793 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:30:28,794 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:30:28,794 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:30:28,797 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:30:28,798 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,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@517e93e7 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,800 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,807 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:30:28,821 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:30:29,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:30:29,024 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:30:29,044 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:30:29,065 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:30:29,066 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,066 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:30:29,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:30:29,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:30:29,067 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:30:29,169 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,171 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,179 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,180 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,186 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,192 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,193 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,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:30:29,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:30:29,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:30:29,197 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:30:29,200 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,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:30:29,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:30:29,252 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-15 01:30:29,253 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:30:29,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:30:29,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:30:29,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 01:30:29,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2019-10-15 01:30:29,253 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:30:29,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:30:29,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:30:29,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:30:29,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:30:29,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:30:29,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:30:29,666 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:30:29,666 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-15 01:30:29,667 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,668 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:30:29,669 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:30:29,669 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:30:29,672 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:30:29,672 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,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49cd0325 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,673 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,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49cd0325 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,674 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,676 INFO L109 eAbstractionObserver]: Analyzing ICFG zero_sum1.c [2019-10-15 01:30:29,686 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:30:29,695 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:30:29,707 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:30:29,736 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:30:29,736 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:30:29,736 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:30:29,736 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:30:29,737 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:30:29,737 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:30:29,737 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:30:29,737 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:30:29,755 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-10-15 01:30:29,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 01:30:29,761 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:29,762 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:29,764 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:29,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:29,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1031182649, now seen corresponding path program 1 times [2019-10-15 01:30:29,777 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:29,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905870089] [2019-10-15 01:30:29,778 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:29,778 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:29,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:29,983 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:29,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905870089] [2019-10-15 01:30:29,985 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:30:29,986 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:30:29,986 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577742563] [2019-10-15 01:30:29,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:30:29,992 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:30,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:30:30,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:30:30,006 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2019-10-15 01:30:30,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:30,082 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2019-10-15 01:30:30,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:30:30,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-15 01:30:30,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:30,092 INFO L225 Difference]: With dead ends: 40 [2019-10-15 01:30:30,092 INFO L226 Difference]: Without dead ends: 16 [2019-10-15 01:30:30,095 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,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-10-15 01:30:30,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-10-15 01:30:30,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-15 01:30:30,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-10-15 01:30:30,129 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 13 [2019-10-15 01:30:30,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:30,129 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-10-15 01:30:30,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:30:30,130 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2019-10-15 01:30:30,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-15 01:30:30,130 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:30,131 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:30,131 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:30,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:30,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1822912223, now seen corresponding path program 1 times [2019-10-15 01:30:30,132 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:30,132 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929033] [2019-10-15 01:30:30,132 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:30,132 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:30,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:30,189 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,190 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929033] [2019-10-15 01:30:30,190 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:30:30,190 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:30:30,191 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126165181] [2019-10-15 01:30:30,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:30:30,193 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:30,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:30:30,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:30:30,194 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 3 states. [2019-10-15 01:30:30,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:30,220 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2019-10-15 01:30:30,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:30:30,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-15 01:30:30,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:30,222 INFO L225 Difference]: With dead ends: 26 [2019-10-15 01:30:30,222 INFO L226 Difference]: Without dead ends: 17 [2019-10-15 01:30:30,223 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,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-15 01:30:30,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-15 01:30:30,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-15 01:30:30,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-10-15 01:30:30,230 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 14 [2019-10-15 01:30:30,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:30,230 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-10-15 01:30:30,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:30:30,230 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-10-15 01:30:30,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-15 01:30:30,231 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:30,231 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:30,232 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:30,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:30,232 INFO L82 PathProgramCache]: Analyzing trace with hash 377267447, now seen corresponding path program 1 times [2019-10-15 01:30:30,233 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:30,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982062341] [2019-10-15 01:30:30,233 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:30,234 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:30,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:30,309 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,312 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982062341] [2019-10-15 01:30:30,313 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:30:30,313 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:30:30,313 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226940829] [2019-10-15 01:30:30,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:30:30,315 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:30,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:30:30,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:30:30,316 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 4 states. [2019-10-15 01:30:30,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:30,359 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2019-10-15 01:30:30,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:30:30,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-15 01:30:30,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:30,361 INFO L225 Difference]: With dead ends: 24 [2019-10-15 01:30:30,361 INFO L226 Difference]: Without dead ends: 17 [2019-10-15 01:30:30,362 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,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-15 01:30:30,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-15 01:30:30,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-15 01:30:30,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-10-15 01:30:30,367 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 15 [2019-10-15 01:30:30,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:30,368 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-10-15 01:30:30,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:30:30,368 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-10-15 01:30:30,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-15 01:30:30,369 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:30,369 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,369 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:30,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:30,370 INFO L82 PathProgramCache]: Analyzing trace with hash 492654506, now seen corresponding path program 1 times [2019-10-15 01:30:30,370 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:30,370 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231912563] [2019-10-15 01:30:30,371 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:30,371 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:30,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:30,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 01:30:30,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231912563] [2019-10-15 01:30:30,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340444860] [2019-10-15 01:30:30,439 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,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:30,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:30:30,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:30,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 01:30:30,585 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:30,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 01:30:30,618 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1009144763] [2019-10-15 01:30:30,646 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-15 01:30:30,646 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:30,653 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:30,663 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:30,664 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:30,860 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-15 01:30:31,222 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:30:31,260 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:30:31,270 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:31,728 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:31,728 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-15 01:30:31,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946837459] [2019-10-15 01:30:31,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-15 01:30:31,732 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:31,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-15 01:30:31,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-10-15 01:30:31,735 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 17 states. [2019-10-15 01:30:32,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:32,044 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2019-10-15 01:30:32,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 01:30:32,044 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-10-15 01:30:32,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:32,045 INFO L225 Difference]: With dead ends: 27 [2019-10-15 01:30:32,045 INFO L226 Difference]: Without dead ends: 18 [2019-10-15 01:30:32,046 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2019-10-15 01:30:32,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-15 01:30:32,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-15 01:30:32,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-15 01:30:32,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-15 01:30:32,051 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 16 [2019-10-15 01:30:32,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:32,052 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-15 01:30:32,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-15 01:30:32,052 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-15 01:30:32,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 01:30:32,053 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:32,053 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:32,259 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:32,259 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:32,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:32,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1497538622, now seen corresponding path program 2 times [2019-10-15 01:30:32,260 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:32,260 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344775653] [2019-10-15 01:30:32,260 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:32,261 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:32,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:32,346 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:32,347 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344775653] [2019-10-15 01:30:32,347 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571064489] [2019-10-15 01:30:32,347 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:32,408 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-15 01:30:32,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:32,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:30:32,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:32,445 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:32,446 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:32,469 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:32,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2008982768] [2019-10-15 01:30:32,470 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-15 01:30:32,471 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:32,472 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:32,472 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:32,472 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:32,520 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-15 01:30:32,728 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:30:32,757 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:30:32,764 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:33,146 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:33,146 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 11] total 18 [2019-10-15 01:30:33,146 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025237764] [2019-10-15 01:30:33,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-15 01:30:33,148 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:33,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-15 01:30:33,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:30:33,150 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 18 states. [2019-10-15 01:30:33,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:33,474 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2019-10-15 01:30:33,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 01:30:33,474 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-10-15 01:30:33,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:33,475 INFO L225 Difference]: With dead ends: 27 [2019-10-15 01:30:33,475 INFO L226 Difference]: Without dead ends: 20 [2019-10-15 01:30:33,476 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2019-10-15 01:30:33,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-15 01:30:33,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-15 01:30:33,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-15 01:30:33,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-10-15 01:30:33,484 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2019-10-15 01:30:33,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:33,485 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-10-15 01:30:33,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-15 01:30:33,490 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-10-15 01:30:33,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 01:30:33,491 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:33,491 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:33,692 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:33,692 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:33,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:33,693 INFO L82 PathProgramCache]: Analyzing trace with hash 211073689, now seen corresponding path program 3 times [2019-10-15 01:30:33,694 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:33,694 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559620616] [2019-10-15 01:30:33,695 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:33,695 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:33,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:34,133 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:30:34,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559620616] [2019-10-15 01:30:34,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456313703] [2019-10-15 01:30:34,135 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:34,192 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 01:30:34,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:34,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-15 01:30:34,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:34,343 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:30:34,344 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:34,602 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:30:34,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1841355403] [2019-10-15 01:30:34,605 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-15 01:30:34,605 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:34,605 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:34,606 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:34,606 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:34,643 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-15 01:30:34,823 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:30:34,841 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:30:34,848 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:35,542 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:35,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10, 11] total 32 [2019-10-15 01:30:35,543 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561724415] [2019-10-15 01:30:35,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-15 01:30:35,544 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:35,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-15 01:30:35,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=896, Unknown=0, NotChecked=0, Total=992 [2019-10-15 01:30:35,545 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 32 states. [2019-10-15 01:30:36,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:36,153 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-10-15 01:30:36,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-15 01:30:36,153 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 19 [2019-10-15 01:30:36,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:36,154 INFO L225 Difference]: With dead ends: 29 [2019-10-15 01:30:36,154 INFO L226 Difference]: Without dead ends: 24 [2019-10-15 01:30:36,155 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=159, Invalid=1481, Unknown=0, NotChecked=0, Total=1640 [2019-10-15 01:30:36,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-15 01:30:36,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-10-15 01:30:36,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-15 01:30:36,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-10-15 01:30:36,161 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 19 [2019-10-15 01:30:36,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:36,162 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-10-15 01:30:36,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-15 01:30:36,162 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-10-15 01:30:36,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 01:30:36,163 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:36,163 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:36,372 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:36,373 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:36,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:36,374 INFO L82 PathProgramCache]: Analyzing trace with hash -2125629057, now seen corresponding path program 4 times [2019-10-15 01:30:36,374 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:36,375 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5117579] [2019-10-15 01:30:36,375 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:36,376 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:36,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:36,432 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:30:36,433 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5117579] [2019-10-15 01:30:36,433 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29237362] [2019-10-15 01:30:36,433 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:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:36,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-15 01:30:36,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:36,602 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:30:36,602 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:36,663 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:30:36,664 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [836074181] [2019-10-15 01:30:36,666 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-15 01:30:36,666 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:36,667 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:36,667 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:36,667 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:36,703 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-15 01:30:36,857 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:30:36,872 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:30:36,878 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:37,272 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:37,273 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9, 11] total 26 [2019-10-15 01:30:37,273 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859363899] [2019-10-15 01:30:37,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-15 01:30:37,275 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:37,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-15 01:30:37,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2019-10-15 01:30:37,276 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 26 states. [2019-10-15 01:30:37,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:37,856 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2019-10-15 01:30:37,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-15 01:30:37,857 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 20 [2019-10-15 01:30:37,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:37,858 INFO L225 Difference]: With dead ends: 46 [2019-10-15 01:30:37,858 INFO L226 Difference]: Without dead ends: 28 [2019-10-15 01:30:37,859 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=243, Invalid=1397, Unknown=0, NotChecked=0, Total=1640 [2019-10-15 01:30:37,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-15 01:30:37,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2019-10-15 01:30:37,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-15 01:30:37,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-10-15 01:30:37,864 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 20 [2019-10-15 01:30:37,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:37,865 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-15 01:30:37,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-15 01:30:37,865 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-10-15 01:30:37,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 01:30:37,866 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:37,866 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:38,069 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:38,069 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:38,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:38,070 INFO L82 PathProgramCache]: Analyzing trace with hash -204742162, now seen corresponding path program 5 times [2019-10-15 01:30:38,070 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:38,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242707297] [2019-10-15 01:30:38,070 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:38,070 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:38,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:38,142 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:30:38,143 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242707297] [2019-10-15 01:30:38,143 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778126770] [2019-10-15 01:30:38,143 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:38,217 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-15 01:30:38,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:38,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-15 01:30:38,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:38,270 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:30:38,270 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:38,328 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:30:38,328 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [173971380] [2019-10-15 01:30:38,330 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-15 01:30:38,330 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:38,331 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:38,331 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:38,332 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:38,355 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-15 01:30:38,457 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:30:38,467 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:30:38,471 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:38,832 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:38,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 11] total 24 [2019-10-15 01:30:38,833 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987834403] [2019-10-15 01:30:38,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-15 01:30:38,834 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:38,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-15 01:30:38,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2019-10-15 01:30:38,835 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 24 states. [2019-10-15 01:30:39,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:39,234 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-10-15 01:30:39,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-15 01:30:39,234 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-10-15 01:30:39,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:39,235 INFO L225 Difference]: With dead ends: 28 [2019-10-15 01:30:39,235 INFO L226 Difference]: Without dead ends: 23 [2019-10-15 01:30:39,236 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=175, Invalid=947, Unknown=0, NotChecked=0, Total=1122 [2019-10-15 01:30:39,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-15 01:30:39,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-15 01:30:39,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-15 01:30:39,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-10-15 01:30:39,242 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 21 [2019-10-15 01:30:39,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:39,242 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-10-15 01:30:39,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-15 01:30:39,242 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-10-15 01:30:39,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 01:30:39,243 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:39,243 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:39,446 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:39,447 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:39,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:39,448 INFO L82 PathProgramCache]: Analyzing trace with hash -2131018550, now seen corresponding path program 6 times [2019-10-15 01:30:39,448 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:39,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639916183] [2019-10-15 01:30:39,449 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:39,449 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:39,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:40,072 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:30:40,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639916183] [2019-10-15 01:30:40,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755092078] [2019-10-15 01:30:40,073 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:40,174 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 01:30:40,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:40,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-15 01:30:40,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:40,427 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:30:40,427 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:40,894 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 29 [2019-10-15 01:30:40,957 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:30:40,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [993889918] [2019-10-15 01:30:40,959 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-15 01:30:40,959 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:40,960 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:40,960 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:40,960 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:40,998 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-15 01:30:41,131 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:30:41,146 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:30:41,150 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:41,684 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:41,684 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 12, 11] total 44 [2019-10-15 01:30:41,684 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533781518] [2019-10-15 01:30:41,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-15 01:30:41,686 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:41,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-15 01:30:41,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1731, Unknown=0, NotChecked=0, Total=1892 [2019-10-15 01:30:41,687 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 44 states. [2019-10-15 01:30:42,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:42,878 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2019-10-15 01:30:42,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-15 01:30:42,879 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 22 [2019-10-15 01:30:42,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:42,880 INFO L225 Difference]: With dead ends: 33 [2019-10-15 01:30:42,880 INFO L226 Difference]: Without dead ends: 28 [2019-10-15 01:30:42,883 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=306, Invalid=3234, Unknown=0, NotChecked=0, Total=3540 [2019-10-15 01:30:42,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-15 01:30:42,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-10-15 01:30:42,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-15 01:30:42,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-10-15 01:30:42,889 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 22 [2019-10-15 01:30:42,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:42,889 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-10-15 01:30:42,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-15 01:30:42,889 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-10-15 01:30:42,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-15 01:30:42,890 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:42,890 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:43,093 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:43,094 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:43,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:43,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1716044434, now seen corresponding path program 7 times [2019-10-15 01:30:43,095 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:43,095 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468603715] [2019-10-15 01:30:43,095 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:43,095 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:43,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:43,183 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:30:43,183 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468603715] [2019-10-15 01:30:43,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301798810] [2019-10-15 01:30:43,184 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:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:43,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-15 01:30:43,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:43,332 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:30:43,332 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:43,382 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:30:43,383 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [965874834] [2019-10-15 01:30:43,384 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-15 01:30:43,384 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:43,384 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:43,385 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:43,385 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:43,416 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-15 01:30:43,510 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:30:43,519 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:30:43,523 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:43,997 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:43,997 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 27 [2019-10-15 01:30:43,997 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721556530] [2019-10-15 01:30:43,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-15 01:30:43,999 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:43,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-15 01:30:44,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2019-10-15 01:30:44,003 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 27 states. [2019-10-15 01:30:44,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:44,456 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2019-10-15 01:30:44,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-15 01:30:44,457 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 23 [2019-10-15 01:30:44,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:44,458 INFO L225 Difference]: With dead ends: 44 [2019-10-15 01:30:44,458 INFO L226 Difference]: Without dead ends: 26 [2019-10-15 01:30:44,459 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 47 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=182, Invalid=1008, Unknown=0, NotChecked=0, Total=1190 [2019-10-15 01:30:44,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-15 01:30:44,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-15 01:30:44,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-15 01:30:44,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-10-15 01:30:44,465 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 23 [2019-10-15 01:30:44,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:44,465 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-10-15 01:30:44,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-15 01:30:44,465 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-10-15 01:30:44,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:30:44,466 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:44,467 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:44,679 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:44,679 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:44,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:44,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1807654314, now seen corresponding path program 8 times [2019-10-15 01:30:44,681 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:44,681 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633397905] [2019-10-15 01:30:44,681 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:44,682 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:44,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:44,818 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:30:44,819 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633397905] [2019-10-15 01:30:44,819 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974562540] [2019-10-15 01:30:44,820 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:44,973 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-15 01:30:44,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:44,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-15 01:30:44,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:45,109 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:30:45,110 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:45,217 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:30:45,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [586641946] [2019-10-15 01:30:45,221 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-15 01:30:45,221 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:45,222 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:45,222 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:45,222 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:45,249 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-15 01:30:45,353 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:30:45,363 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:30:45,372 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:30:45,882 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:30:45,883 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10, 11] total 33 [2019-10-15 01:30:45,883 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419359371] [2019-10-15 01:30:45,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-15 01:30:45,884 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:30:45,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-15 01:30:45,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=933, Unknown=0, NotChecked=0, Total=1056 [2019-10-15 01:30:45,885 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 33 states. [2019-10-15 01:30:46,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:30:46,514 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-10-15 01:30:46,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-15 01:30:46,514 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 24 [2019-10-15 01:30:46,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:30:46,515 INFO L225 Difference]: With dead ends: 36 [2019-10-15 01:30:46,515 INFO L226 Difference]: Without dead ends: 26 [2019-10-15 01:30:46,516 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=241, Invalid=1651, Unknown=0, NotChecked=0, Total=1892 [2019-10-15 01:30:46,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-15 01:30:46,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-15 01:30:46,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-15 01:30:46,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-10-15 01:30:46,521 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 24 [2019-10-15 01:30:46,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:30:46,521 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-10-15 01:30:46,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-15 01:30:46,522 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-10-15 01:30:46,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:30:46,522 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:30:46,522 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:30:46,732 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:30:46,732 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:30:46,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:30:46,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1628582905, now seen corresponding path program 9 times [2019-10-15 01:30:46,733 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:30:46,733 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176134321] [2019-10-15 01:30:46,733 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:46,733 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:30:46,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:30:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:30:47,637 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:30:47,638 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176134321] [2019-10-15 01:30:47,638 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838879990] [2019-10-15 01:30:47,638 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:47,742 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 01:30:47,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:30:47,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-15 01:30:47,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:30:48,066 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:30:48,066 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:30:59,548 WARN L191 SmtUtils]: Spent 7.75 s on a formula simplification. DAG size of input: 3358 DAG size of output: 34 [2019-10-15 01:30:59,626 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:30:59,626 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [790644248] [2019-10-15 01:30:59,627 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-15 01:30:59,628 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:30:59,628 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:30:59,628 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:30:59,628 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:30:59,652 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-15 01:30:59,740 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:30:59,749 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:30:59,753 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:31:00,457 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:31:00,458 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 14, 11] total 51 [2019-10-15 01:31:00,458 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511512120] [2019-10-15 01:31:00,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-15 01:31:00,459 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:31:00,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-15 01:31:00,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2360, Unknown=0, NotChecked=0, Total=2550 [2019-10-15 01:31:00,461 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 51 states. [2019-10-15 01:31:02,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:31:02,344 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-10-15 01:31:02,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-15 01:31:02,345 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 25 [2019-10-15 01:31:02,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:31:02,346 INFO L225 Difference]: With dead ends: 37 [2019-10-15 01:31:02,346 INFO L226 Difference]: Without dead ends: 32 [2019-10-15 01:31:02,349 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1263 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=365, Invalid=4327, Unknown=0, NotChecked=0, Total=4692 [2019-10-15 01:31:02,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-15 01:31:02,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2019-10-15 01:31:02,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-15 01:31:02,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-10-15 01:31:02,354 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 25 [2019-10-15 01:31:02,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:31:02,355 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-10-15 01:31:02,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-15 01:31:02,355 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-10-15 01:31:02,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 01:31:02,356 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:31:02,356 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:31:02,561 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:31:02,562 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:31:02,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:31:02,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1132516321, now seen corresponding path program 10 times [2019-10-15 01:31:02,563 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:31:02,563 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832974055] [2019-10-15 01:31:02,564 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:02,564 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:02,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:31:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:02,648 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:31:02,648 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832974055] [2019-10-15 01:31:02,649 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55798369] [2019-10-15 01:31:02,649 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:31:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:02,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-15 01:31:02,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:31:02,852 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:31:02,853 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:31:02,932 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 01:31:02,932 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1888776618] [2019-10-15 01:31:02,934 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-15 01:31:02,934 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:31:02,934 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:31:02,934 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:31:02,935 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:31:02,955 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-15 01:31:03,040 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:31:03,049 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:31:03,053 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:31:03,531 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:31:03,531 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 11] total 30 [2019-10-15 01:31:03,531 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350786436] [2019-10-15 01:31:03,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-15 01:31:03,532 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:31:03,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-15 01:31:03,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=732, Unknown=0, NotChecked=0, Total=870 [2019-10-15 01:31:03,533 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 30 states. [2019-10-15 01:31:03,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:31:03,949 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-10-15 01:31:03,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-15 01:31:03,950 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 26 [2019-10-15 01:31:03,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:31:03,951 INFO L225 Difference]: With dead ends: 50 [2019-10-15 01:31:03,951 INFO L226 Difference]: Without dead ends: 29 [2019-10-15 01:31:03,953 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=227, Invalid=1255, Unknown=0, NotChecked=0, Total=1482 [2019-10-15 01:31:03,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-15 01:31:03,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-15 01:31:03,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-15 01:31:03,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-10-15 01:31:03,958 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 26 [2019-10-15 01:31:03,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:31:03,958 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-10-15 01:31:03,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-15 01:31:03,958 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-10-15 01:31:03,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 01:31:03,959 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:31:03,959 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:31:04,162 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:31:04,163 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:31:04,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:31:04,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1316748855, now seen corresponding path program 11 times [2019-10-15 01:31:04,164 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:31:04,164 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620193191] [2019-10-15 01:31:04,164 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:04,165 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:04,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:31:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:04,307 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-15 01:31:04,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620193191] [2019-10-15 01:31:04,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570962647] [2019-10-15 01:31:04,307 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:31:04,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-15 01:31:04,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:31:04,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-15 01:31:04,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:31:04,549 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-15 01:31:04,549 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:31:04,659 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-15 01:31:04,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [895217062] [2019-10-15 01:31:04,661 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-15 01:31:04,661 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:31:04,661 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:31:04,662 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:31:04,662 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:31:04,692 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-15 01:31:04,779 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:31:04,790 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-15 01:31:04,793 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:31:05,235 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:31:05,236 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12, 11] total 38 [2019-10-15 01:31:05,236 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216448891] [2019-10-15 01:31:05,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-15 01:31:05,238 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:31:05,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-15 01:31:05,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1246, Unknown=0, NotChecked=0, Total=1406 [2019-10-15 01:31:05,239 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 38 states. [2019-10-15 01:31:05,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:31:05,998 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-10-15 01:31:05,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-15 01:31:05,999 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 27 [2019-10-15 01:31:06,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:31:06,000 INFO L225 Difference]: With dead ends: 40 [2019-10-15 01:31:06,000 INFO L226 Difference]: Without dead ends: 29 [2019-10-15 01:31:06,002 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=310, Invalid=2140, Unknown=0, NotChecked=0, Total=2450 [2019-10-15 01:31:06,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-15 01:31:06,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-15 01:31:06,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-15 01:31:06,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-10-15 01:31:06,007 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 27 [2019-10-15 01:31:06,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:31:06,008 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-10-15 01:31:06,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-15 01:31:06,008 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-10-15 01:31:06,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 01:31:06,009 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:31:06,009 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:31:06,213 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:31:06,213 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:31:06,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:31:06,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1174376938, now seen corresponding path program 12 times [2019-10-15 01:31:06,214 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:31:06,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300512881] [2019-10-15 01:31:06,214 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:06,215 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:06,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:31:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat