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_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 23:22:18,780 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:22:18,783 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:22:18,800 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:22:18,801 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:22:18,803 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:22:18,805 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:22:18,814 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:22:18,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:22:18,822 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:22:18,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:22:18,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:22:18,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:22:18,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:22:18,829 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:22:18,831 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:22:18,832 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:22:18,834 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:22:18,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:22:18,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:22:18,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:22:18,844 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:22:18,845 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:22:18,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:22:18,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:22:18,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:22:18,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:22:18,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:22:18,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:22:18,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:22:18,850 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:22:18,851 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:22:18,852 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:22:18,852 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:22:18,853 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:22:18,853 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:22:18,854 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:22:18,854 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:22:18,854 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:22:18,855 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:22:18,856 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:22:18,857 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:22:18,870 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:22:18,871 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:22:18,872 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:22:18,872 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:22:18,872 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:22:18,872 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:22:18,873 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:22:18,873 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:22:18,873 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:22:18,873 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:22:18,873 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:22:18,874 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:22:18,874 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:22:18,874 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:22:18,874 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:22:18,874 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:22:18,874 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:22:18,875 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:22:18,875 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:22:18,875 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:22:18,875 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:22:18,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:22:18,876 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:22:18,876 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:22:18,876 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:22:18,876 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:22:18,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:22:18,877 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:22:18,877 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:22:19,204 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:22:19,226 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:22:19,229 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:22:19,231 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:22:19,231 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:22:19,232 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-13 23:22:19,310 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca2836d9/d7225b81a33c432dad2c0b58877434c0/FLAG960dbe96c [2019-10-13 23:22:19,896 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:22:19,897 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-13 23:22:19,915 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca2836d9/d7225b81a33c432dad2c0b58877434c0/FLAG960dbe96c [2019-10-13 23:22:20,113 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca2836d9/d7225b81a33c432dad2c0b58877434c0 [2019-10-13 23:22:20,124 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:22:20,126 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:22:20,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:22:20,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:22:20,131 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:22:20,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:22:20" (1/1) ... [2019-10-13 23:22:20,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a7a5bea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:20, skipping insertion in model container [2019-10-13 23:22:20,135 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:22:20" (1/1) ... [2019-10-13 23:22:20,142 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:22:20,225 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:22:20,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:22:20,941 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:22:21,360 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:22:21,382 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:22:21,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:21 WrapperNode [2019-10-13 23:22:21,383 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:22:21,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:22:21,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:22:21,384 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:22:21,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:21" (1/1) ... [2019-10-13 23:22:21,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:21" (1/1) ... [2019-10-13 23:22:21,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:21" (1/1) ... [2019-10-13 23:22:21,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:21" (1/1) ... [2019-10-13 23:22:21,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:21" (1/1) ... [2019-10-13 23:22:21,489 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:21" (1/1) ... [2019-10-13 23:22:21,496 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:21" (1/1) ... [2019-10-13 23:22:21,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:22:21,510 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:22:21,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:22:21,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:22:21,515 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:22:21,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:22:21,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:22:21,608 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:22:21,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:22:21,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 23:22:21,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-13 23:22:21,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 23:22:21,609 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 23:22:21,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 23:22:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 23:22:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 23:22:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 23:22:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 23:22:21,610 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 23:22:21,611 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 23:22:21,611 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 23:22:21,611 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:22:21,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:22:21,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:22:24,632 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:22:24,633 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 23:22:24,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:22:24 BoogieIcfgContainer [2019-10-13 23:22:24,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:22:24,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:22:24,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:22:24,640 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:22:24,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:22:20" (1/3) ... [2019-10-13 23:22:24,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4336ad37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:22:24, skipping insertion in model container [2019-10-13 23:22:24,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:21" (2/3) ... [2019-10-13 23:22:24,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4336ad37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:22:24, skipping insertion in model container [2019-10-13 23:22:24,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:22:24" (3/3) ... [2019-10-13 23:22:24,650 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-13 23:22:24,660 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:22:24,669 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-10-13 23:22:24,680 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-10-13 23:22:24,708 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:22:24,709 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:22:24,709 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:22:24,709 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:22:24,709 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:22:24,709 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:22:24,709 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:22:24,709 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:22:24,736 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states. [2019-10-13 23:22:24,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-13 23:22:24,750 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:24,751 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,753 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:24,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:24,759 INFO L82 PathProgramCache]: Analyzing trace with hash -88145364, now seen corresponding path program 1 times [2019-10-13 23:22:24,766 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:24,767 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358677138] [2019-10-13 23:22:24,767 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:24,767 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:24,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:25,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:25,850 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:25,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358677138] [2019-10-13 23:22:25,852 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:25,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:22:25,853 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182305757] [2019-10-13 23:22:25,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:22:25,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:25,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:22:25,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:22:25,877 INFO L87 Difference]: Start difference. First operand 320 states. Second operand 6 states. [2019-10-13 23:22:26,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:26,137 INFO L93 Difference]: Finished difference Result 834 states and 1461 transitions. [2019-10-13 23:22:26,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:26,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2019-10-13 23:22:26,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:26,164 INFO L225 Difference]: With dead ends: 834 [2019-10-13 23:22:26,165 INFO L226 Difference]: Without dead ends: 567 [2019-10-13 23:22:26,175 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:22:26,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-10-13 23:22:26,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 545. [2019-10-13 23:22:26,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-10-13 23:22:26,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 723 transitions. [2019-10-13 23:22:26,294 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 723 transitions. Word has length 123 [2019-10-13 23:22:26,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:26,295 INFO L462 AbstractCegarLoop]: Abstraction has 545 states and 723 transitions. [2019-10-13 23:22:26,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:22:26,296 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 723 transitions. [2019-10-13 23:22:26,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-13 23:22:26,306 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:26,306 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,307 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:26,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:26,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1796124794, now seen corresponding path program 1 times [2019-10-13 23:22:26,309 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:26,309 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471776913] [2019-10-13 23:22:26,309 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:26,310 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:26,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:26,461 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:26,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471776913] [2019-10-13 23:22:26,462 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:26,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:26,462 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194867124] [2019-10-13 23:22:26,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:26,465 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:26,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:26,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:26,465 INFO L87 Difference]: Start difference. First operand 545 states and 723 transitions. Second operand 3 states. [2019-10-13 23:22:26,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:26,571 INFO L93 Difference]: Finished difference Result 1238 states and 1691 transitions. [2019-10-13 23:22:26,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:26,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-10-13 23:22:26,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:26,577 INFO L225 Difference]: With dead ends: 1238 [2019-10-13 23:22:26,577 INFO L226 Difference]: Without dead ends: 737 [2019-10-13 23:22:26,581 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:26,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-10-13 23:22:26,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 652. [2019-10-13 23:22:26,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-10-13 23:22:26,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 896 transitions. [2019-10-13 23:22:26,636 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 896 transitions. Word has length 125 [2019-10-13 23:22:26,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:26,639 INFO L462 AbstractCegarLoop]: Abstraction has 652 states and 896 transitions. [2019-10-13 23:22:26,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:26,639 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 896 transitions. [2019-10-13 23:22:26,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-13 23:22:26,649 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:26,650 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,650 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:26,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:26,652 INFO L82 PathProgramCache]: Analyzing trace with hash -254745606, now seen corresponding path program 1 times [2019-10-13 23:22:26,652 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:26,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120176314] [2019-10-13 23:22:26,653 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:26,653 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:26,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:26,776 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:26,777 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120176314] [2019-10-13 23:22:26,777 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:26,777 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:26,778 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404269088] [2019-10-13 23:22:26,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:26,779 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:26,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:26,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:26,779 INFO L87 Difference]: Start difference. First operand 652 states and 896 transitions. Second operand 3 states. [2019-10-13 23:22:26,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:26,883 INFO L93 Difference]: Finished difference Result 1509 states and 2134 transitions. [2019-10-13 23:22:26,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:26,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-10-13 23:22:26,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:26,890 INFO L225 Difference]: With dead ends: 1509 [2019-10-13 23:22:26,890 INFO L226 Difference]: Without dead ends: 925 [2019-10-13 23:22:26,893 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:26,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2019-10-13 23:22:26,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 853. [2019-10-13 23:22:26,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2019-10-13 23:22:26,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1221 transitions. [2019-10-13 23:22:26,939 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1221 transitions. Word has length 125 [2019-10-13 23:22:26,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:26,940 INFO L462 AbstractCegarLoop]: Abstraction has 853 states and 1221 transitions. [2019-10-13 23:22:26,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:26,941 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1221 transitions. [2019-10-13 23:22:26,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-13 23:22:26,943 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:26,943 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,944 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:26,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:26,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1233192348, now seen corresponding path program 1 times [2019-10-13 23:22:26,944 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:26,945 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596895045] [2019-10-13 23:22:26,946 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:26,946 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:26,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:27,170 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:27,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596895045] [2019-10-13 23:22:27,171 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:27,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:22:27,172 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924646349] [2019-10-13 23:22:27,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:22:27,173 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:27,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:22:27,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:22:27,174 INFO L87 Difference]: Start difference. First operand 853 states and 1221 transitions. Second operand 6 states. [2019-10-13 23:22:27,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:27,631 INFO L93 Difference]: Finished difference Result 2178 states and 3205 transitions. [2019-10-13 23:22:27,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:27,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-10-13 23:22:27,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:27,639 INFO L225 Difference]: With dead ends: 2178 [2019-10-13 23:22:27,639 INFO L226 Difference]: Without dead ends: 1367 [2019-10-13 23:22:27,642 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:22:27,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2019-10-13 23:22:27,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1275. [2019-10-13 23:22:27,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2019-10-13 23:22:27,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1897 transitions. [2019-10-13 23:22:27,733 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1897 transitions. Word has length 128 [2019-10-13 23:22:27,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:27,736 INFO L462 AbstractCegarLoop]: Abstraction has 1275 states and 1897 transitions. [2019-10-13 23:22:27,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:22:27,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1897 transitions. [2019-10-13 23:22:27,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-13 23:22:27,738 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:27,738 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,738 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:27,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:27,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1281543543, now seen corresponding path program 1 times [2019-10-13 23:22:27,739 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:27,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579639276] [2019-10-13 23:22:27,740 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:27,740 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:27,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:27,913 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:27,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579639276] [2019-10-13 23:22:27,914 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:27,914 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:27,915 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945259373] [2019-10-13 23:22:27,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:27,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:27,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:27,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:27,916 INFO L87 Difference]: Start difference. First operand 1275 states and 1897 transitions. Second operand 3 states. [2019-10-13 23:22:28,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:28,110 INFO L93 Difference]: Finished difference Result 2434 states and 3639 transitions. [2019-10-13 23:22:28,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:28,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-10-13 23:22:28,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:28,126 INFO L225 Difference]: With dead ends: 2434 [2019-10-13 23:22:28,126 INFO L226 Difference]: Without dead ends: 1876 [2019-10-13 23:22:28,128 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:28,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2019-10-13 23:22:28,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1854. [2019-10-13 23:22:28,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1854 states. [2019-10-13 23:22:28,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2754 transitions. [2019-10-13 23:22:28,293 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2754 transitions. Word has length 128 [2019-10-13 23:22:28,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:28,295 INFO L462 AbstractCegarLoop]: Abstraction has 1854 states and 2754 transitions. [2019-10-13 23:22:28,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:28,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2754 transitions. [2019-10-13 23:22:28,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-13 23:22:28,298 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:28,299 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,299 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:28,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:28,300 INFO L82 PathProgramCache]: Analyzing trace with hash -333562049, now seen corresponding path program 1 times [2019-10-13 23:22:28,300 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:28,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23995919] [2019-10-13 23:22:28,300 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:28,301 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:28,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:28,803 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:28,803 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23995919] [2019-10-13 23:22:28,804 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:28,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:28,804 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168578860] [2019-10-13 23:22:28,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:28,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:28,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:28,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:28,805 INFO L87 Difference]: Start difference. First operand 1854 states and 2754 transitions. Second operand 5 states. [2019-10-13 23:22:29,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:29,163 INFO L93 Difference]: Finished difference Result 5295 states and 7912 transitions. [2019-10-13 23:22:29,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:29,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2019-10-13 23:22:29,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:29,180 INFO L225 Difference]: With dead ends: 5295 [2019-10-13 23:22:29,180 INFO L226 Difference]: Without dead ends: 3548 [2019-10-13 23:22:29,184 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:29,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2019-10-13 23:22:29,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 3526. [2019-10-13 23:22:29,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3526 states. [2019-10-13 23:22:29,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 5217 transitions. [2019-10-13 23:22:29,447 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 5217 transitions. Word has length 128 [2019-10-13 23:22:29,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:29,448 INFO L462 AbstractCegarLoop]: Abstraction has 3526 states and 5217 transitions. [2019-10-13 23:22:29,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:29,449 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 5217 transitions. [2019-10-13 23:22:29,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-13 23:22:29,452 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:29,452 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,452 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:29,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:29,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1525850627, now seen corresponding path program 1 times [2019-10-13 23:22:29,453 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:29,453 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390382512] [2019-10-13 23:22:29,453 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:29,454 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:29,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:29,547 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:29,547 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390382512] [2019-10-13 23:22:29,547 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:29,548 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:29,548 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727893506] [2019-10-13 23:22:29,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:29,548 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:29,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:29,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:29,549 INFO L87 Difference]: Start difference. First operand 3526 states and 5217 transitions. Second operand 3 states. [2019-10-13 23:22:30,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:30,080 INFO L93 Difference]: Finished difference Result 9122 states and 13744 transitions. [2019-10-13 23:22:30,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:30,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-10-13 23:22:30,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:30,110 INFO L225 Difference]: With dead ends: 9122 [2019-10-13 23:22:30,110 INFO L226 Difference]: Without dead ends: 5742 [2019-10-13 23:22:30,118 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:30,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5742 states. [2019-10-13 23:22:30,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5742 to 5558. [2019-10-13 23:22:30,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5558 states. [2019-10-13 23:22:30,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5558 states to 5558 states and 8399 transitions. [2019-10-13 23:22:30,481 INFO L78 Accepts]: Start accepts. Automaton has 5558 states and 8399 transitions. Word has length 130 [2019-10-13 23:22:30,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:30,482 INFO L462 AbstractCegarLoop]: Abstraction has 5558 states and 8399 transitions. [2019-10-13 23:22:30,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:30,482 INFO L276 IsEmpty]: Start isEmpty. Operand 5558 states and 8399 transitions. [2019-10-13 23:22:30,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-13 23:22:30,485 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:30,486 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,486 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:30,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:30,487 INFO L82 PathProgramCache]: Analyzing trace with hash -2057522103, now seen corresponding path program 1 times [2019-10-13 23:22:30,487 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:30,487 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928511671] [2019-10-13 23:22:30,487 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:30,487 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:30,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:30,615 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:30,615 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928511671] [2019-10-13 23:22:30,615 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:30,616 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:30,616 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488029373] [2019-10-13 23:22:30,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:30,617 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:30,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:30,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:30,617 INFO L87 Difference]: Start difference. First operand 5558 states and 8399 transitions. Second operand 5 states. [2019-10-13 23:22:31,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:31,171 INFO L93 Difference]: Finished difference Result 10982 states and 16629 transitions. [2019-10-13 23:22:31,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:31,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-10-13 23:22:31,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:31,199 INFO L225 Difference]: With dead ends: 10982 [2019-10-13 23:22:31,199 INFO L226 Difference]: Without dead ends: 5558 [2019-10-13 23:22:31,211 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:31,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5558 states. [2019-10-13 23:22:31,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5558 to 5558. [2019-10-13 23:22:31,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5558 states. [2019-10-13 23:22:31,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5558 states to 5558 states and 8279 transitions. [2019-10-13 23:22:31,656 INFO L78 Accepts]: Start accepts. Automaton has 5558 states and 8279 transitions. Word has length 133 [2019-10-13 23:22:31,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:31,657 INFO L462 AbstractCegarLoop]: Abstraction has 5558 states and 8279 transitions. [2019-10-13 23:22:31,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:31,657 INFO L276 IsEmpty]: Start isEmpty. Operand 5558 states and 8279 transitions. [2019-10-13 23:22:31,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-13 23:22:31,660 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:31,660 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,661 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:31,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:31,661 INFO L82 PathProgramCache]: Analyzing trace with hash 100294532, now seen corresponding path program 1 times [2019-10-13 23:22:31,661 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:31,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373254613] [2019-10-13 23:22:31,662 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:31,662 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:31,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:32,024 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:32,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373254613] [2019-10-13 23:22:32,025 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:32,025 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:32,028 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967776296] [2019-10-13 23:22:32,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:32,028 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:32,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:32,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:32,029 INFO L87 Difference]: Start difference. First operand 5558 states and 8279 transitions. Second operand 5 states. [2019-10-13 23:22:32,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:32,343 INFO L93 Difference]: Finished difference Result 6461 states and 9604 transitions. [2019-10-13 23:22:32,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:32,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-10-13 23:22:32,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:32,386 INFO L225 Difference]: With dead ends: 6461 [2019-10-13 23:22:32,386 INFO L226 Difference]: Without dead ends: 4735 [2019-10-13 23:22:32,392 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:32,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4735 states. [2019-10-13 23:22:32,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4735 to 4696. [2019-10-13 23:22:32,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4696 states. [2019-10-13 23:22:32,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4696 states to 4696 states and 7003 transitions. [2019-10-13 23:22:32,737 INFO L78 Accepts]: Start accepts. Automaton has 4696 states and 7003 transitions. Word has length 133 [2019-10-13 23:22:32,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:32,738 INFO L462 AbstractCegarLoop]: Abstraction has 4696 states and 7003 transitions. [2019-10-13 23:22:32,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:32,738 INFO L276 IsEmpty]: Start isEmpty. Operand 4696 states and 7003 transitions. [2019-10-13 23:22:32,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-13 23:22:32,741 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:32,741 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,741 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:32,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:32,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1643558573, now seen corresponding path program 1 times [2019-10-13 23:22:32,742 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:32,742 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010586142] [2019-10-13 23:22:32,742 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:32,743 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:32,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:32,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:33,050 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:33,051 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010586142] [2019-10-13 23:22:33,052 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:33,052 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:33,052 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778496878] [2019-10-13 23:22:33,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:33,053 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:33,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:33,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:33,054 INFO L87 Difference]: Start difference. First operand 4696 states and 7003 transitions. Second operand 5 states. [2019-10-13 23:22:33,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:33,745 INFO L93 Difference]: Finished difference Result 13582 states and 20369 transitions. [2019-10-13 23:22:33,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:33,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-10-13 23:22:33,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:33,770 INFO L225 Difference]: With dead ends: 13582 [2019-10-13 23:22:33,770 INFO L226 Difference]: Without dead ends: 9053 [2019-10-13 23:22:33,781 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:33,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9053 states. [2019-10-13 23:22:34,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9053 to 9031. [2019-10-13 23:22:34,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9031 states. [2019-10-13 23:22:34,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9031 states to 9031 states and 13457 transitions. [2019-10-13 23:22:34,243 INFO L78 Accepts]: Start accepts. Automaton has 9031 states and 13457 transitions. Word has length 133 [2019-10-13 23:22:34,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:34,243 INFO L462 AbstractCegarLoop]: Abstraction has 9031 states and 13457 transitions. [2019-10-13 23:22:34,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:34,243 INFO L276 IsEmpty]: Start isEmpty. Operand 9031 states and 13457 transitions. [2019-10-13 23:22:34,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-13 23:22:34,249 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:34,249 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,249 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:34,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:34,250 INFO L82 PathProgramCache]: Analyzing trace with hash -640634061, now seen corresponding path program 1 times [2019-10-13 23:22:34,250 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:34,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114980530] [2019-10-13 23:22:34,250 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:34,251 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:34,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:34,448 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:34,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114980530] [2019-10-13 23:22:34,449 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:34,449 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:34,449 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137242081] [2019-10-13 23:22:34,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:34,450 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:34,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:34,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:34,451 INFO L87 Difference]: Start difference. First operand 9031 states and 13457 transitions. Second operand 3 states. [2019-10-13 23:22:35,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:35,087 INFO L93 Difference]: Finished difference Result 16931 states and 25211 transitions. [2019-10-13 23:22:35,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:35,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-10-13 23:22:35,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:35,124 INFO L225 Difference]: With dead ends: 16931 [2019-10-13 23:22:35,125 INFO L226 Difference]: Without dead ends: 12631 [2019-10-13 23:22:35,137 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:35,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12631 states. [2019-10-13 23:22:35,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12631 to 12609. [2019-10-13 23:22:35,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12609 states. [2019-10-13 23:22:35,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12609 states to 12609 states and 18567 transitions. [2019-10-13 23:22:35,885 INFO L78 Accepts]: Start accepts. Automaton has 12609 states and 18567 transitions. Word has length 138 [2019-10-13 23:22:35,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:35,885 INFO L462 AbstractCegarLoop]: Abstraction has 12609 states and 18567 transitions. [2019-10-13 23:22:35,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:35,886 INFO L276 IsEmpty]: Start isEmpty. Operand 12609 states and 18567 transitions. [2019-10-13 23:22:35,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-13 23:22:35,891 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:35,892 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,892 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:35,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:35,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1935605800, now seen corresponding path program 1 times [2019-10-13 23:22:35,893 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:35,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179227124] [2019-10-13 23:22:35,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:35,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:35,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:36,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:36,446 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179227124] [2019-10-13 23:22:36,446 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:36,447 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:36,447 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442912997] [2019-10-13 23:22:36,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:36,447 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:36,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:36,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:36,448 INFO L87 Difference]: Start difference. First operand 12609 states and 18567 transitions. Second operand 5 states. [2019-10-13 23:22:37,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:37,256 INFO L93 Difference]: Finished difference Result 20979 states and 31100 transitions. [2019-10-13 23:22:37,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:37,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-10-13 23:22:37,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:37,293 INFO L225 Difference]: With dead ends: 20979 [2019-10-13 23:22:37,293 INFO L226 Difference]: Without dead ends: 12688 [2019-10-13 23:22:37,310 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:37,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12688 states. [2019-10-13 23:22:38,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12688 to 12612. [2019-10-13 23:22:38,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12612 states. [2019-10-13 23:22:38,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12612 states to 12612 states and 18570 transitions. [2019-10-13 23:22:38,050 INFO L78 Accepts]: Start accepts. Automaton has 12612 states and 18570 transitions. Word has length 138 [2019-10-13 23:22:38,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:38,050 INFO L462 AbstractCegarLoop]: Abstraction has 12612 states and 18570 transitions. [2019-10-13 23:22:38,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:38,050 INFO L276 IsEmpty]: Start isEmpty. Operand 12612 states and 18570 transitions. [2019-10-13 23:22:38,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-13 23:22:38,055 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:38,056 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,056 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:38,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:38,056 INFO L82 PathProgramCache]: Analyzing trace with hash 407147818, now seen corresponding path program 1 times [2019-10-13 23:22:38,057 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:38,057 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099717299] [2019-10-13 23:22:38,057 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:38,057 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:38,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:39,201 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-10-13 23:22:39,334 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-10-13 23:22:39,476 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-10-13 23:22:39,626 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-10-13 23:22:39,788 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-10-13 23:22:39,987 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-10-13 23:22:40,143 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-10-13 23:22:40,305 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-10-13 23:22:40,482 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-10-13 23:22:40,635 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-10-13 23:22:40,823 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-10-13 23:22:40,978 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-10-13 23:22:41,304 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-10-13 23:22:41,988 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-10-13 23:22:42,706 WARN L191 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-10-13 23:22:43,070 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-10-13 23:22:43,288 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-10-13 23:22:44,163 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:44,163 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099717299] [2019-10-13 23:22:44,163 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:44,163 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2019-10-13 23:22:44,164 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412946981] [2019-10-13 23:22:44,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-13 23:22:44,164 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:44,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-13 23:22:44,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1033, Unknown=0, NotChecked=0, Total=1122 [2019-10-13 23:22:44,165 INFO L87 Difference]: Start difference. First operand 12612 states and 18570 transitions. Second operand 34 states. [2019-10-13 23:22:44,726 WARN L191 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 87 [2019-10-13 23:22:45,251 WARN L191 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 79 [2019-10-13 23:22:45,996 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-10-13 23:22:46,222 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-10-13 23:22:46,411 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-10-13 23:22:46,681 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-10-13 23:22:47,180 WARN L191 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-10-13 23:22:47,587 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2019-10-13 23:22:48,162 WARN L191 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 77 [2019-10-13 23:22:48,728 WARN L191 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 74 [2019-10-13 23:22:49,405 WARN L191 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 80 [2019-10-13 23:22:50,090 WARN L191 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 81 [2019-10-13 23:22:50,977 WARN L191 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 80 [2019-10-13 23:22:51,584 WARN L191 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 77 [2019-10-13 23:22:52,287 WARN L191 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 83 [2019-10-13 23:22:52,882 WARN L191 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 82 [2019-10-13 23:22:53,658 WARN L191 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 82 [2019-10-13 23:22:54,364 WARN L191 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 91