/usr/bin/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.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 04:41:45,346 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 04:41:45,349 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 04:41:45,362 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 04:41:45,362 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 04:41:45,363 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 04:41:45,365 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 04:41:45,366 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 04:41:45,368 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 04:41:45,369 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 04:41:45,373 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 04:41:45,375 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 04:41:45,375 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 04:41:45,378 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 04:41:45,379 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 04:41:45,380 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 04:41:45,381 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 04:41:45,381 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 04:41:45,384 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 04:41:45,389 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 04:41:45,392 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 04:41:45,394 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 04:41:45,396 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 04:41:45,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 04:41:45,400 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 04:41:45,401 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 04:41:45,401 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 04:41:45,403 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 04:41:45,403 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 04:41:45,406 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 04:41:45,406 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 04:41:45,408 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 04:41:45,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 04:41:45,410 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 04:41:45,414 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 04:41:45,414 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 04:41:45,415 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 04:41:45,415 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 04:41:45,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 04:41:45,418 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 04:41:45,418 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 04:41:45,419 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-11-07 04:41:45,446 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 04:41:45,446 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 04:41:45,447 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 04:41:45,448 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 04:41:45,448 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 04:41:45,448 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 04:41:45,448 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 04:41:45,448 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 04:41:45,449 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 04:41:45,449 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 04:41:45,449 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 04:41:45,449 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 04:41:45,449 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 04:41:45,450 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 04:41:45,450 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 04:41:45,450 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 04:41:45,450 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 04:41:45,450 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 04:41:45,451 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 04:41:45,451 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 04:41:45,451 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 04:41:45,451 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:41:45,451 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 04:41:45,452 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 04:41:45,452 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 04:41:45,452 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 04:41:45,452 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 04:41:45,452 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 04:41:45,453 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-11-07 04:41:45,730 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 04:41:45,747 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 04:41:45,750 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 04:41:45,754 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 04:41:45,754 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 04:41:45,755 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.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-11-07 04:41:45,836 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da065dff9/fd37ea486b0841458c53775e707dcb14/FLAGaf39ba166 [2019-11-07 04:41:46,593 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 04:41:46,594 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-11-07 04:41:46,625 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da065dff9/fd37ea486b0841458c53775e707dcb14/FLAGaf39ba166 [2019-11-07 04:41:46,715 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da065dff9/fd37ea486b0841458c53775e707dcb14 [2019-11-07 04:41:46,725 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 04:41:46,726 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 04:41:46,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 04:41:46,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 04:41:46,733 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 04:41:46,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:41:46" (1/1) ... [2019-11-07 04:41:46,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4552667a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:46, skipping insertion in model container [2019-11-07 04:41:46,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:41:46" (1/1) ... [2019-11-07 04:41:46,745 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 04:41:46,922 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 04:41:47,952 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:41:47,979 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 04:41:48,313 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:41:48,357 INFO L192 MainTranslator]: Completed translation [2019-11-07 04:41:48,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:48 WrapperNode [2019-11-07 04:41:48,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 04:41:48,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 04:41:48,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 04:41:48,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 04:41:48,380 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:48" (1/1) ... [2019-11-07 04:41:48,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:48" (1/1) ... [2019-11-07 04:41:48,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:48" (1/1) ... [2019-11-07 04:41:48,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:48" (1/1) ... [2019-11-07 04:41:48,539 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:48" (1/1) ... [2019-11-07 04:41:48,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:48" (1/1) ... [2019-11-07 04:41:48,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:48" (1/1) ... [2019-11-07 04:41:48,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 04:41:48,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 04:41:48,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 04:41:48,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 04:41:48,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:48" (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-11-07 04:41:48,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 04:41:48,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 04:41:48,702 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 04:41:48,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 04:41:48,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 04:41:48,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 04:41:48,704 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 04:41:48,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 04:41:48,705 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 04:41:48,705 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 04:41:48,705 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 04:41:48,706 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 04:41:48,707 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 04:41:48,707 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 04:41:48,707 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 04:41:48,707 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 04:41:48,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 04:41:48,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 04:41:52,649 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 04:41:52,650 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 04:41:52,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:41:52 BoogieIcfgContainer [2019-11-07 04:41:52,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 04:41:52,653 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 04:41:52,653 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 04:41:52,657 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 04:41:52,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:41:46" (1/3) ... [2019-11-07 04:41:52,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1711f115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:41:52, skipping insertion in model container [2019-11-07 04:41:52,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:48" (2/3) ... [2019-11-07 04:41:52,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1711f115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:41:52, skipping insertion in model container [2019-11-07 04:41:52,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:41:52" (3/3) ... [2019-11-07 04:41:52,661 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-11-07 04:41:52,672 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 04:41:52,681 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-07 04:41:52,694 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-07 04:41:52,729 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 04:41:52,730 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 04:41:52,730 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 04:41:52,730 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 04:41:52,730 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 04:41:52,730 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 04:41:52,730 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 04:41:52,730 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 04:41:52,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states. [2019-11-07 04:41:52,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 04:41:52,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:52,793 INFO L410 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-11-07 04:41:52,795 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:52,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:52,801 INFO L82 PathProgramCache]: Analyzing trace with hash 733972695, now seen corresponding path program 1 times [2019-11-07 04:41:52,812 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:52,812 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633606069] [2019-11-07 04:41:52,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:53,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:41:53,503 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633606069] [2019-11-07 04:41:53,504 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:53,504 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:41:53,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148765628] [2019-11-07 04:41:53,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:41:53,512 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:53,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:41:53,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:41:53,530 INFO L87 Difference]: Start difference. First operand 1140 states. Second operand 6 states. [2019-11-07 04:41:55,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:55,295 INFO L93 Difference]: Finished difference Result 2212 states and 3775 transitions. [2019-11-07 04:41:55,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:41:55,297 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-11-07 04:41:55,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:55,327 INFO L225 Difference]: With dead ends: 2212 [2019-11-07 04:41:55,329 INFO L226 Difference]: Without dead ends: 1488 [2019-11-07 04:41:55,337 INFO L630 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-11-07 04:41:55,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2019-11-07 04:41:55,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1465. [2019-11-07 04:41:55,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1465 states. [2019-11-07 04:41:55,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 1840 transitions. [2019-11-07 04:41:55,487 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 1840 transitions. Word has length 55 [2019-11-07 04:41:55,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:55,488 INFO L462 AbstractCegarLoop]: Abstraction has 1465 states and 1840 transitions. [2019-11-07 04:41:55,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:41:55,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 1840 transitions. [2019-11-07 04:41:55,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 04:41:55,494 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:55,495 INFO L410 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-11-07 04:41:55,495 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:55,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:55,496 INFO L82 PathProgramCache]: Analyzing trace with hash -2111314929, now seen corresponding path program 1 times [2019-11-07 04:41:55,496 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:55,496 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418140818] [2019-11-07 04:41:55,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:55,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:41:55,670 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418140818] [2019-11-07 04:41:55,671 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:55,671 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:41:55,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416121147] [2019-11-07 04:41:55,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:41:55,673 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:55,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:41:55,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:41:55,674 INFO L87 Difference]: Start difference. First operand 1465 states and 1840 transitions. Second operand 6 states. [2019-11-07 04:41:57,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:57,118 INFO L93 Difference]: Finished difference Result 3061 states and 3889 transitions. [2019-11-07 04:41:57,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:41:57,118 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-11-07 04:41:57,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:57,130 INFO L225 Difference]: With dead ends: 3061 [2019-11-07 04:41:57,130 INFO L226 Difference]: Without dead ends: 2199 [2019-11-07 04:41:57,133 INFO L630 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-11-07 04:41:57,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2199 states. [2019-11-07 04:41:57,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2199 to 2183. [2019-11-07 04:41:57,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2183 states. [2019-11-07 04:41:57,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 2764 transitions. [2019-11-07 04:41:57,237 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 2764 transitions. Word has length 55 [2019-11-07 04:41:57,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:57,237 INFO L462 AbstractCegarLoop]: Abstraction has 2183 states and 2764 transitions. [2019-11-07 04:41:57,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:41:57,238 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 2764 transitions. [2019-11-07 04:41:57,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 04:41:57,242 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:57,242 INFO L410 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-11-07 04:41:57,243 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:57,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:57,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1234087864, now seen corresponding path program 1 times [2019-11-07 04:41:57,244 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:57,244 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157068327] [2019-11-07 04:41:57,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:57,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:41:57,493 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157068327] [2019-11-07 04:41:57,493 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:57,493 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:41:57,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707299657] [2019-11-07 04:41:57,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:41:57,494 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:57,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:41:57,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:41:57,496 INFO L87 Difference]: Start difference. First operand 2183 states and 2764 transitions. Second operand 5 states. [2019-11-07 04:41:58,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:58,652 INFO L93 Difference]: Finished difference Result 4401 states and 5595 transitions. [2019-11-07 04:41:58,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:41:58,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-11-07 04:41:58,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:58,672 INFO L225 Difference]: With dead ends: 4401 [2019-11-07 04:41:58,673 INFO L226 Difference]: Without dead ends: 3325 [2019-11-07 04:41:58,686 INFO L630 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-11-07 04:41:58,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3325 states. [2019-11-07 04:41:58,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3325 to 3319. [2019-11-07 04:41:58,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3319 states. [2019-11-07 04:41:58,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3319 states to 3319 states and 4153 transitions. [2019-11-07 04:41:58,843 INFO L78 Accepts]: Start accepts. Automaton has 3319 states and 4153 transitions. Word has length 55 [2019-11-07 04:41:58,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:58,844 INFO L462 AbstractCegarLoop]: Abstraction has 3319 states and 4153 transitions. [2019-11-07 04:41:58,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:41:58,845 INFO L276 IsEmpty]: Start isEmpty. Operand 3319 states and 4153 transitions. [2019-11-07 04:41:58,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-07 04:41:58,849 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:58,849 INFO L410 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] [2019-11-07 04:41:58,849 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:58,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:58,850 INFO L82 PathProgramCache]: Analyzing trace with hash -374787316, now seen corresponding path program 1 times [2019-11-07 04:41:58,850 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:58,850 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561037918] [2019-11-07 04:41:58,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:59,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:41:59,159 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561037918] [2019-11-07 04:41:59,159 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:59,160 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 04:41:59,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464401574] [2019-11-07 04:41:59,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 04:41:59,161 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:59,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 04:41:59,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:41:59,162 INFO L87 Difference]: Start difference. First operand 3319 states and 4153 transitions. Second operand 8 states. [2019-11-07 04:42:01,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:01,506 INFO L93 Difference]: Finished difference Result 7454 states and 9846 transitions. [2019-11-07 04:42:01,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-07 04:42:01,506 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-11-07 04:42:01,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:01,537 INFO L225 Difference]: With dead ends: 7454 [2019-11-07 04:42:01,537 INFO L226 Difference]: Without dead ends: 6490 [2019-11-07 04:42:01,541 INFO L630 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-11-07 04:42:01,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6490 states. [2019-11-07 04:42:01,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6490 to 3319. [2019-11-07 04:42:01,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3319 states. [2019-11-07 04:42:01,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3319 states to 3319 states and 4152 transitions. [2019-11-07 04:42:01,759 INFO L78 Accepts]: Start accepts. Automaton has 3319 states and 4152 transitions. Word has length 57 [2019-11-07 04:42:01,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:01,760 INFO L462 AbstractCegarLoop]: Abstraction has 3319 states and 4152 transitions. [2019-11-07 04:42:01,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 04:42:01,761 INFO L276 IsEmpty]: Start isEmpty. Operand 3319 states and 4152 transitions. [2019-11-07 04:42:01,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-07 04:42:01,765 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:01,765 INFO L410 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] [2019-11-07 04:42:01,766 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:01,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:01,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1908353876, now seen corresponding path program 1 times [2019-11-07 04:42:01,767 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:01,767 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704202250] [2019-11-07 04:42:01,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:01,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:02,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:02,036 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704202250] [2019-11-07 04:42:02,036 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:02,036 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 04:42:02,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421504478] [2019-11-07 04:42:02,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:42:02,038 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:02,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:42:02,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:42:02,040 INFO L87 Difference]: Start difference. First operand 3319 states and 4152 transitions. Second operand 9 states. [2019-11-07 04:42:05,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:05,057 INFO L93 Difference]: Finished difference Result 5403 states and 6945 transitions. [2019-11-07 04:42:05,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-07 04:42:05,058 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-11-07 04:42:05,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:05,080 INFO L225 Difference]: With dead ends: 5403 [2019-11-07 04:42:05,080 INFO L226 Difference]: Without dead ends: 5397 [2019-11-07 04:42:05,083 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2019-11-07 04:42:05,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5397 states. [2019-11-07 04:42:05,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5397 to 3319. [2019-11-07 04:42:05,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3319 states. [2019-11-07 04:42:05,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3319 states to 3319 states and 4151 transitions. [2019-11-07 04:42:05,365 INFO L78 Accepts]: Start accepts. Automaton has 3319 states and 4151 transitions. Word has length 57 [2019-11-07 04:42:05,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:05,367 INFO L462 AbstractCegarLoop]: Abstraction has 3319 states and 4151 transitions. [2019-11-07 04:42:05,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:42:05,368 INFO L276 IsEmpty]: Start isEmpty. Operand 3319 states and 4151 transitions. [2019-11-07 04:42:05,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-07 04:42:05,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:05,372 INFO L410 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] [2019-11-07 04:42:05,372 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:05,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:05,373 INFO L82 PathProgramCache]: Analyzing trace with hash -171785464, now seen corresponding path program 1 times [2019-11-07 04:42:05,373 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:05,373 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24784880] [2019-11-07 04:42:05,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:05,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:05,600 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24784880] [2019-11-07 04:42:05,601 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:05,602 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 04:42:05,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076127235] [2019-11-07 04:42:05,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:42:05,603 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:05,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:42:05,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:42:05,603 INFO L87 Difference]: Start difference. First operand 3319 states and 4151 transitions. Second operand 9 states. [2019-11-07 04:42:08,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:08,674 INFO L93 Difference]: Finished difference Result 6995 states and 9012 transitions. [2019-11-07 04:42:08,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-07 04:42:08,674 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-11-07 04:42:08,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:08,694 INFO L225 Difference]: With dead ends: 6995 [2019-11-07 04:42:08,694 INFO L226 Difference]: Without dead ends: 6709 [2019-11-07 04:42:08,696 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-11-07 04:42:08,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6709 states. [2019-11-07 04:42:08,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6709 to 3319. [2019-11-07 04:42:08,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3319 states. [2019-11-07 04:42:08,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3319 states to 3319 states and 4150 transitions. [2019-11-07 04:42:08,926 INFO L78 Accepts]: Start accepts. Automaton has 3319 states and 4150 transitions. Word has length 57 [2019-11-07 04:42:08,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:08,930 INFO L462 AbstractCegarLoop]: Abstraction has 3319 states and 4150 transitions. [2019-11-07 04:42:08,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:42:08,931 INFO L276 IsEmpty]: Start isEmpty. Operand 3319 states and 4150 transitions. [2019-11-07 04:42:08,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-07 04:42:08,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:08,937 INFO L410 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-11-07 04:42:08,938 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:08,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:08,938 INFO L82 PathProgramCache]: Analyzing trace with hash -2090309520, now seen corresponding path program 1 times [2019-11-07 04:42:08,939 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:08,941 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923842172] [2019-11-07 04:42:08,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:09,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:09,048 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923842172] [2019-11-07 04:42:09,049 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:09,049 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:09,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074278447] [2019-11-07 04:42:09,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:09,050 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:09,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:09,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:09,051 INFO L87 Difference]: Start difference. First operand 3319 states and 4150 transitions. Second operand 3 states. [2019-11-07 04:42:09,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:09,352 INFO L93 Difference]: Finished difference Result 4537 states and 5821 transitions. [2019-11-07 04:42:09,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:09,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-11-07 04:42:09,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:09,366 INFO L225 Difference]: With dead ends: 4537 [2019-11-07 04:42:09,367 INFO L226 Difference]: Without dead ends: 3436 [2019-11-07 04:42:09,370 INFO L630 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-11-07 04:42:09,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3436 states. [2019-11-07 04:42:09,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3436 to 3244. [2019-11-07 04:42:09,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3244 states. [2019-11-07 04:42:09,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3244 states to 3244 states and 4047 transitions. [2019-11-07 04:42:09,634 INFO L78 Accepts]: Start accepts. Automaton has 3244 states and 4047 transitions. Word has length 58 [2019-11-07 04:42:09,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:09,635 INFO L462 AbstractCegarLoop]: Abstraction has 3244 states and 4047 transitions. [2019-11-07 04:42:09,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:09,635 INFO L276 IsEmpty]: Start isEmpty. Operand 3244 states and 4047 transitions. [2019-11-07 04:42:09,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-07 04:42:09,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:09,639 INFO L410 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-11-07 04:42:09,639 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:09,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:09,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1502019993, now seen corresponding path program 1 times [2019-11-07 04:42:09,640 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:09,640 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345257968] [2019-11-07 04:42:09,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:09,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:09,726 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345257968] [2019-11-07 04:42:09,727 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:09,727 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:09,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960468740] [2019-11-07 04:42:09,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:09,728 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:09,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:09,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:09,728 INFO L87 Difference]: Start difference. First operand 3244 states and 4047 transitions. Second operand 3 states. [2019-11-07 04:42:10,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:10,134 INFO L93 Difference]: Finished difference Result 4994 states and 6444 transitions. [2019-11-07 04:42:10,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:10,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-11-07 04:42:10,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:10,144 INFO L225 Difference]: With dead ends: 4994 [2019-11-07 04:42:10,144 INFO L226 Difference]: Without dead ends: 3758 [2019-11-07 04:42:10,148 INFO L630 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-11-07 04:42:10,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3758 states. [2019-11-07 04:42:10,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3758 to 3472. [2019-11-07 04:42:10,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3472 states. [2019-11-07 04:42:10,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3472 states to 3472 states and 4377 transitions. [2019-11-07 04:42:10,499 INFO L78 Accepts]: Start accepts. Automaton has 3472 states and 4377 transitions. Word has length 58 [2019-11-07 04:42:10,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:10,500 INFO L462 AbstractCegarLoop]: Abstraction has 3472 states and 4377 transitions. [2019-11-07 04:42:10,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:10,500 INFO L276 IsEmpty]: Start isEmpty. Operand 3472 states and 4377 transitions. [2019-11-07 04:42:10,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-07 04:42:10,504 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:10,504 INFO L410 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-11-07 04:42:10,504 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:10,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:10,505 INFO L82 PathProgramCache]: Analyzing trace with hash -272730919, now seen corresponding path program 1 times [2019-11-07 04:42:10,505 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:10,505 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067314917] [2019-11-07 04:42:10,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:10,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:10,632 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067314917] [2019-11-07 04:42:10,633 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:10,633 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:10,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386005352] [2019-11-07 04:42:10,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:10,635 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:10,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:10,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:10,636 INFO L87 Difference]: Start difference. First operand 3472 states and 4377 transitions. Second operand 3 states. [2019-11-07 04:42:11,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:11,191 INFO L93 Difference]: Finished difference Result 5662 states and 7301 transitions. [2019-11-07 04:42:11,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:11,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-11-07 04:42:11,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:11,204 INFO L225 Difference]: With dead ends: 5662 [2019-11-07 04:42:11,205 INFO L226 Difference]: Without dead ends: 3376 [2019-11-07 04:42:11,210 INFO L630 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-11-07 04:42:11,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3376 states. [2019-11-07 04:42:11,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3376 to 3374. [2019-11-07 04:42:11,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3374 states. [2019-11-07 04:42:11,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3374 states to 3374 states and 4207 transitions. [2019-11-07 04:42:11,485 INFO L78 Accepts]: Start accepts. Automaton has 3374 states and 4207 transitions. Word has length 58 [2019-11-07 04:42:11,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:11,486 INFO L462 AbstractCegarLoop]: Abstraction has 3374 states and 4207 transitions. [2019-11-07 04:42:11,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:11,486 INFO L276 IsEmpty]: Start isEmpty. Operand 3374 states and 4207 transitions. [2019-11-07 04:42:11,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-07 04:42:11,489 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:11,489 INFO L410 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-11-07 04:42:11,489 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:11,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:11,490 INFO L82 PathProgramCache]: Analyzing trace with hash -475874997, now seen corresponding path program 1 times [2019-11-07 04:42:11,490 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:11,490 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400306159] [2019-11-07 04:42:11,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:11,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:11,564 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400306159] [2019-11-07 04:42:11,564 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:11,564 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:11,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216755644] [2019-11-07 04:42:11,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:11,565 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:11,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:11,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:11,566 INFO L87 Difference]: Start difference. First operand 3374 states and 4207 transitions. Second operand 3 states. [2019-11-07 04:42:12,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:12,026 INFO L93 Difference]: Finished difference Result 5820 states and 7391 transitions. [2019-11-07 04:42:12,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:12,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-07 04:42:12,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:12,034 INFO L225 Difference]: With dead ends: 5820 [2019-11-07 04:42:12,034 INFO L226 Difference]: Without dead ends: 3270 [2019-11-07 04:42:12,040 INFO L630 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-11-07 04:42:12,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states. [2019-11-07 04:42:12,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 2598. [2019-11-07 04:42:12,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2598 states. [2019-11-07 04:42:12,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2598 states to 2598 states and 3221 transitions. [2019-11-07 04:42:12,374 INFO L78 Accepts]: Start accepts. Automaton has 2598 states and 3221 transitions. Word has length 59 [2019-11-07 04:42:12,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:12,374 INFO L462 AbstractCegarLoop]: Abstraction has 2598 states and 3221 transitions. [2019-11-07 04:42:12,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:12,374 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 3221 transitions. [2019-11-07 04:42:12,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-07 04:42:12,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:12,377 INFO L410 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-11-07 04:42:12,377 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:12,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:12,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1742126863, now seen corresponding path program 1 times [2019-11-07 04:42:12,378 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:12,378 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135772070] [2019-11-07 04:42:12,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:12,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:12,455 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135772070] [2019-11-07 04:42:12,455 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:12,455 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:12,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404145499] [2019-11-07 04:42:12,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:12,456 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:12,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:12,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:12,456 INFO L87 Difference]: Start difference. First operand 2598 states and 3221 transitions. Second operand 3 states. [2019-11-07 04:42:12,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:12,976 INFO L93 Difference]: Finished difference Result 5758 states and 7340 transitions. [2019-11-07 04:42:12,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:12,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-07 04:42:12,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:12,983 INFO L225 Difference]: With dead ends: 5758 [2019-11-07 04:42:12,983 INFO L226 Difference]: Without dead ends: 3718 [2019-11-07 04:42:12,987 INFO L630 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-11-07 04:42:12,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3718 states. [2019-11-07 04:42:13,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3718 to 2993. [2019-11-07 04:42:13,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2993 states. [2019-11-07 04:42:13,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2993 states to 2993 states and 3785 transitions. [2019-11-07 04:42:13,425 INFO L78 Accepts]: Start accepts. Automaton has 2993 states and 3785 transitions. Word has length 59 [2019-11-07 04:42:13,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:13,425 INFO L462 AbstractCegarLoop]: Abstraction has 2993 states and 3785 transitions. [2019-11-07 04:42:13,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:13,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 3785 transitions. [2019-11-07 04:42:13,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-07 04:42:13,426 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:13,427 INFO L410 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-11-07 04:42:13,427 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:13,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:13,427 INFO L82 PathProgramCache]: Analyzing trace with hash 2026503182, now seen corresponding path program 1 times [2019-11-07 04:42:13,427 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:13,428 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100748497] [2019-11-07 04:42:13,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:14,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:14,962 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100748497] [2019-11-07 04:42:14,963 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:14,963 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-11-07 04:42:14,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429010185] [2019-11-07 04:42:14,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-07 04:42:14,963 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:14,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-07 04:42:14,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2019-11-07 04:42:14,964 INFO L87 Difference]: Start difference. First operand 2993 states and 3785 transitions. Second operand 21 states. [2019-11-07 04:42:15,225 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-11-07 04:42:15,542 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2019-11-07 04:42:15,732 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-11-07 04:42:15,966 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-11-07 04:42:16,250 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-11-07 04:42:16,535 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-11-07 04:42:16,861 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2019-11-07 04:42:17,298 WARN L191 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-11-07 04:42:17,882 WARN L191 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 76 [2019-11-07 04:42:18,375 WARN L191 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 76 [2019-11-07 04:42:18,956 WARN L191 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2019-11-07 04:42:19,466 WARN L191 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2019-11-07 04:42:19,876 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-11-07 04:42:20,267 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57