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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 23:21:53,389 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:21:53,392 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:21:53,409 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:21:53,409 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:21:53,411 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:21:53,412 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:21:53,414 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:21:53,415 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:21:53,416 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:21:53,417 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:21:53,418 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:21:53,419 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:21:53,420 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:21:53,421 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:21:53,422 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:21:53,423 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:21:53,424 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:21:53,425 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:21:53,427 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:21:53,429 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:21:53,430 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:21:53,435 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:21:53,436 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:21:53,439 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:21:53,440 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:21:53,440 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:21:53,441 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:21:53,441 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:21:53,444 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:21:53,445 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:21:53,445 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:21:53,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:21:53,447 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:21:53,448 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:21:53,450 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:21:53,451 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:21:53,451 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:21:53,451 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:21:53,452 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:21:53,453 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:21:53,453 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-13 23:21:53,470 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:21:53,470 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:21:53,471 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:21:53,471 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:21:53,472 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:21:53,472 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:21:53,472 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:21:53,472 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:21:53,473 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:21:53,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:21:53,473 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:21:53,473 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:21:53,473 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:21:53,474 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:21:53,474 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:21:53,474 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:21:53,474 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:21:53,474 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:21:53,475 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:21:53,475 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:21:53,475 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:21:53,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:21:53,475 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:21:53,476 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:21:53,476 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:21:53,476 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:21:53,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:21:53,476 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:21:53,477 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-13 23:21:53,750 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:21:53,764 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:21:53,768 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:21:53,769 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:21:53,770 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:21:53,770 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-10-13 23:21:53,829 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d89165e07/88ea7e0e8f244c2aa0173e3f8c76b4b8/FLAG3d65602d3 [2019-10-13 23:21:54,500 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:21:54,502 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-10-13 23:21:54,529 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d89165e07/88ea7e0e8f244c2aa0173e3f8c76b4b8/FLAG3d65602d3 [2019-10-13 23:21:54,683 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d89165e07/88ea7e0e8f244c2aa0173e3f8c76b4b8 [2019-10-13 23:21:54,692 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:21:54,693 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:21:54,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:21:54,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:21:54,698 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:21:54,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:21:54" (1/1) ... [2019-10-13 23:21:54,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4061229e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:54, skipping insertion in model container [2019-10-13 23:21:54,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:21:54" (1/1) ... [2019-10-13 23:21:54,710 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:21:54,855 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:21:55,772 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:21:55,805 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:21:56,162 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:21:56,190 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:21:56,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:56 WrapperNode [2019-10-13 23:21:56,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:21:56,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:21:56,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:21:56,193 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:21:56,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:56" (1/1) ... [2019-10-13 23:21:56,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:56" (1/1) ... [2019-10-13 23:21:56,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:56" (1/1) ... [2019-10-13 23:21:56,256 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:56" (1/1) ... [2019-10-13 23:21:56,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:56" (1/1) ... [2019-10-13 23:21:56,399 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:56" (1/1) ... [2019-10-13 23:21:56,411 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:56" (1/1) ... [2019-10-13 23:21:56,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:21:56,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:21:56,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:21:56,442 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:21:56,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:56" (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-13 23:21:56,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:21:56,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:21:56,514 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:21:56,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:21:56,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 23:21:56,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 23:21:56,515 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 23:21:56,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 23:21:56,515 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 23:21:56,515 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 23:21:56,515 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 23:21:56,516 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 23:21:56,516 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 23:21:56,516 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 23:21:56,516 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 23:21:56,517 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:21:56,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:21:56,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:22:00,429 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:22:00,430 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 23:22:00,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:22:00 BoogieIcfgContainer [2019-10-13 23:22:00,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:22:00,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:22:00,436 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:22:00,440 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:22:00,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:21:54" (1/3) ... [2019-10-13 23:22:00,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@544092c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:22:00, skipping insertion in model container [2019-10-13 23:22:00,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:56" (2/3) ... [2019-10-13 23:22:00,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@544092c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:22:00, skipping insertion in model container [2019-10-13 23:22:00,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:22:00" (3/3) ... [2019-10-13 23:22:00,455 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-10-13 23:22:00,476 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:22:00,490 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-13 23:22:00,505 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-13 23:22:00,562 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:22:00,562 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:22:00,562 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:22:00,563 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:22:00,563 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:22:00,563 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:22:00,563 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:22:00,563 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:22:00,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states. [2019-10-13 23:22:00,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 23:22:00,652 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:00,653 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:00,655 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:00,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:00,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1049131971, now seen corresponding path program 1 times [2019-10-13 23:22:00,672 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:00,672 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219759128] [2019-10-13 23:22:00,672 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:00,673 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:00,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:01,423 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-13 23:22:01,425 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219759128] [2019-10-13 23:22:01,427 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:01,427 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:01,428 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272871814] [2019-10-13 23:22:01,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:01,435 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:01,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:01,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:01,456 INFO L87 Difference]: Start difference. First operand 1240 states. Second operand 5 states. [2019-10-13 23:22:03,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:03,494 INFO L93 Difference]: Finished difference Result 2377 states and 4076 transitions. [2019-10-13 23:22:03,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:03,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-10-13 23:22:03,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:03,524 INFO L225 Difference]: With dead ends: 2377 [2019-10-13 23:22:03,524 INFO L226 Difference]: Without dead ends: 1498 [2019-10-13 23:22:03,533 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:22:03,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2019-10-13 23:22:03,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1492. [2019-10-13 23:22:03,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1492 states. [2019-10-13 23:22:03,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1900 transitions. [2019-10-13 23:22:03,665 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1900 transitions. Word has length 55 [2019-10-13 23:22:03,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:03,665 INFO L462 AbstractCegarLoop]: Abstraction has 1492 states and 1900 transitions. [2019-10-13 23:22:03,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:03,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1900 transitions. [2019-10-13 23:22:03,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 23:22:03,670 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:03,670 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:03,671 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:03,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:03,671 INFO L82 PathProgramCache]: Analyzing trace with hash -853550216, now seen corresponding path program 1 times [2019-10-13 23:22:03,671 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:03,672 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336144990] [2019-10-13 23:22:03,672 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:03,672 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:03,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:03,968 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-13 23:22:03,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336144990] [2019-10-13 23:22:03,969 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:03,970 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:22:03,970 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169259945] [2019-10-13 23:22:03,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:22:03,973 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:03,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:22:03,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:22:03,973 INFO L87 Difference]: Start difference. First operand 1492 states and 1900 transitions. Second operand 6 states. [2019-10-13 23:22:05,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:05,380 INFO L93 Difference]: Finished difference Result 3286 states and 4192 transitions. [2019-10-13 23:22:05,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:05,381 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-13 23:22:05,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:05,399 INFO L225 Difference]: With dead ends: 3286 [2019-10-13 23:22:05,399 INFO L226 Difference]: Without dead ends: 2368 [2019-10-13 23:22:05,404 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:22:05,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2019-10-13 23:22:05,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2345. [2019-10-13 23:22:05,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2345 states. [2019-10-13 23:22:05,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 2345 states and 2997 transitions. [2019-10-13 23:22:05,655 INFO L78 Accepts]: Start accepts. Automaton has 2345 states and 2997 transitions. Word has length 56 [2019-10-13 23:22:05,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:05,656 INFO L462 AbstractCegarLoop]: Abstraction has 2345 states and 2997 transitions. [2019-10-13 23:22:05,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:22:05,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 2997 transitions. [2019-10-13 23:22:05,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 23:22:05,665 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:05,666 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:05,668 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:05,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:05,668 INFO L82 PathProgramCache]: Analyzing trace with hash 618054128, now seen corresponding path program 1 times [2019-10-13 23:22:05,669 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:05,670 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465705106] [2019-10-13 23:22:05,670 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:05,670 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:05,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:05,988 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-13 23:22:05,990 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465705106] [2019-10-13 23:22:05,990 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:05,991 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:22:05,991 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630392155] [2019-10-13 23:22:05,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:22:05,992 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:05,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:22:05,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:22:05,993 INFO L87 Difference]: Start difference. First operand 2345 states and 2997 transitions. Second operand 6 states. [2019-10-13 23:22:07,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:07,490 INFO L93 Difference]: Finished difference Result 5347 states and 6862 transitions. [2019-10-13 23:22:07,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:07,490 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-13 23:22:07,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:07,509 INFO L225 Difference]: With dead ends: 5347 [2019-10-13 23:22:07,510 INFO L226 Difference]: Without dead ends: 3865 [2019-10-13 23:22:07,514 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:22:07,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3865 states. [2019-10-13 23:22:07,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3865 to 3849. [2019-10-13 23:22:07,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3849 states. [2019-10-13 23:22:07,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 4898 transitions. [2019-10-13 23:22:07,767 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 4898 transitions. Word has length 56 [2019-10-13 23:22:07,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:07,767 INFO L462 AbstractCegarLoop]: Abstraction has 3849 states and 4898 transitions. [2019-10-13 23:22:07,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:22:07,768 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 4898 transitions. [2019-10-13 23:22:07,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 23:22:07,772 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:07,772 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:07,773 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:07,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:07,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1627295014, now seen corresponding path program 1 times [2019-10-13 23:22:07,773 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:07,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713300599] [2019-10-13 23:22:07,774 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:07,774 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:07,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:07,995 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-13 23:22:07,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713300599] [2019-10-13 23:22:07,996 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:07,996 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:22:07,996 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265848969] [2019-10-13 23:22:07,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:22:07,997 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:07,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:22:07,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:22:07,997 INFO L87 Difference]: Start difference. First operand 3849 states and 4898 transitions. Second operand 9 states. [2019-10-13 23:22:11,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:11,292 INFO L93 Difference]: Finished difference Result 5687 states and 7418 transitions. [2019-10-13 23:22:11,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-13 23:22:11,293 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-10-13 23:22:11,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:11,331 INFO L225 Difference]: With dead ends: 5687 [2019-10-13 23:22:11,331 INFO L226 Difference]: Without dead ends: 5681 [2019-10-13 23:22:11,338 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2019-10-13 23:22:11,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5681 states. [2019-10-13 23:22:11,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5681 to 3849. [2019-10-13 23:22:11,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3849 states. [2019-10-13 23:22:11,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 4897 transitions. [2019-10-13 23:22:11,688 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 4897 transitions. Word has length 58 [2019-10-13 23:22:11,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:11,689 INFO L462 AbstractCegarLoop]: Abstraction has 3849 states and 4897 transitions. [2019-10-13 23:22:11,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:22:11,690 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 4897 transitions. [2019-10-13 23:22:11,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 23:22:11,696 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:11,696 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:11,697 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:11,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:11,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1670672239, now seen corresponding path program 1 times [2019-10-13 23:22:11,698 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:11,698 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053841315] [2019-10-13 23:22:11,698 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:11,698 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:11,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:11,896 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-13 23:22:11,897 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053841315] [2019-10-13 23:22:11,897 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:11,897 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:22:11,898 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134265369] [2019-10-13 23:22:11,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:22:11,900 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:11,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:22:11,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:22:11,901 INFO L87 Difference]: Start difference. First operand 3849 states and 4897 transitions. Second operand 9 states. [2019-10-13 23:22:15,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:15,769 INFO L93 Difference]: Finished difference Result 9189 states and 12006 transitions. [2019-10-13 23:22:15,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 23:22:15,775 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-10-13 23:22:15,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:15,817 INFO L225 Difference]: With dead ends: 9189 [2019-10-13 23:22:15,817 INFO L226 Difference]: Without dead ends: 8864 [2019-10-13 23:22:15,822 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-10-13 23:22:15,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8864 states. [2019-10-13 23:22:16,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8864 to 3849. [2019-10-13 23:22:16,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3849 states. [2019-10-13 23:22:16,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 4896 transitions. [2019-10-13 23:22:16,184 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 4896 transitions. Word has length 58 [2019-10-13 23:22:16,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:16,184 INFO L462 AbstractCegarLoop]: Abstraction has 3849 states and 4896 transitions. [2019-10-13 23:22:16,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:22:16,185 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 4896 transitions. [2019-10-13 23:22:16,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 23:22:16,188 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:16,188 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:16,189 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:16,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:16,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1060275482, now seen corresponding path program 1 times [2019-10-13 23:22:16,189 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:16,190 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612248965] [2019-10-13 23:22:16,190 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:16,190 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:16,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:16,379 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-13 23:22:16,380 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612248965] [2019-10-13 23:22:16,381 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:16,381 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 23:22:16,381 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687536041] [2019-10-13 23:22:16,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 23:22:16,382 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:16,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 23:22:16,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:22:16,383 INFO L87 Difference]: Start difference. First operand 3849 states and 4896 transitions. Second operand 8 states. [2019-10-13 23:22:19,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:19,032 INFO L93 Difference]: Finished difference Result 8269 states and 11100 transitions. [2019-10-13 23:22:19,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 23:22:19,036 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-10-13 23:22:19,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:19,068 INFO L225 Difference]: With dead ends: 8269 [2019-10-13 23:22:19,069 INFO L226 Difference]: Without dead ends: 7254 [2019-10-13 23:22:19,073 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-10-13 23:22:19,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7254 states. [2019-10-13 23:22:19,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7254 to 3849. [2019-10-13 23:22:19,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3849 states. [2019-10-13 23:22:19,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 4895 transitions. [2019-10-13 23:22:19,367 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 4895 transitions. Word has length 58 [2019-10-13 23:22:19,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:19,368 INFO L462 AbstractCegarLoop]: Abstraction has 3849 states and 4895 transitions. [2019-10-13 23:22:19,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 23:22:19,368 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 4895 transitions. [2019-10-13 23:22:19,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 23:22:19,376 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:19,376 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:19,376 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:19,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:19,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1321462413, now seen corresponding path program 1 times [2019-10-13 23:22:19,377 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:19,377 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974226464] [2019-10-13 23:22:19,377 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:19,378 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:19,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:19,477 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-13 23:22:19,477 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974226464] [2019-10-13 23:22:19,477 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:19,478 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:19,478 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939610997] [2019-10-13 23:22:19,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:19,479 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:19,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:19,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:19,480 INFO L87 Difference]: Start difference. First operand 3849 states and 4895 transitions. Second operand 3 states. [2019-10-13 23:22:20,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:20,002 INFO L93 Difference]: Finished difference Result 6822 states and 8777 transitions. [2019-10-13 23:22:20,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:20,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-13 23:22:20,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:20,031 INFO L225 Difference]: With dead ends: 6822 [2019-10-13 23:22:20,031 INFO L226 Difference]: Without dead ends: 4669 [2019-10-13 23:22:20,039 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:20,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-10-13 23:22:20,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4663. [2019-10-13 23:22:20,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4663 states. [2019-10-13 23:22:20,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4663 states to 4663 states and 5839 transitions. [2019-10-13 23:22:20,411 INFO L78 Accepts]: Start accepts. Automaton has 4663 states and 5839 transitions. Word has length 59 [2019-10-13 23:22:20,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:20,414 INFO L462 AbstractCegarLoop]: Abstraction has 4663 states and 5839 transitions. [2019-10-13 23:22:20,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:20,414 INFO L276 IsEmpty]: Start isEmpty. Operand 4663 states and 5839 transitions. [2019-10-13 23:22:20,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 23:22:20,419 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:20,419 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:20,420 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:20,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:20,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1942209389, now seen corresponding path program 1 times [2019-10-13 23:22:20,420 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:20,420 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118955687] [2019-10-13 23:22:20,421 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:20,421 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:20,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:20,510 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-13 23:22:20,511 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118955687] [2019-10-13 23:22:20,511 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:20,511 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:20,512 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176145870] [2019-10-13 23:22:20,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:20,512 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:20,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:20,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:20,513 INFO L87 Difference]: Start difference. First operand 4663 states and 5839 transitions. Second operand 3 states. [2019-10-13 23:22:20,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:20,821 INFO L93 Difference]: Finished difference Result 6941 states and 9014 transitions. [2019-10-13 23:22:20,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:20,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-13 23:22:20,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:20,837 INFO L225 Difference]: With dead ends: 6941 [2019-10-13 23:22:20,837 INFO L226 Difference]: Without dead ends: 5280 [2019-10-13 23:22:20,843 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:20,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5280 states. [2019-10-13 23:22:21,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5280 to 4904. [2019-10-13 23:22:21,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4904 states. [2019-10-13 23:22:21,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4904 states to 4904 states and 6223 transitions. [2019-10-13 23:22:21,324 INFO L78 Accepts]: Start accepts. Automaton has 4904 states and 6223 transitions. Word has length 59 [2019-10-13 23:22:21,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:21,324 INFO L462 AbstractCegarLoop]: Abstraction has 4904 states and 6223 transitions. [2019-10-13 23:22:21,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:21,324 INFO L276 IsEmpty]: Start isEmpty. Operand 4904 states and 6223 transitions. [2019-10-13 23:22:21,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 23:22:21,329 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:21,329 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:21,329 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:21,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:21,329 INFO L82 PathProgramCache]: Analyzing trace with hash -88721283, now seen corresponding path program 1 times [2019-10-13 23:22:21,330 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:21,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131258501] [2019-10-13 23:22:21,330 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:21,330 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:21,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:21,431 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-13 23:22:21,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131258501] [2019-10-13 23:22:21,433 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:21,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:21,433 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735570546] [2019-10-13 23:22:21,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:21,434 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:21,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:21,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:21,435 INFO L87 Difference]: Start difference. First operand 4904 states and 6223 transitions. Second operand 3 states. [2019-10-13 23:22:22,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:22,097 INFO L93 Difference]: Finished difference Result 8340 states and 10960 transitions. [2019-10-13 23:22:22,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:22,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-13 23:22:22,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:22,112 INFO L225 Difference]: With dead ends: 8340 [2019-10-13 23:22:22,112 INFO L226 Difference]: Without dead ends: 6034 [2019-10-13 23:22:22,120 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:22,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6034 states. [2019-10-13 23:22:22,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6034 to 5474. [2019-10-13 23:22:22,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5474 states. [2019-10-13 23:22:22,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5474 states to 5474 states and 7008 transitions. [2019-10-13 23:22:22,746 INFO L78 Accepts]: Start accepts. Automaton has 5474 states and 7008 transitions. Word has length 59 [2019-10-13 23:22:22,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:22,747 INFO L462 AbstractCegarLoop]: Abstraction has 5474 states and 7008 transitions. [2019-10-13 23:22:22,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:22,747 INFO L276 IsEmpty]: Start isEmpty. Operand 5474 states and 7008 transitions. [2019-10-13 23:22:22,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 23:22:22,752 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:22,752 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:22,752 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:22,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:22,753 INFO L82 PathProgramCache]: Analyzing trace with hash 23632550, now seen corresponding path program 1 times [2019-10-13 23:22:22,753 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:22,753 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083594289] [2019-10-13 23:22:22,753 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:22,753 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:22,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:22,832 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-13 23:22:22,832 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083594289] [2019-10-13 23:22:22,832 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:22,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:22,833 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775021295] [2019-10-13 23:22:22,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:22,834 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:22,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:22,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:22,834 INFO L87 Difference]: Start difference. First operand 5474 states and 7008 transitions. Second operand 3 states. [2019-10-13 23:22:23,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:23,435 INFO L93 Difference]: Finished difference Result 8947 states and 11629 transitions. [2019-10-13 23:22:23,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:23,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-13 23:22:23,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:23,443 INFO L225 Difference]: With dead ends: 8947 [2019-10-13 23:22:23,443 INFO L226 Difference]: Without dead ends: 4932 [2019-10-13 23:22:23,453 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:23,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4932 states. [2019-10-13 23:22:23,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4932 to 4091. [2019-10-13 23:22:23,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4091 states. [2019-10-13 23:22:23,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4091 states to 4091 states and 5201 transitions. [2019-10-13 23:22:23,937 INFO L78 Accepts]: Start accepts. Automaton has 4091 states and 5201 transitions. Word has length 60 [2019-10-13 23:22:23,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:23,937 INFO L462 AbstractCegarLoop]: Abstraction has 4091 states and 5201 transitions. [2019-10-13 23:22:23,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:23,937 INFO L276 IsEmpty]: Start isEmpty. Operand 4091 states and 5201 transitions. [2019-10-13 23:22:23,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 23:22:23,940 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:23,940 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:23,941 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:23,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:23,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1752281124, now seen corresponding path program 1 times [2019-10-13 23:22:23,941 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:23,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252510901] [2019-10-13 23:22:23,942 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:23,942 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:23,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:24,364 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-13 23:22:24,364 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252510901] [2019-10-13 23:22:24,364 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:24,364 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 23:22:24,364 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460375976] [2019-10-13 23:22:24,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 23:22:24,365 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:24,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 23:22:24,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:22:24,365 INFO L87 Difference]: Start difference. First operand 4091 states and 5201 transitions. Second operand 11 states. [2019-10-13 23:22:25,003 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-10-13 23:22:25,238 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42