/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/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 05:49:40,957 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 05:49:40,960 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 05:49:40,979 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 05:49:40,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 05:49:40,981 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 05:49:40,983 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 05:49:40,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 05:49:40,998 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 05:49:40,999 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 05:49:41,001 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 05:49:41,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 05:49:41,003 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 05:49:41,004 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 05:49:41,004 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 05:49:41,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 05:49:41,006 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 05:49:41,007 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 05:49:41,008 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 05:49:41,010 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 05:49:41,012 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 05:49:41,013 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 05:49:41,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 05:49:41,014 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 05:49:41,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 05:49:41,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 05:49:41,017 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 05:49:41,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 05:49:41,018 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 05:49:41,019 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 05:49:41,020 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 05:49:41,020 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 05:49:41,021 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 05:49:41,022 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 05:49:41,023 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 05:49:41,023 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 05:49:41,024 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 05:49:41,024 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 05:49:41,024 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 05:49:41,025 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 05:49:41,026 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 05:49:41,026 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-24 05:49:41,041 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 05:49:41,041 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 05:49:41,042 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 05:49:41,042 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 05:49:41,043 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 05:49:41,043 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 05:49:41,043 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 05:49:41,043 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 05:49:41,043 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 05:49:41,044 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 05:49:41,044 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 05:49:41,044 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 05:49:41,044 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 05:49:41,044 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 05:49:41,045 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 05:49:41,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 05:49:41,045 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 05:49:41,046 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 05:49:41,046 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 05:49:41,046 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 05:49:41,046 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 05:49:41,046 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 05:49:41,047 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 05:49:41,047 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 05:49:41,047 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 05:49:41,047 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 05:49:41,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 05:49:41,048 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 05:49:41,048 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 05:49:41,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 05:49:41,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 05:49:41,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 05:49:41,049 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 05:49:41,049 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 05:49:41,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 05:49:41,049 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 05:49:41,049 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 05:49:41,050 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 05:49:41,324 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 05:49:41,346 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 05:49:41,350 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 05:49:41,351 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 05:49:41,352 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 05:49:41,353 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2019-11-24 05:49:41,430 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de1c8a6f6/aa90bc0b569c47cc91ac6008517ecc61/FLAGc38f580b8 [2019-11-24 05:49:41,937 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 05:49:41,938 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2019-11-24 05:49:41,949 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de1c8a6f6/aa90bc0b569c47cc91ac6008517ecc61/FLAGc38f580b8 [2019-11-24 05:49:42,251 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de1c8a6f6/aa90bc0b569c47cc91ac6008517ecc61 [2019-11-24 05:49:42,261 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 05:49:42,262 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 05:49:42,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 05:49:42,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 05:49:42,267 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 05:49:42,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:49:42" (1/1) ... [2019-11-24 05:49:42,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3214594f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:42, skipping insertion in model container [2019-11-24 05:49:42,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:49:42" (1/1) ... [2019-11-24 05:49:42,278 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 05:49:42,342 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 05:49:42,728 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:49:42,737 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 05:49:42,807 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:49:42,829 INFO L208 MainTranslator]: Completed translation [2019-11-24 05:49:42,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:42 WrapperNode [2019-11-24 05:49:42,829 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 05:49:42,830 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 05:49:42,831 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 05:49:42,831 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 05:49:42,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:42" (1/1) ... [2019-11-24 05:49:42,852 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:42" (1/1) ... [2019-11-24 05:49:42,922 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 05:49:42,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 05:49:42,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 05:49:42,926 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 05:49:42,936 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:42" (1/1) ... [2019-11-24 05:49:42,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:42" (1/1) ... [2019-11-24 05:49:42,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:42" (1/1) ... [2019-11-24 05:49:42,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:42" (1/1) ... [2019-11-24 05:49:42,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:42" (1/1) ... [2019-11-24 05:49:42,990 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:42" (1/1) ... [2019-11-24 05:49:43,001 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:42" (1/1) ... [2019-11-24 05:49:43,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 05:49:43,018 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 05:49:43,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 05:49:43,019 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 05:49:43,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:42" (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-24 05:49:43,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 05:49:43,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 05:49:44,773 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 05:49:44,773 INFO L284 CfgBuilder]: Removed 119 assume(true) statements. [2019-11-24 05:49:44,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:49:44 BoogieIcfgContainer [2019-11-24 05:49:44,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 05:49:44,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 05:49:44,776 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 05:49:44,779 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 05:49:44,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 05:49:42" (1/3) ... [2019-11-24 05:49:44,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a67fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:49:44, skipping insertion in model container [2019-11-24 05:49:44,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:42" (2/3) ... [2019-11-24 05:49:44,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a67fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:49:44, skipping insertion in model container [2019-11-24 05:49:44,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:49:44" (3/3) ... [2019-11-24 05:49:44,783 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2019-11-24 05:49:44,792 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 05:49:44,800 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2019-11-24 05:49:44,812 INFO L249 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2019-11-24 05:49:44,841 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 05:49:44,841 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 05:49:44,841 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 05:49:44,841 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 05:49:44,842 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 05:49:44,842 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 05:49:44,842 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 05:49:44,842 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 05:49:44,868 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2019-11-24 05:49:44,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-24 05:49:44,875 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:44,876 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:44,877 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:44,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:44,883 INFO L82 PathProgramCache]: Analyzing trace with hash 341399660, now seen corresponding path program 1 times [2019-11-24 05:49:44,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:44,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265477054] [2019-11-24 05:49:44,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:45,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:45,238 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-24 05:49:45,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265477054] [2019-11-24 05:49:45,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:45,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:45,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147015748] [2019-11-24 05:49:45,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:49:45,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:45,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:49:45,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:45,266 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2019-11-24 05:49:45,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:45,408 INFO L93 Difference]: Finished difference Result 472 states and 737 transitions. [2019-11-24 05:49:45,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:49:45,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-24 05:49:45,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:45,432 INFO L225 Difference]: With dead ends: 472 [2019-11-24 05:49:45,433 INFO L226 Difference]: Without dead ends: 236 [2019-11-24 05:49:45,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:45,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-11-24 05:49:45,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 212. [2019-11-24 05:49:45,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-11-24 05:49:45,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 308 transitions. [2019-11-24 05:49:45,570 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 308 transitions. Word has length 11 [2019-11-24 05:49:45,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:45,571 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 308 transitions. [2019-11-24 05:49:45,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:49:45,571 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 308 transitions. [2019-11-24 05:49:45,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 05:49:45,574 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:45,574 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:45,574 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:45,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:45,575 INFO L82 PathProgramCache]: Analyzing trace with hash -2070080243, now seen corresponding path program 1 times [2019-11-24 05:49:45,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:45,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268206023] [2019-11-24 05:49:45,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:45,713 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-24 05:49:45,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268206023] [2019-11-24 05:49:45,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:45,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:49:45,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771652838] [2019-11-24 05:49:45,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:49:45,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:45,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:49:45,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:45,717 INFO L87 Difference]: Start difference. First operand 212 states and 308 transitions. Second operand 5 states. [2019-11-24 05:49:45,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:45,813 INFO L93 Difference]: Finished difference Result 649 states and 946 transitions. [2019-11-24 05:49:45,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:49:45,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-24 05:49:45,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:45,817 INFO L225 Difference]: With dead ends: 649 [2019-11-24 05:49:45,817 INFO L226 Difference]: Without dead ends: 438 [2019-11-24 05:49:45,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:45,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-11-24 05:49:45,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 234. [2019-11-24 05:49:45,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-24 05:49:45,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 342 transitions. [2019-11-24 05:49:45,841 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 342 transitions. Word has length 15 [2019-11-24 05:49:45,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:45,841 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 342 transitions. [2019-11-24 05:49:45,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:49:45,842 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 342 transitions. [2019-11-24 05:49:45,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 05:49:45,842 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:45,843 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:45,843 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:45,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:45,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1810736648, now seen corresponding path program 1 times [2019-11-24 05:49:45,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:45,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7477007] [2019-11-24 05:49:45,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:45,923 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-24 05:49:45,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7477007] [2019-11-24 05:49:45,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:45,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:49:45,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867269113] [2019-11-24 05:49:45,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:49:45,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:45,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:49:45,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:45,929 INFO L87 Difference]: Start difference. First operand 234 states and 342 transitions. Second operand 5 states. [2019-11-24 05:49:46,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:46,056 INFO L93 Difference]: Finished difference Result 857 states and 1248 transitions. [2019-11-24 05:49:46,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 05:49:46,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-24 05:49:46,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:46,069 INFO L225 Difference]: With dead ends: 857 [2019-11-24 05:49:46,069 INFO L226 Difference]: Without dead ends: 646 [2019-11-24 05:49:46,074 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-24 05:49:46,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-11-24 05:49:46,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 235. [2019-11-24 05:49:46,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-11-24 05:49:46,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 343 transitions. [2019-11-24 05:49:46,124 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 343 transitions. Word has length 16 [2019-11-24 05:49:46,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:46,125 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 343 transitions. [2019-11-24 05:49:46,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:49:46,125 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 343 transitions. [2019-11-24 05:49:46,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 05:49:46,128 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:46,128 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:46,129 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:46,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:46,129 INFO L82 PathProgramCache]: Analyzing trace with hash 482055830, now seen corresponding path program 1 times [2019-11-24 05:49:46,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:46,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834061530] [2019-11-24 05:49:46,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:46,250 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-24 05:49:46,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834061530] [2019-11-24 05:49:46,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:46,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:49:46,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956891635] [2019-11-24 05:49:46,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:49:46,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:46,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:49:46,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:49:46,253 INFO L87 Difference]: Start difference. First operand 235 states and 343 transitions. Second operand 4 states. [2019-11-24 05:49:46,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:46,298 INFO L93 Difference]: Finished difference Result 677 states and 981 transitions. [2019-11-24 05:49:46,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 05:49:46,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-24 05:49:46,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:46,301 INFO L225 Difference]: With dead ends: 677 [2019-11-24 05:49:46,301 INFO L226 Difference]: Without dead ends: 452 [2019-11-24 05:49:46,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:49:46,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-11-24 05:49:46,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 239. [2019-11-24 05:49:46,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-11-24 05:49:46,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 347 transitions. [2019-11-24 05:49:46,314 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 347 transitions. Word has length 18 [2019-11-24 05:49:46,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:46,314 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 347 transitions. [2019-11-24 05:49:46,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:49:46,315 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 347 transitions. [2019-11-24 05:49:46,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 05:49:46,316 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:46,316 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] [2019-11-24 05:49:46,316 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:46,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:46,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1660837388, now seen corresponding path program 1 times [2019-11-24 05:49:46,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:46,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659242449] [2019-11-24 05:49:46,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:46,375 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-24 05:49:46,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659242449] [2019-11-24 05:49:46,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:46,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:46,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876677982] [2019-11-24 05:49:46,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:49:46,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:46,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:49:46,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:46,378 INFO L87 Difference]: Start difference. First operand 239 states and 347 transitions. Second operand 3 states. [2019-11-24 05:49:46,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:46,406 INFO L93 Difference]: Finished difference Result 481 states and 700 transitions. [2019-11-24 05:49:46,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:49:46,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-24 05:49:46,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:46,409 INFO L225 Difference]: With dead ends: 481 [2019-11-24 05:49:46,409 INFO L226 Difference]: Without dead ends: 268 [2019-11-24 05:49:46,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:46,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-11-24 05:49:46,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 234. [2019-11-24 05:49:46,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-24 05:49:46,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 339 transitions. [2019-11-24 05:49:46,420 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 339 transitions. Word has length 20 [2019-11-24 05:49:46,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:46,421 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 339 transitions. [2019-11-24 05:49:46,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:49:46,421 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 339 transitions. [2019-11-24 05:49:46,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 05:49:46,422 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:46,422 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] [2019-11-24 05:49:46,423 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:46,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:46,423 INFO L82 PathProgramCache]: Analyzing trace with hash -540599348, now seen corresponding path program 1 times [2019-11-24 05:49:46,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:46,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460750596] [2019-11-24 05:49:46,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:46,482 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-24 05:49:46,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460750596] [2019-11-24 05:49:46,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:46,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:46,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157146942] [2019-11-24 05:49:46,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:49:46,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:46,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:49:46,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:46,484 INFO L87 Difference]: Start difference. First operand 234 states and 339 transitions. Second operand 3 states. [2019-11-24 05:49:46,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:46,564 INFO L93 Difference]: Finished difference Result 480 states and 699 transitions. [2019-11-24 05:49:46,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:49:46,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-24 05:49:46,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:46,567 INFO L225 Difference]: With dead ends: 480 [2019-11-24 05:49:46,568 INFO L226 Difference]: Without dead ends: 272 [2019-11-24 05:49:46,569 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:46,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-24 05:49:46,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 214. [2019-11-24 05:49:46,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-11-24 05:49:46,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 307 transitions. [2019-11-24 05:49:46,611 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 307 transitions. Word has length 24 [2019-11-24 05:49:46,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:46,612 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 307 transitions. [2019-11-24 05:49:46,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:49:46,612 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 307 transitions. [2019-11-24 05:49:46,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 05:49:46,613 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:46,615 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] [2019-11-24 05:49:46,623 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:46,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:46,624 INFO L82 PathProgramCache]: Analyzing trace with hash -317062876, now seen corresponding path program 1 times [2019-11-24 05:49:46,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:46,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588625525] [2019-11-24 05:49:46,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:46,722 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-24 05:49:46,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588625525] [2019-11-24 05:49:46,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:46,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:46,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347921154] [2019-11-24 05:49:46,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:49:46,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:46,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:49:46,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:46,726 INFO L87 Difference]: Start difference. First operand 214 states and 307 transitions. Second operand 3 states. [2019-11-24 05:49:46,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:46,790 INFO L93 Difference]: Finished difference Result 448 states and 643 transitions. [2019-11-24 05:49:46,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:49:46,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-24 05:49:46,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:46,792 INFO L225 Difference]: With dead ends: 448 [2019-11-24 05:49:46,792 INFO L226 Difference]: Without dead ends: 260 [2019-11-24 05:49:46,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:46,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-24 05:49:46,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 202. [2019-11-24 05:49:46,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-11-24 05:49:46,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 289 transitions. [2019-11-24 05:49:46,803 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 289 transitions. Word has length 28 [2019-11-24 05:49:46,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:46,804 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 289 transitions. [2019-11-24 05:49:46,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:49:46,805 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 289 transitions. [2019-11-24 05:49:46,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-24 05:49:46,811 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:46,811 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] [2019-11-24 05:49:46,811 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:46,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:46,812 INFO L82 PathProgramCache]: Analyzing trace with hash -953364564, now seen corresponding path program 1 times [2019-11-24 05:49:46,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:46,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135235090] [2019-11-24 05:49:46,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:46,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:46,878 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-24 05:49:46,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135235090] [2019-11-24 05:49:46,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:46,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:46,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319684690] [2019-11-24 05:49:46,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:49:46,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:46,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:49:46,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:46,881 INFO L87 Difference]: Start difference. First operand 202 states and 289 transitions. Second operand 3 states. [2019-11-24 05:49:46,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:46,952 INFO L93 Difference]: Finished difference Result 444 states and 635 transitions. [2019-11-24 05:49:46,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:49:46,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-24 05:49:46,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:46,956 INFO L225 Difference]: With dead ends: 444 [2019-11-24 05:49:46,957 INFO L226 Difference]: Without dead ends: 268 [2019-11-24 05:49:46,958 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:46,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-11-24 05:49:46,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 182. [2019-11-24 05:49:46,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-11-24 05:49:46,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 257 transitions. [2019-11-24 05:49:46,972 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 257 transitions. Word has length 29 [2019-11-24 05:49:46,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:46,973 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 257 transitions. [2019-11-24 05:49:46,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:49:46,974 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 257 transitions. [2019-11-24 05:49:46,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-24 05:49:46,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:46,977 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] [2019-11-24 05:49:46,977 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:46,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:46,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1602550152, now seen corresponding path program 1 times [2019-11-24 05:49:46,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:46,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451707611] [2019-11-24 05:49:46,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:47,153 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-24 05:49:47,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451707611] [2019-11-24 05:49:47,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:47,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 05:49:47,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935798839] [2019-11-24 05:49:47,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 05:49:47,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:47,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 05:49:47,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 05:49:47,157 INFO L87 Difference]: Start difference. First operand 182 states and 257 transitions. Second operand 6 states. [2019-11-24 05:49:47,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:47,332 INFO L93 Difference]: Finished difference Result 624 states and 870 transitions. [2019-11-24 05:49:47,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 05:49:47,334 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-24 05:49:47,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:47,337 INFO L225 Difference]: With dead ends: 624 [2019-11-24 05:49:47,338 INFO L226 Difference]: Without dead ends: 468 [2019-11-24 05:49:47,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-24 05:49:47,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-11-24 05:49:47,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 219. [2019-11-24 05:49:47,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-11-24 05:49:47,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 311 transitions. [2019-11-24 05:49:47,353 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 311 transitions. Word has length 34 [2019-11-24 05:49:47,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:47,353 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 311 transitions. [2019-11-24 05:49:47,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 05:49:47,354 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 311 transitions. [2019-11-24 05:49:47,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-24 05:49:47,354 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:47,354 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] [2019-11-24 05:49:47,355 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:47,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:47,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1756164157, now seen corresponding path program 1 times [2019-11-24 05:49:47,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:47,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048058004] [2019-11-24 05:49:47,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:47,420 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-24 05:49:47,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048058004] [2019-11-24 05:49:47,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:47,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:47,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049902805] [2019-11-24 05:49:47,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:49:47,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:47,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:49:47,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:47,424 INFO L87 Difference]: Start difference. First operand 219 states and 311 transitions. Second operand 3 states. [2019-11-24 05:49:47,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:47,479 INFO L93 Difference]: Finished difference Result 467 states and 658 transitions. [2019-11-24 05:49:47,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:49:47,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-24 05:49:47,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:47,483 INFO L225 Difference]: With dead ends: 467 [2019-11-24 05:49:47,484 INFO L226 Difference]: Without dead ends: 294 [2019-11-24 05:49:47,484 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:47,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-11-24 05:49:47,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 203. [2019-11-24 05:49:47,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-11-24 05:49:47,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 285 transitions. [2019-11-24 05:49:47,518 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 285 transitions. Word has length 35 [2019-11-24 05:49:47,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:47,520 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 285 transitions. [2019-11-24 05:49:47,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:49:47,521 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 285 transitions. [2019-11-24 05:49:47,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-24 05:49:47,522 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:47,522 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] [2019-11-24 05:49:47,523 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:47,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:47,523 INFO L82 PathProgramCache]: Analyzing trace with hash -876583939, now seen corresponding path program 1 times [2019-11-24 05:49:47,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:47,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495386342] [2019-11-24 05:49:47,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:47,651 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-24 05:49:47,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495386342] [2019-11-24 05:49:47,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:47,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:47,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838930403] [2019-11-24 05:49:47,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:49:47,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:47,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:49:47,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:47,654 INFO L87 Difference]: Start difference. First operand 203 states and 285 transitions. Second operand 3 states. [2019-11-24 05:49:47,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:47,692 INFO L93 Difference]: Finished difference Result 369 states and 520 transitions. [2019-11-24 05:49:47,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:49:47,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-24 05:49:47,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:47,694 INFO L225 Difference]: With dead ends: 369 [2019-11-24 05:49:47,694 INFO L226 Difference]: Without dead ends: 225 [2019-11-24 05:49:47,695 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:47,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-11-24 05:49:47,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 199. [2019-11-24 05:49:47,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-11-24 05:49:47,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 278 transitions. [2019-11-24 05:49:47,706 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 278 transitions. Word has length 35 [2019-11-24 05:49:47,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:47,706 INFO L462 AbstractCegarLoop]: Abstraction has 199 states and 278 transitions. [2019-11-24 05:49:47,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:49:47,707 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 278 transitions. [2019-11-24 05:49:47,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-24 05:49:47,707 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:47,707 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] [2019-11-24 05:49:47,708 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:47,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:47,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1727893290, now seen corresponding path program 1 times [2019-11-24 05:49:47,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:47,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411954636] [2019-11-24 05:49:47,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:47,768 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-24 05:49:47,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411954636] [2019-11-24 05:49:47,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:47,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:49:47,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312523870] [2019-11-24 05:49:47,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:49:47,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:47,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:49:47,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:49:47,771 INFO L87 Difference]: Start difference. First operand 199 states and 278 transitions. Second operand 4 states. [2019-11-24 05:49:47,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:47,860 INFO L93 Difference]: Finished difference Result 630 states and 868 transitions. [2019-11-24 05:49:47,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:49:47,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-11-24 05:49:47,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:47,864 INFO L225 Difference]: With dead ends: 630 [2019-11-24 05:49:47,864 INFO L226 Difference]: Without dead ends: 480 [2019-11-24 05:49:47,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:47,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-11-24 05:49:47,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 316. [2019-11-24 05:49:47,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-11-24 05:49:47,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 432 transitions. [2019-11-24 05:49:47,886 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 432 transitions. Word has length 38 [2019-11-24 05:49:47,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:47,886 INFO L462 AbstractCegarLoop]: Abstraction has 316 states and 432 transitions. [2019-11-24 05:49:47,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:49:47,886 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 432 transitions. [2019-11-24 05:49:47,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-24 05:49:47,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:47,888 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] [2019-11-24 05:49:47,888 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:47,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:47,888 INFO L82 PathProgramCache]: Analyzing trace with hash -786443337, now seen corresponding path program 1 times [2019-11-24 05:49:47,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:47,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219477377] [2019-11-24 05:49:47,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:48,039 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-24 05:49:48,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219477377] [2019-11-24 05:49:48,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:48,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:49:48,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870448989] [2019-11-24 05:49:48,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 05:49:48,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:48,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 05:49:48,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:49:48,042 INFO L87 Difference]: Start difference. First operand 316 states and 432 transitions. Second operand 7 states. [2019-11-24 05:49:48,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:48,425 INFO L93 Difference]: Finished difference Result 1171 states and 1603 transitions. [2019-11-24 05:49:48,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 05:49:48,425 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-11-24 05:49:48,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:48,430 INFO L225 Difference]: With dead ends: 1171 [2019-11-24 05:49:48,430 INFO L226 Difference]: Without dead ends: 934 [2019-11-24 05:49:48,431 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-24 05:49:48,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2019-11-24 05:49:48,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 370. [2019-11-24 05:49:48,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-11-24 05:49:48,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 506 transitions. [2019-11-24 05:49:48,464 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 506 transitions. Word has length 38 [2019-11-24 05:49:48,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:48,464 INFO L462 AbstractCegarLoop]: Abstraction has 370 states and 506 transitions. [2019-11-24 05:49:48,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 05:49:48,464 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 506 transitions. [2019-11-24 05:49:48,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-24 05:49:48,465 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:48,466 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] [2019-11-24 05:49:48,466 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:48,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:48,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1566925489, now seen corresponding path program 1 times [2019-11-24 05:49:48,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:48,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935011298] [2019-11-24 05:49:48,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:48,604 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-24 05:49:48,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935011298] [2019-11-24 05:49:48,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:48,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 05:49:48,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645080809] [2019-11-24 05:49:48,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 05:49:48,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:48,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 05:49:48,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 05:49:48,606 INFO L87 Difference]: Start difference. First operand 370 states and 506 transitions. Second operand 6 states. [2019-11-24 05:49:48,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:48,839 INFO L93 Difference]: Finished difference Result 1151 states and 1580 transitions. [2019-11-24 05:49:48,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 05:49:48,840 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-11-24 05:49:48,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:48,845 INFO L225 Difference]: With dead ends: 1151 [2019-11-24 05:49:48,845 INFO L226 Difference]: Without dead ends: 912 [2019-11-24 05:49:48,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-24 05:49:48,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2019-11-24 05:49:48,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 374. [2019-11-24 05:49:48,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-11-24 05:49:48,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 511 transitions. [2019-11-24 05:49:48,883 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 511 transitions. Word has length 39 [2019-11-24 05:49:48,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:48,884 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 511 transitions. [2019-11-24 05:49:48,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 05:49:48,884 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 511 transitions. [2019-11-24 05:49:48,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-24 05:49:48,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:48,885 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] [2019-11-24 05:49:48,885 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:48,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:48,886 INFO L82 PathProgramCache]: Analyzing trace with hash 547379734, now seen corresponding path program 1 times [2019-11-24 05:49:48,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:48,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893862644] [2019-11-24 05:49:48,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:48,969 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-24 05:49:48,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893862644] [2019-11-24 05:49:48,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:48,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:49:48,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183368110] [2019-11-24 05:49:48,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:49:48,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:48,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:49:48,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:49:48,971 INFO L87 Difference]: Start difference. First operand 374 states and 511 transitions. Second operand 4 states. [2019-11-24 05:49:49,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:49,080 INFO L93 Difference]: Finished difference Result 599 states and 825 transitions. [2019-11-24 05:49:49,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:49:49,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-11-24 05:49:49,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:49,083 INFO L225 Difference]: With dead ends: 599 [2019-11-24 05:49:49,084 INFO L226 Difference]: Without dead ends: 597 [2019-11-24 05:49:49,086 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:49,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-11-24 05:49:49,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 376. [2019-11-24 05:49:49,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-11-24 05:49:49,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 513 transitions. [2019-11-24 05:49:49,119 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 513 transitions. Word has length 39 [2019-11-24 05:49:49,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:49,119 INFO L462 AbstractCegarLoop]: Abstraction has 376 states and 513 transitions. [2019-11-24 05:49:49,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:49:49,119 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 513 transitions. [2019-11-24 05:49:49,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-24 05:49:49,120 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:49,120 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] [2019-11-24 05:49:49,120 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:49,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:49,121 INFO L82 PathProgramCache]: Analyzing trace with hash -821558325, now seen corresponding path program 1 times [2019-11-24 05:49:49,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:49,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099816803] [2019-11-24 05:49:49,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:49,267 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-24 05:49:49,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099816803] [2019-11-24 05:49:49,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:49,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:49:49,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794063899] [2019-11-24 05:49:49,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 05:49:49,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:49,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 05:49:49,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:49:49,271 INFO L87 Difference]: Start difference. First operand 376 states and 513 transitions. Second operand 7 states. [2019-11-24 05:49:49,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:49,679 INFO L93 Difference]: Finished difference Result 1643 states and 2217 transitions. [2019-11-24 05:49:49,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 05:49:49,680 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-11-24 05:49:49,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:49,686 INFO L225 Difference]: With dead ends: 1643 [2019-11-24 05:49:49,687 INFO L226 Difference]: Without dead ends: 1379 [2019-11-24 05:49:49,688 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-24 05:49:49,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2019-11-24 05:49:49,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 457. [2019-11-24 05:49:49,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2019-11-24 05:49:49,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 616 transitions. [2019-11-24 05:49:49,733 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 616 transitions. Word has length 40 [2019-11-24 05:49:49,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:49,733 INFO L462 AbstractCegarLoop]: Abstraction has 457 states and 616 transitions. [2019-11-24 05:49:49,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 05:49:49,734 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 616 transitions. [2019-11-24 05:49:49,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-24 05:49:49,734 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:49,734 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] [2019-11-24 05:49:49,735 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:49,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:49,735 INFO L82 PathProgramCache]: Analyzing trace with hash 2050935946, now seen corresponding path program 1 times [2019-11-24 05:49:49,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:49,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78835241] [2019-11-24 05:49:49,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:49,793 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-24 05:49:49,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78835241] [2019-11-24 05:49:49,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:49,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 05:49:49,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493873735] [2019-11-24 05:49:49,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 05:49:49,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:49,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 05:49:49,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 05:49:49,795 INFO L87 Difference]: Start difference. First operand 457 states and 616 transitions. Second operand 6 states. [2019-11-24 05:49:49,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:49,962 INFO L93 Difference]: Finished difference Result 1015 states and 1409 transitions. [2019-11-24 05:49:49,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 05:49:49,962 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-11-24 05:49:49,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:49,966 INFO L225 Difference]: With dead ends: 1015 [2019-11-24 05:49:49,966 INFO L226 Difference]: Without dead ends: 720 [2019-11-24 05:49:49,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-24 05:49:49,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2019-11-24 05:49:50,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 463. [2019-11-24 05:49:50,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-11-24 05:49:50,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 622 transitions. [2019-11-24 05:49:50,009 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 622 transitions. Word has length 40 [2019-11-24 05:49:50,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:50,009 INFO L462 AbstractCegarLoop]: Abstraction has 463 states and 622 transitions. [2019-11-24 05:49:50,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 05:49:50,009 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 622 transitions. [2019-11-24 05:49:50,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-24 05:49:50,010 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:50,010 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] [2019-11-24 05:49:50,010 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:50,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:50,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1021985610, now seen corresponding path program 1 times [2019-11-24 05:49:50,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:50,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591092674] [2019-11-24 05:49:50,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:50,067 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-24 05:49:50,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591092674] [2019-11-24 05:49:50,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:50,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:49:50,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510811283] [2019-11-24 05:49:50,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:49:50,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:50,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:49:50,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:49:50,070 INFO L87 Difference]: Start difference. First operand 463 states and 622 transitions. Second operand 4 states. [2019-11-24 05:49:50,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:50,231 INFO L93 Difference]: Finished difference Result 1255 states and 1669 transitions. [2019-11-24 05:49:50,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:49:50,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-24 05:49:50,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:50,236 INFO L225 Difference]: With dead ends: 1255 [2019-11-24 05:49:50,236 INFO L226 Difference]: Without dead ends: 938 [2019-11-24 05:49:50,240 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:50,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2019-11-24 05:49:50,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 644. [2019-11-24 05:49:50,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-11-24 05:49:50,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 857 transitions. [2019-11-24 05:49:50,298 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 857 transitions. Word has length 42 [2019-11-24 05:49:50,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:50,298 INFO L462 AbstractCegarLoop]: Abstraction has 644 states and 857 transitions. [2019-11-24 05:49:50,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:49:50,298 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 857 transitions. [2019-11-24 05:49:50,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-24 05:49:50,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:50,299 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] [2019-11-24 05:49:50,299 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:50,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:50,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1785503366, now seen corresponding path program 1 times [2019-11-24 05:49:50,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:50,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917715432] [2019-11-24 05:49:50,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:50,339 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-24 05:49:50,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917715432] [2019-11-24 05:49:50,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:50,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:50,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830229653] [2019-11-24 05:49:50,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:49:50,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:50,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:49:50,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:49:50,342 INFO L87 Difference]: Start difference. First operand 644 states and 857 transitions. Second operand 4 states. [2019-11-24 05:49:50,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:50,444 INFO L93 Difference]: Finished difference Result 1429 states and 1888 transitions. [2019-11-24 05:49:50,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:49:50,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-24 05:49:50,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:50,449 INFO L225 Difference]: With dead ends: 1429 [2019-11-24 05:49:50,449 INFO L226 Difference]: Without dead ends: 818 [2019-11-24 05:49:50,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:50,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-11-24 05:49:50,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 565. [2019-11-24 05:49:50,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-11-24 05:49:50,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 744 transitions. [2019-11-24 05:49:50,500 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 744 transitions. Word has length 42 [2019-11-24 05:49:50,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:50,500 INFO L462 AbstractCegarLoop]: Abstraction has 565 states and 744 transitions. [2019-11-24 05:49:50,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:49:50,500 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 744 transitions. [2019-11-24 05:49:50,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-24 05:49:50,501 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:50,501 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] [2019-11-24 05:49:50,501 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:50,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:50,502 INFO L82 PathProgramCache]: Analyzing trace with hash -506171982, now seen corresponding path program 1 times [2019-11-24 05:49:50,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:50,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334463491] [2019-11-24 05:49:50,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:50,534 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-24 05:49:50,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334463491] [2019-11-24 05:49:50,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:50,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:50,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085461229] [2019-11-24 05:49:50,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:49:50,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:50,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:49:50,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:49:50,536 INFO L87 Difference]: Start difference. First operand 565 states and 744 transitions. Second operand 4 states. [2019-11-24 05:49:50,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:50,630 INFO L93 Difference]: Finished difference Result 1301 states and 1711 transitions. [2019-11-24 05:49:50,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:49:50,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-24 05:49:50,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:50,634 INFO L225 Difference]: With dead ends: 1301 [2019-11-24 05:49:50,635 INFO L226 Difference]: Without dead ends: 774 [2019-11-24 05:49:50,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:50,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2019-11-24 05:49:50,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 523. [2019-11-24 05:49:50,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-11-24 05:49:50,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 684 transitions. [2019-11-24 05:49:50,698 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 684 transitions. Word has length 45 [2019-11-24 05:49:50,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:50,698 INFO L462 AbstractCegarLoop]: Abstraction has 523 states and 684 transitions. [2019-11-24 05:49:50,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:49:50,698 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 684 transitions. [2019-11-24 05:49:50,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-24 05:49:50,700 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:50,701 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 05:49:50,701 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:50,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:50,702 INFO L82 PathProgramCache]: Analyzing trace with hash -2075563970, now seen corresponding path program 1 times [2019-11-24 05:49:50,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:50,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482790772] [2019-11-24 05:49:50,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:50,983 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:50,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482790772] [2019-11-24 05:49:50,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220235256] [2019-11-24 05:49:50,984 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-24 05:49:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:51,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-24 05:49:51,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:49:51,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:51,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:51,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:51,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:51,264 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-24 05:49:51,264 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:49:51,281 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-24 05:49:51,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 05:49:51,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [9] total 13 [2019-11-24 05:49:51,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573335850] [2019-11-24 05:49:51,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 05:49:51,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:51,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 05:49:51,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-11-24 05:49:51,283 INFO L87 Difference]: Start difference. First operand 523 states and 684 transitions. Second operand 6 states. [2019-11-24 05:49:51,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:51,525 INFO L93 Difference]: Finished difference Result 1535 states and 2073 transitions. [2019-11-24 05:49:51,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 05:49:51,526 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-24 05:49:51,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:51,532 INFO L225 Difference]: With dead ends: 1535 [2019-11-24 05:49:51,532 INFO L226 Difference]: Without dead ends: 1103 [2019-11-24 05:49:51,533 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-11-24 05:49:51,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2019-11-24 05:49:51,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 523. [2019-11-24 05:49:51,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-11-24 05:49:51,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 681 transitions. [2019-11-24 05:49:51,599 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 681 transitions. Word has length 68 [2019-11-24 05:49:51,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:51,599 INFO L462 AbstractCegarLoop]: Abstraction has 523 states and 681 transitions. [2019-11-24 05:49:51,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 05:49:51,600 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 681 transitions. [2019-11-24 05:49:51,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-24 05:49:51,603 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:51,603 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 05:49:51,807 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:49:51,808 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:51,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:51,809 INFO L82 PathProgramCache]: Analyzing trace with hash -705405959, now seen corresponding path program 1 times [2019-11-24 05:49:51,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:51,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563743965] [2019-11-24 05:49:51,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:52,000 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:52,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563743965] [2019-11-24 05:49:52,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287397170] [2019-11-24 05:49:52,001 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-24 05:49:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:52,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-24 05:49:52,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:49:52,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:52,275 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-24 05:49:52,276 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:49:52,291 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-24 05:49:52,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 05:49:52,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [9] total 13 [2019-11-24 05:49:52,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124403673] [2019-11-24 05:49:52,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 05:49:52,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:52,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 05:49:52,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-11-24 05:49:52,300 INFO L87 Difference]: Start difference. First operand 523 states and 681 transitions. Second operand 6 states. [2019-11-24 05:49:52,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:52,598 INFO L93 Difference]: Finished difference Result 1372 states and 1834 transitions. [2019-11-24 05:49:52,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 05:49:52,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-11-24 05:49:52,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:52,603 INFO L225 Difference]: With dead ends: 1372 [2019-11-24 05:49:52,603 INFO L226 Difference]: Without dead ends: 940 [2019-11-24 05:49:52,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-11-24 05:49:52,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2019-11-24 05:49:52,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 523. [2019-11-24 05:49:52,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-11-24 05:49:52,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 678 transitions. [2019-11-24 05:49:52,662 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 678 transitions. Word has length 72 [2019-11-24 05:49:52,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:52,662 INFO L462 AbstractCegarLoop]: Abstraction has 523 states and 678 transitions. [2019-11-24 05:49:52,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 05:49:52,662 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 678 transitions. [2019-11-24 05:49:52,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-24 05:49:52,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:52,667 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 05:49:52,872 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:49:52,872 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:52,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:52,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1014537821, now seen corresponding path program 1 times [2019-11-24 05:49:52,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:52,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137400563] [2019-11-24 05:49:52,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:53,047 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:53,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137400563] [2019-11-24 05:49:53,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430577253] [2019-11-24 05:49:53,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:49:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:53,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-24 05:49:53,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:49:53,309 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-24 05:49:53,309 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:49:53,373 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-24 05:49:53,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 05:49:53,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [9] total 15 [2019-11-24 05:49:53,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247311266] [2019-11-24 05:49:53,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 05:49:53,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:53,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 05:49:53,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-11-24 05:49:53,375 INFO L87 Difference]: Start difference. First operand 523 states and 678 transitions. Second operand 7 states. [2019-11-24 05:49:53,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:53,855 INFO L93 Difference]: Finished difference Result 1654 states and 2210 transitions. [2019-11-24 05:49:53,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-24 05:49:53,855 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-11-24 05:49:53,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:53,863 INFO L225 Difference]: With dead ends: 1654 [2019-11-24 05:49:53,863 INFO L226 Difference]: Without dead ends: 1222 [2019-11-24 05:49:53,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2019-11-24 05:49:53,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2019-11-24 05:49:53,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 523. [2019-11-24 05:49:53,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-11-24 05:49:53,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 670 transitions. [2019-11-24 05:49:53,941 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 670 transitions. Word has length 75 [2019-11-24 05:49:53,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:53,941 INFO L462 AbstractCegarLoop]: Abstraction has 523 states and 670 transitions. [2019-11-24 05:49:53,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 05:49:53,941 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 670 transitions. [2019-11-24 05:49:53,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-24 05:49:53,943 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:53,943 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 05:49:54,155 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:49:54,155 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:54,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:54,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1931143010, now seen corresponding path program 1 times [2019-11-24 05:49:54,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:54,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818554448] [2019-11-24 05:49:54,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:54,244 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:54,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818554448] [2019-11-24 05:49:54,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821016728] [2019-11-24 05:49:54,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:49:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:54,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-24 05:49:54,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:49:54,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:54,439 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 05:49:54,440 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:49:54,455 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 05:49:54,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 05:49:54,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5] total 9 [2019-11-24 05:49:54,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663252057] [2019-11-24 05:49:54,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 05:49:54,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:54,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 05:49:54,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-24 05:49:54,459 INFO L87 Difference]: Start difference. First operand 523 states and 670 transitions. Second operand 6 states. [2019-11-24 05:49:54,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:54,767 INFO L93 Difference]: Finished difference Result 1263 states and 1680 transitions. [2019-11-24 05:49:54,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 05:49:54,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-11-24 05:49:54,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:54,771 INFO L225 Difference]: With dead ends: 1263 [2019-11-24 05:49:54,772 INFO L226 Difference]: Without dead ends: 845 [2019-11-24 05:49:54,773 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-11-24 05:49:54,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2019-11-24 05:49:54,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 523. [2019-11-24 05:49:54,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-11-24 05:49:54,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 669 transitions. [2019-11-24 05:49:54,829 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 669 transitions. Word has length 75 [2019-11-24 05:49:54,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:54,829 INFO L462 AbstractCegarLoop]: Abstraction has 523 states and 669 transitions. [2019-11-24 05:49:54,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 05:49:54,830 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 669 transitions. [2019-11-24 05:49:54,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-24 05:49:54,831 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:54,832 INFO L410 BasicCegarLoop]: trace histogram [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-24 05:49:55,044 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:49:55,044 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:49:55,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:55,044 INFO L82 PathProgramCache]: Analyzing trace with hash 244518493, now seen corresponding path program 1 times [2019-11-24 05:49:55,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:55,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831762434] [2019-11-24 05:49:55,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:55,131 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:55,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831762434] [2019-11-24 05:49:55,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563204484] [2019-11-24 05:49:55,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:49:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:55,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-24 05:49:55,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:49:55,435 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:55,435 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:49:55,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:55,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:55,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:55,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 05:49:55,766 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:55,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [684530662] [2019-11-24 05:49:55,792 INFO L159 IcfgInterpreter]: Started Sifa with 60 locations of interest [2019-11-24 05:49:55,792 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 05:49:55,799 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 05:49:55,806 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 05:49:55,806 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 05:49:56,318 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 251 [2019-11-24 05:49:58,377 WARN L192 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 403 DAG size of output: 345 [2019-11-24 05:49:59,310 WARN L192 SmtUtils]: Spent 921.00 ms on a formula simplification. DAG size of input: 403 DAG size of output: 345 [2019-11-24 05:49:59,868 WARN L192 SmtUtils]: Spent 554.00 ms on a formula simplification that was a NOOP. DAG size: 340 [2019-11-24 05:50:00,530 WARN L192 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 379 DAG size of output: 375 [2019-11-24 05:50:01,137 WARN L192 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 379 DAG size of output: 375 [2019-11-24 05:50:01,829 WARN L192 SmtUtils]: Spent 689.00 ms on a formula simplification that was a NOOP. DAG size: 375 [2019-11-24 05:50:02,671 WARN L192 SmtUtils]: Spent 748.00 ms on a formula simplification that was a NOOP. DAG size: 423 [2019-11-24 05:50:03,259 WARN L192 SmtUtils]: Spent 585.00 ms on a formula simplification that was a NOOP. DAG size: 423 [2019-11-24 05:50:03,850 WARN L192 SmtUtils]: Spent 589.00 ms on a formula simplification that was a NOOP. DAG size: 423 [2019-11-24 05:50:04,694 WARN L192 SmtUtils]: Spent 761.00 ms on a formula simplification that was a NOOP. DAG size: 480 [2019-11-24 05:50:05,404 WARN L192 SmtUtils]: Spent 708.00 ms on a formula simplification that was a NOOP. DAG size: 480 [2019-11-24 05:50:06,151 WARN L192 SmtUtils]: Spent 745.00 ms on a formula simplification that was a NOOP. DAG size: 480 [2019-11-24 05:50:39,141 WARN L192 SmtUtils]: Spent 29.06 s on a formula simplification. DAG size of input: 1802 DAG size of output: 883 [2019-11-24 05:51:08,029 WARN L192 SmtUtils]: Spent 28.87 s on a formula simplification. DAG size of input: 1802 DAG size of output: 883