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/locks/test_locks_15-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:00:50,584 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:00:50,586 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:00:50,601 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:00:50,601 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:00:50,602 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:00:50,604 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:00:50,606 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:00:50,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:00:50,609 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:00:50,610 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:00:50,611 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:00:50,611 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:00:50,612 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:00:50,613 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:00:50,615 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:00:50,615 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:00:50,616 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:00:50,618 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:00:50,620 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:00:50,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:00:50,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:00:50,624 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:00:50,625 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:00:50,627 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:00:50,628 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:00:50,628 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:00:50,629 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:00:50,629 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:00:50,630 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:00:50,631 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:00:50,631 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:00:50,632 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:00:50,633 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:00:50,634 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:00:50,634 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:00:50,635 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:00:50,635 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:00:50,635 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:00:50,636 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:00:50,637 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:00:50,638 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:00:50,657 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:00:50,658 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:00:50,659 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:00:50,659 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:00:50,659 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:00:50,659 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:00:50,660 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:00:50,660 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:00:50,660 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:00:50,660 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:00:50,660 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:00:50,661 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:00:50,661 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:00:50,661 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:00:50,662 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:00:50,663 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:00:50,663 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:00:50,663 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:00:50,663 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:00:50,663 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:00:50,664 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:00:50,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:00:50,664 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:00:50,664 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:00:50,665 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:00:50,665 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:00:50,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:00:50,665 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:00:50,665 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:00:50,965 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:00:50,979 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:00:50,983 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:00:50,984 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:00:50,985 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:00:50,986 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_15-2.c [2019-10-15 03:00:51,048 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b05ed0a/c6162386adf0411ea3f08b0bc6b22017/FLAG72f9604e6 [2019-10-15 03:00:51,517 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:00:51,518 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15-2.c [2019-10-15 03:00:51,530 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b05ed0a/c6162386adf0411ea3f08b0bc6b22017/FLAG72f9604e6 [2019-10-15 03:00:51,904 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b05ed0a/c6162386adf0411ea3f08b0bc6b22017 [2019-10-15 03:00:51,918 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:00:51,920 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:00:51,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:00:51,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:00:51,925 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:00:51,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:00:51" (1/1) ... [2019-10-15 03:00:51,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52da3fca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:51, skipping insertion in model container [2019-10-15 03:00:51,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:00:51" (1/1) ... [2019-10-15 03:00:51,941 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:00:51,985 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:00:52,269 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:00:52,277 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:00:52,307 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:00:52,424 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:00:52,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:52 WrapperNode [2019-10-15 03:00:52,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:00:52,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:00:52,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:00:52,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:00:52,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:52" (1/1) ... [2019-10-15 03:00:52,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:52" (1/1) ... [2019-10-15 03:00:52,443 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:52" (1/1) ... [2019-10-15 03:00:52,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:52" (1/1) ... [2019-10-15 03:00:52,454 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:52" (1/1) ... [2019-10-15 03:00:52,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:52" (1/1) ... [2019-10-15 03:00:52,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:52" (1/1) ... [2019-10-15 03:00:52,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:00:52,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:00:52,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:00:52,469 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:00:52,470 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:52" (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:00:52,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:00:52,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:00:52,542 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:00:52,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:00:52,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:00:52,542 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:00:52,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:00:52,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:00:53,249 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:00:53,250 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 03:00:53,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:00:53 BoogieIcfgContainer [2019-10-15 03:00:53,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:00:53,253 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:00:53,253 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:00:53,256 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:00:53,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:00:51" (1/3) ... [2019-10-15 03:00:53,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c44b86d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:00:53, skipping insertion in model container [2019-10-15 03:00:53,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:52" (2/3) ... [2019-10-15 03:00:53,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c44b86d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:00:53, skipping insertion in model container [2019-10-15 03:00:53,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:00:53" (3/3) ... [2019-10-15 03:00:53,261 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_15-2.c [2019-10-15 03:00:53,270 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:00:53,278 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:00:53,290 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:00:53,314 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:00:53,315 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:00:53,315 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:00:53,315 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:00:53,315 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:00:53,315 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:00:53,316 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:00:53,316 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:00:53,334 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-10-15 03:00:53,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-15 03:00:53,340 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:53,341 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:53,343 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:53,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:53,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1439940406, now seen corresponding path program 1 times [2019-10-15 03:00:53,358 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:53,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487422233] [2019-10-15 03:00:53,359 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:53,359 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:53,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:53,591 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:00:53,592 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487422233] [2019-10-15 03:00:53,594 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:53,594 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:53,595 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749093237] [2019-10-15 03:00:53,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:53,600 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:53,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:53,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:53,618 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 4 states. [2019-10-15 03:00:53,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:53,701 INFO L93 Difference]: Finished difference Result 86 states and 146 transitions. [2019-10-15 03:00:53,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:53,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-15 03:00:53,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:53,723 INFO L225 Difference]: With dead ends: 86 [2019-10-15 03:00:53,723 INFO L226 Difference]: Without dead ends: 71 [2019-10-15 03:00:53,728 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:53,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-15 03:00:53,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 39. [2019-10-15 03:00:53,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-15 03:00:53,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 67 transitions. [2019-10-15 03:00:53,791 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 67 transitions. Word has length 10 [2019-10-15 03:00:53,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:53,791 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 67 transitions. [2019-10-15 03:00:53,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:53,793 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 67 transitions. [2019-10-15 03:00:53,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-15 03:00:53,794 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:53,795 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:53,795 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:53,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:53,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1688267866, now seen corresponding path program 1 times [2019-10-15 03:00:53,797 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:53,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294509358] [2019-10-15 03:00:53,798 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:53,798 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:53,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:53,928 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:00:53,931 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294509358] [2019-10-15 03:00:53,932 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:53,932 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:53,932 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298055714] [2019-10-15 03:00:53,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:53,936 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:53,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:53,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:53,937 INFO L87 Difference]: Start difference. First operand 39 states and 67 transitions. Second operand 4 states. [2019-10-15 03:00:53,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:53,981 INFO L93 Difference]: Finished difference Result 71 states and 123 transitions. [2019-10-15 03:00:53,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:53,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-15 03:00:53,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:53,984 INFO L225 Difference]: With dead ends: 71 [2019-10-15 03:00:53,984 INFO L226 Difference]: Without dead ends: 69 [2019-10-15 03:00:53,985 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:53,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-15 03:00:53,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 39. [2019-10-15 03:00:53,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-15 03:00:53,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 66 transitions. [2019-10-15 03:00:53,994 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 66 transitions. Word has length 11 [2019-10-15 03:00:53,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:53,994 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 66 transitions. [2019-10-15 03:00:53,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:53,995 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 66 transitions. [2019-10-15 03:00:53,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-15 03:00:53,995 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:53,996 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:53,996 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:53,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:53,996 INFO L82 PathProgramCache]: Analyzing trace with hash -796484193, now seen corresponding path program 1 times [2019-10-15 03:00:53,997 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:53,997 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298694941] [2019-10-15 03:00:53,997 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:53,998 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:53,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:54,093 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:00:54,093 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298694941] [2019-10-15 03:00:54,093 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:54,094 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:54,094 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023697780] [2019-10-15 03:00:54,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:54,095 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:54,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:54,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:54,095 INFO L87 Difference]: Start difference. First operand 39 states and 66 transitions. Second operand 4 states. [2019-10-15 03:00:54,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:54,124 INFO L93 Difference]: Finished difference Result 69 states and 118 transitions. [2019-10-15 03:00:54,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:54,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-15 03:00:54,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:54,127 INFO L225 Difference]: With dead ends: 69 [2019-10-15 03:00:54,127 INFO L226 Difference]: Without dead ends: 67 [2019-10-15 03:00:54,128 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:54,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-15 03:00:54,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 39. [2019-10-15 03:00:54,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-15 03:00:54,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 65 transitions. [2019-10-15 03:00:54,134 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 65 transitions. Word has length 12 [2019-10-15 03:00:54,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:54,135 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 65 transitions. [2019-10-15 03:00:54,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:54,135 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 65 transitions. [2019-10-15 03:00:54,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 03:00:54,136 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:54,136 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:54,136 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:54,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:54,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1079006235, now seen corresponding path program 1 times [2019-10-15 03:00:54,137 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:54,137 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925259074] [2019-10-15 03:00:54,138 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:54,138 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:54,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:54,197 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:00:54,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925259074] [2019-10-15 03:00:54,200 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:54,201 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:54,201 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106707346] [2019-10-15 03:00:54,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:54,202 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:54,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:54,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:54,202 INFO L87 Difference]: Start difference. First operand 39 states and 65 transitions. Second operand 4 states. [2019-10-15 03:00:54,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:54,239 INFO L93 Difference]: Finished difference Result 67 states and 113 transitions. [2019-10-15 03:00:54,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:54,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-15 03:00:54,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:54,241 INFO L225 Difference]: With dead ends: 67 [2019-10-15 03:00:54,242 INFO L226 Difference]: Without dead ends: 65 [2019-10-15 03:00:54,242 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:54,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-15 03:00:54,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2019-10-15 03:00:54,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-15 03:00:54,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 64 transitions. [2019-10-15 03:00:54,254 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 64 transitions. Word has length 13 [2019-10-15 03:00:54,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:54,254 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 64 transitions. [2019-10-15 03:00:54,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:54,255 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 64 transitions. [2019-10-15 03:00:54,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-15 03:00:54,257 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:54,257 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:54,257 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:54,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:54,258 INFO L82 PathProgramCache]: Analyzing trace with hash -910332300, now seen corresponding path program 1 times [2019-10-15 03:00:54,258 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:54,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217883360] [2019-10-15 03:00:54,260 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:54,260 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:54,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:54,341 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:00:54,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217883360] [2019-10-15 03:00:54,342 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:54,342 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:54,343 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567417172] [2019-10-15 03:00:54,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:54,343 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:54,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:54,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:54,344 INFO L87 Difference]: Start difference. First operand 39 states and 64 transitions. Second operand 4 states. [2019-10-15 03:00:54,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:54,370 INFO L93 Difference]: Finished difference Result 65 states and 108 transitions. [2019-10-15 03:00:54,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:54,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-15 03:00:54,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:54,371 INFO L225 Difference]: With dead ends: 65 [2019-10-15 03:00:54,371 INFO L226 Difference]: Without dead ends: 63 [2019-10-15 03:00:54,372 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:54,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-15 03:00:54,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 39. [2019-10-15 03:00:54,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-15 03:00:54,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 63 transitions. [2019-10-15 03:00:54,377 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 63 transitions. Word has length 14 [2019-10-15 03:00:54,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:54,378 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 63 transitions. [2019-10-15 03:00:54,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:54,378 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 63 transitions. [2019-10-15 03:00:54,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-15 03:00:54,379 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:54,379 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:54,379 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:54,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:54,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1844682896, now seen corresponding path program 1 times [2019-10-15 03:00:54,380 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:54,380 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535429637] [2019-10-15 03:00:54,380 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:54,380 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:54,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:54,457 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:00:54,458 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535429637] [2019-10-15 03:00:54,458 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:54,458 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:54,459 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766697940] [2019-10-15 03:00:54,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:54,459 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:54,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:54,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:54,460 INFO L87 Difference]: Start difference. First operand 39 states and 63 transitions. Second operand 4 states. [2019-10-15 03:00:54,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:54,484 INFO L93 Difference]: Finished difference Result 63 states and 103 transitions. [2019-10-15 03:00:54,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:54,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-15 03:00:54,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:54,486 INFO L225 Difference]: With dead ends: 63 [2019-10-15 03:00:54,486 INFO L226 Difference]: Without dead ends: 61 [2019-10-15 03:00:54,486 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:54,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-15 03:00:54,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2019-10-15 03:00:54,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-15 03:00:54,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 62 transitions. [2019-10-15 03:00:54,491 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 62 transitions. Word has length 15 [2019-10-15 03:00:54,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:54,492 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 62 transitions. [2019-10-15 03:00:54,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:54,492 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 62 transitions. [2019-10-15 03:00:54,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-15 03:00:54,493 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:54,493 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:54,493 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:54,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:54,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1350808393, now seen corresponding path program 1 times [2019-10-15 03:00:54,494 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:54,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271188715] [2019-10-15 03:00:54,494 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:54,494 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:54,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:54,527 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:00:54,528 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271188715] [2019-10-15 03:00:54,528 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:54,528 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:54,529 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950140723] [2019-10-15 03:00:54,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:54,529 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:54,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:54,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:54,530 INFO L87 Difference]: Start difference. First operand 39 states and 62 transitions. Second operand 4 states. [2019-10-15 03:00:54,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:54,551 INFO L93 Difference]: Finished difference Result 61 states and 98 transitions. [2019-10-15 03:00:54,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:54,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-15 03:00:54,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:54,552 INFO L225 Difference]: With dead ends: 61 [2019-10-15 03:00:54,552 INFO L226 Difference]: Without dead ends: 59 [2019-10-15 03:00:54,553 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:54,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-15 03:00:54,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2019-10-15 03:00:54,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-15 03:00:54,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 61 transitions. [2019-10-15 03:00:54,558 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 61 transitions. Word has length 16 [2019-10-15 03:00:54,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:54,558 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 61 transitions. [2019-10-15 03:00:54,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:54,558 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 61 transitions. [2019-10-15 03:00:54,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 03:00:54,559 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:54,559 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:54,559 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:54,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:54,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1074398971, now seen corresponding path program 1 times [2019-10-15 03:00:54,560 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:54,560 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507275633] [2019-10-15 03:00:54,561 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:54,561 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:54,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:54,609 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:00:54,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507275633] [2019-10-15 03:00:54,611 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:54,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:54,611 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408097064] [2019-10-15 03:00:54,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:54,612 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:54,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:54,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:54,613 INFO L87 Difference]: Start difference. First operand 39 states and 61 transitions. Second operand 4 states. [2019-10-15 03:00:54,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:54,631 INFO L93 Difference]: Finished difference Result 59 states and 93 transitions. [2019-10-15 03:00:54,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:54,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-15 03:00:54,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:54,632 INFO L225 Difference]: With dead ends: 59 [2019-10-15 03:00:54,632 INFO L226 Difference]: Without dead ends: 57 [2019-10-15 03:00:54,633 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:54,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-15 03:00:54,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 39. [2019-10-15 03:00:54,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-15 03:00:54,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 60 transitions. [2019-10-15 03:00:54,638 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 60 transitions. Word has length 17 [2019-10-15 03:00:54,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:54,638 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 60 transitions. [2019-10-15 03:00:54,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:54,639 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 60 transitions. [2019-10-15 03:00:54,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 03:00:54,639 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:54,640 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:54,640 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:54,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:54,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1053584414, now seen corresponding path program 1 times [2019-10-15 03:00:54,641 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:54,641 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109853194] [2019-10-15 03:00:54,641 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:54,641 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:54,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:54,681 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:00:54,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109853194] [2019-10-15 03:00:54,682 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:54,683 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:54,683 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91255114] [2019-10-15 03:00:54,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:54,684 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:54,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:54,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:54,684 INFO L87 Difference]: Start difference. First operand 39 states and 60 transitions. Second operand 4 states. [2019-10-15 03:00:54,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:54,711 INFO L93 Difference]: Finished difference Result 57 states and 88 transitions. [2019-10-15 03:00:54,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:54,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-15 03:00:54,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:54,713 INFO L225 Difference]: With dead ends: 57 [2019-10-15 03:00:54,713 INFO L226 Difference]: Without dead ends: 55 [2019-10-15 03:00:54,713 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:54,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-15 03:00:54,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2019-10-15 03:00:54,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-15 03:00:54,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 59 transitions. [2019-10-15 03:00:54,722 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 59 transitions. Word has length 18 [2019-10-15 03:00:54,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:54,722 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 59 transitions. [2019-10-15 03:00:54,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:54,722 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 59 transitions. [2019-10-15 03:00:54,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 03:00:54,723 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:54,723 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:54,724 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:54,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:54,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1698407046, now seen corresponding path program 1 times [2019-10-15 03:00:54,726 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:54,726 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175101511] [2019-10-15 03:00:54,731 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:54,731 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:54,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:54,782 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:00:54,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175101511] [2019-10-15 03:00:54,782 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:54,783 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:54,783 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621243196] [2019-10-15 03:00:54,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:54,784 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:54,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:54,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:54,784 INFO L87 Difference]: Start difference. First operand 39 states and 59 transitions. Second operand 4 states. [2019-10-15 03:00:54,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:54,802 INFO L93 Difference]: Finished difference Result 55 states and 83 transitions. [2019-10-15 03:00:54,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:54,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-10-15 03:00:54,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:54,804 INFO L225 Difference]: With dead ends: 55 [2019-10-15 03:00:54,804 INFO L226 Difference]: Without dead ends: 53 [2019-10-15 03:00:54,804 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:54,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-15 03:00:54,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2019-10-15 03:00:54,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-15 03:00:54,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 58 transitions. [2019-10-15 03:00:54,808 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 58 transitions. Word has length 19 [2019-10-15 03:00:54,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:54,808 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 58 transitions. [2019-10-15 03:00:54,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:54,809 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 58 transitions. [2019-10-15 03:00:54,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 03:00:54,810 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:54,810 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:54,810 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:54,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:54,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1110796045, now seen corresponding path program 1 times [2019-10-15 03:00:54,811 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:54,811 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582957043] [2019-10-15 03:00:54,811 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:54,811 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:54,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:54,843 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:00:54,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582957043] [2019-10-15 03:00:54,844 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:54,844 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:54,844 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026691670] [2019-10-15 03:00:54,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:54,845 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:54,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:54,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:54,845 INFO L87 Difference]: Start difference. First operand 39 states and 58 transitions. Second operand 4 states. [2019-10-15 03:00:54,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:54,860 INFO L93 Difference]: Finished difference Result 53 states and 78 transitions. [2019-10-15 03:00:54,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:54,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-10-15 03:00:54,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:54,862 INFO L225 Difference]: With dead ends: 53 [2019-10-15 03:00:54,862 INFO L226 Difference]: Without dead ends: 51 [2019-10-15 03:00:54,862 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:54,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-15 03:00:54,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 39. [2019-10-15 03:00:54,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-15 03:00:54,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 57 transitions. [2019-10-15 03:00:54,866 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 57 transitions. Word has length 20 [2019-10-15 03:00:54,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:54,866 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 57 transitions. [2019-10-15 03:00:54,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:54,866 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 57 transitions. [2019-10-15 03:00:54,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 03:00:54,867 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:54,867 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:54,867 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:54,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:54,868 INFO L82 PathProgramCache]: Analyzing trace with hash -74723857, now seen corresponding path program 1 times [2019-10-15 03:00:54,868 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:54,868 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828669066] [2019-10-15 03:00:54,868 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:54,869 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:54,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:54,901 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:00:54,901 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828669066] [2019-10-15 03:00:54,901 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:54,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:54,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302938745] [2019-10-15 03:00:54,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:54,902 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:54,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:54,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:54,903 INFO L87 Difference]: Start difference. First operand 39 states and 57 transitions. Second operand 4 states. [2019-10-15 03:00:54,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:54,920 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2019-10-15 03:00:54,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:54,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-15 03:00:54,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:54,921 INFO L225 Difference]: With dead ends: 51 [2019-10-15 03:00:54,921 INFO L226 Difference]: Without dead ends: 49 [2019-10-15 03:00:54,922 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:54,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-15 03:00:54,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2019-10-15 03:00:54,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-15 03:00:54,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2019-10-15 03:00:54,925 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 56 transitions. Word has length 21 [2019-10-15 03:00:54,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:54,926 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 56 transitions. [2019-10-15 03:00:54,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:54,926 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 56 transitions. [2019-10-15 03:00:54,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 03:00:54,927 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:54,927 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:54,927 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:54,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:54,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1978743240, now seen corresponding path program 1 times [2019-10-15 03:00:54,928 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:54,928 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31354465] [2019-10-15 03:00:54,929 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:54,929 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:54,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:54,971 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:00:54,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31354465] [2019-10-15 03:00:54,972 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:54,972 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:54,973 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182799553] [2019-10-15 03:00:54,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:54,973 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:54,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:54,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:54,974 INFO L87 Difference]: Start difference. First operand 39 states and 56 transitions. Second operand 4 states. [2019-10-15 03:00:54,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:54,995 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions. [2019-10-15 03:00:54,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:54,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-10-15 03:00:54,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:54,997 INFO L225 Difference]: With dead ends: 49 [2019-10-15 03:00:54,997 INFO L226 Difference]: Without dead ends: 47 [2019-10-15 03:00:54,998 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:54,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-15 03:00:55,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2019-10-15 03:00:55,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-15 03:00:55,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2019-10-15 03:00:55,001 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 22 [2019-10-15 03:00:55,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:55,002 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2019-10-15 03:00:55,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:55,002 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2019-10-15 03:00:55,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-15 03:00:55,003 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:55,003 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:55,003 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:55,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:55,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1211714148, now seen corresponding path program 1 times [2019-10-15 03:00:55,004 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:55,004 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455433284] [2019-10-15 03:00:55,004 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:55,005 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:55,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:55,038 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:00:55,038 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455433284] [2019-10-15 03:00:55,039 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:55,039 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:55,039 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515396290] [2019-10-15 03:00:55,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:55,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:55,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:55,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:55,040 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand 4 states. [2019-10-15 03:00:55,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:55,058 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2019-10-15 03:00:55,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:55,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-10-15 03:00:55,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:55,060 INFO L225 Difference]: With dead ends: 47 [2019-10-15 03:00:55,060 INFO L226 Difference]: Without dead ends: 45 [2019-10-15 03:00:55,061 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:55,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-15 03:00:55,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2019-10-15 03:00:55,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-15 03:00:55,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2019-10-15 03:00:55,064 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 23 [2019-10-15 03:00:55,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:55,064 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2019-10-15 03:00:55,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:55,065 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2019-10-15 03:00:55,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 03:00:55,065 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:55,066 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:55,066 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:55,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:55,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1091350883, now seen corresponding path program 1 times [2019-10-15 03:00:55,067 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:55,067 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525570280] [2019-10-15 03:00:55,067 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:55,067 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:55,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:55,109 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:00:55,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525570280] [2019-10-15 03:00:55,109 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:55,109 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:55,110 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203058309] [2019-10-15 03:00:55,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:55,110 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:55,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:55,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:55,112 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 4 states. [2019-10-15 03:00:55,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:55,144 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2019-10-15 03:00:55,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:55,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-10-15 03:00:55,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:55,145 INFO L225 Difference]: With dead ends: 41 [2019-10-15 03:00:55,145 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 03:00:55,146 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:55,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 03:00:55,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 03:00:55,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 03:00:55,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 03:00:55,147 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2019-10-15 03:00:55,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:55,148 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 03:00:55,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:55,148 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 03:00:55,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 03:00:55,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 03:00:55,169 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-15 03:00:55,169 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:00:55,169 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:00:55,169 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 03:00:55,169 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 03:00:55,170 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 03:00:55,170 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 233) no Hoare annotation was computed. [2019-10-15 03:00:55,170 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-10-15 03:00:55,170 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 54 228) no Hoare annotation was computed. [2019-10-15 03:00:55,170 INFO L443 ceAbstractionStarter]: For program point L218-1(lines 54 228) no Hoare annotation was computed. [2019-10-15 03:00:55,170 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-10-15 03:00:55,170 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2019-10-15 03:00:55,171 INFO L443 ceAbstractionStarter]: For program point L219(line 219) no Hoare annotation was computed. [2019-10-15 03:00:55,171 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 54 228) no Hoare annotation was computed. [2019-10-15 03:00:55,171 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 233) no Hoare annotation was computed. [2019-10-15 03:00:55,171 INFO L443 ceAbstractionStarter]: For program point L203-1(lines 54 228) no Hoare annotation was computed. [2019-10-15 03:00:55,171 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-10-15 03:00:55,171 INFO L443 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-10-15 03:00:55,171 INFO L443 ceAbstractionStarter]: For program point L188-1(lines 54 228) no Hoare annotation was computed. [2019-10-15 03:00:55,172 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2019-10-15 03:00:55,172 INFO L443 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-10-15 03:00:55,173 INFO L443 ceAbstractionStarter]: For program point L173-1(lines 54 228) no Hoare annotation was computed. [2019-10-15 03:00:55,173 INFO L446 ceAbstractionStarter]: At program point L223-1(lines 54 228) the Hoare annotation is: true [2019-10-15 03:00:55,173 INFO L443 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-10-15 03:00:55,173 INFO L443 ceAbstractionStarter]: For program point L224(line 224) no Hoare annotation was computed. [2019-10-15 03:00:55,173 INFO L439 ceAbstractionStarter]: At program point L224-1(lines 5 233) the Hoare annotation is: false [2019-10-15 03:00:55,173 INFO L443 ceAbstractionStarter]: For program point L158-1(lines 54 228) no Hoare annotation was computed. [2019-10-15 03:00:55,173 INFO L443 ceAbstractionStarter]: For program point L208-1(lines 54 228) no Hoare annotation was computed. [2019-10-15 03:00:55,174 INFO L443 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-10-15 03:00:55,174 INFO L443 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2019-10-15 03:00:55,174 INFO L443 ceAbstractionStarter]: For program point L193-1(lines 54 228) no Hoare annotation was computed. [2019-10-15 03:00:55,174 INFO L443 ceAbstractionStarter]: For program point L194(line 194) no Hoare annotation was computed. [2019-10-15 03:00:55,174 INFO L443 ceAbstractionStarter]: For program point L178-1(lines 54 228) no Hoare annotation was computed. [2019-10-15 03:00:55,174 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 233) the Hoare annotation is: true [2019-10-15 03:00:55,174 INFO L443 ceAbstractionStarter]: For program point L179(line 179) no Hoare annotation was computed. [2019-10-15 03:00:55,175 INFO L446 ceAbstractionStarter]: At program point L229(lines 5 233) the Hoare annotation is: true [2019-10-15 03:00:55,175 INFO L443 ceAbstractionStarter]: For program point L163-1(lines 54 228) no Hoare annotation was computed. [2019-10-15 03:00:55,175 INFO L443 ceAbstractionStarter]: For program point L213-1(lines 54 228) no Hoare annotation was computed. [2019-10-15 03:00:55,175 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 54 228) no Hoare annotation was computed. [2019-10-15 03:00:55,175 INFO L443 ceAbstractionStarter]: For program point L164(line 164) no Hoare annotation was computed. [2019-10-15 03:00:55,175 INFO L443 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2019-10-15 03:00:55,175 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 54 228) no Hoare annotation was computed. [2019-10-15 03:00:55,175 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-10-15 03:00:55,175 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 54 228) no Hoare annotation was computed. [2019-10-15 03:00:55,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:00:55 BoogieIcfgContainer [2019-10-15 03:00:55,189 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 03:00:55,197 INFO L168 Benchmark]: Toolchain (without parser) took 3270.90 ms. Allocated memory was 139.5 MB in the beginning and 244.3 MB in the end (delta: 104.9 MB). Free memory was 104.8 MB in the beginning and 210.7 MB in the end (delta: -105.9 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-10-15 03:00:55,198 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 03:00:55,199 INFO L168 Benchmark]: CACSL2BoogieTranslator took 504.06 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 104.6 MB in the beginning and 181.7 MB in the end (delta: -77.1 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:55,200 INFO L168 Benchmark]: Boogie Preprocessor took 42.86 ms. Allocated memory is still 202.9 MB. Free memory was 181.7 MB in the beginning and 179.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:55,200 INFO L168 Benchmark]: RCFGBuilder took 782.70 ms. Allocated memory is still 202.9 MB. Free memory was 179.7 MB in the beginning and 131.2 MB in the end (delta: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:55,203 INFO L168 Benchmark]: TraceAbstraction took 1936.03 ms. Allocated memory was 202.9 MB in the beginning and 244.3 MB in the end (delta: 41.4 MB). Free memory was 131.2 MB in the beginning and 210.7 MB in the end (delta: -79.5 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-10-15 03:00:55,212 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 504.06 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 104.6 MB in the beginning and 181.7 MB in the end (delta: -77.1 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.86 ms. Allocated memory is still 202.9 MB. Free memory was 181.7 MB in the beginning and 179.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 782.70 ms. Allocated memory is still 202.9 MB. Free memory was 179.7 MB in the beginning and 131.2 MB in the end (delta: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1936.03 ms. Allocated memory was 202.9 MB in the beginning and 244.3 MB in the end (delta: 41.4 MB). Free memory was 131.2 MB in the beginning and 210.7 MB in the end (delta: -79.5 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 231]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 44 locations, 1 error locations. Result: SAFE, OverallTime: 1.8s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 878 SDtfs, 692 SDslu, 1282 SDs, 0 SdLazy, 135 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 266 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 10 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 17800 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...