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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:04:14,284 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:04:14,285 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:04:14,297 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:04:14,297 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:04:14,298 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:04:14,299 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:04:14,301 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:04:14,303 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:04:14,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:04:14,304 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:04:14,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:04:14,306 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:04:14,307 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:04:14,308 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:04:14,309 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:04:14,310 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:04:14,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:04:14,312 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:04:14,313 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:04:14,315 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:04:14,316 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:04:14,317 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:04:14,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:04:14,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:04:14,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:04:14,320 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:04:14,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:04:14,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:04:14,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:04:14,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:04:14,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:04:14,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:04:14,324 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:04:14,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:04:14,325 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:04:14,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:04:14,326 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:04:14,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:04:14,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:04:14,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:04:14,329 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:04:14,342 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:04:14,343 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:04:14,343 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:04:14,343 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:04:14,344 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:04:14,344 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:04:14,344 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:04:14,345 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:04:14,345 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:04:14,345 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:04:14,346 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:04:14,346 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:04:14,346 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:04:14,346 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:04:14,346 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:04:14,347 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:04:14,347 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:04:14,347 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:04:14,347 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:04:14,347 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:04:14,348 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:04:14,348 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:04:14,348 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:04:14,348 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:04:14,348 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:04:14,349 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:04:14,349 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:04:14,349 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:04:14,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:04:14,349 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:04:14,376 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:04:14,388 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:04:14,391 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:04:14,392 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:04:14,393 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:04:14,393 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2019-09-10 02:04:14,451 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c88bc6d7b/d02d18edb301497f90cf53e7e67c880e/FLAGe46beee92 [2019-09-10 02:04:14,893 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:04:14,894 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2019-09-10 02:04:14,904 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c88bc6d7b/d02d18edb301497f90cf53e7e67c880e/FLAGe46beee92 [2019-09-10 02:04:15,274 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c88bc6d7b/d02d18edb301497f90cf53e7e67c880e [2019-09-10 02:04:15,287 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:04:15,289 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:04:15,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:04:15,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:04:15,298 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:04:15,299 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:04:15" (1/1) ... [2019-09-10 02:04:15,302 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@822f784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:15, skipping insertion in model container [2019-09-10 02:04:15,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:04:15" (1/1) ... [2019-09-10 02:04:15,310 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:04:15,355 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:04:15,611 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:04:15,616 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:04:15,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:04:15,771 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:04:15,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:15 WrapperNode [2019-09-10 02:04:15,772 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:04:15,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:04:15,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:04:15,773 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:04:15,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:15" (1/1) ... [2019-09-10 02:04:15,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:15" (1/1) ... [2019-09-10 02:04:15,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:15" (1/1) ... [2019-09-10 02:04:15,795 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:15" (1/1) ... [2019-09-10 02:04:15,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:15" (1/1) ... [2019-09-10 02:04:15,820 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:15" (1/1) ... [2019-09-10 02:04:15,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:15" (1/1) ... [2019-09-10 02:04:15,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:04:15,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:04:15,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:04:15,826 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:04:15,827 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:15" (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-09-10 02:04:15,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:04:15,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:04:15,883 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:04:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:04:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 02:04:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 02:04:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:04:15,884 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:04:15,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:04:15,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:04:16,351 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:04:16,351 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 02:04:16,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:04:16 BoogieIcfgContainer [2019-09-10 02:04:16,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:04:16,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:04:16,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:04:16,357 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:04:16,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:04:15" (1/3) ... [2019-09-10 02:04:16,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137b5316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:04:16, skipping insertion in model container [2019-09-10 02:04:16,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:15" (2/3) ... [2019-09-10 02:04:16,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137b5316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:04:16, skipping insertion in model container [2019-09-10 02:04:16,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:04:16" (3/3) ... [2019-09-10 02:04:16,360 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2019-09-10 02:04:16,370 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:04:16,379 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-10 02:04:16,394 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-10 02:04:16,417 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:04:16,417 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:04:16,417 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:04:16,417 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:04:16,418 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:04:16,418 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:04:16,418 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:04:16,418 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:04:16,435 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-09-10 02:04:16,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 02:04:16,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:16,444 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:16,446 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:16,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:16,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1118366569, now seen corresponding path program 1 times [2019-09-10 02:04:16,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:16,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:16,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:16,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:16,502 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:16,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:16,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:16,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:04:16,617 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:16,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:04:16,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:04:16,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:04:16,634 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2019-09-10 02:04:16,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:16,668 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2019-09-10 02:04:16,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:04:16,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-10 02:04:16,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:16,679 INFO L225 Difference]: With dead ends: 82 [2019-09-10 02:04:16,679 INFO L226 Difference]: Without dead ends: 76 [2019-09-10 02:04:16,681 INFO L628 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-09-10 02:04:16,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-10 02:04:16,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2019-09-10 02:04:16,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-10 02:04:16,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-09-10 02:04:16,720 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2019-09-10 02:04:16,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:16,721 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-09-10 02:04:16,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:04:16,721 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-09-10 02:04:16,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-10 02:04:16,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:16,722 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:16,723 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:16,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:16,723 INFO L82 PathProgramCache]: Analyzing trace with hash -306453431, now seen corresponding path program 1 times [2019-09-10 02:04:16,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:16,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:16,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:16,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:16,726 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:16,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:16,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:16,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:04:16,779 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:16,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:04:16,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:04:16,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:04:16,782 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 4 states. [2019-09-10 02:04:16,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:16,890 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2019-09-10 02:04:16,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:04:16,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-09-10 02:04:16,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:16,893 INFO L225 Difference]: With dead ends: 101 [2019-09-10 02:04:16,893 INFO L226 Difference]: Without dead ends: 101 [2019-09-10 02:04:16,894 INFO L628 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-09-10 02:04:16,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-10 02:04:16,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 58. [2019-09-10 02:04:16,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-10 02:04:16,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-09-10 02:04:16,904 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 14 [2019-09-10 02:04:16,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:16,904 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-09-10 02:04:16,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:04:16,905 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-09-10 02:04:16,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-10 02:04:16,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:16,906 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:16,907 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:16,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:16,907 INFO L82 PathProgramCache]: Analyzing trace with hash -309622200, now seen corresponding path program 1 times [2019-09-10 02:04:16,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:16,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:16,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:16,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:16,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:16,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:16,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:16,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:04:16,967 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:16,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:04:16,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:04:16,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:04:16,970 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 4 states. [2019-09-10 02:04:17,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:17,067 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2019-09-10 02:04:17,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:04:17,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-09-10 02:04:17,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:17,070 INFO L225 Difference]: With dead ends: 73 [2019-09-10 02:04:17,071 INFO L226 Difference]: Without dead ends: 73 [2019-09-10 02:04:17,071 INFO L628 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-09-10 02:04:17,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-10 02:04:17,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2019-09-10 02:04:17,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-10 02:04:17,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-09-10 02:04:17,082 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2019-09-10 02:04:17,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:17,083 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-09-10 02:04:17,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:04:17,083 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-09-10 02:04:17,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-10 02:04:17,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:17,088 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:17,089 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:17,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:17,090 INFO L82 PathProgramCache]: Analyzing trace with hash -910118681, now seen corresponding path program 1 times [2019-09-10 02:04:17,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:17,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:17,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:17,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:17,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:17,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:17,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:17,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:04:17,161 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:17,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:04:17,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:04:17,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:04:17,163 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 4 states. [2019-09-10 02:04:17,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:17,247 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2019-09-10 02:04:17,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:04:17,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-09-10 02:04:17,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:17,249 INFO L225 Difference]: With dead ends: 94 [2019-09-10 02:04:17,250 INFO L226 Difference]: Without dead ends: 94 [2019-09-10 02:04:17,251 INFO L628 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-09-10 02:04:17,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-10 02:04:17,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2019-09-10 02:04:17,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-10 02:04:17,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-09-10 02:04:17,261 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2019-09-10 02:04:17,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:17,262 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-09-10 02:04:17,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:04:17,262 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-09-10 02:04:17,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-10 02:04:17,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:17,264 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:17,264 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:17,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:17,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1851095055, now seen corresponding path program 1 times [2019-09-10 02:04:17,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:17,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:17,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:17,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:17,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:17,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:17,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:17,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:17,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:17,353 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:17,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:17,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:17,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:17,354 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 5 states. [2019-09-10 02:04:17,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:17,474 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2019-09-10 02:04:17,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:04:17,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-10 02:04:17,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:17,476 INFO L225 Difference]: With dead ends: 93 [2019-09-10 02:04:17,476 INFO L226 Difference]: Without dead ends: 93 [2019-09-10 02:04:17,477 INFO L628 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-09-10 02:04:17,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-10 02:04:17,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2019-09-10 02:04:17,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-10 02:04:17,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-09-10 02:04:17,482 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2019-09-10 02:04:17,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:17,482 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-09-10 02:04:17,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:17,483 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-09-10 02:04:17,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-10 02:04:17,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:17,483 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:17,484 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:17,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:17,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1194066488, now seen corresponding path program 1 times [2019-09-10 02:04:17,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:17,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:17,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:17,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:17,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:17,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:17,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:17,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:04:17,540 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:17,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:04:17,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:04:17,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:04:17,541 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 4 states. [2019-09-10 02:04:17,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:17,603 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2019-09-10 02:04:17,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:04:17,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-10 02:04:17,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:17,605 INFO L225 Difference]: With dead ends: 67 [2019-09-10 02:04:17,605 INFO L226 Difference]: Without dead ends: 67 [2019-09-10 02:04:17,606 INFO L628 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-09-10 02:04:17,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-10 02:04:17,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2019-09-10 02:04:17,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-10 02:04:17,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-09-10 02:04:17,615 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2019-09-10 02:04:17,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:17,615 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-09-10 02:04:17,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:04:17,615 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-09-10 02:04:17,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 02:04:17,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:17,616 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:17,617 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:17,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:17,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1549374957, now seen corresponding path program 1 times [2019-09-10 02:04:17,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:17,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:17,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:17,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:17,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:17,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:17,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:04:17,658 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:17,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:04:17,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:04:17,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:04:17,660 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 4 states. [2019-09-10 02:04:17,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:17,732 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2019-09-10 02:04:17,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:04:17,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-09-10 02:04:17,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:17,734 INFO L225 Difference]: With dead ends: 89 [2019-09-10 02:04:17,734 INFO L226 Difference]: Without dead ends: 89 [2019-09-10 02:04:17,735 INFO L628 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-09-10 02:04:17,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-10 02:04:17,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 48. [2019-09-10 02:04:17,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-10 02:04:17,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-09-10 02:04:17,740 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2019-09-10 02:04:17,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:17,740 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-09-10 02:04:17,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:04:17,740 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-09-10 02:04:17,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 02:04:17,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:17,741 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:17,742 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:17,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:17,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1638647651, now seen corresponding path program 1 times [2019-09-10 02:04:17,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:17,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:17,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:17,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:17,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:17,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:17,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:17,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:17,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:17,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:17,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:17,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:17,796 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 5 states. [2019-09-10 02:04:17,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:17,910 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2019-09-10 02:04:17,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:04:17,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-10 02:04:17,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:17,911 INFO L225 Difference]: With dead ends: 71 [2019-09-10 02:04:17,911 INFO L226 Difference]: Without dead ends: 71 [2019-09-10 02:04:17,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-09-10 02:04:17,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-10 02:04:17,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2019-09-10 02:04:17,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-10 02:04:17,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-09-10 02:04:17,916 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2019-09-10 02:04:17,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:17,916 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-09-10 02:04:17,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:17,916 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-09-10 02:04:17,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 02:04:17,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:17,917 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:17,918 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:17,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:17,918 INFO L82 PathProgramCache]: Analyzing trace with hash -741527250, now seen corresponding path program 1 times [2019-09-10 02:04:17,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:17,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:17,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:17,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:17,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:17,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:17,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:17,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:17,992 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:17,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:17,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:17,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:17,993 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 5 states. [2019-09-10 02:04:18,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:18,065 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2019-09-10 02:04:18,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:04:18,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-10 02:04:18,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:18,066 INFO L225 Difference]: With dead ends: 59 [2019-09-10 02:04:18,067 INFO L226 Difference]: Without dead ends: 59 [2019-09-10 02:04:18,067 INFO L628 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-09-10 02:04:18,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-10 02:04:18,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2019-09-10 02:04:18,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-10 02:04:18,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-09-10 02:04:18,072 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2019-09-10 02:04:18,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:18,075 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-09-10 02:04:18,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:18,075 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-09-10 02:04:18,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-10 02:04:18,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:18,076 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:18,076 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:18,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:18,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1512505143, now seen corresponding path program 1 times [2019-09-10 02:04:18,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:18,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:18,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:18,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:18,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:18,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:18,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:18,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:04:18,129 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:18,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:04:18,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:04:18,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:04:18,130 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 4 states. [2019-09-10 02:04:18,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:18,178 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2019-09-10 02:04:18,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:04:18,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-09-10 02:04:18,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:18,180 INFO L225 Difference]: With dead ends: 59 [2019-09-10 02:04:18,180 INFO L226 Difference]: Without dead ends: 59 [2019-09-10 02:04:18,180 INFO L628 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-09-10 02:04:18,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-10 02:04:18,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2019-09-10 02:04:18,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-10 02:04:18,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-09-10 02:04:18,189 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2019-09-10 02:04:18,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:18,190 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-09-10 02:04:18,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:04:18,190 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-09-10 02:04:18,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-10 02:04:18,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:18,191 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:18,191 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:18,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:18,192 INFO L82 PathProgramCache]: Analyzing trace with hash 356983956, now seen corresponding path program 1 times [2019-09-10 02:04:18,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:18,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:18,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:18,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:18,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:18,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:18,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:18,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:04:18,254 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:18,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:04:18,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:04:18,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:04:18,255 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 4 states. [2019-09-10 02:04:18,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:18,323 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2019-09-10 02:04:18,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:04:18,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-10 02:04:18,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:18,324 INFO L225 Difference]: With dead ends: 67 [2019-09-10 02:04:18,325 INFO L226 Difference]: Without dead ends: 67 [2019-09-10 02:04:18,325 INFO L628 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-09-10 02:04:18,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-10 02:04:18,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2019-09-10 02:04:18,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-10 02:04:18,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-09-10 02:04:18,331 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2019-09-10 02:04:18,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:18,331 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-09-10 02:04:18,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:04:18,332 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-09-10 02:04:18,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-10 02:04:18,333 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:18,333 INFO L399 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-09-10 02:04:18,334 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:18,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:18,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1818396113, now seen corresponding path program 1 times [2019-09-10 02:04:18,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:18,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:18,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:18,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:18,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:18,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-09-10 02:04:18,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:18,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:18,392 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:18,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:18,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:18,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:18,393 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 5 states. [2019-09-10 02:04:18,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:18,493 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2019-09-10 02:04:18,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:04:18,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-09-10 02:04:18,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:18,494 INFO L225 Difference]: With dead ends: 72 [2019-09-10 02:04:18,494 INFO L226 Difference]: Without dead ends: 72 [2019-09-10 02:04:18,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:04:18,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-10 02:04:18,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2019-09-10 02:04:18,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-10 02:04:18,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-09-10 02:04:18,497 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2019-09-10 02:04:18,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:18,498 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-09-10 02:04:18,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:18,498 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-09-10 02:04:18,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 02:04:18,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:18,499 INFO L399 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-09-10 02:04:18,500 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:18,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:18,500 INFO L82 PathProgramCache]: Analyzing trace with hash -535701510, now seen corresponding path program 1 times [2019-09-10 02:04:18,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:18,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:18,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:18,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:18,502 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:18,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:18,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:18,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:04:18,553 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:18,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:04:18,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:04:18,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:04:18,554 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 6 states. [2019-09-10 02:04:18,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:18,655 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2019-09-10 02:04:18,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:04:18,656 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-09-10 02:04:18,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:18,657 INFO L225 Difference]: With dead ends: 60 [2019-09-10 02:04:18,657 INFO L226 Difference]: Without dead ends: 60 [2019-09-10 02:04:18,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:04:18,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-10 02:04:18,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2019-09-10 02:04:18,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-10 02:04:18,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-09-10 02:04:18,660 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2019-09-10 02:04:18,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:18,661 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-09-10 02:04:18,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:04:18,661 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-09-10 02:04:18,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-10 02:04:18,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:18,662 INFO L399 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] [2019-09-10 02:04:18,663 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:18,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:18,663 INFO L82 PathProgramCache]: Analyzing trace with hash 573125525, now seen corresponding path program 1 times [2019-09-10 02:04:18,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:18,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:18,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:18,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:18,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:18,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:18,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:18,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:18,694 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:18,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:18,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:18,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:18,695 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 5 states. [2019-09-10 02:04:18,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:18,782 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2019-09-10 02:04:18,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:04:18,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-09-10 02:04:18,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:18,784 INFO L225 Difference]: With dead ends: 85 [2019-09-10 02:04:18,784 INFO L226 Difference]: Without dead ends: 85 [2019-09-10 02:04:18,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:04:18,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-10 02:04:18,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 34. [2019-09-10 02:04:18,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-10 02:04:18,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-09-10 02:04:18,788 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2019-09-10 02:04:18,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:18,788 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-09-10 02:04:18,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:18,789 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-09-10 02:04:18,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-10 02:04:18,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:18,797 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:18,797 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:18,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:18,797 INFO L82 PathProgramCache]: Analyzing trace with hash 587025248, now seen corresponding path program 1 times [2019-09-10 02:04:18,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:18,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:18,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:18,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:18,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:18,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:18,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:18,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:04:18,885 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:18,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:04:18,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:04:18,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:04:18,886 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 6 states. [2019-09-10 02:04:18,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:18,991 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2019-09-10 02:04:18,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:04:18,992 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-09-10 02:04:18,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:18,993 INFO L225 Difference]: With dead ends: 58 [2019-09-10 02:04:18,993 INFO L226 Difference]: Without dead ends: 58 [2019-09-10 02:04:18,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:04:18,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-10 02:04:18,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 32. [2019-09-10 02:04:18,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-10 02:04:18,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-09-10 02:04:18,996 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2019-09-10 02:04:18,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:18,996 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-09-10 02:04:18,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:04:18,996 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-09-10 02:04:18,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-10 02:04:18,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:18,997 INFO L399 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-09-10 02:04:18,998 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:18,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:18,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1017916667, now seen corresponding path program 1 times [2019-09-10 02:04:18,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:18,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:18,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:18,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:18,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:19,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:19,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:19,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:04:19,038 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:19,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:04:19,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:04:19,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:04:19,039 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2019-09-10 02:04:19,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:19,181 INFO L93 Difference]: Finished difference Result 123 states and 145 transitions. [2019-09-10 02:04:19,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:04:19,181 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-09-10 02:04:19,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:19,182 INFO L225 Difference]: With dead ends: 123 [2019-09-10 02:04:19,182 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:04:19,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:04:19,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:04:19,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:04:19,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:04:19,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:04:19,184 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-09-10 02:04:19,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:19,184 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:04:19,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:04:19,186 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:04:19,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:04:19,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:04:19 BoogieIcfgContainer [2019-09-10 02:04:19,195 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:04:19,198 INFO L168 Benchmark]: Toolchain (without parser) took 3908.31 ms. Allocated memory was 136.8 MB in the beginning and 251.1 MB in the end (delta: 114.3 MB). Free memory was 92.8 MB in the beginning and 130.7 MB in the end (delta: -37.9 MB). Peak memory consumption was 76.3 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:19,200 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 136.8 MB. Free memory is still 111.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-10 02:04:19,203 INFO L168 Benchmark]: CACSL2BoogieTranslator took 478.98 ms. Allocated memory was 136.8 MB in the beginning and 201.9 MB in the end (delta: 65.0 MB). Free memory was 92.4 MB in the beginning and 177.3 MB in the end (delta: -84.9 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:19,206 INFO L168 Benchmark]: Boogie Preprocessor took 53.42 ms. Allocated memory is still 201.9 MB. Free memory was 177.3 MB in the beginning and 175.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:19,207 INFO L168 Benchmark]: RCFGBuilder took 526.80 ms. Allocated memory is still 201.9 MB. Free memory was 175.6 MB in the beginning and 154.9 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:19,209 INFO L168 Benchmark]: TraceAbstraction took 2841.51 ms. Allocated memory was 201.9 MB in the beginning and 251.1 MB in the end (delta: 49.3 MB). Free memory was 154.9 MB in the beginning and 130.7 MB in the end (delta: 24.1 MB). Peak memory consumption was 73.4 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:19,214 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 136.8 MB. Free memory is still 111.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 478.98 ms. Allocated memory was 136.8 MB in the beginning and 201.9 MB in the end (delta: 65.0 MB). Free memory was 92.4 MB in the beginning and 177.3 MB in the end (delta: -84.9 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.42 ms. Allocated memory is still 201.9 MB. Free memory was 177.3 MB in the beginning and 175.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 526.80 ms. Allocated memory is still 201.9 MB. Free memory was 175.6 MB in the beginning and 154.9 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2841.51 ms. Allocated memory was 201.9 MB in the beginning and 251.1 MB in the end (delta: 49.3 MB). Free memory was 154.9 MB in the beginning and 130.7 MB in the end (delta: 24.1 MB). Peak memory consumption was 73.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 200]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 224]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 240]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 71]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 136]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 83]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 95]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 160]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 188]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 212]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 42]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 148]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 107]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 65 locations, 16 error locations. SAFE Result, 2.7s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 936 SDtfs, 1252 SDslu, 802 SDs, 0 SdLazy, 796 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 435 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 13104 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...