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_14-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:00:47,405 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:00:47,408 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:00:47,427 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:00:47,428 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:00:47,429 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:00:47,431 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:00:47,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:00:47,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:00:47,443 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:00:47,444 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:00:47,445 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:00:47,446 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:00:47,449 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:00:47,452 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:00:47,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:00:47,456 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:00:47,459 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:00:47,460 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:00:47,467 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:00:47,471 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:00:47,474 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:00:47,477 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:00:47,478 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:00:47,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:00:47,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:00:47,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:00:47,483 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:00:47,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:00:47,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:00:47,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:00:47,488 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:00:47,488 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:00:47,489 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:00:47,491 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:00:47,491 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:00:47,492 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:00:47,492 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:00:47,492 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:00:47,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:00:47,494 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:00:47,495 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:47,510 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:00:47,510 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:00:47,511 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:00:47,511 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:00:47,511 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:00:47,512 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:00:47,512 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:00:47,512 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:00:47,512 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:00:47,512 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:00:47,513 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:00:47,513 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:00:47,513 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:00:47,513 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:00:47,513 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:00:47,514 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:00:47,514 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:00:47,514 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:00:47,514 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:00:47,515 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:00:47,515 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:00:47,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:00:47,515 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:00:47,515 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:00:47,516 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:00:47,516 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:00:47,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:00:47,516 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:00:47,516 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:47,842 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:00:47,858 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:00:47,862 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:00:47,864 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:00:47,864 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:00:47,865 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_14-1.c [2019-10-15 03:00:47,931 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc0dd78af/13b394cbb00746acbd7c5890741ec1f9/FLAGeb91889da [2019-10-15 03:00:48,407 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:00:48,411 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14-1.c [2019-10-15 03:00:48,422 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc0dd78af/13b394cbb00746acbd7c5890741ec1f9/FLAGeb91889da [2019-10-15 03:00:48,791 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc0dd78af/13b394cbb00746acbd7c5890741ec1f9 [2019-10-15 03:00:48,802 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:00:48,805 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:00:48,806 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:00:48,807 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:00:48,810 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:00:48,811 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:00:48" (1/1) ... [2019-10-15 03:00:48,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57118955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:48, skipping insertion in model container [2019-10-15 03:00:48,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:00:48" (1/1) ... [2019-10-15 03:00:48,823 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:00:48,847 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:00:49,058 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:00:49,063 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:00:49,101 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:00:49,199 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:00:49,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:49 WrapperNode [2019-10-15 03:00:49,200 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:00:49,201 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:00:49,201 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:00:49,201 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:00:49,214 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:49" (1/1) ... [2019-10-15 03:00:49,214 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:49" (1/1) ... [2019-10-15 03:00:49,220 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:49" (1/1) ... [2019-10-15 03:00:49,220 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:49" (1/1) ... [2019-10-15 03:00:49,227 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:49" (1/1) ... [2019-10-15 03:00:49,236 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:49" (1/1) ... [2019-10-15 03:00:49,237 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:49" (1/1) ... [2019-10-15 03:00:49,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:00:49,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:00:49,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:00:49,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:00:49,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:49" (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:49,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:00:49,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:00:49,295 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:00:49,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:00:49,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:00:49,296 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:00:49,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:00:49,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:00:49,939 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:00:49,940 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 03:00:49,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:00:49 BoogieIcfgContainer [2019-10-15 03:00:49,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:00:49,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:00:49,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:00:49,951 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:00:49,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:00:48" (1/3) ... [2019-10-15 03:00:49,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42d3745d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:00:49, skipping insertion in model container [2019-10-15 03:00:49,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:49" (2/3) ... [2019-10-15 03:00:49,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42d3745d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:00:49, skipping insertion in model container [2019-10-15 03:00:49,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:00:49" (3/3) ... [2019-10-15 03:00:49,970 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2019-10-15 03:00:49,981 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:00:49,993 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:00:50,006 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:00:50,039 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:00:50,039 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:00:50,040 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:00:50,040 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:00:50,040 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:00:50,040 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:00:50,041 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:00:50,041 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:00:50,067 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-10-15 03:00:50,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-15 03:00:50,074 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:50,075 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:50,076 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:50,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:50,081 INFO L82 PathProgramCache]: Analyzing trace with hash 134551869, now seen corresponding path program 1 times [2019-10-15 03:00:50,088 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:50,089 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713504949] [2019-10-15 03:00:50,089 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:50,090 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:50,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:50,315 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:50,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713504949] [2019-10-15 03:00:50,317 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:50,317 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:50,317 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646292104] [2019-10-15 03:00:50,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:50,322 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:50,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:50,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:50,340 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 4 states. [2019-10-15 03:00:50,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:50,447 INFO L93 Difference]: Finished difference Result 82 states and 138 transitions. [2019-10-15 03:00:50,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:50,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-15 03:00:50,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:50,469 INFO L225 Difference]: With dead ends: 82 [2019-10-15 03:00:50,469 INFO L226 Difference]: Without dead ends: 67 [2019-10-15 03:00:50,476 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:50,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-15 03:00:50,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2019-10-15 03:00:50,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-15 03:00:50,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 63 transitions. [2019-10-15 03:00:50,549 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 63 transitions. Word has length 10 [2019-10-15 03:00:50,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:50,549 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 63 transitions. [2019-10-15 03:00:50,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:50,550 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 63 transitions. [2019-10-15 03:00:50,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-15 03:00:50,552 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:50,552 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:50,553 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:50,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:50,555 INFO L82 PathProgramCache]: Analyzing trace with hash -123647273, now seen corresponding path program 1 times [2019-10-15 03:00:50,555 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:50,555 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917802096] [2019-10-15 03:00:50,555 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:50,556 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:50,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:50,650 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:50,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917802096] [2019-10-15 03:00:50,651 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:50,651 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:50,651 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504433371] [2019-10-15 03:00:50,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:50,653 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:50,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:50,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:50,654 INFO L87 Difference]: Start difference. First operand 37 states and 63 transitions. Second operand 4 states. [2019-10-15 03:00:50,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:50,688 INFO L93 Difference]: Finished difference Result 67 states and 115 transitions. [2019-10-15 03:00:50,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:50,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-15 03:00:50,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:50,691 INFO L225 Difference]: With dead ends: 67 [2019-10-15 03:00:50,691 INFO L226 Difference]: Without dead ends: 65 [2019-10-15 03:00:50,692 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:50,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-15 03:00:50,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 37. [2019-10-15 03:00:50,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-15 03:00:50,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 62 transitions. [2019-10-15 03:00:50,700 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 62 transitions. Word has length 11 [2019-10-15 03:00:50,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:50,700 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 62 transitions. [2019-10-15 03:00:50,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:50,701 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 62 transitions. [2019-10-15 03:00:50,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-15 03:00:50,701 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:50,702 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:50,702 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:50,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:50,702 INFO L82 PathProgramCache]: Analyzing trace with hash 462114258, now seen corresponding path program 1 times [2019-10-15 03:00:50,703 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:50,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725929578] [2019-10-15 03:00:50,703 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:50,703 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:50,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:50,762 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:50,762 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725929578] [2019-10-15 03:00:50,762 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:50,763 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:50,763 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530803226] [2019-10-15 03:00:50,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:50,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:50,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:50,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:50,764 INFO L87 Difference]: Start difference. First operand 37 states and 62 transitions. Second operand 4 states. [2019-10-15 03:00:50,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:50,800 INFO L93 Difference]: Finished difference Result 65 states and 110 transitions. [2019-10-15 03:00:50,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:50,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-15 03:00:50,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:50,802 INFO L225 Difference]: With dead ends: 65 [2019-10-15 03:00:50,802 INFO L226 Difference]: Without dead ends: 63 [2019-10-15 03:00:50,803 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:50,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-15 03:00:50,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 37. [2019-10-15 03:00:50,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-15 03:00:50,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 61 transitions. [2019-10-15 03:00:50,810 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 61 transitions. Word has length 12 [2019-10-15 03:00:50,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:50,811 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 61 transitions. [2019-10-15 03:00:50,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:50,811 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 61 transitions. [2019-10-15 03:00:50,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 03:00:50,812 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:50,812 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:50,812 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:50,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:50,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1440852876, now seen corresponding path program 1 times [2019-10-15 03:00:50,813 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:50,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691100118] [2019-10-15 03:00:50,813 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:50,814 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:50,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:50,875 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:50,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691100118] [2019-10-15 03:00:50,877 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:50,878 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:50,878 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525116147] [2019-10-15 03:00:50,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:50,879 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:50,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:50,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:50,881 INFO L87 Difference]: Start difference. First operand 37 states and 61 transitions. Second operand 4 states. [2019-10-15 03:00:50,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:50,915 INFO L93 Difference]: Finished difference Result 63 states and 105 transitions. [2019-10-15 03:00:50,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:50,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-15 03:00:50,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:50,917 INFO L225 Difference]: With dead ends: 63 [2019-10-15 03:00:50,917 INFO L226 Difference]: Without dead ends: 61 [2019-10-15 03:00:50,919 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:50,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-15 03:00:50,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 37. [2019-10-15 03:00:50,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-15 03:00:50,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 60 transitions. [2019-10-15 03:00:50,931 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 60 transitions. Word has length 13 [2019-10-15 03:00:50,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:50,932 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 60 transitions. [2019-10-15 03:00:50,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:50,932 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 60 transitions. [2019-10-15 03:00:50,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-15 03:00:50,933 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:50,933 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:50,933 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:50,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:50,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1716979303, now seen corresponding path program 1 times [2019-10-15 03:00:50,934 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:50,934 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709614400] [2019-10-15 03:00:50,935 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:50,935 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:50,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:50,996 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:50,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709614400] [2019-10-15 03:00:50,997 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:50,997 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:50,997 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952351660] [2019-10-15 03:00:50,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:50,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:50,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:50,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:50,999 INFO L87 Difference]: Start difference. First operand 37 states and 60 transitions. Second operand 4 states. [2019-10-15 03:00:51,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:51,023 INFO L93 Difference]: Finished difference Result 61 states and 100 transitions. [2019-10-15 03:00:51,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:51,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-15 03:00:51,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:51,024 INFO L225 Difference]: With dead ends: 61 [2019-10-15 03:00:51,025 INFO L226 Difference]: Without dead ends: 59 [2019-10-15 03:00:51,025 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:51,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-15 03:00:51,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 37. [2019-10-15 03:00:51,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-15 03:00:51,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2019-10-15 03:00:51,031 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 14 [2019-10-15 03:00:51,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:51,031 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2019-10-15 03:00:51,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:51,032 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2019-10-15 03:00:51,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-15 03:00:51,032 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:51,033 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:51,033 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:51,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:51,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1686964289, now seen corresponding path program 1 times [2019-10-15 03:00:51,033 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:51,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094970742] [2019-10-15 03:00:51,034 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:51,034 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:51,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:51,083 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:51,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094970742] [2019-10-15 03:00:51,083 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:51,083 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:51,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644810453] [2019-10-15 03:00:51,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:51,084 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:51,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:51,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:51,085 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand 4 states. [2019-10-15 03:00:51,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:51,113 INFO L93 Difference]: Finished difference Result 59 states and 95 transitions. [2019-10-15 03:00:51,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:51,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-15 03:00:51,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:51,115 INFO L225 Difference]: With dead ends: 59 [2019-10-15 03:00:51,115 INFO L226 Difference]: Without dead ends: 57 [2019-10-15 03:00:51,115 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:51,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-15 03:00:51,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 37. [2019-10-15 03:00:51,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-15 03:00:51,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 58 transitions. [2019-10-15 03:00:51,120 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 58 transitions. Word has length 15 [2019-10-15 03:00:51,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:51,120 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 58 transitions. [2019-10-15 03:00:51,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:51,121 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 58 transitions. [2019-10-15 03:00:51,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-15 03:00:51,121 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:51,121 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:51,122 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:51,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:51,122 INFO L82 PathProgramCache]: Analyzing trace with hash 756499196, now seen corresponding path program 1 times [2019-10-15 03:00:51,122 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:51,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750635945] [2019-10-15 03:00:51,123 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:51,123 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:51,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:51,167 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:51,168 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750635945] [2019-10-15 03:00:51,168 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:51,168 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:51,168 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341565451] [2019-10-15 03:00:51,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:51,169 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:51,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:51,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:51,169 INFO L87 Difference]: Start difference. First operand 37 states and 58 transitions. Second operand 4 states. [2019-10-15 03:00:51,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:51,193 INFO L93 Difference]: Finished difference Result 57 states and 90 transitions. [2019-10-15 03:00:51,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:51,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-15 03:00:51,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:51,195 INFO L225 Difference]: With dead ends: 57 [2019-10-15 03:00:51,195 INFO L226 Difference]: Without dead ends: 55 [2019-10-15 03:00:51,196 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:51,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-15 03:00:51,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 37. [2019-10-15 03:00:51,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-15 03:00:51,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 57 transitions. [2019-10-15 03:00:51,200 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 57 transitions. Word has length 16 [2019-10-15 03:00:51,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:51,201 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 57 transitions. [2019-10-15 03:00:51,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:51,201 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 57 transitions. [2019-10-15 03:00:51,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 03:00:51,202 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:51,202 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:51,202 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:51,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:51,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1976852726, now seen corresponding path program 1 times [2019-10-15 03:00:51,203 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:51,203 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486108644] [2019-10-15 03:00:51,203 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:51,203 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:51,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:51,271 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:51,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486108644] [2019-10-15 03:00:51,272 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:51,272 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:51,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090755029] [2019-10-15 03:00:51,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:51,273 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:51,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:51,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:51,273 INFO L87 Difference]: Start difference. First operand 37 states and 57 transitions. Second operand 4 states. [2019-10-15 03:00:51,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:51,295 INFO L93 Difference]: Finished difference Result 55 states and 85 transitions. [2019-10-15 03:00:51,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:51,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-15 03:00:51,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:51,297 INFO L225 Difference]: With dead ends: 55 [2019-10-15 03:00:51,297 INFO L226 Difference]: Without dead ends: 53 [2019-10-15 03:00:51,298 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:51,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-15 03:00:51,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 37. [2019-10-15 03:00:51,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-15 03:00:51,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 56 transitions. [2019-10-15 03:00:51,302 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 56 transitions. Word has length 17 [2019-10-15 03:00:51,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:51,303 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 56 transitions. [2019-10-15 03:00:51,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:51,303 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 56 transitions. [2019-10-15 03:00:51,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 03:00:51,304 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:51,304 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:51,304 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:51,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:51,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1153106833, now seen corresponding path program 1 times [2019-10-15 03:00:51,305 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:51,305 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687443325] [2019-10-15 03:00:51,305 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:51,305 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:51,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:51,355 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:51,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687443325] [2019-10-15 03:00:51,356 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:51,357 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:51,357 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688563134] [2019-10-15 03:00:51,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:51,358 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:51,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:51,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:51,360 INFO L87 Difference]: Start difference. First operand 37 states and 56 transitions. Second operand 4 states. [2019-10-15 03:00:51,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:51,387 INFO L93 Difference]: Finished difference Result 53 states and 80 transitions. [2019-10-15 03:00:51,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:51,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-15 03:00:51,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:51,389 INFO L225 Difference]: With dead ends: 53 [2019-10-15 03:00:51,390 INFO L226 Difference]: Without dead ends: 51 [2019-10-15 03:00:51,390 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:51,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-15 03:00:51,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 37. [2019-10-15 03:00:51,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-15 03:00:51,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2019-10-15 03:00:51,402 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 18 [2019-10-15 03:00:51,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:51,403 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2019-10-15 03:00:51,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:51,403 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2019-10-15 03:00:51,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 03:00:51,404 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:51,404 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:51,404 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:51,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:51,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1386788267, now seen corresponding path program 1 times [2019-10-15 03:00:51,405 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:51,405 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475950950] [2019-10-15 03:00:51,405 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:51,405 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:51,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:51,446 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:51,446 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475950950] [2019-10-15 03:00:51,446 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:51,446 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:51,447 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732423467] [2019-10-15 03:00:51,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:51,447 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:51,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:51,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:51,448 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. Second operand 4 states. [2019-10-15 03:00:51,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:51,469 INFO L93 Difference]: Finished difference Result 51 states and 75 transitions. [2019-10-15 03:00:51,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:51,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-10-15 03:00:51,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:51,470 INFO L225 Difference]: With dead ends: 51 [2019-10-15 03:00:51,470 INFO L226 Difference]: Without dead ends: 49 [2019-10-15 03:00:51,471 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:51,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-15 03:00:51,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37. [2019-10-15 03:00:51,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-15 03:00:51,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2019-10-15 03:00:51,474 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 19 [2019-10-15 03:00:51,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:51,475 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2019-10-15 03:00:51,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:51,475 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2019-10-15 03:00:51,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 03:00:51,476 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:51,476 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:51,476 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:51,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:51,476 INFO L82 PathProgramCache]: Analyzing trace with hash 40978470, now seen corresponding path program 1 times [2019-10-15 03:00:51,477 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:51,477 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424409457] [2019-10-15 03:00:51,477 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:51,477 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:51,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:51,517 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:51,518 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424409457] [2019-10-15 03:00:51,518 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:51,518 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:51,518 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882460342] [2019-10-15 03:00:51,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:51,519 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:51,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:51,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:51,520 INFO L87 Difference]: Start difference. First operand 37 states and 54 transitions. Second operand 4 states. [2019-10-15 03:00:51,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:51,537 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2019-10-15 03:00:51,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:51,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-10-15 03:00:51,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:51,539 INFO L225 Difference]: With dead ends: 49 [2019-10-15 03:00:51,539 INFO L226 Difference]: Without dead ends: 47 [2019-10-15 03:00:51,540 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:51,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-15 03:00:51,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2019-10-15 03:00:51,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-15 03:00:51,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 53 transitions. [2019-10-15 03:00:51,545 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 53 transitions. Word has length 20 [2019-10-15 03:00:51,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:51,546 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 53 transitions. [2019-10-15 03:00:51,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:51,546 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 53 transitions. [2019-10-15 03:00:51,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 03:00:51,547 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:51,547 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:51,547 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:51,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:51,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1270548064, now seen corresponding path program 1 times [2019-10-15 03:00:51,548 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:51,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146667415] [2019-10-15 03:00:51,549 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:51,549 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:51,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:51,590 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:51,591 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146667415] [2019-10-15 03:00:51,591 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:51,591 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:51,591 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298037793] [2019-10-15 03:00:51,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:51,592 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:51,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:51,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:51,593 INFO L87 Difference]: Start difference. First operand 37 states and 53 transitions. Second operand 4 states. [2019-10-15 03:00:51,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:51,613 INFO L93 Difference]: Finished difference Result 47 states and 65 transitions. [2019-10-15 03:00:51,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:51,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-15 03:00:51,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:51,614 INFO L225 Difference]: With dead ends: 47 [2019-10-15 03:00:51,614 INFO L226 Difference]: Without dead ends: 45 [2019-10-15 03:00:51,615 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:51,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-15 03:00:51,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2019-10-15 03:00:51,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-15 03:00:51,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 52 transitions. [2019-10-15 03:00:51,620 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 52 transitions. Word has length 21 [2019-10-15 03:00:51,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:51,620 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 52 transitions. [2019-10-15 03:00:51,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:51,620 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 52 transitions. [2019-10-15 03:00:51,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 03:00:51,621 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:51,621 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:51,622 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:51,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:51,622 INFO L82 PathProgramCache]: Analyzing trace with hash 732500155, now seen corresponding path program 1 times [2019-10-15 03:00:51,622 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:51,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904974558] [2019-10-15 03:00:51,623 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:51,623 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:51,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:51,658 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:51,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904974558] [2019-10-15 03:00:51,658 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:51,659 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:51,659 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361857824] [2019-10-15 03:00:51,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:51,660 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:51,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:51,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:51,660 INFO L87 Difference]: Start difference. First operand 37 states and 52 transitions. Second operand 4 states. [2019-10-15 03:00:51,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:51,681 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2019-10-15 03:00:51,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:51,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-10-15 03:00:51,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:51,683 INFO L225 Difference]: With dead ends: 45 [2019-10-15 03:00:51,683 INFO L226 Difference]: Without dead ends: 43 [2019-10-15 03:00:51,683 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:51,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-15 03:00:51,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2019-10-15 03:00:51,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-15 03:00:51,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2019-10-15 03:00:51,687 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 22 [2019-10-15 03:00:51,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:51,687 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2019-10-15 03:00:51,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:51,688 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2019-10-15 03:00:51,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-15 03:00:51,689 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:51,689 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:51,689 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:51,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:51,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1232884501, now seen corresponding path program 1 times [2019-10-15 03:00:51,690 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:51,690 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149168227] [2019-10-15 03:00:51,691 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:51,691 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:51,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:51,728 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:51,729 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149168227] [2019-10-15 03:00:51,729 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:51,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:51,730 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235678313] [2019-10-15 03:00:51,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:51,730 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:51,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:51,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:51,731 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 4 states. [2019-10-15 03:00:51,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:51,751 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2019-10-15 03:00:51,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:51,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-10-15 03:00:51,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:51,753 INFO L225 Difference]: With dead ends: 39 [2019-10-15 03:00:51,753 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 03:00:51,753 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:51,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 03:00:51,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 03:00:51,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 03:00:51,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 03:00:51,755 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-10-15 03:00:51,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:51,755 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 03:00:51,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:51,755 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 03:00:51,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 03:00:51,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 03:00:51,777 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-15 03:00:51,778 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:00:51,778 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:00:51,778 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 03:00:51,778 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 03:00:51,778 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 03:00:51,779 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 219) no Hoare annotation was computed. [2019-10-15 03:00:51,779 INFO L443 ceAbstractionStarter]: For program point L184-1(lines 51 214) no Hoare annotation was computed. [2019-10-15 03:00:51,779 INFO L443 ceAbstractionStarter]: For program point L185(line 185) no Hoare annotation was computed. [2019-10-15 03:00:51,779 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 217) no Hoare annotation was computed. [2019-10-15 03:00:51,779 INFO L443 ceAbstractionStarter]: For program point L53(lines 53 55) no Hoare annotation was computed. [2019-10-15 03:00:51,779 INFO L443 ceAbstractionStarter]: For program point L169-1(lines 51 214) no Hoare annotation was computed. [2019-10-15 03:00:51,780 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 219) no Hoare annotation was computed. [2019-10-15 03:00:51,780 INFO L443 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2019-10-15 03:00:51,780 INFO L443 ceAbstractionStarter]: For program point L154-1(lines 51 214) no Hoare annotation was computed. [2019-10-15 03:00:51,780 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 51 214) no Hoare annotation was computed. [2019-10-15 03:00:51,780 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 51 214) no Hoare annotation was computed. [2019-10-15 03:00:51,780 INFO L443 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2019-10-15 03:00:51,780 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-10-15 03:00:51,781 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 51 214) no Hoare annotation was computed. [2019-10-15 03:00:51,781 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-10-15 03:00:51,781 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 51 214) no Hoare annotation was computed. [2019-10-15 03:00:51,781 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-10-15 03:00:51,781 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 51 214) no Hoare annotation was computed. [2019-10-15 03:00:51,781 INFO L446 ceAbstractionStarter]: At program point L209-1(lines 51 214) the Hoare annotation is: true [2019-10-15 03:00:51,781 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-10-15 03:00:51,782 INFO L443 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2019-10-15 03:00:51,782 INFO L439 ceAbstractionStarter]: At program point L210-1(lines 5 219) the Hoare annotation is: false [2019-10-15 03:00:51,782 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 51 214) no Hoare annotation was computed. [2019-10-15 03:00:51,782 INFO L443 ceAbstractionStarter]: For program point L194-1(lines 51 214) no Hoare annotation was computed. [2019-10-15 03:00:51,782 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-10-15 03:00:51,782 INFO L443 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-10-15 03:00:51,783 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 219) the Hoare annotation is: true [2019-10-15 03:00:51,783 INFO L443 ceAbstractionStarter]: For program point L179-1(lines 51 214) no Hoare annotation was computed. [2019-10-15 03:00:51,783 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-10-15 03:00:51,783 INFO L443 ceAbstractionStarter]: For program point L164-1(lines 51 214) no Hoare annotation was computed. [2019-10-15 03:00:51,783 INFO L443 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-10-15 03:00:51,783 INFO L446 ceAbstractionStarter]: At program point L215(lines 5 219) the Hoare annotation is: true [2019-10-15 03:00:51,783 INFO L443 ceAbstractionStarter]: For program point L149-1(lines 51 214) no Hoare annotation was computed. [2019-10-15 03:00:51,783 INFO L443 ceAbstractionStarter]: For program point L199-1(lines 51 214) no Hoare annotation was computed. [2019-10-15 03:00:51,784 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-10-15 03:00:51,784 INFO L443 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2019-10-15 03:00:51,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:00:51 BoogieIcfgContainer [2019-10-15 03:00:51,793 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 03:00:51,796 INFO L168 Benchmark]: Toolchain (without parser) took 2991.66 ms. Allocated memory was 138.4 MB in the beginning and 235.4 MB in the end (delta: 97.0 MB). Free memory was 103.5 MB in the beginning and 94.7 MB in the end (delta: 8.8 MB). Peak memory consumption was 105.8 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:51,797 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory was 121.7 MB in the beginning and 121.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:51,798 INFO L168 Benchmark]: CACSL2BoogieTranslator took 394.21 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 103.1 MB in the beginning and 180.8 MB in the end (delta: -77.8 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:51,799 INFO L168 Benchmark]: Boogie Preprocessor took 39.85 ms. Allocated memory is still 202.4 MB. Free memory was 180.8 MB in the beginning and 178.8 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:51,800 INFO L168 Benchmark]: RCFGBuilder took 705.27 ms. Allocated memory is still 202.4 MB. Free memory was 178.8 MB in the beginning and 133.7 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:51,801 INFO L168 Benchmark]: TraceAbstraction took 1845.50 ms. Allocated memory was 202.4 MB in the beginning and 235.4 MB in the end (delta: 33.0 MB). Free memory was 133.7 MB in the beginning and 94.7 MB in the end (delta: 39.0 MB). Peak memory consumption was 72.1 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:51,804 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.21 ms. Allocated memory is still 138.4 MB. Free memory was 121.7 MB in the beginning and 121.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 394.21 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 103.1 MB in the beginning and 180.8 MB in the end (delta: -77.8 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.85 ms. Allocated memory is still 202.4 MB. Free memory was 180.8 MB in the beginning and 178.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 705.27 ms. Allocated memory is still 202.4 MB. Free memory was 178.8 MB in the beginning and 133.7 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1845.50 ms. Allocated memory was 202.4 MB in the beginning and 235.4 MB in the end (delta: 33.0 MB). Free memory was 133.7 MB in the beginning and 94.7 MB in the end (delta: 39.0 MB). Peak memory consumption was 72.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 217]: 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: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 42 locations, 1 error locations. Result: SAFE, OverallTime: 1.7s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 771 SDtfs, 604 SDslu, 1141 SDs, 0 SdLazy, 132 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred 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, 14 MinimizatonAttempts, 234 StatesRemovedByMinimization, 13 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.5s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 15155 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...