/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 04:00:57,317 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 04:00:57,320 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 04:00:57,331 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 04:00:57,332 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 04:00:57,333 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 04:00:57,334 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 04:00:57,336 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 04:00:57,338 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 04:00:57,339 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 04:00:57,340 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 04:00:57,341 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 04:00:57,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 04:00:57,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 04:00:57,343 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 04:00:57,344 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 04:00:57,345 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 04:00:57,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 04:00:57,348 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 04:00:57,349 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 04:00:57,351 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 04:00:57,352 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 04:00:57,353 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 04:00:57,354 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 04:00:57,356 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 04:00:57,356 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 04:00:57,356 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 04:00:57,357 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 04:00:57,358 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 04:00:57,359 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 04:00:57,359 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 04:00:57,359 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 04:00:57,360 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 04:00:57,361 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 04:00:57,362 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 04:00:57,362 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 04:00:57,363 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 04:00:57,363 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 04:00:57,363 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 04:00:57,364 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 04:00:57,365 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 04:00:57,365 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 04:00:57,379 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 04:00:57,380 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 04:00:57,381 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 04:00:57,381 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 04:00:57,381 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 04:00:57,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 04:00:57,382 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 04:00:57,382 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 04:00:57,382 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 04:00:57,382 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 04:00:57,383 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 04:00:57,383 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 04:00:57,383 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 04:00:57,383 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 04:00:57,383 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 04:00:57,384 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 04:00:57,384 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 04:00:57,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 04:00:57,384 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 04:00:57,384 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 04:00:57,385 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 04:00:57,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:00:57,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 04:00:57,385 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 04:00:57,385 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 04:00:57,386 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 04:00:57,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 04:00:57,386 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 04:00:57,386 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-11-07 04:00:57,667 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 04:00:57,680 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 04:00:57,684 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 04:00:57,685 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 04:00:57,686 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 04:00:57,686 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-11-07 04:00:57,745 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5140933a9/c8ee481a01de44c08e7113c4a8e26022/FLAGe0c44a2fc [2019-11-07 04:00:58,292 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 04:00:58,293 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-11-07 04:00:58,302 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5140933a9/c8ee481a01de44c08e7113c4a8e26022/FLAGe0c44a2fc [2019-11-07 04:00:58,694 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5140933a9/c8ee481a01de44c08e7113c4a8e26022 [2019-11-07 04:00:58,709 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 04:00:58,711 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 04:00:58,714 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 04:00:58,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 04:00:58,719 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 04:00:58,720 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:00:58" (1/1) ... [2019-11-07 04:00:58,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25b37aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:58, skipping insertion in model container [2019-11-07 04:00:58,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:00:58" (1/1) ... [2019-11-07 04:00:58,731 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 04:00:58,764 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 04:00:59,001 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:00:59,007 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 04:00:59,051 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:00:59,165 INFO L192 MainTranslator]: Completed translation [2019-11-07 04:00:59,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:59 WrapperNode [2019-11-07 04:00:59,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 04:00:59,167 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 04:00:59,167 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 04:00:59,167 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 04:00:59,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:59" (1/1) ... [2019-11-07 04:00:59,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:59" (1/1) ... [2019-11-07 04:00:59,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:59" (1/1) ... [2019-11-07 04:00:59,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:59" (1/1) ... [2019-11-07 04:00:59,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:59" (1/1) ... [2019-11-07 04:00:59,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:59" (1/1) ... [2019-11-07 04:00:59,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:59" (1/1) ... [2019-11-07 04:00:59,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 04:00:59,218 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 04:00:59,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 04:00:59,218 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 04:00:59,219 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:00:59,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 04:00:59,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 04:00:59,276 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 04:00:59,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 04:00:59,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 04:00:59,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-07 04:00:59,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 04:00:59,278 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 04:00:59,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 04:00:59,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 04:00:59,736 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 04:00:59,736 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 04:00:59,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:00:59 BoogieIcfgContainer [2019-11-07 04:00:59,739 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 04:00:59,740 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 04:00:59,740 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 04:00:59,746 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 04:00:59,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:00:58" (1/3) ... [2019-11-07 04:00:59,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d74f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:00:59, skipping insertion in model container [2019-11-07 04:00:59,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:59" (2/3) ... [2019-11-07 04:00:59,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d74f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:00:59, skipping insertion in model container [2019-11-07 04:00:59,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:00:59" (3/3) ... [2019-11-07 04:00:59,752 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2019-11-07 04:00:59,762 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 04:00:59,776 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-11-07 04:00:59,788 INFO L249 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-11-07 04:00:59,836 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 04:00:59,837 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 04:00:59,837 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 04:00:59,837 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 04:00:59,838 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 04:00:59,839 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 04:00:59,839 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 04:00:59,839 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 04:00:59,869 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2019-11-07 04:00:59,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-07 04:00:59,875 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:00:59,876 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:00:59,878 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:00:59,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:00:59,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1240490557, now seen corresponding path program 1 times [2019-11-07 04:00:59,890 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:00:59,890 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075734048] [2019-11-07 04:00:59,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:00:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:00,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:00,063 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075734048] [2019-11-07 04:01:00,064 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:00,064 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:01:00,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303836428] [2019-11-07 04:01:00,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:01:00,071 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:00,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:01:00,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:01:00,089 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 3 states. [2019-11-07 04:01:00,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:00,120 INFO L93 Difference]: Finished difference Result 92 states and 128 transitions. [2019-11-07 04:01:00,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:01:00,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-07 04:01:00,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:00,132 INFO L225 Difference]: With dead ends: 92 [2019-11-07 04:01:00,132 INFO L226 Difference]: Without dead ends: 79 [2019-11-07 04:01:00,135 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:01:00,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-07 04:01:00,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-11-07 04:01:00,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-07 04:01:00,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2019-11-07 04:01:00,179 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 18 [2019-11-07 04:01:00,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:00,180 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2019-11-07 04:01:00,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:01:00,180 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2019-11-07 04:01:00,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-07 04:01:00,181 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:00,181 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-07 04:01:00,182 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:00,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:00,183 INFO L82 PathProgramCache]: Analyzing trace with hash -199495303, now seen corresponding path program 1 times [2019-11-07 04:01:00,183 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:00,183 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323709770] [2019-11-07 04:01:00,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:00,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:00,292 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323709770] [2019-11-07 04:01:00,292 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:00,292 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:01:00,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086328055] [2019-11-07 04:01:00,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:01:00,294 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:00,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:01:00,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:01:00,295 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand 6 states. [2019-11-07 04:01:00,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:00,420 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-11-07 04:01:00,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:01:00,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-07 04:01:00,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:00,422 INFO L225 Difference]: With dead ends: 79 [2019-11-07 04:01:00,423 INFO L226 Difference]: Without dead ends: 77 [2019-11-07 04:01:00,424 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:01:00,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-07 04:01:00,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-11-07 04:01:00,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-07 04:01:00,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2019-11-07 04:01:00,434 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 19 [2019-11-07 04:01:00,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:00,434 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2019-11-07 04:01:00,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:01:00,435 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2019-11-07 04:01:00,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-07 04:01:00,435 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:00,436 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] [2019-11-07 04:01:00,436 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:00,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:00,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1558638364, now seen corresponding path program 1 times [2019-11-07 04:01:00,437 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:00,437 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135851544] [2019-11-07 04:01:00,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:00,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:00,510 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135851544] [2019-11-07 04:01:00,510 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:00,510 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:01:00,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111316598] [2019-11-07 04:01:00,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:01:00,511 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:00,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:01:00,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:01:00,512 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 4 states. [2019-11-07 04:01:00,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:00,607 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2019-11-07 04:01:00,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:00,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-11-07 04:01:00,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:00,613 INFO L225 Difference]: With dead ends: 100 [2019-11-07 04:01:00,613 INFO L226 Difference]: Without dead ends: 98 [2019-11-07 04:01:00,614 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-07 04:01:00,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-07 04:01:00,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 75. [2019-11-07 04:01:00,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-07 04:01:00,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2019-11-07 04:01:00,635 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 21 [2019-11-07 04:01:00,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:00,637 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2019-11-07 04:01:00,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:01:00,637 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2019-11-07 04:01:00,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-07 04:01:00,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:00,639 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:00,640 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:00,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:00,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1073152137, now seen corresponding path program 1 times [2019-11-07 04:01:00,642 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:00,642 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938305183] [2019-11-07 04:01:00,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:00,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:00,744 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938305183] [2019-11-07 04:01:00,744 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:00,744 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:00,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508987199] [2019-11-07 04:01:00,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:00,745 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:00,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:00,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:00,746 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 5 states. [2019-11-07 04:01:00,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:00,859 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2019-11-07 04:01:00,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:00,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-07 04:01:00,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:00,862 INFO L225 Difference]: With dead ends: 75 [2019-11-07 04:01:00,864 INFO L226 Difference]: Without dead ends: 73 [2019-11-07 04:01:00,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:01:00,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-07 04:01:00,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-11-07 04:01:00,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-07 04:01:00,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2019-11-07 04:01:00,876 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 22 [2019-11-07 04:01:00,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:00,876 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2019-11-07 04:01:00,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:00,876 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2019-11-07 04:01:00,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-07 04:01:00,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:00,878 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] [2019-11-07 04:01:00,878 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:00,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:00,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1458097995, now seen corresponding path program 1 times [2019-11-07 04:01:00,879 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:00,879 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684109665] [2019-11-07 04:01:00,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:00,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:00,946 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684109665] [2019-11-07 04:01:00,947 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:00,947 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:00,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966937605] [2019-11-07 04:01:00,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:00,948 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:00,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:00,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:00,948 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 5 states. [2019-11-07 04:01:01,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:01,128 INFO L93 Difference]: Finished difference Result 140 states and 146 transitions. [2019-11-07 04:01:01,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 04:01:01,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-07 04:01:01,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:01,131 INFO L225 Difference]: With dead ends: 140 [2019-11-07 04:01:01,131 INFO L226 Difference]: Without dead ends: 138 [2019-11-07 04:01:01,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:01:01,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-07 04:01:01,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 76. [2019-11-07 04:01:01,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-07 04:01:01,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2019-11-07 04:01:01,157 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 25 [2019-11-07 04:01:01,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:01,157 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2019-11-07 04:01:01,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:01,157 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2019-11-07 04:01:01,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-07 04:01:01,158 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:01,158 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] [2019-11-07 04:01:01,159 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:01,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:01,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1454364186, now seen corresponding path program 1 times [2019-11-07 04:01:01,160 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:01,160 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278306306] [2019-11-07 04:01:01,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:01,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:01,217 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278306306] [2019-11-07 04:01:01,217 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:01,217 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:01,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366768187] [2019-11-07 04:01:01,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:01,218 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:01,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:01,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:01,219 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 5 states. [2019-11-07 04:01:01,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:01,364 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2019-11-07 04:01:01,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 04:01:01,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-07 04:01:01,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:01,366 INFO L225 Difference]: With dead ends: 107 [2019-11-07 04:01:01,366 INFO L226 Difference]: Without dead ends: 105 [2019-11-07 04:01:01,367 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:01:01,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-07 04:01:01,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 78. [2019-11-07 04:01:01,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-07 04:01:01,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2019-11-07 04:01:01,385 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 25 [2019-11-07 04:01:01,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:01,385 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2019-11-07 04:01:01,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:01,385 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2019-11-07 04:01:01,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-07 04:01:01,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:01,387 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] [2019-11-07 04:01:01,390 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:01,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:01,391 INFO L82 PathProgramCache]: Analyzing trace with hash 2043605651, now seen corresponding path program 1 times [2019-11-07 04:01:01,391 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:01,391 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137768330] [2019-11-07 04:01:01,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:01,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:01,479 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137768330] [2019-11-07 04:01:01,479 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:01,480 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:01,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648892835] [2019-11-07 04:01:01,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:01,481 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:01,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:01,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:01,485 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 5 states. [2019-11-07 04:01:01,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:01,620 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2019-11-07 04:01:01,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:01,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-07 04:01:01,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:01,621 INFO L225 Difference]: With dead ends: 120 [2019-11-07 04:01:01,622 INFO L226 Difference]: Without dead ends: 118 [2019-11-07 04:01:01,622 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:01:01,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-07 04:01:01,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 76. [2019-11-07 04:01:01,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-07 04:01:01,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2019-11-07 04:01:01,630 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 26 [2019-11-07 04:01:01,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:01,630 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2019-11-07 04:01:01,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:01,631 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2019-11-07 04:01:01,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-07 04:01:01,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:01,632 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] [2019-11-07 04:01:01,633 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:01,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:01,634 INFO L82 PathProgramCache]: Analyzing trace with hash -2135613676, now seen corresponding path program 1 times [2019-11-07 04:01:01,634 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:01,634 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342509003] [2019-11-07 04:01:01,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:01,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:01,707 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342509003] [2019-11-07 04:01:01,707 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:01,707 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:01,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159134994] [2019-11-07 04:01:01,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:01,709 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:01,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:01,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:01,710 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 5 states. [2019-11-07 04:01:01,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:01,819 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2019-11-07 04:01:01,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:01,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-07 04:01:01,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:01,820 INFO L225 Difference]: With dead ends: 76 [2019-11-07 04:01:01,821 INFO L226 Difference]: Without dead ends: 74 [2019-11-07 04:01:01,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:01:01,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-07 04:01:01,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-07 04:01:01,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-07 04:01:01,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2019-11-07 04:01:01,831 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 26 [2019-11-07 04:01:01,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:01,832 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2019-11-07 04:01:01,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:01,832 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2019-11-07 04:01:01,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-07 04:01:01,839 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:01,839 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:01,840 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:01,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:01,840 INFO L82 PathProgramCache]: Analyzing trace with hash 669725210, now seen corresponding path program 1 times [2019-11-07 04:01:01,842 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:01,842 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407354041] [2019-11-07 04:01:01,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:01,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:01,908 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407354041] [2019-11-07 04:01:01,908 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:01,908 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:01:01,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127458025] [2019-11-07 04:01:01,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:01:01,909 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:01,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:01:01,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:01:01,910 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 3 states. [2019-11-07 04:01:01,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:01,967 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2019-11-07 04:01:01,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:01:01,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-07 04:01:01,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:01,969 INFO L225 Difference]: With dead ends: 114 [2019-11-07 04:01:01,969 INFO L226 Difference]: Without dead ends: 74 [2019-11-07 04:01:01,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:01:01,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-07 04:01:01,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-07 04:01:01,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-07 04:01:01,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2019-11-07 04:01:01,976 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 28 [2019-11-07 04:01:01,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:01,976 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2019-11-07 04:01:01,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:01:01,976 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2019-11-07 04:01:01,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-07 04:01:01,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:01,978 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-07 04:01:01,979 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:01,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:01,979 INFO L82 PathProgramCache]: Analyzing trace with hash 144873553, now seen corresponding path program 1 times [2019-11-07 04:01:01,980 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:01,980 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979629940] [2019-11-07 04:01:01,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:02,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:02,058 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979629940] [2019-11-07 04:01:02,058 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:02,058 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:02,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662628015] [2019-11-07 04:01:02,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:02,059 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:02,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:02,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:02,060 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 5 states. [2019-11-07 04:01:02,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:02,128 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2019-11-07 04:01:02,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:01:02,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-07 04:01:02,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:02,131 INFO L225 Difference]: With dead ends: 75 [2019-11-07 04:01:02,131 INFO L226 Difference]: Without dead ends: 73 [2019-11-07 04:01:02,131 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:01:02,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-07 04:01:02,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-11-07 04:01:02,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-07 04:01:02,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2019-11-07 04:01:02,137 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 29 [2019-11-07 04:01:02,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:02,137 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2019-11-07 04:01:02,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:02,138 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2019-11-07 04:01:02,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-07 04:01:02,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:02,139 INFO L410 BasicCegarLoop]: trace histogram [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-07 04:01:02,139 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:02,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:02,140 INFO L82 PathProgramCache]: Analyzing trace with hash -106234418, now seen corresponding path program 1 times [2019-11-07 04:01:02,140 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:02,140 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718573963] [2019-11-07 04:01:02,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:02,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 04:01:02,218 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718573963] [2019-11-07 04:01:02,218 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14179191] [2019-11-07 04:01:02,219 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-07 04:01:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:02,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-07 04:01:02,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:01:02,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:01:02,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 04:01:02,362 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:01:02,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 04:01:02,404 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [194296303] [2019-11-07 04:01:02,429 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2019-11-07 04:01:02,429 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 04:01:02,435 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 04:01:02,442 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 04:01:02,443 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 04:01:02,512 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 12 for LOIs [2019-11-07 04:01:02,580 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-07 04:01:02,603 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-07 04:01:03,125 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2019-11-07 04:01:03,128 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 04:01:03,366 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-11-07 04:01:04,069 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 21 [2019-11-07 04:01:04,791 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 37 [2019-11-07 04:01:04,980 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 45 [2019-11-07 04:01:05,204 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 51 [2019-11-07 04:01:05,552 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-07 04:01:05,910 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-11-07 04:01:06,183 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-11-07 04:01:06,513 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-11-07 04:01:06,517 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 04:01:06,517 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 24] total 33 [2019-11-07 04:01:06,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302157105] [2019-11-07 04:01:06,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-07 04:01:06,519 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:06,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-07 04:01:06,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=764, Unknown=0, NotChecked=0, Total=1056 [2019-11-07 04:01:06,520 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 33 states. [2019-11-07 04:01:07,855 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 57 [2019-11-07 04:01:08,325 WARN L191 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 59 [2019-11-07 04:01:08,890 WARN L191 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 66 [2019-11-07 04:01:09,254 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-11-07 04:01:09,704 WARN L191 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 65 [2019-11-07 04:01:10,264 WARN L191 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 63 [2019-11-07 04:01:10,769 WARN L191 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 67 [2019-11-07 04:01:11,373 WARN L191 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 59 [2019-11-07 04:01:11,780 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 59 [2019-11-07 04:01:12,100 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 59 [2019-11-07 04:01:12,628 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 61 [2019-11-07 04:01:12,946 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 61 [2019-11-07 04:01:13,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:13,174 INFO L93 Difference]: Finished difference Result 153 states and 159 transitions. [2019-11-07 04:01:13,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-07 04:01:13,174 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 29 [2019-11-07 04:01:13,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:13,177 INFO L225 Difference]: With dead ends: 153 [2019-11-07 04:01:13,177 INFO L226 Difference]: Without dead ends: 151 [2019-11-07 04:01:13,179 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=1186, Invalid=2596, Unknown=0, NotChecked=0, Total=3782 [2019-11-07 04:01:13,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-07 04:01:13,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 69. [2019-11-07 04:01:13,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-07 04:01:13,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2019-11-07 04:01:13,186 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 29 [2019-11-07 04:01:13,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:13,186 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2019-11-07 04:01:13,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-07 04:01:13,187 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2019-11-07 04:01:13,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-07 04:01:13,187 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:13,187 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-07 04:01:13,398 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:01:13,399 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:13,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:13,400 INFO L82 PathProgramCache]: Analyzing trace with hash 196115995, now seen corresponding path program 1 times [2019-11-07 04:01:13,401 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:13,401 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396606586] [2019-11-07 04:01:13,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:13,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:13,442 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396606586] [2019-11-07 04:01:13,442 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:13,442 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:13,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101022674] [2019-11-07 04:01:13,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:13,443 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:13,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:13,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:13,444 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 5 states. [2019-11-07 04:01:13,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:13,497 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-11-07 04:01:13,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:13,498 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-07 04:01:13,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:13,499 INFO L225 Difference]: With dead ends: 69 [2019-11-07 04:01:13,499 INFO L226 Difference]: Without dead ends: 67 [2019-11-07 04:01:13,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:01:13,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-07 04:01:13,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-11-07 04:01:13,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-07 04:01:13,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2019-11-07 04:01:13,506 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 30 [2019-11-07 04:01:13,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:13,506 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2019-11-07 04:01:13,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:13,507 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2019-11-07 04:01:13,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-07 04:01:13,507 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:13,507 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-07 04:01:13,508 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:13,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:13,508 INFO L82 PathProgramCache]: Analyzing trace with hash 998251798, now seen corresponding path program 1 times [2019-11-07 04:01:13,508 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:13,509 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911529245] [2019-11-07 04:01:13,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:13,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 04:01:13,571 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911529245] [2019-11-07 04:01:13,571 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768740318] [2019-11-07 04:01:13,571 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-07 04:01:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:13,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-07 04:01:13,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:01:13,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 04:01:13,674 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:01:13,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 04:01:13,706 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [494165526] [2019-11-07 04:01:13,708 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2019-11-07 04:01:13,708 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 04:01:13,709 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 04:01:13,709 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 04:01:13,709 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 04:01:13,723 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 10 for LOIs [2019-11-07 04:01:13,765 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-07 04:01:13,772 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-07 04:01:14,176 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2019-11-07 04:01:14,178 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 04:01:14,771 WARN L191 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-11-07 04:01:15,601 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 18 [2019-11-07 04:01:16,067 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 37 [2019-11-07 04:01:16,251 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 45 [2019-11-07 04:01:16,496 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 51 [2019-11-07 04:01:16,808 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-07 04:01:17,189 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-07 04:01:17,823 WARN L191 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2019-11-07 04:01:18,112 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-11-07 04:01:18,507 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-07 04:01:18,920 WARN L191 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-07 04:01:18,921 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-07 04:01:18,921 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 26] total 35 [2019-11-07 04:01:18,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970859464] [2019-11-07 04:01:18,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-07 04:01:18,923 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:18,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-07 04:01:18,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=864, Unknown=0, NotChecked=0, Total=1190 [2019-11-07 04:01:18,925 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 35 states. [2019-11-07 04:01:20,155 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 61 [2019-11-07 04:01:20,511 WARN L191 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 63 [2019-11-07 04:01:20,860 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 63 [2019-11-07 04:01:21,215 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 67 [2019-11-07 04:01:21,727 WARN L191 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 67 [2019-11-07 04:01:22,212 WARN L191 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 68 [2019-11-07 04:01:22,586 WARN L191 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 61 [2019-11-07 04:01:22,950 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 63 [2019-11-07 04:01:23,293 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 63 [2019-11-07 04:01:23,676 WARN L191 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 67 [2019-11-07 04:01:24,153 WARN L191 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 68 [2019-11-07 04:01:24,712 WARN L191 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 63 [2019-11-07 04:01:25,240 WARN L191 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 67 [2019-11-07 04:01:25,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:25,494 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2019-11-07 04:01:25,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-07 04:01:25,494 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 30 [2019-11-07 04:01:25,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:25,495 INFO L225 Difference]: With dead ends: 125 [2019-11-07 04:01:25,495 INFO L226 Difference]: Without dead ends: 123 [2019-11-07 04:01:25,497 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=1265, Invalid=2895, Unknown=0, NotChecked=0, Total=4160 [2019-11-07 04:01:25,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-07 04:01:25,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 61. [2019-11-07 04:01:25,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-07 04:01:25,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2019-11-07 04:01:25,502 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 30 [2019-11-07 04:01:25,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:25,502 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2019-11-07 04:01:25,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-07 04:01:25,502 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2019-11-07 04:01:25,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-07 04:01:25,503 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:25,503 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-07 04:01:25,706 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:01:25,707 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:25,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:25,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1339182842, now seen corresponding path program 1 times [2019-11-07 04:01:25,709 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:25,709 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280681720] [2019-11-07 04:01:25,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:25,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:25,755 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280681720] [2019-11-07 04:01:25,755 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:25,755 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:25,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330960028] [2019-11-07 04:01:25,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:25,756 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:25,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:25,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:25,756 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 5 states. [2019-11-07 04:01:25,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:25,821 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2019-11-07 04:01:25,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:01:25,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-07 04:01:25,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:25,822 INFO L225 Difference]: With dead ends: 62 [2019-11-07 04:01:25,822 INFO L226 Difference]: Without dead ends: 60 [2019-11-07 04:01:25,823 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:01:25,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-07 04:01:25,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-11-07 04:01:25,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-07 04:01:25,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-11-07 04:01:25,828 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 33 [2019-11-07 04:01:25,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:25,828 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-11-07 04:01:25,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:25,828 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-11-07 04:01:25,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-07 04:01:25,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:25,829 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-07 04:01:25,830 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:25,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:25,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1435001690, now seen corresponding path program 1 times [2019-11-07 04:01:25,830 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:25,830 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359778383] [2019-11-07 04:01:25,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:25,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:25,875 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359778383] [2019-11-07 04:01:25,875 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:25,875 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 04:01:25,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522404392] [2019-11-07 04:01:25,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 04:01:25,875 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:25,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 04:01:25,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:01:25,876 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 7 states. [2019-11-07 04:01:25,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:25,956 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-11-07 04:01:25,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 04:01:25,957 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-11-07 04:01:25,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:25,957 INFO L225 Difference]: With dead ends: 70 [2019-11-07 04:01:25,957 INFO L226 Difference]: Without dead ends: 68 [2019-11-07 04:01:25,958 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-07 04:01:25,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-07 04:01:25,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2019-11-07 04:01:25,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-07 04:01:25,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2019-11-07 04:01:25,962 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 34 [2019-11-07 04:01:25,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:25,962 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2019-11-07 04:01:25,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 04:01:25,963 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2019-11-07 04:01:25,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-07 04:01:25,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:25,963 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-07 04:01:25,964 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:25,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:25,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1972205027, now seen corresponding path program 1 times [2019-11-07 04:01:25,964 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:25,964 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567967716] [2019-11-07 04:01:25,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:26,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:26,011 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567967716] [2019-11-07 04:01:26,011 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:26,011 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:26,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049232957] [2019-11-07 04:01:26,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:26,012 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:26,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:26,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:26,012 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 5 states. [2019-11-07 04:01:26,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:26,125 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2019-11-07 04:01:26,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 04:01:26,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-11-07 04:01:26,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:26,126 INFO L225 Difference]: With dead ends: 90 [2019-11-07 04:01:26,126 INFO L226 Difference]: Without dead ends: 88 [2019-11-07 04:01:26,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:01:26,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-07 04:01:26,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 60. [2019-11-07 04:01:26,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-07 04:01:26,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-11-07 04:01:26,136 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 37 [2019-11-07 04:01:26,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:26,136 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-11-07 04:01:26,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:26,136 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-11-07 04:01:26,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-07 04:01:26,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:26,138 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:26,139 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:26,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:26,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1008816880, now seen corresponding path program 1 times [2019-11-07 04:01:26,140 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:26,140 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364974975] [2019-11-07 04:01:26,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:26,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:26,209 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364974975] [2019-11-07 04:01:26,209 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:26,209 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:26,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829969261] [2019-11-07 04:01:26,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:26,211 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:26,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:26,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:26,211 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 5 states. [2019-11-07 04:01:26,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:26,321 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-11-07 04:01:26,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:26,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-11-07 04:01:26,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:26,322 INFO L225 Difference]: With dead ends: 60 [2019-11-07 04:01:26,322 INFO L226 Difference]: Without dead ends: 58 [2019-11-07 04:01:26,322 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:01:26,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-07 04:01:26,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-11-07 04:01:26,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-07 04:01:26,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-11-07 04:01:26,330 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 38 [2019-11-07 04:01:26,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:26,331 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-11-07 04:01:26,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:26,331 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-11-07 04:01:26,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-07 04:01:26,332 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:26,332 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-07 04:01:26,333 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:26,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:26,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1189488013, now seen corresponding path program 1 times [2019-11-07 04:01:26,333 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:26,334 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956200039] [2019-11-07 04:01:26,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:26,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:26,391 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956200039] [2019-11-07 04:01:26,391 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:26,391 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:26,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467750701] [2019-11-07 04:01:26,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:26,392 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:26,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:26,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:26,393 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 5 states. [2019-11-07 04:01:26,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:26,424 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-11-07 04:01:26,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:26,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-11-07 04:01:26,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:26,425 INFO L225 Difference]: With dead ends: 69 [2019-11-07 04:01:26,426 INFO L226 Difference]: Without dead ends: 67 [2019-11-07 04:01:26,426 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:26,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-07 04:01:26,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2019-11-07 04:01:26,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-07 04:01:26,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-11-07 04:01:26,437 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 40 [2019-11-07 04:01:26,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:26,437 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-11-07 04:01:26,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:26,437 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-11-07 04:01:26,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-07 04:01:26,438 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:26,438 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:26,439 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:26,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:26,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1780580463, now seen corresponding path program 1 times [2019-11-07 04:01:26,440 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:26,440 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848128047] [2019-11-07 04:01:26,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:26,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:26,521 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848128047] [2019-11-07 04:01:26,521 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:26,522 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:26,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355749906] [2019-11-07 04:01:26,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:26,523 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:26,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:26,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:26,524 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2019-11-07 04:01:26,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:26,563 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-11-07 04:01:26,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:26,564 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-07 04:01:26,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:26,565 INFO L225 Difference]: With dead ends: 67 [2019-11-07 04:01:26,565 INFO L226 Difference]: Without dead ends: 65 [2019-11-07 04:01:26,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:01:26,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-07 04:01:26,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-11-07 04:01:26,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-07 04:01:26,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-11-07 04:01:26,576 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 41 [2019-11-07 04:01:26,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:26,576 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-11-07 04:01:26,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:26,577 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-11-07 04:01:26,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-07 04:01:26,578 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:26,578 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:26,578 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:26,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:26,579 INFO L82 PathProgramCache]: Analyzing trace with hash -636577287, now seen corresponding path program 1 times [2019-11-07 04:01:26,579 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:26,579 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995695562] [2019-11-07 04:01:26,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:26,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:26,630 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995695562] [2019-11-07 04:01:26,630 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:26,630 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:26,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391633054] [2019-11-07 04:01:26,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:26,631 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:26,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:26,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:26,632 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 5 states. [2019-11-07 04:01:26,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:26,754 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2019-11-07 04:01:26,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 04:01:26,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-11-07 04:01:26,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:26,755 INFO L225 Difference]: With dead ends: 89 [2019-11-07 04:01:26,756 INFO L226 Difference]: Without dead ends: 87 [2019-11-07 04:01:26,756 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:01:26,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-07 04:01:26,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 68. [2019-11-07 04:01:26,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-07 04:01:26,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2019-11-07 04:01:26,764 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 42 [2019-11-07 04:01:26,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:26,765 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2019-11-07 04:01:26,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:26,765 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2019-11-07 04:01:26,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-07 04:01:26,766 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:26,766 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:26,766 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:26,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:26,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1734863350, now seen corresponding path program 1 times [2019-11-07 04:01:26,767 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:26,767 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919730144] [2019-11-07 04:01:26,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:26,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:26,856 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919730144] [2019-11-07 04:01:26,857 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772720544] [2019-11-07 04:01:26,857 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-07 04:01:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:26,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-07 04:01:26,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:01:26,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:26,981 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:01:27,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:27,016 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [641126644] [2019-11-07 04:01:27,018 INFO L159 IcfgInterpreter]: Started Sifa with 41 locations of interest [2019-11-07 04:01:27,018 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 04:01:27,019 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 04:01:27,019 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 04:01:27,019 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 04:01:27,041 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 10 for LOIs [2019-11-07 04:01:27,110 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-07 04:01:27,152 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-07 04:01:27,366 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-07 04:01:27,420 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2019-11-07 04:01:27,422 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 04:01:28,570 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-11-07 04:01:28,765 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 37 [2019-11-07 04:01:28,998 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 45 [2019-11-07 04:01:29,233 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 51 [2019-11-07 04:01:29,619 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 54 [2019-11-07 04:01:29,937 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 56 [2019-11-07 04:01:30,271 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 62 [2019-11-07 04:01:30,651 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 68 [2019-11-07 04:01:31,170 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 73 [2019-11-07 04:01:31,583 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 77 [2019-11-07 04:01:31,984 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-07 04:01:32,299 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-11-07 04:01:32,847 WARN L191 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2019-11-07 04:01:34,411 WARN L191 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 131 DAG size of output: 129 [2019-11-07 04:01:34,966 WARN L191 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 107 [2019-11-07 04:01:35,565 WARN L191 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 112 [2019-11-07 04:01:36,216 WARN L191 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 116 [2019-11-07 04:01:37,189 WARN L191 SmtUtils]: Spent 799.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 116 [2019-11-07 04:01:38,183 WARN L191 SmtUtils]: Spent 821.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 114 [2019-11-07 04:01:38,184 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-07 04:01:38,184 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [6, 6, 6] total 43 [2019-11-07 04:01:38,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351223299] [2019-11-07 04:01:38,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-07 04:01:38,185 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:38,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-07 04:01:38,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=1227, Unknown=0, NotChecked=0, Total=1806 [2019-11-07 04:01:38,186 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 36 states. [2019-11-07 04:01:40,383 WARN L191 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 84 [2019-11-07 04:01:40,939 WARN L191 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 92