/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label08.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:33:45,894 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:33:45,896 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:33:45,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:33:45,908 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:33:45,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:33:45,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:33:45,912 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:33:45,914 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:33:45,915 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:33:45,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:33:45,917 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:33:45,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:33:45,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:33:45,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:33:45,921 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:33:45,922 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:33:45,923 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:33:45,924 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:33:45,926 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:33:45,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:33:45,929 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:33:45,930 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:33:45,931 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:33:45,934 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:33:45,934 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:33:45,934 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:33:45,935 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:33:45,936 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:33:45,937 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:33:45,937 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:33:45,938 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:33:45,939 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:33:45,940 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:33:45,941 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:33:45,941 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:33:45,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:33:45,942 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:33:45,942 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:33:45,943 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:33:45,944 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:33:45,945 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-23 23:33:45,969 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:33:45,969 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:33:45,970 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:33:45,970 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:33:45,970 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:33:45,970 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:33:45,971 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:33:45,971 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:33:45,971 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:33:45,971 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:33:45,971 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:33:45,972 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:33:45,973 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:33:45,973 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:33:45,974 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:33:45,974 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:33:45,974 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:33:45,975 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:33:45,975 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:33:45,975 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:33:45,975 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:33:45,975 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:33:45,976 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:33:45,977 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:33:45,977 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:33:45,977 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:33:45,977 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:33:45,977 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:33:45,978 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:33:45,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:33:45,978 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:33:45,979 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:33:45,979 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:33:45,979 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:33:45,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:33:45,979 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:33:45,979 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:33:45,980 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:33:46,247 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:33:46,264 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:33:46,267 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:33:46,268 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:33:46,269 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:33:46,270 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label08.c [2019-11-23 23:33:46,342 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb2792b47/f948a8bb8f684cb69ba71cf2602cf046/FLAG80ecefb80 [2019-11-23 23:33:47,013 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:33:47,015 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label08.c [2019-11-23 23:33:47,035 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb2792b47/f948a8bb8f684cb69ba71cf2602cf046/FLAG80ecefb80 [2019-11-23 23:33:47,144 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb2792b47/f948a8bb8f684cb69ba71cf2602cf046 [2019-11-23 23:33:47,154 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:33:47,155 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:33:47,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:33:47,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:33:47,160 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:33:47,161 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:33:47" (1/1) ... [2019-11-23 23:33:47,163 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ca29688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:47, skipping insertion in model container [2019-11-23 23:33:47,164 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:33:47" (1/1) ... [2019-11-23 23:33:47,171 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:33:47,258 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:33:48,069 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:33:48,076 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:33:48,331 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:33:48,354 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:33:48,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:48 WrapperNode [2019-11-23 23:33:48,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:33:48,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:33:48,356 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:33:48,357 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:33:48,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:48" (1/1) ... [2019-11-23 23:33:48,419 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:48" (1/1) ... [2019-11-23 23:33:48,520 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:33:48,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:33:48,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:33:48,521 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:33:48,531 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:48" (1/1) ... [2019-11-23 23:33:48,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:48" (1/1) ... [2019-11-23 23:33:48,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:48" (1/1) ... [2019-11-23 23:33:48,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:48" (1/1) ... [2019-11-23 23:33:48,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:48" (1/1) ... [2019-11-23 23:33:48,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:48" (1/1) ... [2019-11-23 23:33:48,631 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:48" (1/1) ... [2019-11-23 23:33:48,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:33:48,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:33:48,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:33:48,644 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:33:48,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33: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-23 23:33:48,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:33:48,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:33:51,690 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:33:51,690 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:33:51,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:33:51 BoogieIcfgContainer [2019-11-23 23:33:51,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:33:51,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:33:51,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:33:51,696 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:33:51,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:33:47" (1/3) ... [2019-11-23 23:33:51,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e05590c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:33:51, skipping insertion in model container [2019-11-23 23:33:51,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:33:48" (2/3) ... [2019-11-23 23:33:51,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e05590c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:33:51, skipping insertion in model container [2019-11-23 23:33:51,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:33:51" (3/3) ... [2019-11-23 23:33:51,700 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label08.c [2019-11-23 23:33:51,710 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:33:51,721 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:33:51,732 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:33:51,770 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:33:51,770 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:33:51,770 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:33:51,771 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:33:51,771 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:33:51,771 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:33:51,771 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:33:51,771 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:33:51,787 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-23 23:33:51,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-23 23:33:51,800 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:51,801 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:33:51,802 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:51,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:51,807 INFO L82 PathProgramCache]: Analyzing trace with hash 466745300, now seen corresponding path program 1 times [2019-11-23 23:33:51,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:51,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009442724] [2019-11-23 23:33:51,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:52,411 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-23 23:33:52,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009442724] [2019-11-23 23:33:52,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:52,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:33:52,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990483123] [2019-11-23 23:33:52,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:33:52,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:52,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:33:52,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:52,439 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-23 23:33:54,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:54,186 INFO L93 Difference]: Finished difference Result 585 states and 1145 transitions. [2019-11-23 23:33:54,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:33:54,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-11-23 23:33:54,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:54,209 INFO L225 Difference]: With dead ends: 585 [2019-11-23 23:33:54,209 INFO L226 Difference]: Without dead ends: 432 [2019-11-23 23:33:54,213 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:54,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-11-23 23:33:54,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2019-11-23 23:33:54,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-11-23 23:33:54,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 728 transitions. [2019-11-23 23:33:54,299 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 728 transitions. Word has length 143 [2019-11-23 23:33:54,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:54,300 INFO L462 AbstractCegarLoop]: Abstraction has 432 states and 728 transitions. [2019-11-23 23:33:54,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:33:54,300 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 728 transitions. [2019-11-23 23:33:54,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-23 23:33:54,305 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:54,305 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:33:54,306 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:54,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:54,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1593788787, now seen corresponding path program 1 times [2019-11-23 23:33:54,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:54,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870859452] [2019-11-23 23:33:54,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:54,419 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:33:54,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870859452] [2019-11-23 23:33:54,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:54,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:33:54,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240631491] [2019-11-23 23:33:54,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:33:54,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:54,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:33:54,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:33:54,424 INFO L87 Difference]: Start difference. First operand 432 states and 728 transitions. Second operand 3 states. [2019-11-23 23:33:55,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:55,378 INFO L93 Difference]: Finished difference Result 1292 states and 2181 transitions. [2019-11-23 23:33:55,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:33:55,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-23 23:33:55,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:55,385 INFO L225 Difference]: With dead ends: 1292 [2019-11-23 23:33:55,385 INFO L226 Difference]: Without dead ends: 861 [2019-11-23 23:33:55,388 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-23 23:33:55,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-11-23 23:33:55,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 861. [2019-11-23 23:33:55,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2019-11-23 23:33:55,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1412 transitions. [2019-11-23 23:33:55,435 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1412 transitions. Word has length 151 [2019-11-23 23:33:55,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:55,435 INFO L462 AbstractCegarLoop]: Abstraction has 861 states and 1412 transitions. [2019-11-23 23:33:55,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:33:55,435 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1412 transitions. [2019-11-23 23:33:55,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-23 23:33:55,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:55,441 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:33:55,441 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:55,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:55,441 INFO L82 PathProgramCache]: Analyzing trace with hash -698299822, now seen corresponding path program 1 times [2019-11-23 23:33:55,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:55,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468271445] [2019-11-23 23:33:55,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:55,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:55,689 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:33:55,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468271445] [2019-11-23 23:33:55,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:55,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:33:55,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492951817] [2019-11-23 23:33:55,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:33:55,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:55,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:33:55,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:33:55,730 INFO L87 Difference]: Start difference. First operand 861 states and 1412 transitions. Second operand 3 states. [2019-11-23 23:33:56,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:56,559 INFO L93 Difference]: Finished difference Result 2579 states and 4233 transitions. [2019-11-23 23:33:56,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:33:56,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-23 23:33:56,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:56,570 INFO L225 Difference]: With dead ends: 2579 [2019-11-23 23:33:56,570 INFO L226 Difference]: Without dead ends: 1719 [2019-11-23 23:33:56,572 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-23 23:33:56,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2019-11-23 23:33:56,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1719. [2019-11-23 23:33:56,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-11-23 23:33:56,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2728 transitions. [2019-11-23 23:33:56,621 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2728 transitions. Word has length 158 [2019-11-23 23:33:56,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:56,622 INFO L462 AbstractCegarLoop]: Abstraction has 1719 states and 2728 transitions. [2019-11-23 23:33:56,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:33:56,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2728 transitions. [2019-11-23 23:33:56,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-23 23:33:56,629 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:56,630 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:33:56,630 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:56,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:56,630 INFO L82 PathProgramCache]: Analyzing trace with hash 812338694, now seen corresponding path program 1 times [2019-11-23 23:33:56,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:56,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699898648] [2019-11-23 23:33:56,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:56,750 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-23 23:33:56,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699898648] [2019-11-23 23:33:56,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:56,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:33:56,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636522648] [2019-11-23 23:33:56,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:33:56,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:56,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:33:56,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:33:56,752 INFO L87 Difference]: Start difference. First operand 1719 states and 2728 transitions. Second operand 3 states. [2019-11-23 23:33:57,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:57,277 INFO L93 Difference]: Finished difference Result 3437 states and 5455 transitions. [2019-11-23 23:33:57,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:33:57,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-11-23 23:33:57,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:57,287 INFO L225 Difference]: With dead ends: 3437 [2019-11-23 23:33:57,288 INFO L226 Difference]: Without dead ends: 1719 [2019-11-23 23:33:57,290 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-23 23:33:57,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2019-11-23 23:33:57,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1719. [2019-11-23 23:33:57,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-11-23 23:33:57,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2652 transitions. [2019-11-23 23:33:57,331 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2652 transitions. Word has length 171 [2019-11-23 23:33:57,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:57,331 INFO L462 AbstractCegarLoop]: Abstraction has 1719 states and 2652 transitions. [2019-11-23 23:33:57,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:33:57,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2652 transitions. [2019-11-23 23:33:57,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-23 23:33:57,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:57,337 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:33:57,337 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:57,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:57,338 INFO L82 PathProgramCache]: Analyzing trace with hash -2137932279, now seen corresponding path program 1 times [2019-11-23 23:33:57,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:57,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7020419] [2019-11-23 23:33:57,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:57,429 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:33:57,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7020419] [2019-11-23 23:33:57,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:57,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:33:57,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057408472] [2019-11-23 23:33:57,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:33:57,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:57,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:33:57,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:33:57,431 INFO L87 Difference]: Start difference. First operand 1719 states and 2652 transitions. Second operand 3 states. [2019-11-23 23:33:58,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:33:58,353 INFO L93 Difference]: Finished difference Result 4867 states and 7623 transitions. [2019-11-23 23:33:58,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:33:58,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-11-23 23:33:58,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:33:58,371 INFO L225 Difference]: With dead ends: 4867 [2019-11-23 23:33:58,371 INFO L226 Difference]: Without dead ends: 3149 [2019-11-23 23:33:58,375 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-23 23:33:58,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3149 states. [2019-11-23 23:33:58,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3149 to 3149. [2019-11-23 23:33:58,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3149 states. [2019-11-23 23:33:58,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 3149 states and 4721 transitions. [2019-11-23 23:33:58,449 INFO L78 Accepts]: Start accepts. Automaton has 3149 states and 4721 transitions. Word has length 192 [2019-11-23 23:33:58,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:33:58,450 INFO L462 AbstractCegarLoop]: Abstraction has 3149 states and 4721 transitions. [2019-11-23 23:33:58,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:33:58,450 INFO L276 IsEmpty]: Start isEmpty. Operand 3149 states and 4721 transitions. [2019-11-23 23:33:58,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-23 23:33:58,459 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:33:58,460 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:33:58,460 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:33:58,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:33:58,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1885946162, now seen corresponding path program 1 times [2019-11-23 23:33:58,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:33:58,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480701454] [2019-11-23 23:33:58,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:33:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:33:58,661 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:33:58,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480701454] [2019-11-23 23:33:58,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:33:58,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:33:58,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950310360] [2019-11-23 23:33:58,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:33:58,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:33:58,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:33:58,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:33:58,664 INFO L87 Difference]: Start difference. First operand 3149 states and 4721 transitions. Second operand 4 states. [2019-11-23 23:34:00,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:00,256 INFO L93 Difference]: Finished difference Result 10589 states and 15666 transitions. [2019-11-23 23:34:00,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:00,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-11-23 23:34:00,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:00,301 INFO L225 Difference]: With dead ends: 10589 [2019-11-23 23:34:00,301 INFO L226 Difference]: Without dead ends: 7441 [2019-11-23 23:34:00,308 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:00,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7441 states. [2019-11-23 23:34:00,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7441 to 5580. [2019-11-23 23:34:00,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5580 states. [2019-11-23 23:34:00,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5580 states to 5580 states and 7927 transitions. [2019-11-23 23:34:00,546 INFO L78 Accepts]: Start accepts. Automaton has 5580 states and 7927 transitions. Word has length 197 [2019-11-23 23:34:00,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:00,546 INFO L462 AbstractCegarLoop]: Abstraction has 5580 states and 7927 transitions. [2019-11-23 23:34:00,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:00,546 INFO L276 IsEmpty]: Start isEmpty. Operand 5580 states and 7927 transitions. [2019-11-23 23:34:00,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-23 23:34:00,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:00,560 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:34:00,560 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:00,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:00,561 INFO L82 PathProgramCache]: Analyzing trace with hash -283028495, now seen corresponding path program 1 times [2019-11-23 23:34:00,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:00,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271915826] [2019-11-23 23:34:00,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:00,653 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-23 23:34:00,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271915826] [2019-11-23 23:34:00,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:00,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:34:00,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342995485] [2019-11-23 23:34:00,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:00,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:00,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:00,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:00,657 INFO L87 Difference]: Start difference. First operand 5580 states and 7927 transitions. Second operand 3 states. [2019-11-23 23:34:01,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:01,503 INFO L93 Difference]: Finished difference Result 13878 states and 19637 transitions. [2019-11-23 23:34:01,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:01,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-11-23 23:34:01,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:01,539 INFO L225 Difference]: With dead ends: 13878 [2019-11-23 23:34:01,540 INFO L226 Difference]: Without dead ends: 8299 [2019-11-23 23:34:01,548 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-23 23:34:01,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8299 states. [2019-11-23 23:34:01,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8299 to 8297. [2019-11-23 23:34:01,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8297 states. [2019-11-23 23:34:01,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8297 states to 8297 states and 11666 transitions. [2019-11-23 23:34:01,691 INFO L78 Accepts]: Start accepts. Automaton has 8297 states and 11666 transitions. Word has length 205 [2019-11-23 23:34:01,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:01,691 INFO L462 AbstractCegarLoop]: Abstraction has 8297 states and 11666 transitions. [2019-11-23 23:34:01,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:01,692 INFO L276 IsEmpty]: Start isEmpty. Operand 8297 states and 11666 transitions. [2019-11-23 23:34:01,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-23 23:34:01,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:01,711 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:34:01,711 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:01,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:01,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1629939824, now seen corresponding path program 1 times [2019-11-23 23:34:01,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:01,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546872159] [2019-11-23 23:34:01,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:01,932 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-23 23:34:01,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546872159] [2019-11-23 23:34:01,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559910378] [2019-11-23 23:34:01,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:34:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:02,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:34:02,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:34:02,322 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-11-23 23:34:02,322 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:34:02,398 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-11-23 23:34:02,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:34:02,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [4] total 5 [2019-11-23 23:34:02,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843709260] [2019-11-23 23:34:02,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:02,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:02,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:02,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:34:02,403 INFO L87 Difference]: Start difference. First operand 8297 states and 11666 transitions. Second operand 3 states. [2019-11-23 23:34:03,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:03,386 INFO L93 Difference]: Finished difference Result 23457 states and 33070 transitions. [2019-11-23 23:34:03,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:03,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-11-23 23:34:03,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:03,428 INFO L225 Difference]: With dead ends: 23457 [2019-11-23 23:34:03,428 INFO L226 Difference]: Without dead ends: 15161 [2019-11-23 23:34:03,439 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 421 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:34:03,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15161 states. [2019-11-23 23:34:03,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15161 to 15161. [2019-11-23 23:34:03,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15161 states. [2019-11-23 23:34:03,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15161 states to 15161 states and 20623 transitions. [2019-11-23 23:34:03,704 INFO L78 Accepts]: Start accepts. Automaton has 15161 states and 20623 transitions. Word has length 212 [2019-11-23 23:34:03,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:03,705 INFO L462 AbstractCegarLoop]: Abstraction has 15161 states and 20623 transitions. [2019-11-23 23:34:03,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:03,705 INFO L276 IsEmpty]: Start isEmpty. Operand 15161 states and 20623 transitions. [2019-11-23 23:34:03,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-23 23:34:03,742 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:03,742 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:34:03,945 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:34:03,946 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:03,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:03,946 INFO L82 PathProgramCache]: Analyzing trace with hash 2045282608, now seen corresponding path program 1 times [2019-11-23 23:34:03,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:03,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99562012] [2019-11-23 23:34:03,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:04,174 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:34:04,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99562012] [2019-11-23 23:34:04,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:04,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:34:04,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603080033] [2019-11-23 23:34:04,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:34:04,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:04,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:34:04,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:34:04,178 INFO L87 Difference]: Start difference. First operand 15161 states and 20623 transitions. Second operand 5 states. [2019-11-23 23:34:05,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:05,958 INFO L93 Difference]: Finished difference Result 44194 states and 59863 transitions. [2019-11-23 23:34:05,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:34:05,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 212 [2019-11-23 23:34:05,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:06,011 INFO L225 Difference]: With dead ends: 44194 [2019-11-23 23:34:06,011 INFO L226 Difference]: Without dead ends: 29034 [2019-11-23 23:34:06,030 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-11-23 23:34:06,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29034 states. [2019-11-23 23:34:06,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29034 to 29032. [2019-11-23 23:34:06,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29032 states. [2019-11-23 23:34:06,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29032 states to 29032 states and 37579 transitions. [2019-11-23 23:34:06,453 INFO L78 Accepts]: Start accepts. Automaton has 29032 states and 37579 transitions. Word has length 212 [2019-11-23 23:34:06,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:06,454 INFO L462 AbstractCegarLoop]: Abstraction has 29032 states and 37579 transitions. [2019-11-23 23:34:06,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:34:06,454 INFO L276 IsEmpty]: Start isEmpty. Operand 29032 states and 37579 transitions. [2019-11-23 23:34:06,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-11-23 23:34:06,499 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:06,499 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:34:06,499 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:06,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:06,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1714965876, now seen corresponding path program 1 times [2019-11-23 23:34:06,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:06,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856158509] [2019-11-23 23:34:06,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:07,691 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:34:07,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856158509] [2019-11-23 23:34:07,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:07,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:34:07,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636643031] [2019-11-23 23:34:07,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:07,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:07,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:07,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:34:07,701 INFO L87 Difference]: Start difference. First operand 29032 states and 37579 transitions. Second operand 3 states. [2019-11-23 23:34:08,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:08,800 INFO L93 Difference]: Finished difference Result 73795 states and 95553 transitions. [2019-11-23 23:34:08,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:34:08,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2019-11-23 23:34:08,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:08,872 INFO L225 Difference]: With dead ends: 73795 [2019-11-23 23:34:08,872 INFO L226 Difference]: Without dead ends: 44764 [2019-11-23 23:34:08,904 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-23 23:34:08,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44764 states. [2019-11-23 23:34:09,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44764 to 44762. [2019-11-23 23:34:09,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44762 states. [2019-11-23 23:34:09,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44762 states to 44762 states and 57775 transitions. [2019-11-23 23:34:09,744 INFO L78 Accepts]: Start accepts. Automaton has 44762 states and 57775 transitions. Word has length 258 [2019-11-23 23:34:09,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:09,744 INFO L462 AbstractCegarLoop]: Abstraction has 44762 states and 57775 transitions. [2019-11-23 23:34:09,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:34:09,744 INFO L276 IsEmpty]: Start isEmpty. Operand 44762 states and 57775 transitions. [2019-11-23 23:34:09,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-23 23:34:09,777 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:09,777 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:34:09,778 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:09,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:09,778 INFO L82 PathProgramCache]: Analyzing trace with hash 577715646, now seen corresponding path program 1 times [2019-11-23 23:34:09,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:09,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593280617] [2019-11-23 23:34:09,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:09,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:09,951 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-23 23:34:09,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593280617] [2019-11-23 23:34:09,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:09,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:09,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62581423] [2019-11-23 23:34:09,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:09,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:09,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:09,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:09,954 INFO L87 Difference]: Start difference. First operand 44762 states and 57775 transitions. Second operand 4 states. [2019-11-23 23:34:11,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:11,070 INFO L93 Difference]: Finished difference Result 90810 states and 117301 transitions. [2019-11-23 23:34:11,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:11,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 263 [2019-11-23 23:34:11,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:11,120 INFO L225 Difference]: With dead ends: 90810 [2019-11-23 23:34:11,121 INFO L226 Difference]: Without dead ends: 46049 [2019-11-23 23:34:11,149 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:11,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46049 states. [2019-11-23 23:34:11,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46049 to 42760. [2019-11-23 23:34:11,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42760 states. [2019-11-23 23:34:11,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42760 states to 42760 states and 54580 transitions. [2019-11-23 23:34:11,858 INFO L78 Accepts]: Start accepts. Automaton has 42760 states and 54580 transitions. Word has length 263 [2019-11-23 23:34:11,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:11,858 INFO L462 AbstractCegarLoop]: Abstraction has 42760 states and 54580 transitions. [2019-11-23 23:34:11,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:11,858 INFO L276 IsEmpty]: Start isEmpty. Operand 42760 states and 54580 transitions. [2019-11-23 23:34:11,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-11-23 23:34:11,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:11,886 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:34:11,886 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:11,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:11,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1016590539, now seen corresponding path program 1 times [2019-11-23 23:34:11,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:11,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997301856] [2019-11-23 23:34:11,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:12,571 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-11-23 23:34:13,585 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:34:13,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997301856] [2019-11-23 23:34:13,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:13,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-23 23:34:13,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464441867] [2019-11-23 23:34:13,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 23:34:13,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:13,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 23:34:13,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-23 23:34:13,587 INFO L87 Difference]: Start difference. First operand 42760 states and 54580 transitions. Second operand 11 states. [2019-11-23 23:34:13,715 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-11-23 23:34:13,913 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-11-23 23:34:17,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:17,474 INFO L93 Difference]: Finished difference Result 125009 states and 158382 transitions. [2019-11-23 23:34:17,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 23:34:17,475 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 265 [2019-11-23 23:34:17,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:17,547 INFO L225 Difference]: With dead ends: 125009 [2019-11-23 23:34:17,547 INFO L226 Difference]: Without dead ends: 82250 [2019-11-23 23:34:17,578 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-11-23 23:34:17,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82250 states. [2019-11-23 23:34:18,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82250 to 77795. [2019-11-23 23:34:18,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77795 states. [2019-11-23 23:34:20,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77795 states to 77795 states and 98673 transitions. [2019-11-23 23:34:20,445 INFO L78 Accepts]: Start accepts. Automaton has 77795 states and 98673 transitions. Word has length 265 [2019-11-23 23:34:20,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:20,445 INFO L462 AbstractCegarLoop]: Abstraction has 77795 states and 98673 transitions. [2019-11-23 23:34:20,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 23:34:20,445 INFO L276 IsEmpty]: Start isEmpty. Operand 77795 states and 98673 transitions. [2019-11-23 23:34:20,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-11-23 23:34:20,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:20,496 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:34:20,496 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:20,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:20,497 INFO L82 PathProgramCache]: Analyzing trace with hash -429458261, now seen corresponding path program 1 times [2019-11-23 23:34:20,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:20,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770620983] [2019-11-23 23:34:20,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:20,760 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-23 23:34:20,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770620983] [2019-11-23 23:34:20,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:20,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:20,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377458231] [2019-11-23 23:34:20,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:20,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:20,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:20,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:20,768 INFO L87 Difference]: Start difference. First operand 77795 states and 98673 transitions. Second operand 4 states. [2019-11-23 23:34:22,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:22,210 INFO L93 Difference]: Finished difference Result 173752 states and 221198 transitions. [2019-11-23 23:34:22,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:22,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 272 [2019-11-23 23:34:22,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:22,299 INFO L225 Difference]: With dead ends: 173752 [2019-11-23 23:34:22,299 INFO L226 Difference]: Without dead ends: 95958 [2019-11-23 23:34:22,338 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:22,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95958 states. [2019-11-23 23:34:23,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95958 to 83944. [2019-11-23 23:34:23,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83944 states. [2019-11-23 23:34:23,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83944 states to 83944 states and 107293 transitions. [2019-11-23 23:34:23,513 INFO L78 Accepts]: Start accepts. Automaton has 83944 states and 107293 transitions. Word has length 272 [2019-11-23 23:34:23,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:23,513 INFO L462 AbstractCegarLoop]: Abstraction has 83944 states and 107293 transitions. [2019-11-23 23:34:23,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:23,513 INFO L276 IsEmpty]: Start isEmpty. Operand 83944 states and 107293 transitions. [2019-11-23 23:34:23,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-11-23 23:34:23,553 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:23,553 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:34:23,554 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:23,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:23,554 INFO L82 PathProgramCache]: Analyzing trace with hash 2050640263, now seen corresponding path program 1 times [2019-11-23 23:34:23,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:23,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988509364] [2019-11-23 23:34:23,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:23,772 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:34:23,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988509364] [2019-11-23 23:34:23,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:23,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:23,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288181156] [2019-11-23 23:34:23,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:23,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:23,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:23,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:23,774 INFO L87 Difference]: Start difference. First operand 83944 states and 107293 transitions. Second operand 4 states. [2019-11-23 23:34:25,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:25,517 INFO L93 Difference]: Finished difference Result 178042 states and 226325 transitions. [2019-11-23 23:34:25,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:25,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 293 [2019-11-23 23:34:25,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:25,608 INFO L225 Difference]: With dead ends: 178042 [2019-11-23 23:34:25,608 INFO L226 Difference]: Without dead ends: 94099 [2019-11-23 23:34:25,646 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:25,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94099 states. [2019-11-23 23:34:26,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94099 to 94097. [2019-11-23 23:34:26,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94097 states. [2019-11-23 23:34:26,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94097 states to 94097 states and 117444 transitions. [2019-11-23 23:34:26,532 INFO L78 Accepts]: Start accepts. Automaton has 94097 states and 117444 transitions. Word has length 293 [2019-11-23 23:34:26,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:26,532 INFO L462 AbstractCegarLoop]: Abstraction has 94097 states and 117444 transitions. [2019-11-23 23:34:26,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:26,532 INFO L276 IsEmpty]: Start isEmpty. Operand 94097 states and 117444 transitions. [2019-11-23 23:34:27,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-11-23 23:34:27,011 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:27,011 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:34:27,011 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:27,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:27,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1037553246, now seen corresponding path program 1 times [2019-11-23 23:34:27,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:27,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227539977] [2019-11-23 23:34:27,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:27,145 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-11-23 23:34:27,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227539977] [2019-11-23 23:34:27,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:27,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:27,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566331619] [2019-11-23 23:34:27,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:27,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:27,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:27,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:27,150 INFO L87 Difference]: Start difference. First operand 94097 states and 117444 transitions. Second operand 4 states. [2019-11-23 23:34:29,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:29,242 INFO L93 Difference]: Finished difference Result 280573 states and 348031 transitions. [2019-11-23 23:34:29,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:29,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 299 [2019-11-23 23:34:29,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:29,453 INFO L225 Difference]: With dead ends: 280573 [2019-11-23 23:34:29,453 INFO L226 Difference]: Without dead ends: 186477 [2019-11-23 23:34:29,518 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:29,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186477 states. [2019-11-23 23:34:31,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186477 to 165597. [2019-11-23 23:34:31,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165597 states. [2019-11-23 23:34:31,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165597 states to 165597 states and 204904 transitions. [2019-11-23 23:34:31,867 INFO L78 Accepts]: Start accepts. Automaton has 165597 states and 204904 transitions. Word has length 299 [2019-11-23 23:34:31,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:31,867 INFO L462 AbstractCegarLoop]: Abstraction has 165597 states and 204904 transitions. [2019-11-23 23:34:31,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:31,868 INFO L276 IsEmpty]: Start isEmpty. Operand 165597 states and 204904 transitions. [2019-11-23 23:34:31,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-11-23 23:34:31,938 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:31,938 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:34:31,938 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:31,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:31,939 INFO L82 PathProgramCache]: Analyzing trace with hash -770654404, now seen corresponding path program 1 times [2019-11-23 23:34:31,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:34,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655778207] [2019-11-23 23:34:34,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:34,457 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-23 23:34:34,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655778207] [2019-11-23 23:34:34,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:34,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:34:34,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559696650] [2019-11-23 23:34:34,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:34:34,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:34,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:34:34,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:34,461 INFO L87 Difference]: Start difference. First operand 165597 states and 204904 transitions. Second operand 4 states. [2019-11-23 23:34:37,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:37,149 INFO L93 Difference]: Finished difference Result 430580 states and 532904 transitions. [2019-11-23 23:34:37,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:34:37,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 304 [2019-11-23 23:34:37,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:37,459 INFO L225 Difference]: With dead ends: 430580 [2019-11-23 23:34:37,459 INFO L226 Difference]: Without dead ends: 264984 [2019-11-23 23:34:37,555 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:34:37,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264984 states. [2019-11-23 23:34:44,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264984 to 264982. [2019-11-23 23:34:44,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264982 states. [2019-11-23 23:34:44,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264982 states to 264982 states and 327703 transitions. [2019-11-23 23:34:44,660 INFO L78 Accepts]: Start accepts. Automaton has 264982 states and 327703 transitions. Word has length 304 [2019-11-23 23:34:44,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:44,661 INFO L462 AbstractCegarLoop]: Abstraction has 264982 states and 327703 transitions. [2019-11-23 23:34:44,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:34:44,661 INFO L276 IsEmpty]: Start isEmpty. Operand 264982 states and 327703 transitions. [2019-11-23 23:34:44,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-11-23 23:34:44,715 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:44,715 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:34:44,715 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:44,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:44,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1349130817, now seen corresponding path program 1 times [2019-11-23 23:34:44,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:44,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7076606] [2019-11-23 23:34:44,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:44,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:45,034 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:34:45,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7076606] [2019-11-23 23:34:45,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:34:45,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:34:45,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566497295] [2019-11-23 23:34:45,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:34:45,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:45,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:34:45,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:34:45,037 INFO L87 Difference]: Start difference. First operand 264982 states and 327703 transitions. Second operand 5 states. [2019-11-23 23:34:52,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:34:52,158 INFO L93 Difference]: Finished difference Result 541262 states and 668395 transitions. [2019-11-23 23:34:52,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:34:52,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 316 [2019-11-23 23:34:52,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:34:52,486 INFO L225 Difference]: With dead ends: 541262 [2019-11-23 23:34:52,486 INFO L226 Difference]: Without dead ends: 276281 [2019-11-23 23:34:52,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:34:52,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276281 states. [2019-11-23 23:34:55,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276281 to 257403. [2019-11-23 23:34:55,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257403 states. [2019-11-23 23:34:55,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257403 states to 257403 states and 312194 transitions. [2019-11-23 23:34:55,884 INFO L78 Accepts]: Start accepts. Automaton has 257403 states and 312194 transitions. Word has length 316 [2019-11-23 23:34:55,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:34:55,885 INFO L462 AbstractCegarLoop]: Abstraction has 257403 states and 312194 transitions. [2019-11-23 23:34:55,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:34:55,885 INFO L276 IsEmpty]: Start isEmpty. Operand 257403 states and 312194 transitions. [2019-11-23 23:34:55,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-11-23 23:34:55,936 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:34:55,936 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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-23 23:34:55,936 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:34:55,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:34:55,937 INFO L82 PathProgramCache]: Analyzing trace with hash 247716926, now seen corresponding path program 1 times [2019-11-23 23:34:55,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:34:55,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697933937] [2019-11-23 23:34:55,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:34:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:56,252 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 187 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:34:56,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697933937] [2019-11-23 23:34:56,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113000611] [2019-11-23 23:34:56,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:34:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:34:56,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:34:56,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:34:56,531 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-23 23:34:56,531 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:34:56,588 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-23 23:34:56,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:34:56,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-11-23 23:34:56,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786363748] [2019-11-23 23:34:56,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:34:56,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:34:56,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:34:56,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:34:56,591 INFO L87 Difference]: Start difference. First operand 257403 states and 312194 transitions. Second operand 3 states.