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-fea9116 [2019-09-20 13:25:30,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:25:30,012 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:25:30,033 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:25:30,033 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:25:30,035 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:25:30,037 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:25:30,047 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:25:30,051 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:25:30,054 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:25:30,057 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:25:30,059 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:25:30,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:25:30,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:25:30,064 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:25:30,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:25:30,066 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:25:30,068 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:25:30,070 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:25:30,076 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:25:30,079 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:25:30,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:25:30,084 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:25:30,085 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:25:30,088 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:25:30,088 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:25:30,088 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:25:30,090 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:25:30,092 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:25:30,094 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:25:30,094 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:25:30,095 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:25:30,096 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:25:30,097 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:25:30,099 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:25:30,099 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:25:30,100 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:25:30,100 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:25:30,100 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:25:30,101 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:25:30,102 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:25:30,103 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-20 13:25:30,132 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:25:30,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:25:30,134 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:25:30,134 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:25:30,135 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:25:30,135 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:25:30,135 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:25:30,135 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:25:30,136 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:25:30,136 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:25:30,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:25:30,138 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:25:30,138 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:25:30,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:25:30,139 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:25:30,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:25:30,139 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:25:30,139 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:25:30,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:25:30,140 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:25:30,140 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:25:30,140 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:25:30,140 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:25:30,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:25:30,141 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:25:30,141 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:25:30,141 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:25:30,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:25:30,142 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:25:30,142 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:25:30,187 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:25:30,200 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:25:30,204 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:25:30,205 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:25:30,206 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:25:30,206 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-20 13:25:30,272 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96444257d/98399a7f94d44eaca04c14344076c399/FLAG7761059ce [2019-09-20 13:25:30,713 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:25:30,714 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2019-09-20 13:25:30,722 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96444257d/98399a7f94d44eaca04c14344076c399/FLAG7761059ce [2019-09-20 13:25:31,118 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96444257d/98399a7f94d44eaca04c14344076c399 [2019-09-20 13:25:31,127 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:25:31,129 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:25:31,130 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:25:31,130 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:25:31,135 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:25:31,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:25:31" (1/1) ... [2019-09-20 13:25:31,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2686e1db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:31, skipping insertion in model container [2019-09-20 13:25:31,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:25:31" (1/1) ... [2019-09-20 13:25:31,147 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:25:31,204 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:25:31,464 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:25:31,468 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:25:31,604 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:25:31,623 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:25:31,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:31 WrapperNode [2019-09-20 13:25:31,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:25:31,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:25:31,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:25:31,624 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:25:31,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:31" (1/1) ... [2019-09-20 13:25:31,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:31" (1/1) ... [2019-09-20 13:25:31,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:31" (1/1) ... [2019-09-20 13:25:31,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:31" (1/1) ... [2019-09-20 13:25:31,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:31" (1/1) ... [2019-09-20 13:25:31,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:31" (1/1) ... [2019-09-20 13:25:31,657 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:31" (1/1) ... [2019-09-20 13:25:31,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:25:31,660 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:25:31,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:25:31,660 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:25:31,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:31" (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-20 13:25:31,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:25:31,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:25:31,713 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:25:31,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:25:31,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-20 13:25:31,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-20 13:25:31,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:25:31,713 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:25:31,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:25:31,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:25:32,055 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:25:32,056 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-20 13:25:32,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:25:32 BoogieIcfgContainer [2019-09-20 13:25:32,057 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:25:32,058 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:25:32,058 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:25:32,062 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:25:32,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:25:31" (1/3) ... [2019-09-20 13:25:32,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7750ca34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:25:32, skipping insertion in model container [2019-09-20 13:25:32,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:31" (2/3) ... [2019-09-20 13:25:32,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7750ca34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:25:32, skipping insertion in model container [2019-09-20 13:25:32,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:25:32" (3/3) ... [2019-09-20 13:25:32,066 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2019-09-20 13:25:32,076 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:25:32,089 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-20 13:25:32,112 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-20 13:25:32,137 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:25:32,138 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:25:32,138 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:25:32,138 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:25:32,139 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:25:32,140 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:25:32,140 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:25:32,140 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:25:32,158 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-09-20 13:25:32,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-20 13:25:32,166 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:32,167 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:32,169 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:32,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:32,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1118366569, now seen corresponding path program 1 times [2019-09-20 13:25:32,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:32,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:32,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:32,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:32,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:32,342 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-20 13:25:32,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:32,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:25:32,345 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:32,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:25:32,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:25:32,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:25:32,363 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2019-09-20 13:25:32,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:32,413 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2019-09-20 13:25:32,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:25:32,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-20 13:25:32,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:32,423 INFO L225 Difference]: With dead ends: 82 [2019-09-20 13:25:32,424 INFO L226 Difference]: Without dead ends: 76 [2019-09-20 13:25:32,425 INFO L636 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-20 13:25:32,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-20 13:25:32,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2019-09-20 13:25:32,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-20 13:25:32,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-09-20 13:25:32,478 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2019-09-20 13:25:32,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:32,479 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-09-20 13:25:32,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:25:32,479 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-09-20 13:25:32,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-20 13:25:32,480 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:32,480 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:32,481 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:32,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:32,482 INFO L82 PathProgramCache]: Analyzing trace with hash -306453431, now seen corresponding path program 1 times [2019-09-20 13:25:32,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:32,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:32,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:32,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:32,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:32,550 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-20 13:25:32,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:32,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:32,552 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:32,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:32,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:32,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:32,558 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 4 states. [2019-09-20 13:25:32,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:32,714 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2019-09-20 13:25:32,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:25:32,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-09-20 13:25:32,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:32,718 INFO L225 Difference]: With dead ends: 101 [2019-09-20 13:25:32,718 INFO L226 Difference]: Without dead ends: 101 [2019-09-20 13:25:32,721 INFO L636 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-20 13:25:32,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-20 13:25:32,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 58. [2019-09-20 13:25:32,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-20 13:25:32,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-09-20 13:25:32,740 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 14 [2019-09-20 13:25:32,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:32,740 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-09-20 13:25:32,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:32,741 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-09-20 13:25:32,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-20 13:25:32,742 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:32,742 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:32,744 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:32,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:32,745 INFO L82 PathProgramCache]: Analyzing trace with hash -309622200, now seen corresponding path program 1 times [2019-09-20 13:25:32,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:32,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:32,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:32,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:32,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:32,841 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-20 13:25:32,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:32,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:32,845 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:32,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:32,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:32,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:32,847 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 4 states. [2019-09-20 13:25:32,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:32,982 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2019-09-20 13:25:32,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:32,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-09-20 13:25:32,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:32,985 INFO L225 Difference]: With dead ends: 73 [2019-09-20 13:25:32,985 INFO L226 Difference]: Without dead ends: 73 [2019-09-20 13:25:32,986 INFO L636 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-20 13:25:32,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-20 13:25:32,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2019-09-20 13:25:32,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-20 13:25:32,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-09-20 13:25:32,993 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2019-09-20 13:25:32,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:32,994 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-09-20 13:25:32,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:32,994 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-09-20 13:25:32,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-20 13:25:32,995 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:32,995 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:32,997 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:32,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:32,998 INFO L82 PathProgramCache]: Analyzing trace with hash -910118681, now seen corresponding path program 1 times [2019-09-20 13:25:32,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:33,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:33,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:33,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:33,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:33,065 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-20 13:25:33,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:33,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:33,066 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:33,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:33,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:33,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:33,068 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 4 states. [2019-09-20 13:25:33,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:33,150 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2019-09-20 13:25:33,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:33,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-09-20 13:25:33,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:33,152 INFO L225 Difference]: With dead ends: 94 [2019-09-20 13:25:33,153 INFO L226 Difference]: Without dead ends: 94 [2019-09-20 13:25:33,153 INFO L636 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-20 13:25:33,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-20 13:25:33,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2019-09-20 13:25:33,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-20 13:25:33,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-09-20 13:25:33,159 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2019-09-20 13:25:33,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:33,160 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-09-20 13:25:33,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:33,160 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-09-20 13:25:33,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-20 13:25:33,161 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:33,161 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:33,162 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:33,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:33,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1851095055, now seen corresponding path program 1 times [2019-09-20 13:25:33,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:33,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:33,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:33,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:33,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:33,247 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-20 13:25:33,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:33,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:25:33,247 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:33,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:25:33,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:25:33,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:33,249 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 5 states. [2019-09-20 13:25:33,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:33,352 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2019-09-20 13:25:33,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:25:33,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-20 13:25:33,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:33,368 INFO L225 Difference]: With dead ends: 93 [2019-09-20 13:25:33,368 INFO L226 Difference]: Without dead ends: 93 [2019-09-20 13:25:33,369 INFO L636 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-20 13:25:33,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-20 13:25:33,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2019-09-20 13:25:33,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-20 13:25:33,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-09-20 13:25:33,375 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2019-09-20 13:25:33,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:33,376 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-09-20 13:25:33,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:25:33,376 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-09-20 13:25:33,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-20 13:25:33,377 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:33,377 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:33,378 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:33,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:33,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1194066488, now seen corresponding path program 1 times [2019-09-20 13:25:33,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:33,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:33,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:33,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:33,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:33,449 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-20 13:25:33,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:33,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:33,450 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:33,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:33,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:33,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:33,451 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 4 states. [2019-09-20 13:25:33,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:33,513 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2019-09-20 13:25:33,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:25:33,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-20 13:25:33,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:33,515 INFO L225 Difference]: With dead ends: 67 [2019-09-20 13:25:33,515 INFO L226 Difference]: Without dead ends: 67 [2019-09-20 13:25:33,516 INFO L636 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-20 13:25:33,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-20 13:25:33,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2019-09-20 13:25:33,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-20 13:25:33,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-09-20 13:25:33,520 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2019-09-20 13:25:33,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:33,521 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-09-20 13:25:33,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:33,521 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-09-20 13:25:33,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 13:25:33,522 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:33,522 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:33,523 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:33,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:33,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1549374957, now seen corresponding path program 1 times [2019-09-20 13:25:33,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:33,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:33,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:33,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:33,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:33,571 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-20 13:25:33,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:33,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:33,572 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:33,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:33,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:33,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:33,573 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 4 states. [2019-09-20 13:25:33,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:33,638 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2019-09-20 13:25:33,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:33,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-09-20 13:25:33,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:33,640 INFO L225 Difference]: With dead ends: 89 [2019-09-20 13:25:33,640 INFO L226 Difference]: Without dead ends: 89 [2019-09-20 13:25:33,641 INFO L636 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-20 13:25:33,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-20 13:25:33,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 48. [2019-09-20 13:25:33,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-20 13:25:33,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-09-20 13:25:33,645 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2019-09-20 13:25:33,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:33,646 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-09-20 13:25:33,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:33,646 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-09-20 13:25:33,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 13:25:33,647 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:33,647 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:33,647 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:33,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:33,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1638647651, now seen corresponding path program 1 times [2019-09-20 13:25:33,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:33,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:33,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:33,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:33,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:33,728 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-20 13:25:33,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:33,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:25:33,729 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:33,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:25:33,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:25:33,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:33,730 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 5 states. [2019-09-20 13:25:33,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:33,863 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2019-09-20 13:25:33,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:25:33,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-20 13:25:33,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:33,864 INFO L225 Difference]: With dead ends: 71 [2019-09-20 13:25:33,864 INFO L226 Difference]: Without dead ends: 71 [2019-09-20 13:25:33,865 INFO L636 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-20 13:25:33,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-20 13:25:33,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2019-09-20 13:25:33,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-20 13:25:33,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-09-20 13:25:33,877 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2019-09-20 13:25:33,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:33,878 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-09-20 13:25:33,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:25:33,878 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-09-20 13:25:33,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 13:25:33,882 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:33,882 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:33,883 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:33,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:33,883 INFO L82 PathProgramCache]: Analyzing trace with hash -741527250, now seen corresponding path program 1 times [2019-09-20 13:25:33,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:33,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:33,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:33,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:33,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:33,947 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-20 13:25:33,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:33,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:25:33,948 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:33,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:25:33,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:25:33,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:33,949 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 5 states. [2019-09-20 13:25:34,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:34,030 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2019-09-20 13:25:34,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:25:34,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-20 13:25:34,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:34,031 INFO L225 Difference]: With dead ends: 59 [2019-09-20 13:25:34,031 INFO L226 Difference]: Without dead ends: 59 [2019-09-20 13:25:34,032 INFO L636 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-20 13:25:34,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-20 13:25:34,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2019-09-20 13:25:34,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-20 13:25:34,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-09-20 13:25:34,035 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2019-09-20 13:25:34,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:34,036 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-09-20 13:25:34,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:25:34,036 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-09-20 13:25:34,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:25:34,037 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:34,037 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:34,038 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:34,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:34,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1512505143, now seen corresponding path program 1 times [2019-09-20 13:25:34,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:34,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:34,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:34,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:34,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:34,077 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-20 13:25:34,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:34,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:34,077 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:34,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:34,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:34,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:34,078 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 4 states. [2019-09-20 13:25:34,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:34,135 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2019-09-20 13:25:34,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:34,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-09-20 13:25:34,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:34,137 INFO L225 Difference]: With dead ends: 59 [2019-09-20 13:25:34,137 INFO L226 Difference]: Without dead ends: 59 [2019-09-20 13:25:34,138 INFO L636 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-20 13:25:34,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-20 13:25:34,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2019-09-20 13:25:34,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-20 13:25:34,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-09-20 13:25:34,141 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2019-09-20 13:25:34,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:34,141 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-09-20 13:25:34,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:34,141 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-09-20 13:25:34,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:25:34,142 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:34,142 INFO L407 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-20 13:25:34,143 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:34,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:34,143 INFO L82 PathProgramCache]: Analyzing trace with hash 356983956, now seen corresponding path program 1 times [2019-09-20 13:25:34,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:34,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:34,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:34,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:34,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:34,189 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-20 13:25:34,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:34,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:34,190 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:34,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:34,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:34,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:34,191 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 4 states. [2019-09-20 13:25:34,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:34,252 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2019-09-20 13:25:34,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:25:34,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-20 13:25:34,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:34,255 INFO L225 Difference]: With dead ends: 67 [2019-09-20 13:25:34,256 INFO L226 Difference]: Without dead ends: 67 [2019-09-20 13:25:34,256 INFO L636 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-20 13:25:34,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-20 13:25:34,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2019-09-20 13:25:34,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-20 13:25:34,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-09-20 13:25:34,263 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2019-09-20 13:25:34,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:34,263 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-09-20 13:25:34,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:34,264 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-09-20 13:25:34,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:25:34,264 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:34,264 INFO L407 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-20 13:25:34,265 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:34,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:34,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1818396113, now seen corresponding path program 1 times [2019-09-20 13:25:34,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:34,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:34,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:34,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:34,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:34,301 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-20 13:25:34,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:34,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:25:34,302 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:34,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:25:34,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:25:34,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:34,303 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 5 states. [2019-09-20 13:25:34,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:34,397 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2019-09-20 13:25:34,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:25:34,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-09-20 13:25:34,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:34,399 INFO L225 Difference]: With dead ends: 72 [2019-09-20 13:25:34,399 INFO L226 Difference]: Without dead ends: 72 [2019-09-20 13:25:34,399 INFO L636 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-20 13:25:34,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-20 13:25:34,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2019-09-20 13:25:34,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-20 13:25:34,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-09-20 13:25:34,402 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2019-09-20 13:25:34,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:34,403 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-09-20 13:25:34,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:25:34,403 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-09-20 13:25:34,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:25:34,404 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:34,404 INFO L407 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-20 13:25:34,405 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:34,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:34,405 INFO L82 PathProgramCache]: Analyzing trace with hash -535701510, now seen corresponding path program 1 times [2019-09-20 13:25:34,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:34,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:34,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:34,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:34,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:34,466 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-20 13:25:34,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:34,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:25:34,467 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:34,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:25:34,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:25:34,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:25:34,468 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 6 states. [2019-09-20 13:25:34,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:34,598 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2019-09-20 13:25:34,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:25:34,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-09-20 13:25:34,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:34,599 INFO L225 Difference]: With dead ends: 60 [2019-09-20 13:25:34,600 INFO L226 Difference]: Without dead ends: 60 [2019-09-20 13:25:34,600 INFO L636 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-20 13:25:34,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-20 13:25:34,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2019-09-20 13:25:34,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-20 13:25:34,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-09-20 13:25:34,603 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2019-09-20 13:25:34,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:34,603 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-09-20 13:25:34,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:25:34,603 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-09-20 13:25:34,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:25:34,606 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:34,606 INFO L407 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-20 13:25:34,607 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:34,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:34,608 INFO L82 PathProgramCache]: Analyzing trace with hash 573125525, now seen corresponding path program 1 times [2019-09-20 13:25:34,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:34,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:34,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:34,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:34,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:34,679 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-20 13:25:34,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:34,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:25:34,680 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:34,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:25:34,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:25:34,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:34,681 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 5 states. [2019-09-20 13:25:34,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:34,781 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2019-09-20 13:25:34,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:25:34,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-09-20 13:25:34,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:34,782 INFO L225 Difference]: With dead ends: 85 [2019-09-20 13:25:34,782 INFO L226 Difference]: Without dead ends: 85 [2019-09-20 13:25:34,782 INFO L636 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-20 13:25:34,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-20 13:25:34,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 34. [2019-09-20 13:25:34,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-20 13:25:34,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-09-20 13:25:34,785 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2019-09-20 13:25:34,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:34,786 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-09-20 13:25:34,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:25:34,786 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-09-20 13:25:34,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:25:34,786 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:34,787 INFO L407 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-20 13:25:34,787 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:34,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:34,788 INFO L82 PathProgramCache]: Analyzing trace with hash 587025248, now seen corresponding path program 1 times [2019-09-20 13:25:34,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:34,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:34,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:34,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:34,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:34,845 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-20 13:25:34,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:34,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:25:34,845 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:34,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:25:34,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:25:34,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:25:34,846 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 6 states. [2019-09-20 13:25:34,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:34,980 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2019-09-20 13:25:34,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:25:34,981 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-09-20 13:25:34,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:34,982 INFO L225 Difference]: With dead ends: 58 [2019-09-20 13:25:34,982 INFO L226 Difference]: Without dead ends: 58 [2019-09-20 13:25:34,982 INFO L636 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-20 13:25:34,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-20 13:25:34,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 32. [2019-09-20 13:25:34,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-20 13:25:34,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-09-20 13:25:34,985 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2019-09-20 13:25:34,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:34,985 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-09-20 13:25:34,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:25:34,985 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-09-20 13:25:34,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:25:34,986 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:34,986 INFO L407 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-20 13:25:34,987 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:34,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:34,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1017916667, now seen corresponding path program 1 times [2019-09-20 13:25:34,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:34,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:34,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:34,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:34,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:35,044 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-20 13:25:35,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:35,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:25:35,045 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:35,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:25:35,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:25:35,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:25:35,046 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2019-09-20 13:25:35,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:35,187 INFO L93 Difference]: Finished difference Result 123 states and 145 transitions. [2019-09-20 13:25:35,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:25:35,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-09-20 13:25:35,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:35,188 INFO L225 Difference]: With dead ends: 123 [2019-09-20 13:25:35,188 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:25:35,188 INFO L636 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-20 13:25:35,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:25:35,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:25:35,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:25:35,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:25:35,189 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-09-20 13:25:35,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:35,190 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:25:35,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:25:35,190 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:25:35,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:25:35,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:25:35 BoogieIcfgContainer [2019-09-20 13:25:35,196 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:25:35,198 INFO L168 Benchmark]: Toolchain (without parser) took 4068.79 ms. Allocated memory was 131.1 MB in the beginning and 273.2 MB in the end (delta: 142.1 MB). Free memory was 86.4 MB in the beginning and 153.3 MB in the end (delta: -66.9 MB). Peak memory consumption was 75.2 MB. Max. memory is 7.1 GB. [2019-09-20 13:25:35,199 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 131.1 MB. Free memory was 105.2 MB in the beginning and 105.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-09-20 13:25:35,200 INFO L168 Benchmark]: CACSL2BoogieTranslator took 493.97 ms. Allocated memory was 131.1 MB in the beginning and 195.6 MB in the end (delta: 64.5 MB). Free memory was 86.2 MB in the beginning and 171.3 MB in the end (delta: -85.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-09-20 13:25:35,201 INFO L168 Benchmark]: Boogie Preprocessor took 35.45 ms. Allocated memory is still 195.6 MB. Free memory was 171.3 MB in the beginning and 169.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-09-20 13:25:35,202 INFO L168 Benchmark]: RCFGBuilder took 397.64 ms. Allocated memory is still 195.6 MB. Free memory was 169.4 MB in the beginning and 147.4 MB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-09-20 13:25:35,203 INFO L168 Benchmark]: TraceAbstraction took 3137.45 ms. Allocated memory was 195.6 MB in the beginning and 273.2 MB in the end (delta: 77.6 MB). Free memory was 146.8 MB in the beginning and 153.3 MB in the end (delta: -6.5 MB). Peak memory consumption was 71.1 MB. Max. memory is 7.1 GB. [2019-09-20 13:25:35,206 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.25 ms. Allocated memory is still 131.1 MB. Free memory was 105.2 MB in the beginning and 105.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 493.97 ms. Allocated memory was 131.1 MB in the beginning and 195.6 MB in the end (delta: 64.5 MB). Free memory was 86.2 MB in the beginning and 171.3 MB in the end (delta: -85.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.45 ms. Allocated memory is still 195.6 MB. Free memory was 171.3 MB in the beginning and 169.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 397.64 ms. Allocated memory is still 195.6 MB. Free memory was 169.4 MB in the beginning and 147.4 MB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3137.45 ms. Allocated memory was 195.6 MB in the beginning and 273.2 MB in the end (delta: 77.6 MB). Free memory was 146.8 MB in the beginning and 153.3 MB in the end (delta: -6.5 MB). Peak memory consumption was 71.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 212]: 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: 136]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 200]: 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: 83]: 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: 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: 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: 224]: 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: 252]: 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 - PositiveResult [Line: 172]: 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, 3.0s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 1.6s 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.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s 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.7s 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...