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/loop-invgen/heapsort.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:02:19,845 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:02:19,848 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:02:19,866 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:02:19,866 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:02:19,868 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:02:19,869 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:02:19,878 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:02:19,884 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:02:19,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:02:19,890 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:02:19,891 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:02:19,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:02:19,893 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:02:19,896 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:02:19,897 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:02:19,899 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:02:19,900 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:02:19,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:02:19,906 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:02:19,911 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:02:19,914 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:02:19,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:02:19,918 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:02:19,919 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:02:19,920 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:02:19,920 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:02:19,922 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:02:19,923 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:02:19,924 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:02:19,924 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:02:19,926 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:02:19,927 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:02:19,928 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:02:19,929 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:02:19,929 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:02:19,930 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:02:19,930 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:02:19,930 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:02:19,931 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:02:19,933 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:02:19,933 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 03:02:19,969 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:02:19,970 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:02:19,971 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:02:19,971 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:02:19,971 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:02:19,972 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:02:19,972 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:02:19,972 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:02:19,972 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:02:19,972 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:02:19,973 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:02:19,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:02:19,973 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:02:19,973 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:02:19,973 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:02:19,973 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:02:19,974 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:02:19,974 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:02:19,978 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:02:19,978 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:02:19,979 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:02:19,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:02:19,979 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:02:19,979 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:02:19,980 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:02:19,980 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:02:19,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:02:19,980 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:02:19,980 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 03:02:20,287 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:02:20,300 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:02:20,303 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:02:20,305 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:02:20,305 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:02:20,306 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/heapsort.i [2019-10-15 03:02:20,383 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8a5ddf82/6d3a1a4e27724a25b76e2ea9c6ff8594/FLAG99fc76aac [2019-10-15 03:02:20,827 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:02:20,828 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort.i [2019-10-15 03:02:20,834 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8a5ddf82/6d3a1a4e27724a25b76e2ea9c6ff8594/FLAG99fc76aac [2019-10-15 03:02:21,200 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8a5ddf82/6d3a1a4e27724a25b76e2ea9c6ff8594 [2019-10-15 03:02:21,211 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:02:21,212 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:02:21,213 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:02:21,213 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:02:21,218 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:02:21,219 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:02:21" (1/1) ... [2019-10-15 03:02:21,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ba71078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:21, skipping insertion in model container [2019-10-15 03:02:21,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:02:21" (1/1) ... [2019-10-15 03:02:21,230 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:02:21,251 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:02:21,465 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:02:21,468 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:02:21,489 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:02:21,504 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:02:21,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:21 WrapperNode [2019-10-15 03:02:21,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:02:21,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:02:21,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:02:21,505 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:02:21,594 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:21" (1/1) ... [2019-10-15 03:02:21,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:21" (1/1) ... [2019-10-15 03:02:21,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:21" (1/1) ... [2019-10-15 03:02:21,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:21" (1/1) ... [2019-10-15 03:02:21,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:21" (1/1) ... [2019-10-15 03:02:21,617 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:21" (1/1) ... [2019-10-15 03:02:21,619 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:21" (1/1) ... [2019-10-15 03:02:21,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:02:21,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:02:21,622 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:02:21,622 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:02:21,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:21" (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 03:02:21,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:02:21,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:02:21,673 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-15 03:02:21,673 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:02:21,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:02:21,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 03:02:21,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 03:02:21,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:02:21,674 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:02:21,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:02:21,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:02:22,005 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:02:22,005 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-15 03:02:22,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:02:22 BoogieIcfgContainer [2019-10-15 03:02:22,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:02:22,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:02:22,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:02:22,011 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:02:22,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:02:21" (1/3) ... [2019-10-15 03:02:22,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7f5407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:02:22, skipping insertion in model container [2019-10-15 03:02:22,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:21" (2/3) ... [2019-10-15 03:02:22,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7f5407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:02:22, skipping insertion in model container [2019-10-15 03:02:22,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:02:22" (3/3) ... [2019-10-15 03:02:22,015 INFO L109 eAbstractionObserver]: Analyzing ICFG heapsort.i [2019-10-15 03:02:22,022 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:02:22,028 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:02:22,039 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:02:22,064 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:02:22,064 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:02:22,064 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:02:22,064 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:02:22,065 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:02:22,065 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:02:22,065 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:02:22,065 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:02:22,083 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2019-10-15 03:02:22,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 03:02:22,088 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:22,089 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:22,091 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:22,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:22,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1191516201, now seen corresponding path program 1 times [2019-10-15 03:02:22,105 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:22,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278448744] [2019-10-15 03:02:22,106 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:22,106 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:22,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:22,319 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 03:02:22,320 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278448744] [2019-10-15 03:02:22,321 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:22,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:02:22,321 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385596622] [2019-10-15 03:02:22,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:02:22,327 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:22,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:02:22,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:22,345 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 5 states. [2019-10-15 03:02:22,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:22,497 INFO L93 Difference]: Finished difference Result 78 states and 129 transitions. [2019-10-15 03:02:22,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:02:22,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-15 03:02:22,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:22,513 INFO L225 Difference]: With dead ends: 78 [2019-10-15 03:02:22,513 INFO L226 Difference]: Without dead ends: 40 [2019-10-15 03:02:22,518 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 03:02:22,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-15 03:02:22,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-10-15 03:02:22,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-15 03:02:22,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2019-10-15 03:02:22,575 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 13 [2019-10-15 03:02:22,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:22,576 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2019-10-15 03:02:22,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:02:22,577 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2019-10-15 03:02:22,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 03:02:22,578 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:22,578 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:22,579 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:22,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:22,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1186779432, now seen corresponding path program 1 times [2019-10-15 03:02:22,580 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:22,580 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051433754] [2019-10-15 03:02:22,580 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:22,580 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:22,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:22,684 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 03:02:22,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051433754] [2019-10-15 03:02:22,685 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:22,686 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:02:22,686 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907087942] [2019-10-15 03:02:22,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:02:22,688 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:22,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:02:22,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:22,689 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. Second operand 5 states. [2019-10-15 03:02:22,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:22,816 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2019-10-15 03:02:22,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:02:22,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-15 03:02:22,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:22,819 INFO L225 Difference]: With dead ends: 47 [2019-10-15 03:02:22,820 INFO L226 Difference]: Without dead ends: 45 [2019-10-15 03:02:22,821 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 03:02:22,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-15 03:02:22,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-10-15 03:02:22,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-15 03:02:22,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2019-10-15 03:02:22,843 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 59 transitions. Word has length 13 [2019-10-15 03:02:22,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:22,844 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 59 transitions. [2019-10-15 03:02:22,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:02:22,844 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2019-10-15 03:02:22,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 03:02:22,845 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:22,845 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:22,845 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:22,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:22,846 INFO L82 PathProgramCache]: Analyzing trace with hash 381238888, now seen corresponding path program 1 times [2019-10-15 03:02:22,847 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:22,847 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820796216] [2019-10-15 03:02:22,847 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:22,848 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:22,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:22,918 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 03:02:22,919 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820796216] [2019-10-15 03:02:22,919 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:22,919 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:02:22,920 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750424981] [2019-10-15 03:02:22,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:02:22,920 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:22,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:02:22,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:02:22,921 INFO L87 Difference]: Start difference. First operand 44 states and 59 transitions. Second operand 6 states. [2019-10-15 03:02:23,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:23,186 INFO L93 Difference]: Finished difference Result 76 states and 108 transitions. [2019-10-15 03:02:23,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:02:23,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-10-15 03:02:23,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:23,191 INFO L225 Difference]: With dead ends: 76 [2019-10-15 03:02:23,211 INFO L226 Difference]: Without dead ends: 74 [2019-10-15 03:02:23,212 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:02:23,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-15 03:02:23,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2019-10-15 03:02:23,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-15 03:02:23,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 99 transitions. [2019-10-15 03:02:23,245 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 99 transitions. Word has length 13 [2019-10-15 03:02:23,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:23,246 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 99 transitions. [2019-10-15 03:02:23,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:02:23,246 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 99 transitions. [2019-10-15 03:02:23,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 03:02:23,247 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:23,247 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:23,248 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:23,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:23,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1990396420, now seen corresponding path program 1 times [2019-10-15 03:02:23,248 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:23,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505537129] [2019-10-15 03:02:23,249 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:23,249 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:23,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:23,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:23,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505537129] [2019-10-15 03:02:23,341 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:23,341 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:02:23,341 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991401352] [2019-10-15 03:02:23,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:02:23,342 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:23,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:02:23,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:02:23,343 INFO L87 Difference]: Start difference. First operand 69 states and 99 transitions. Second operand 6 states. [2019-10-15 03:02:23,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:23,523 INFO L93 Difference]: Finished difference Result 76 states and 105 transitions. [2019-10-15 03:02:23,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:02:23,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-10-15 03:02:23,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:23,526 INFO L225 Difference]: With dead ends: 76 [2019-10-15 03:02:23,526 INFO L226 Difference]: Without dead ends: 74 [2019-10-15 03:02:23,527 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:02:23,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-15 03:02:23,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-10-15 03:02:23,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-15 03:02:23,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2019-10-15 03:02:23,543 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 102 transitions. Word has length 18 [2019-10-15 03:02:23,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:23,544 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 102 transitions. [2019-10-15 03:02:23,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:02:23,544 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 102 transitions. [2019-10-15 03:02:23,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 03:02:23,545 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:23,545 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:23,546 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:23,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:23,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1609033957, now seen corresponding path program 1 times [2019-10-15 03:02:23,546 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:23,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902978225] [2019-10-15 03:02:23,547 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:23,547 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:23,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:23,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902978225] [2019-10-15 03:02:23,604 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:23,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:02:23,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783253471] [2019-10-15 03:02:23,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:02:23,605 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:23,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:02:23,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:23,606 INFO L87 Difference]: Start difference. First operand 73 states and 102 transitions. Second operand 5 states. [2019-10-15 03:02:23,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:23,692 INFO L93 Difference]: Finished difference Result 79 states and 107 transitions. [2019-10-15 03:02:23,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:02:23,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-15 03:02:23,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:23,694 INFO L225 Difference]: With dead ends: 79 [2019-10-15 03:02:23,694 INFO L226 Difference]: Without dead ends: 77 [2019-10-15 03:02:23,695 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 03:02:23,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-15 03:02:23,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-10-15 03:02:23,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-15 03:02:23,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 105 transitions. [2019-10-15 03:02:23,725 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 105 transitions. Word has length 18 [2019-10-15 03:02:23,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:23,728 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 105 transitions. [2019-10-15 03:02:23,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:02:23,728 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 105 transitions. [2019-10-15 03:02:23,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 03:02:23,729 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:23,730 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:23,730 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:23,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:23,731 INFO L82 PathProgramCache]: Analyzing trace with hash -915397493, now seen corresponding path program 1 times [2019-10-15 03:02:23,731 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:23,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898153371] [2019-10-15 03:02:23,731 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:23,732 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:23,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:23,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:23,800 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898153371] [2019-10-15 03:02:23,800 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:23,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:02:23,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592654659] [2019-10-15 03:02:23,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:02:23,801 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:23,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:02:23,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:02:23,802 INFO L87 Difference]: Start difference. First operand 77 states and 105 transitions. Second operand 6 states. [2019-10-15 03:02:23,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:23,947 INFO L93 Difference]: Finished difference Result 83 states and 110 transitions. [2019-10-15 03:02:23,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:02:23,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-10-15 03:02:23,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:23,948 INFO L225 Difference]: With dead ends: 83 [2019-10-15 03:02:23,949 INFO L226 Difference]: Without dead ends: 81 [2019-10-15 03:02:23,949 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:02:23,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-15 03:02:23,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-10-15 03:02:23,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-15 03:02:23,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 108 transitions. [2019-10-15 03:02:23,963 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 108 transitions. Word has length 18 [2019-10-15 03:02:23,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:23,963 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 108 transitions. [2019-10-15 03:02:23,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:02:23,964 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 108 transitions. [2019-10-15 03:02:23,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 03:02:23,965 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:23,965 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:23,967 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:23,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:23,968 INFO L82 PathProgramCache]: Analyzing trace with hash -742213082, now seen corresponding path program 1 times [2019-10-15 03:02:23,968 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:23,968 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083111666] [2019-10-15 03:02:23,968 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:23,968 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:23,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:24,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:24,060 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083111666] [2019-10-15 03:02:24,060 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:24,060 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:02:24,060 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635976889] [2019-10-15 03:02:24,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:02:24,061 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:24,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:02:24,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:02:24,061 INFO L87 Difference]: Start difference. First operand 81 states and 108 transitions. Second operand 7 states. [2019-10-15 03:02:24,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:24,277 INFO L93 Difference]: Finished difference Result 122 states and 169 transitions. [2019-10-15 03:02:24,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:02:24,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-10-15 03:02:24,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:24,282 INFO L225 Difference]: With dead ends: 122 [2019-10-15 03:02:24,282 INFO L226 Difference]: Without dead ends: 120 [2019-10-15 03:02:24,284 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:02:24,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-10-15 03:02:24,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2019-10-15 03:02:24,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-15 03:02:24,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 144 transitions. [2019-10-15 03:02:24,318 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 144 transitions. Word has length 18 [2019-10-15 03:02:24,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:24,319 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 144 transitions. [2019-10-15 03:02:24,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:02:24,319 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 144 transitions. [2019-10-15 03:02:24,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 03:02:24,323 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:24,324 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:24,324 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:24,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:24,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1815138482, now seen corresponding path program 1 times [2019-10-15 03:02:24,325 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:24,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966095618] [2019-10-15 03:02:24,325 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:24,325 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:24,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:24,422 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 03:02:24,422 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966095618] [2019-10-15 03:02:24,423 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:24,423 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:02:24,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468749195] [2019-10-15 03:02:24,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:02:24,424 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:24,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:02:24,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:02:24,425 INFO L87 Difference]: Start difference. First operand 105 states and 144 transitions. Second operand 6 states. [2019-10-15 03:02:24,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:24,583 INFO L93 Difference]: Finished difference Result 157 states and 229 transitions. [2019-10-15 03:02:24,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:02:24,584 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-10-15 03:02:24,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:24,587 INFO L225 Difference]: With dead ends: 157 [2019-10-15 03:02:24,587 INFO L226 Difference]: Without dead ends: 155 [2019-10-15 03:02:24,588 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:02:24,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-10-15 03:02:24,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 123. [2019-10-15 03:02:24,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-10-15 03:02:24,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 173 transitions. [2019-10-15 03:02:24,620 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 173 transitions. Word has length 25 [2019-10-15 03:02:24,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:24,620 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 173 transitions. [2019-10-15 03:02:24,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:02:24,620 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 173 transitions. [2019-10-15 03:02:24,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 03:02:24,622 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:24,622 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:24,622 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:24,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:24,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1476054722, now seen corresponding path program 1 times [2019-10-15 03:02:24,623 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:24,623 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174382782] [2019-10-15 03:02:24,623 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:24,623 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:24,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:24,742 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 03:02:24,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174382782] [2019-10-15 03:02:24,743 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:24,743 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:02:24,743 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223977314] [2019-10-15 03:02:24,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:02:24,744 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:24,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:02:24,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:02:24,745 INFO L87 Difference]: Start difference. First operand 123 states and 173 transitions. Second operand 7 states. [2019-10-15 03:02:24,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:24,898 INFO L93 Difference]: Finished difference Result 130 states and 179 transitions. [2019-10-15 03:02:24,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:02:24,899 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-10-15 03:02:24,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:24,900 INFO L225 Difference]: With dead ends: 130 [2019-10-15 03:02:24,901 INFO L226 Difference]: Without dead ends: 128 [2019-10-15 03:02:24,901 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:02:24,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-15 03:02:24,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 87. [2019-10-15 03:02:24,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-15 03:02:24,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 108 transitions. [2019-10-15 03:02:24,914 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 108 transitions. Word has length 27 [2019-10-15 03:02:24,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:24,914 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 108 transitions. [2019-10-15 03:02:24,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:02:24,915 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2019-10-15 03:02:24,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 03:02:24,916 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:24,916 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:24,916 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:24,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:24,917 INFO L82 PathProgramCache]: Analyzing trace with hash -388432127, now seen corresponding path program 1 times [2019-10-15 03:02:24,917 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:24,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498287455] [2019-10-15 03:02:24,917 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:24,918 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:24,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:24,995 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 03:02:24,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498287455] [2019-10-15 03:02:24,996 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:24,996 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:02:24,997 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868195568] [2019-10-15 03:02:24,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:02:24,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:24,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:02:24,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:02:24,999 INFO L87 Difference]: Start difference. First operand 87 states and 108 transitions. Second operand 7 states. [2019-10-15 03:02:25,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:25,182 INFO L93 Difference]: Finished difference Result 102 states and 127 transitions. [2019-10-15 03:02:25,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:02:25,183 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-10-15 03:02:25,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:25,184 INFO L225 Difference]: With dead ends: 102 [2019-10-15 03:02:25,185 INFO L226 Difference]: Without dead ends: 100 [2019-10-15 03:02:25,185 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:02:25,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-15 03:02:25,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2019-10-15 03:02:25,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-15 03:02:25,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2019-10-15 03:02:25,197 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 30 [2019-10-15 03:02:25,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:25,197 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2019-10-15 03:02:25,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:02:25,198 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2019-10-15 03:02:25,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-15 03:02:25,199 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:25,199 INFO L380 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:25,199 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:25,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:25,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1762875004, now seen corresponding path program 1 times [2019-10-15 03:02:25,200 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:25,200 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409317997] [2019-10-15 03:02:25,200 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:25,201 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:25,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:25,290 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-15 03:02:25,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409317997] [2019-10-15 03:02:25,291 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:25,291 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 03:02:25,291 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381068531] [2019-10-15 03:02:25,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 03:02:25,292 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:25,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 03:02:25,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:02:25,293 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand 8 states. [2019-10-15 03:02:25,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:25,698 INFO L93 Difference]: Finished difference Result 161 states and 212 transitions. [2019-10-15 03:02:25,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:02:25,699 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-10-15 03:02:25,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:25,700 INFO L225 Difference]: With dead ends: 161 [2019-10-15 03:02:25,701 INFO L226 Difference]: Without dead ends: 159 [2019-10-15 03:02:25,701 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:02:25,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-15 03:02:25,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 153. [2019-10-15 03:02:25,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-10-15 03:02:25,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 202 transitions. [2019-10-15 03:02:25,724 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 202 transitions. Word has length 39 [2019-10-15 03:02:25,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:25,724 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 202 transitions. [2019-10-15 03:02:25,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 03:02:25,725 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 202 transitions. [2019-10-15 03:02:25,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-15 03:02:25,726 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:25,726 INFO L380 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:25,727 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:25,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:25,727 INFO L82 PathProgramCache]: Analyzing trace with hash -696616044, now seen corresponding path program 1 times [2019-10-15 03:02:25,727 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:25,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617123508] [2019-10-15 03:02:25,728 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:25,728 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:25,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:25,787 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-15 03:02:25,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617123508] [2019-10-15 03:02:25,788 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:25,788 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:02:25,789 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215353137] [2019-10-15 03:02:25,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:02:25,791 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:25,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:02:25,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:02:25,791 INFO L87 Difference]: Start difference. First operand 153 states and 202 transitions. Second operand 6 states. [2019-10-15 03:02:25,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:25,967 INFO L93 Difference]: Finished difference Result 235 states and 338 transitions. [2019-10-15 03:02:25,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:02:25,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-10-15 03:02:25,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:25,975 INFO L225 Difference]: With dead ends: 235 [2019-10-15 03:02:25,976 INFO L226 Difference]: Without dead ends: 233 [2019-10-15 03:02:25,976 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:02:25,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-10-15 03:02:26,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 210. [2019-10-15 03:02:26,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-10-15 03:02:26,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 297 transitions. [2019-10-15 03:02:26,010 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 297 transitions. Word has length 46 [2019-10-15 03:02:26,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:26,010 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 297 transitions. [2019-10-15 03:02:26,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:02:26,011 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 297 transitions. [2019-10-15 03:02:26,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-15 03:02:26,013 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:26,014 INFO L380 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:26,014 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:26,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:26,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1730536098, now seen corresponding path program 1 times [2019-10-15 03:02:26,015 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:26,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922469628] [2019-10-15 03:02:26,015 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:26,015 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:26,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:26,139 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-15 03:02:26,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922469628] [2019-10-15 03:02:26,139 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:26,140 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:02:26,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922986359] [2019-10-15 03:02:26,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:02:26,145 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:26,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:02:26,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:02:26,146 INFO L87 Difference]: Start difference. First operand 210 states and 297 transitions. Second operand 9 states. [2019-10-15 03:02:26,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:26,690 INFO L93 Difference]: Finished difference Result 570 states and 888 transitions. [2019-10-15 03:02:26,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:02:26,691 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-10-15 03:02:26,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:26,698 INFO L225 Difference]: With dead ends: 570 [2019-10-15 03:02:26,698 INFO L226 Difference]: Without dead ends: 568 [2019-10-15 03:02:26,700 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-10-15 03:02:26,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-10-15 03:02:26,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 497. [2019-10-15 03:02:26,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2019-10-15 03:02:26,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 774 transitions. [2019-10-15 03:02:26,774 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 774 transitions. Word has length 53 [2019-10-15 03:02:26,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:26,775 INFO L462 AbstractCegarLoop]: Abstraction has 497 states and 774 transitions. [2019-10-15 03:02:26,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:02:26,775 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 774 transitions. [2019-10-15 03:02:26,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 03:02:26,778 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:26,778 INFO L380 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:26,779 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:26,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:26,779 INFO L82 PathProgramCache]: Analyzing trace with hash -589963654, now seen corresponding path program 1 times [2019-10-15 03:02:26,779 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:26,779 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317423891] [2019-10-15 03:02:26,779 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:26,780 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:26,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:26,897 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 03:02:26,897 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317423891] [2019-10-15 03:02:26,898 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:26,898 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:02:26,898 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033945377] [2019-10-15 03:02:26,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:02:26,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:26,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:02:26,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:02:26,899 INFO L87 Difference]: Start difference. First operand 497 states and 774 transitions. Second operand 7 states. [2019-10-15 03:02:27,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:27,197 INFO L93 Difference]: Finished difference Result 691 states and 1114 transitions. [2019-10-15 03:02:27,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:02:27,198 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-10-15 03:02:27,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:27,204 INFO L225 Difference]: With dead ends: 691 [2019-10-15 03:02:27,204 INFO L226 Difference]: Without dead ends: 689 [2019-10-15 03:02:27,205 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:02:27,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-10-15 03:02:27,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 561. [2019-10-15 03:02:27,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-10-15 03:02:27,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 885 transitions. [2019-10-15 03:02:27,305 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 885 transitions. Word has length 60 [2019-10-15 03:02:27,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:27,305 INFO L462 AbstractCegarLoop]: Abstraction has 561 states and 885 transitions. [2019-10-15 03:02:27,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:02:27,306 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 885 transitions. [2019-10-15 03:02:27,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 03:02:27,333 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:27,333 INFO L380 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:27,333 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:27,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:27,333 INFO L82 PathProgramCache]: Analyzing trace with hash -751656022, now seen corresponding path program 1 times [2019-10-15 03:02:27,334 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:27,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294062187] [2019-10-15 03:02:27,334 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:27,334 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:27,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:27,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:27,390 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 03:02:27,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294062187] [2019-10-15 03:02:27,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371565508] [2019-10-15 03:02:27,391 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 03:02:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:27,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 03:02:27,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:02:27,596 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-10-15 03:02:27,596 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:02:27,741 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-15 03:02:27,741 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 03:02:27,741 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 5] total 12 [2019-10-15 03:02:27,742 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311797133] [2019-10-15 03:02:27,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:02:27,742 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:27,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:02:27,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:02:27,743 INFO L87 Difference]: Start difference. First operand 561 states and 885 transitions. Second operand 5 states. [2019-10-15 03:02:28,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:28,046 INFO L93 Difference]: Finished difference Result 1210 states and 1913 transitions. [2019-10-15 03:02:28,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:02:28,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-10-15 03:02:28,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:28,052 INFO L225 Difference]: With dead ends: 1210 [2019-10-15 03:02:28,052 INFO L226 Difference]: Without dead ends: 673 [2019-10-15 03:02:28,063 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:02:28,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-10-15 03:02:28,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 579. [2019-10-15 03:02:28,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-10-15 03:02:28,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 903 transitions. [2019-10-15 03:02:28,166 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 903 transitions. Word has length 60 [2019-10-15 03:02:28,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:28,167 INFO L462 AbstractCegarLoop]: Abstraction has 579 states and 903 transitions. [2019-10-15 03:02:28,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:02:28,167 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 903 transitions. [2019-10-15 03:02:28,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-15 03:02:28,170 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:28,170 INFO L380 BasicCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:28,374 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:02:28,374 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:28,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:28,375 INFO L82 PathProgramCache]: Analyzing trace with hash -678920824, now seen corresponding path program 1 times [2019-10-15 03:02:28,375 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:28,375 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171827222] [2019-10-15 03:02:28,375 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:28,376 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:28,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:28,506 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-10-15 03:02:28,506 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171827222] [2019-10-15 03:02:28,506 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783672755] [2019-10-15 03:02:28,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:02:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:28,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-15 03:02:28,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:02:28,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:02:28,778 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-10-15 03:02:28,778 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:02:29,016 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-10-15 03:02:29,016 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [763095203] [2019-10-15 03:02:29,072 INFO L162 IcfgInterpreter]: Started Sifa with 29 locations of interest [2019-10-15 03:02:29,072 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:02:29,082 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:02:29,096 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:02:29,097 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:02:29,166 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-15 03:02:31,008 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2019-10-15 03:02:43,669 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-10-15 03:02:43,828 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-10-15 03:02:48,206 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-10-15 03:02:53,592 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-10-15 03:02:55,794 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 18 [2019-10-15 03:02:56,589 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 12