/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_1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 05:49:33,138 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 05:49:33,141 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 05:49:33,160 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 05:49:33,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 05:49:33,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 05:49:33,164 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 05:49:33,173 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 05:49:33,177 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 05:49:33,181 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 05:49:33,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 05:49:33,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 05:49:33,185 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 05:49:33,186 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 05:49:33,188 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 05:49:33,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 05:49:33,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 05:49:33,192 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 05:49:33,193 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 05:49:33,198 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 05:49:33,203 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 05:49:33,208 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 05:49:33,209 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 05:49:33,210 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 05:49:33,211 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 05:49:33,212 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 05:49:33,212 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 05:49:33,213 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 05:49:33,213 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 05:49:33,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 05:49:33,214 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 05:49:33,215 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 05:49:33,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 05:49:33,216 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 05:49:33,217 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 05:49:33,217 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 05:49:33,218 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 05:49:33,218 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 05:49:33,218 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 05:49:33,219 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 05:49:33,220 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 05:49:33,221 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:33,249 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 05:49:33,249 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 05:49:33,251 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 05:49:33,251 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 05:49:33,251 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 05:49:33,251 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 05:49:33,252 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 05:49:33,252 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 05:49:33,252 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 05:49:33,252 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 05:49:33,252 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 05:49:33,253 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 05:49:33,254 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 05:49:33,254 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 05:49:33,255 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 05:49:33,255 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 05:49:33,255 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 05:49:33,256 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 05:49:33,256 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 05:49:33,256 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 05:49:33,256 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 05:49:33,257 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 05:49:33,257 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 05:49:33,258 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 05:49:33,258 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 05:49:33,258 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 05:49:33,259 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 05:49:33,259 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 05:49:33,260 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 05:49:33,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 05:49:33,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 05:49:33,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 05:49:33,261 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 05:49:33,261 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 05:49:33,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 05:49:33,262 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 05:49:33,262 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 05:49:33,262 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 05:49:33,532 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 05:49:33,545 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 05:49:33,548 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 05:49:33,550 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 05:49:33,550 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 05:49:33,551 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_1.ufo.UNBOUNDED.pals.c [2019-11-24 05:49:33,621 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9fc10c65/35c952885908453cb8db63a0d3e9359b/FLAG3cfde57b3 [2019-11-24 05:49:34,096 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 05:49:34,099 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2019-11-24 05:49:34,111 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9fc10c65/35c952885908453cb8db63a0d3e9359b/FLAG3cfde57b3 [2019-11-24 05:49:34,465 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9fc10c65/35c952885908453cb8db63a0d3e9359b [2019-11-24 05:49:34,476 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 05:49:34,478 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 05:49:34,479 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 05:49:34,479 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 05:49:34,483 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 05:49:34,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:49:34" (1/1) ... [2019-11-24 05:49:34,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78d22946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:34, skipping insertion in model container [2019-11-24 05:49:34,487 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:49:34" (1/1) ... [2019-11-24 05:49:34,495 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 05:49:34,556 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 05:49:34,924 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:49:34,935 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 05:49:35,019 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:49:35,052 INFO L208 MainTranslator]: Completed translation [2019-11-24 05:49:35,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:35 WrapperNode [2019-11-24 05:49:35,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 05:49:35,053 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 05:49:35,053 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 05:49:35,053 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 05:49:35,061 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:35" (1/1) ... [2019-11-24 05:49:35,091 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:35" (1/1) ... [2019-11-24 05:49:35,192 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 05:49:35,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 05:49:35,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 05:49:35,193 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 05:49:35,210 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:35" (1/1) ... [2019-11-24 05:49:35,211 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:35" (1/1) ... [2019-11-24 05:49:35,231 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:35" (1/1) ... [2019-11-24 05:49:35,232 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:35" (1/1) ... [2019-11-24 05:49:35,263 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:35" (1/1) ... [2019-11-24 05:49:35,282 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:35" (1/1) ... [2019-11-24 05:49:35,291 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:35" (1/1) ... [2019-11-24 05:49:35,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 05:49:35,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 05:49:35,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 05:49:35,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 05:49:35,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:35" (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:35,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 05:49:35,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 05:49:37,267 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 05:49:37,267 INFO L284 CfgBuilder]: Removed 119 assume(true) statements. [2019-11-24 05:49:37,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:49:37 BoogieIcfgContainer [2019-11-24 05:49:37,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 05:49:37,270 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 05:49:37,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 05:49:37,273 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 05:49:37,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 05:49:34" (1/3) ... [2019-11-24 05:49:37,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d827ae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:49:37, skipping insertion in model container [2019-11-24 05:49:37,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:49:35" (2/3) ... [2019-11-24 05:49:37,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d827ae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:49:37, skipping insertion in model container [2019-11-24 05:49:37,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:49:37" (3/3) ... [2019-11-24 05:49:37,277 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2019-11-24 05:49:37,287 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 05:49:37,299 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2019-11-24 05:49:37,310 INFO L249 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2019-11-24 05:49:37,353 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 05:49:37,354 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 05:49:37,354 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 05:49:37,354 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 05:49:37,354 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 05:49:37,354 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 05:49:37,354 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 05:49:37,355 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 05:49:37,377 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states. [2019-11-24 05:49:37,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-24 05:49:37,383 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:37,385 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:37,386 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:37,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:37,392 INFO L82 PathProgramCache]: Analyzing trace with hash -404213796, now seen corresponding path program 1 times [2019-11-24 05:49:37,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:37,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789018066] [2019-11-24 05:49:37,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:37,729 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:37,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789018066] [2019-11-24 05:49:37,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:37,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:37,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115482320] [2019-11-24 05:49:37,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:49:37,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:37,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:49:37,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:37,783 INFO L87 Difference]: Start difference. First operand 231 states. Second operand 3 states. [2019-11-24 05:49:37,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:37,905 INFO L93 Difference]: Finished difference Result 460 states and 717 transitions. [2019-11-24 05:49:37,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:49:37,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-24 05:49:37,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:37,926 INFO L225 Difference]: With dead ends: 460 [2019-11-24 05:49:37,927 INFO L226 Difference]: Without dead ends: 230 [2019-11-24 05:49:37,931 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:37,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-24 05:49:37,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 206. [2019-11-24 05:49:37,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-24 05:49:37,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 298 transitions. [2019-11-24 05:49:37,991 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 298 transitions. Word has length 11 [2019-11-24 05:49:37,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:37,991 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 298 transitions. [2019-11-24 05:49:37,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:49:37,992 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 298 transitions. [2019-11-24 05:49:37,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 05:49:37,993 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:37,993 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:37,993 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:37,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:37,994 INFO L82 PathProgramCache]: Analyzing trace with hash -163693681, now seen corresponding path program 1 times [2019-11-24 05:49:37,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:37,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011766563] [2019-11-24 05:49:37,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:38,096 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:38,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011766563] [2019-11-24 05:49:38,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:38,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:49:38,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208974685] [2019-11-24 05:49:38,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:49:38,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:38,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:49:38,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:49:38,100 INFO L87 Difference]: Start difference. First operand 206 states and 298 transitions. Second operand 4 states. [2019-11-24 05:49:38,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:38,169 INFO L93 Difference]: Finished difference Result 611 states and 881 transitions. [2019-11-24 05:49:38,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 05:49:38,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-24 05:49:38,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:38,177 INFO L225 Difference]: With dead ends: 611 [2019-11-24 05:49:38,177 INFO L226 Difference]: Without dead ends: 403 [2019-11-24 05:49:38,183 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:38,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2019-11-24 05:49:38,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 208. [2019-11-24 05:49:38,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-11-24 05:49:38,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 300 transitions. [2019-11-24 05:49:38,222 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 300 transitions. Word has length 13 [2019-11-24 05:49:38,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:38,223 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 300 transitions. [2019-11-24 05:49:38,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:49:38,225 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 300 transitions. [2019-11-24 05:49:38,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 05:49:38,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:38,225 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:38,226 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:38,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:38,226 INFO L82 PathProgramCache]: Analyzing trace with hash 271745383, now seen corresponding path program 1 times [2019-11-24 05:49:38,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:38,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768607971] [2019-11-24 05:49:38,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:38,341 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:38,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768607971] [2019-11-24 05:49:38,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:38,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:38,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286868334] [2019-11-24 05:49:38,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:49:38,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:38,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:49:38,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:38,344 INFO L87 Difference]: Start difference. First operand 208 states and 300 transitions. Second operand 3 states. [2019-11-24 05:49:38,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:38,370 INFO L93 Difference]: Finished difference Result 438 states and 633 transitions. [2019-11-24 05:49:38,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:49:38,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-24 05:49:38,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:38,373 INFO L225 Difference]: With dead ends: 438 [2019-11-24 05:49:38,373 INFO L226 Difference]: Without dead ends: 231 [2019-11-24 05:49:38,374 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:38,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-11-24 05:49:38,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 203. [2019-11-24 05:49:38,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-11-24 05:49:38,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 292 transitions. [2019-11-24 05:49:38,385 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 292 transitions. Word has length 15 [2019-11-24 05:49:38,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:38,385 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 292 transitions. [2019-11-24 05:49:38,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:49:38,385 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 292 transitions. [2019-11-24 05:49:38,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 05:49:38,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:38,386 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:49:38,387 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:38,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:38,387 INFO L82 PathProgramCache]: Analyzing trace with hash -2017499457, now seen corresponding path program 1 times [2019-11-24 05:49:38,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:38,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206060046] [2019-11-24 05:49:38,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:38,583 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:38,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206060046] [2019-11-24 05:49:38,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:38,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 05:49:38,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478235277] [2019-11-24 05:49:38,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:49:38,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:38,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:49:38,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:38,587 INFO L87 Difference]: Start difference. First operand 203 states and 292 transitions. Second operand 5 states. [2019-11-24 05:49:38,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:38,771 INFO L93 Difference]: Finished difference Result 540 states and 787 transitions. [2019-11-24 05:49:38,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 05:49:38,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-24 05:49:38,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:38,774 INFO L225 Difference]: With dead ends: 540 [2019-11-24 05:49:38,774 INFO L226 Difference]: Without dead ends: 338 [2019-11-24 05:49:38,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:49:38,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-24 05:49:38,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 173. [2019-11-24 05:49:38,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-11-24 05:49:38,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 246 transitions. [2019-11-24 05:49:38,798 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 246 transitions. Word has length 19 [2019-11-24 05:49:38,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:38,799 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 246 transitions. [2019-11-24 05:49:38,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:49:38,799 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 246 transitions. [2019-11-24 05:49:38,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 05:49:38,802 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:38,802 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:38,802 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:38,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:38,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1053665165, now seen corresponding path program 1 times [2019-11-24 05:49:38,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:38,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978865901] [2019-11-24 05:49:38,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:38,956 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:38,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978865901] [2019-11-24 05:49:38,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:38,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 05:49:38,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242239730] [2019-11-24 05:49:38,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:49:38,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:38,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:49:38,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:38,958 INFO L87 Difference]: Start difference. First operand 173 states and 246 transitions. Second operand 5 states. [2019-11-24 05:49:39,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:39,161 INFO L93 Difference]: Finished difference Result 572 states and 817 transitions. [2019-11-24 05:49:39,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 05:49:39,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-24 05:49:39,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:39,164 INFO L225 Difference]: With dead ends: 572 [2019-11-24 05:49:39,165 INFO L226 Difference]: Without dead ends: 400 [2019-11-24 05:49:39,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:49:39,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-11-24 05:49:39,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 143. [2019-11-24 05:49:39,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-24 05:49:39,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 200 transitions. [2019-11-24 05:49:39,176 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 200 transitions. Word has length 24 [2019-11-24 05:49:39,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:39,176 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 200 transitions. [2019-11-24 05:49:39,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:49:39,176 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 200 transitions. [2019-11-24 05:49:39,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-24 05:49:39,178 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:39,178 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:39,178 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:39,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:39,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1309423147, now seen corresponding path program 1 times [2019-11-24 05:49:39,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:39,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376076896] [2019-11-24 05:49:39,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:39,336 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:39,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376076896] [2019-11-24 05:49:39,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:39,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 05:49:39,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189015431] [2019-11-24 05:49:39,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 05:49:39,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:39,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 05:49:39,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 05:49:39,340 INFO L87 Difference]: Start difference. First operand 143 states and 200 transitions. Second operand 6 states. [2019-11-24 05:49:39,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:39,600 INFO L93 Difference]: Finished difference Result 622 states and 871 transitions. [2019-11-24 05:49:39,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 05:49:39,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-11-24 05:49:39,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:39,604 INFO L225 Difference]: With dead ends: 622 [2019-11-24 05:49:39,604 INFO L226 Difference]: Without dead ends: 480 [2019-11-24 05:49:39,606 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:39,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-11-24 05:49:39,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 197. [2019-11-24 05:49:39,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-11-24 05:49:39,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 279 transitions. [2019-11-24 05:49:39,621 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 279 transitions. Word has length 29 [2019-11-24 05:49:39,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:39,621 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 279 transitions. [2019-11-24 05:49:39,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 05:49:39,621 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 279 transitions. [2019-11-24 05:49:39,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-24 05:49:39,628 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:39,628 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] [2019-11-24 05:49:39,629 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:39,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:39,634 INFO L82 PathProgramCache]: Analyzing trace with hash -799724898, now seen corresponding path program 1 times [2019-11-24 05:49:39,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:39,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199956293] [2019-11-24 05:49:39,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:39,710 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:39,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199956293] [2019-11-24 05:49:39,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:39,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:39,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264340508] [2019-11-24 05:49:39,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:49:39,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:39,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:49:39,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:39,712 INFO L87 Difference]: Start difference. First operand 197 states and 279 transitions. Second operand 3 states. [2019-11-24 05:49:39,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:39,757 INFO L93 Difference]: Finished difference Result 361 states and 512 transitions. [2019-11-24 05:49:39,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:49:39,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-24 05:49:39,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:39,759 INFO L225 Difference]: With dead ends: 361 [2019-11-24 05:49:39,759 INFO L226 Difference]: Without dead ends: 219 [2019-11-24 05:49:39,760 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:39,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-11-24 05:49:39,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 193. [2019-11-24 05:49:39,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-11-24 05:49:39,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 272 transitions. [2019-11-24 05:49:39,772 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 272 transitions. Word has length 30 [2019-11-24 05:49:39,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:39,772 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 272 transitions. [2019-11-24 05:49:39,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:49:39,773 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 272 transitions. [2019-11-24 05:49:39,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-24 05:49:39,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:39,775 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] [2019-11-24 05:49:39,775 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:39,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:39,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1237783543, now seen corresponding path program 1 times [2019-11-24 05:49:39,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:39,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869486512] [2019-11-24 05:49:39,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:39,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:39,943 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:39,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869486512] [2019-11-24 05:49:39,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:39,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:49:39,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633936060] [2019-11-24 05:49:39,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 05:49:39,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:39,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 05:49:39,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:49:39,946 INFO L87 Difference]: Start difference. First operand 193 states and 272 transitions. Second operand 7 states. [2019-11-24 05:49:40,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:40,353 INFO L93 Difference]: Finished difference Result 869 states and 1203 transitions. [2019-11-24 05:49:40,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 05:49:40,354 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-11-24 05:49:40,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:40,358 INFO L225 Difference]: With dead ends: 869 [2019-11-24 05:49:40,358 INFO L226 Difference]: Without dead ends: 712 [2019-11-24 05:49:40,359 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:40,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2019-11-24 05:49:40,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 235. [2019-11-24 05:49:40,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-11-24 05:49:40,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 330 transitions. [2019-11-24 05:49:40,381 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 330 transitions. Word has length 33 [2019-11-24 05:49:40,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:40,381 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 330 transitions. [2019-11-24 05:49:40,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 05:49:40,382 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 330 transitions. [2019-11-24 05:49:40,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-24 05:49:40,383 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:40,383 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] [2019-11-24 05:49:40,383 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:40,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:40,384 INFO L82 PathProgramCache]: Analyzing trace with hash 850669721, now seen corresponding path program 1 times [2019-11-24 05:49:40,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:40,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531597634] [2019-11-24 05:49:40,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:40,432 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:40,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531597634] [2019-11-24 05:49:40,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:40,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:49:40,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729911481] [2019-11-24 05:49:40,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:49:40,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:40,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:49:40,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:49:40,435 INFO L87 Difference]: Start difference. First operand 235 states and 330 transitions. Second operand 4 states. [2019-11-24 05:49:40,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:40,528 INFO L93 Difference]: Finished difference Result 681 states and 945 transitions. [2019-11-24 05:49:40,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:49:40,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-24 05:49:40,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:40,532 INFO L225 Difference]: With dead ends: 681 [2019-11-24 05:49:40,532 INFO L226 Difference]: Without dead ends: 512 [2019-11-24 05:49:40,532 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:40,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-11-24 05:49:40,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 346. [2019-11-24 05:49:40,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-11-24 05:49:40,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 478 transitions. [2019-11-24 05:49:40,558 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 478 transitions. Word has length 33 [2019-11-24 05:49:40,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:40,558 INFO L462 AbstractCegarLoop]: Abstraction has 346 states and 478 transitions. [2019-11-24 05:49:40,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:49:40,559 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 478 transitions. [2019-11-24 05:49:40,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-24 05:49:40,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:40,560 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:40,560 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:40,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:40,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1161394234, now seen corresponding path program 1 times [2019-11-24 05:49:40,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:40,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118242466] [2019-11-24 05:49:40,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:40,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:40,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118242466] [2019-11-24 05:49:40,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:40,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:40,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778215667] [2019-11-24 05:49:40,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:49:40,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:40,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:49:40,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:40,606 INFO L87 Difference]: Start difference. First operand 346 states and 478 transitions. Second operand 3 states. [2019-11-24 05:49:40,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:40,669 INFO L93 Difference]: Finished difference Result 692 states and 955 transitions. [2019-11-24 05:49:40,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:49:40,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-24 05:49:40,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:40,672 INFO L225 Difference]: With dead ends: 692 [2019-11-24 05:49:40,672 INFO L226 Difference]: Without dead ends: 422 [2019-11-24 05:49:40,673 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:40,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-11-24 05:49:40,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 340. [2019-11-24 05:49:40,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-11-24 05:49:40,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 464 transitions. [2019-11-24 05:49:40,697 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 464 transitions. Word has length 34 [2019-11-24 05:49:40,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:40,698 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 464 transitions. [2019-11-24 05:49:40,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:49:40,698 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 464 transitions. [2019-11-24 05:49:40,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-24 05:49:40,699 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:40,699 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:40,699 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:40,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:40,700 INFO L82 PathProgramCache]: Analyzing trace with hash 741574768, now seen corresponding path program 1 times [2019-11-24 05:49:40,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:40,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709719849] [2019-11-24 05:49:40,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:40,819 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:40,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709719849] [2019-11-24 05:49:40,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:40,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 05:49:40,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303783205] [2019-11-24 05:49:40,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 05:49:40,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:40,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 05:49:40,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 05:49:40,821 INFO L87 Difference]: Start difference. First operand 340 states and 464 transitions. Second operand 6 states. [2019-11-24 05:49:41,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:41,121 INFO L93 Difference]: Finished difference Result 1066 states and 1447 transitions. [2019-11-24 05:49:41,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 05:49:41,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-24 05:49:41,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:41,128 INFO L225 Difference]: With dead ends: 1066 [2019-11-24 05:49:41,128 INFO L226 Difference]: Without dead ends: 841 [2019-11-24 05:49:41,129 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:41,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2019-11-24 05:49:41,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 344. [2019-11-24 05:49:41,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-11-24 05:49:41,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 469 transitions. [2019-11-24 05:49:41,159 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 469 transitions. Word has length 34 [2019-11-24 05:49:41,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:41,159 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 469 transitions. [2019-11-24 05:49:41,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 05:49:41,160 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 469 transitions. [2019-11-24 05:49:41,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-24 05:49:41,160 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:41,160 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:41,162 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:41,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:41,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1439087305, now seen corresponding path program 1 times [2019-11-24 05:49:41,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:41,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112316924] [2019-11-24 05:49:41,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:41,261 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:41,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112316924] [2019-11-24 05:49:41,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:41,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 05:49:41,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650830417] [2019-11-24 05:49:41,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:49:41,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:41,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:49:41,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:49:41,264 INFO L87 Difference]: Start difference. First operand 344 states and 469 transitions. Second operand 5 states. [2019-11-24 05:49:41,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:41,519 INFO L93 Difference]: Finished difference Result 657 states and 910 transitions. [2019-11-24 05:49:41,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 05:49:41,520 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-11-24 05:49:41,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:41,524 INFO L225 Difference]: With dead ends: 657 [2019-11-24 05:49:41,525 INFO L226 Difference]: Without dead ends: 655 [2019-11-24 05:49:41,525 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 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:41,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-11-24 05:49:41,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 346. [2019-11-24 05:49:41,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-11-24 05:49:41,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 471 transitions. [2019-11-24 05:49:41,570 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 471 transitions. Word has length 34 [2019-11-24 05:49:41,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:41,570 INFO L462 AbstractCegarLoop]: Abstraction has 346 states and 471 transitions. [2019-11-24 05:49:41,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:49:41,571 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 471 transitions. [2019-11-24 05:49:41,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-24 05:49:41,572 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:41,572 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:41,572 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:41,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:41,573 INFO L82 PathProgramCache]: Analyzing trace with hash 599999869, now seen corresponding path program 1 times [2019-11-24 05:49:41,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:41,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678969589] [2019-11-24 05:49:41,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:41,656 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:41,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678969589] [2019-11-24 05:49:41,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:41,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 05:49:41,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357204324] [2019-11-24 05:49:41,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 05:49:41,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:41,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 05:49:41,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-24 05:49:41,658 INFO L87 Difference]: Start difference. First operand 346 states and 471 transitions. Second operand 6 states. [2019-11-24 05:49:41,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:41,830 INFO L93 Difference]: Finished difference Result 728 states and 1004 transitions. [2019-11-24 05:49:41,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 05:49:41,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-11-24 05:49:41,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:41,834 INFO L225 Difference]: With dead ends: 728 [2019-11-24 05:49:41,834 INFO L226 Difference]: Without dead ends: 501 [2019-11-24 05:49:41,835 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:41,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-11-24 05:49:41,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 352. [2019-11-24 05:49:41,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-11-24 05:49:41,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 477 transitions. [2019-11-24 05:49:41,871 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 477 transitions. Word has length 35 [2019-11-24 05:49:41,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:41,873 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 477 transitions. [2019-11-24 05:49:41,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 05:49:41,873 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 477 transitions. [2019-11-24 05:49:41,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-24 05:49:41,875 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:41,875 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:41,875 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:41,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:41,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1018634930, now seen corresponding path program 1 times [2019-11-24 05:49:41,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:41,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531255526] [2019-11-24 05:49:41,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:42,016 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:42,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531255526] [2019-11-24 05:49:42,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:42,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:49:42,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518432] [2019-11-24 05:49:42,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 05:49:42,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:42,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 05:49:42,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:49:42,018 INFO L87 Difference]: Start difference. First operand 352 states and 477 transitions. Second operand 7 states. [2019-11-24 05:49:42,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:42,492 INFO L93 Difference]: Finished difference Result 1589 states and 2108 transitions. [2019-11-24 05:49:42,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 05:49:42,493 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-11-24 05:49:42,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:42,500 INFO L225 Difference]: With dead ends: 1589 [2019-11-24 05:49:42,500 INFO L226 Difference]: Without dead ends: 1333 [2019-11-24 05:49:42,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-24 05:49:42,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2019-11-24 05:49:42,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 434. [2019-11-24 05:49:42,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-11-24 05:49:42,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 579 transitions. [2019-11-24 05:49:42,551 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 579 transitions. Word has length 35 [2019-11-24 05:49:42,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:42,551 INFO L462 AbstractCegarLoop]: Abstraction has 434 states and 579 transitions. [2019-11-24 05:49:42,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 05:49:42,552 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 579 transitions. [2019-11-24 05:49:42,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 05:49:42,552 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:42,552 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] [2019-11-24 05:49:42,553 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:42,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:42,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1799967409, now seen corresponding path program 1 times [2019-11-24 05:49:42,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:42,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649604933] [2019-11-24 05:49:42,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:42,599 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:42,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649604933] [2019-11-24 05:49:42,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:42,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:42,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788672002] [2019-11-24 05:49:42,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:49:42,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:42,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:49:42,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:49:42,601 INFO L87 Difference]: Start difference. First operand 434 states and 579 transitions. Second operand 3 states. [2019-11-24 05:49:42,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:42,727 INFO L93 Difference]: Finished difference Result 909 states and 1205 transitions. [2019-11-24 05:49:42,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:49:42,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-24 05:49:42,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:42,731 INFO L225 Difference]: With dead ends: 909 [2019-11-24 05:49:42,731 INFO L226 Difference]: Without dead ends: 605 [2019-11-24 05:49:42,732 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:42,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-11-24 05:49:42,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 409. [2019-11-24 05:49:42,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-11-24 05:49:42,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 540 transitions. [2019-11-24 05:49:42,773 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 540 transitions. Word has length 36 [2019-11-24 05:49:42,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:42,773 INFO L462 AbstractCegarLoop]: Abstraction has 409 states and 540 transitions. [2019-11-24 05:49:42,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:49:42,773 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 540 transitions. [2019-11-24 05:49:42,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-24 05:49:42,774 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:42,774 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] [2019-11-24 05:49:42,774 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:42,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:42,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1758383398, now seen corresponding path program 1 times [2019-11-24 05:49:42,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:42,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252883399] [2019-11-24 05:49:42,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:42,822 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:42,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252883399] [2019-11-24 05:49:42,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:42,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:49:42,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266008984] [2019-11-24 05:49:42,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:49:42,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:42,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:49:42,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:49:42,824 INFO L87 Difference]: Start difference. First operand 409 states and 540 transitions. Second operand 4 states. [2019-11-24 05:49:42,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:42,956 INFO L93 Difference]: Finished difference Result 1135 states and 1483 transitions. [2019-11-24 05:49:42,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:49:42,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-24 05:49:42,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:42,962 INFO L225 Difference]: With dead ends: 1135 [2019-11-24 05:49:42,962 INFO L226 Difference]: Without dead ends: 848 [2019-11-24 05:49:42,963 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:42,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2019-11-24 05:49:43,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 560. [2019-11-24 05:49:43,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-11-24 05:49:43,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 729 transitions. [2019-11-24 05:49:43,019 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 729 transitions. Word has length 37 [2019-11-24 05:49:43,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:43,019 INFO L462 AbstractCegarLoop]: Abstraction has 560 states and 729 transitions. [2019-11-24 05:49:43,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:49:43,019 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 729 transitions. [2019-11-24 05:49:43,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-24 05:49:43,020 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:43,020 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] [2019-11-24 05:49:43,021 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:43,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:43,021 INFO L82 PathProgramCache]: Analyzing trace with hash -341222932, now seen corresponding path program 1 times [2019-11-24 05:49:43,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:43,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848538830] [2019-11-24 05:49:43,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:43,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:43,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848538830] [2019-11-24 05:49:43,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:43,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:43,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537799895] [2019-11-24 05:49:43,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:49:43,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:43,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:49:43,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:49:43,050 INFO L87 Difference]: Start difference. First operand 560 states and 729 transitions. Second operand 4 states. [2019-11-24 05:49:43,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:43,157 INFO L93 Difference]: Finished difference Result 1261 states and 1626 transitions. [2019-11-24 05:49:43,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:49:43,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-24 05:49:43,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:43,161 INFO L225 Difference]: With dead ends: 1261 [2019-11-24 05:49:43,161 INFO L226 Difference]: Without dead ends: 728 [2019-11-24 05:49:43,162 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:43,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-11-24 05:49:43,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 493. [2019-11-24 05:49:43,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-11-24 05:49:43,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 632 transitions. [2019-11-24 05:49:43,212 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 632 transitions. Word has length 37 [2019-11-24 05:49:43,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:43,212 INFO L462 AbstractCegarLoop]: Abstraction has 493 states and 632 transitions. [2019-11-24 05:49:43,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:49:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 632 transitions. [2019-11-24 05:49:43,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-24 05:49:43,213 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:43,213 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:43,214 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:43,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:43,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1580115624, now seen corresponding path program 1 times [2019-11-24 05:49:43,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:43,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795734464] [2019-11-24 05:49:43,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:43,283 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:43,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795734464] [2019-11-24 05:49:43,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:49:43,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:49:43,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724529110] [2019-11-24 05:49:43,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:49:43,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:43,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:49:43,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:49:43,285 INFO L87 Difference]: Start difference. First operand 493 states and 632 transitions. Second operand 4 states. [2019-11-24 05:49:43,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:43,419 INFO L93 Difference]: Finished difference Result 1151 states and 1473 transitions. [2019-11-24 05:49:43,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:49:43,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-11-24 05:49:43,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:43,422 INFO L225 Difference]: With dead ends: 1151 [2019-11-24 05:49:43,423 INFO L226 Difference]: Without dead ends: 690 [2019-11-24 05:49:43,425 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:43,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-11-24 05:49:43,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 457. [2019-11-24 05:49:43,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2019-11-24 05:49:43,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 580 transitions. [2019-11-24 05:49:43,476 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 580 transitions. Word has length 40 [2019-11-24 05:49:43,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:43,476 INFO L462 AbstractCegarLoop]: Abstraction has 457 states and 580 transitions. [2019-11-24 05:49:43,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:49:43,476 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 580 transitions. [2019-11-24 05:49:43,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-24 05:49:43,478 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:43,478 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] [2019-11-24 05:49:43,478 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:43,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:43,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1977763537, now seen corresponding path program 1 times [2019-11-24 05:49:43,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:43,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984910124] [2019-11-24 05:49:43,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:43,646 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:43,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984910124] [2019-11-24 05:49:43,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960291541] [2019-11-24 05:49:43,647 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:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:43,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-24 05:49:43,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:49:43,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:43,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:43,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:43,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:43,928 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-24 05:49:43,928 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:49:43,939 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-24 05:49:43,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 05:49:43,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 11 [2019-11-24 05:49:43,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610494634] [2019-11-24 05:49:43,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 05:49:43,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:43,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 05:49:43,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-24 05:49:43,942 INFO L87 Difference]: Start difference. First operand 457 states and 580 transitions. Second operand 6 states. [2019-11-24 05:49:44,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:44,187 INFO L93 Difference]: Finished difference Result 1277 states and 1649 transitions. [2019-11-24 05:49:44,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 05:49:44,188 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-11-24 05:49:44,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:44,192 INFO L225 Difference]: With dead ends: 1277 [2019-11-24 05:49:44,192 INFO L226 Difference]: Without dead ends: 893 [2019-11-24 05:49:44,194 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-11-24 05:49:44,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-11-24 05:49:44,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 457. [2019-11-24 05:49:44,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2019-11-24 05:49:44,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 577 transitions. [2019-11-24 05:49:44,280 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 577 transitions. Word has length 61 [2019-11-24 05:49:44,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:44,280 INFO L462 AbstractCegarLoop]: Abstraction has 457 states and 577 transitions. [2019-11-24 05:49:44,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 05:49:44,281 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 577 transitions. [2019-11-24 05:49:44,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-24 05:49:44,282 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:44,282 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 05:49:44,490 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:49:44,490 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:44,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:44,490 INFO L82 PathProgramCache]: Analyzing trace with hash 460303146, now seen corresponding path program 1 times [2019-11-24 05:49:44,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:44,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824703407] [2019-11-24 05:49:44,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:44,640 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:44,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824703407] [2019-11-24 05:49:44,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505350030] [2019-11-24 05:49:44,641 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:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:44,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-24 05:49:44,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:49:44,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:44,914 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-24 05:49:44,916 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:49:44,934 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-24 05:49:44,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 05:49:44,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 11 [2019-11-24 05:49:44,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037394696] [2019-11-24 05:49:44,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 05:49:44,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:44,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 05:49:44,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-24 05:49:44,938 INFO L87 Difference]: Start difference. First operand 457 states and 577 transitions. Second operand 6 states. [2019-11-24 05:49:45,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:45,290 INFO L93 Difference]: Finished difference Result 1162 states and 1490 transitions. [2019-11-24 05:49:45,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 05:49:45,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-11-24 05:49:45,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:45,294 INFO L225 Difference]: With dead ends: 1162 [2019-11-24 05:49:45,294 INFO L226 Difference]: Without dead ends: 778 [2019-11-24 05:49:45,295 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-11-24 05:49:45,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-11-24 05:49:45,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 457. [2019-11-24 05:49:45,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2019-11-24 05:49:45,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 574 transitions. [2019-11-24 05:49:45,360 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 574 transitions. Word has length 65 [2019-11-24 05:49:45,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:45,360 INFO L462 AbstractCegarLoop]: Abstraction has 457 states and 574 transitions. [2019-11-24 05:49:45,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 05:49:45,360 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 574 transitions. [2019-11-24 05:49:45,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-24 05:49:45,362 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:45,362 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 05:49:45,566 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:49:45,567 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:45,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:45,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1242823294, now seen corresponding path program 1 times [2019-11-24 05:49:45,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:45,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168423550] [2019-11-24 05:49:45,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:45,785 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:45,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168423550] [2019-11-24 05:49:45,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805663584] [2019-11-24 05:49:45,787 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:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:45,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-24 05:49:45,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:49:45,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:46,019 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:46,019 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:49:46,034 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:46,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 05:49:46,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 11 [2019-11-24 05:49:46,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475875198] [2019-11-24 05:49:46,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 05:49:46,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:49:46,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 05:49:46,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-24 05:49:46,036 INFO L87 Difference]: Start difference. First operand 457 states and 574 transitions. Second operand 6 states. [2019-11-24 05:49:46,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:49:46,323 INFO L93 Difference]: Finished difference Result 1053 states and 1350 transitions. [2019-11-24 05:49:46,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 05:49:46,324 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-24 05:49:46,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:49:46,327 INFO L225 Difference]: With dead ends: 1053 [2019-11-24 05:49:46,327 INFO L226 Difference]: Without dead ends: 683 [2019-11-24 05:49:46,328 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-11-24 05:49:46,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-11-24 05:49:46,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 457. [2019-11-24 05:49:46,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2019-11-24 05:49:46,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 573 transitions. [2019-11-24 05:49:46,399 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 573 transitions. Word has length 68 [2019-11-24 05:49:46,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:49:46,400 INFO L462 AbstractCegarLoop]: Abstraction has 457 states and 573 transitions. [2019-11-24 05:49:46,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 05:49:46,400 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 573 transitions. [2019-11-24 05:49:46,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-24 05:49:46,405 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:49:46,406 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 05:49:46,611 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 05:49:46,612 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:46,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:49:46,612 INFO L82 PathProgramCache]: Analyzing trace with hash 134957885, now seen corresponding path program 1 times [2019-11-24 05:49:46,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:49:46,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382815667] [2019-11-24 05:49:46,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:49:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:46,748 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:46,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382815667] [2019-11-24 05:49:46,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451431642] [2019-11-24 05:49:46,749 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:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:49:46,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-24 05:49:46,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:49:47,051 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:47,052 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:49:47,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:49:47,221 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-11-24 05:49:47,374 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:49:47,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2082468279] [2019-11-24 05:49:47,431 INFO L159 IcfgInterpreter]: Started Sifa with 53 locations of interest [2019-11-24 05:49:47,434 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 05:49:47,443 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 05:49:47,460 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 05:49:47,461 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 05:49:51,337 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:49:51,350 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:49:51,439 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:49:51,449 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:49:51,952 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:49:51,961 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:49:52,035 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:49:52,050 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 05:49:53,413 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-11-24 05:49:53,562 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 12288 conjuctions. This might take some time... [2019-11-24 05:50:23,073 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-11-24 05:50:23,230 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 16384 conjuctions. This might take some time...