/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/locks/test_locks_7.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 00:32:45,030 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 00:32:45,033 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 00:32:45,044 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 00:32:45,044 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 00:32:45,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 00:32:45,047 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 00:32:45,049 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 00:32:45,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 00:32:45,051 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 00:32:45,052 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 00:32:45,054 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 00:32:45,054 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 00:32:45,055 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 00:32:45,056 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 00:32:45,057 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 00:32:45,058 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 00:32:45,059 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 00:32:45,062 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 00:32:45,064 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 00:32:45,066 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 00:32:45,070 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 00:32:45,072 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 00:32:45,073 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 00:32:45,078 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 00:32:45,080 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 00:32:45,080 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 00:32:45,081 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 00:32:45,082 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 00:32:45,083 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 00:32:45,083 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 00:32:45,084 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 00:32:45,085 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 00:32:45,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 00:32:45,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 00:32:45,087 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 00:32:45,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 00:32:45,087 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 00:32:45,088 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 00:32:45,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 00:32:45,089 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 00:32:45,090 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 00:32:45,108 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 00:32:45,108 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 00:32:45,111 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 00:32:45,111 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 00:32:45,111 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 00:32:45,111 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 00:32:45,112 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 00:32:45,112 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 00:32:45,112 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 00:32:45,112 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 00:32:45,112 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 00:32:45,113 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 00:32:45,113 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 00:32:45,114 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 00:32:45,114 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 00:32:45,114 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 00:32:45,114 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 00:32:45,114 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 00:32:45,114 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 00:32:45,115 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 00:32:45,115 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 00:32:45,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:32:45,115 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 00:32:45,115 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 00:32:45,116 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 00:32:45,116 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 00:32:45,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 00:32:45,116 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 00:32:45,117 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 00:32:45,398 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 00:32:45,411 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 00:32:45,414 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 00:32:45,416 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 00:32:45,417 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 00:32:45,417 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2019-11-07 00:32:45,498 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/799d73678/84005e3de5c946078a175575a9200af2/FLAG34c1c9769 [2019-11-07 00:32:45,983 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 00:32:45,983 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2019-11-07 00:32:45,991 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/799d73678/84005e3de5c946078a175575a9200af2/FLAG34c1c9769 [2019-11-07 00:32:46,309 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/799d73678/84005e3de5c946078a175575a9200af2 [2019-11-07 00:32:46,317 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 00:32:46,319 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 00:32:46,320 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 00:32:46,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 00:32:46,323 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 00:32:46,325 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:32:46" (1/1) ... [2019-11-07 00:32:46,328 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30256132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:46, skipping insertion in model container [2019-11-07 00:32:46,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:32:46" (1/1) ... [2019-11-07 00:32:46,340 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 00:32:46,364 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 00:32:46,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:32:46,579 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 00:32:46,608 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:32:46,623 INFO L192 MainTranslator]: Completed translation [2019-11-07 00:32:46,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:46 WrapperNode [2019-11-07 00:32:46,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 00:32:46,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 00:32:46,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 00:32:46,625 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 00:32:46,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:46" (1/1) ... [2019-11-07 00:32:46,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:46" (1/1) ... [2019-11-07 00:32:46,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:46" (1/1) ... [2019-11-07 00:32:46,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:46" (1/1) ... [2019-11-07 00:32:46,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:46" (1/1) ... [2019-11-07 00:32:46,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:46" (1/1) ... [2019-11-07 00:32:46,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:46" (1/1) ... [2019-11-07 00:32:46,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 00:32:46,735 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 00:32:46,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 00:32:46,736 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 00:32:46,736 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:32:46,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 00:32:46,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 00:32:46,787 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 00:32:46,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 00:32:46,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 00:32:46,787 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 00:32:46,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 00:32:46,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 00:32:47,088 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 00:32:47,088 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-07 00:32:47,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:32:47 BoogieIcfgContainer [2019-11-07 00:32:47,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 00:32:47,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 00:32:47,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 00:32:47,094 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 00:32:47,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:32:46" (1/3) ... [2019-11-07 00:32:47,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8524081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:32:47, skipping insertion in model container [2019-11-07 00:32:47,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:46" (2/3) ... [2019-11-07 00:32:47,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8524081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:32:47, skipping insertion in model container [2019-11-07 00:32:47,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:32:47" (3/3) ... [2019-11-07 00:32:47,103 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2019-11-07 00:32:47,110 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 00:32:47,117 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 00:32:47,128 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 00:32:47,150 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 00:32:47,151 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 00:32:47,151 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 00:32:47,151 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 00:32:47,151 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 00:32:47,151 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 00:32:47,151 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 00:32:47,152 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 00:32:47,170 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-11-07 00:32:47,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 00:32:47,177 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:47,178 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:47,180 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:47,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:47,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1819770524, now seen corresponding path program 1 times [2019-11-07 00:32:47,196 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:47,197 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076029288] [2019-11-07 00:32:47,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:47,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:47,361 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076029288] [2019-11-07 00:32:47,361 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:47,362 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:47,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642019964] [2019-11-07 00:32:47,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:47,371 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:47,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:47,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:47,394 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-11-07 00:32:47,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:47,453 INFO L93 Difference]: Finished difference Result 69 states and 114 transitions. [2019-11-07 00:32:47,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:47,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-07 00:32:47,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:47,466 INFO L225 Difference]: With dead ends: 69 [2019-11-07 00:32:47,466 INFO L226 Difference]: Without dead ends: 54 [2019-11-07 00:32:47,469 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:47,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-07 00:32:47,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-11-07 00:32:47,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-07 00:32:47,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 65 transitions. [2019-11-07 00:32:47,509 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 65 transitions. Word has length 17 [2019-11-07 00:32:47,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:47,509 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 65 transitions. [2019-11-07 00:32:47,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:47,510 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 65 transitions. [2019-11-07 00:32:47,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 00:32:47,511 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:47,511 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:47,512 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:47,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:47,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1426743514, now seen corresponding path program 1 times [2019-11-07 00:32:47,513 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:47,513 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421372710] [2019-11-07 00:32:47,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:47,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:47,573 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421372710] [2019-11-07 00:32:47,573 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:47,573 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:47,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82500157] [2019-11-07 00:32:47,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:47,576 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:47,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:47,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:47,577 INFO L87 Difference]: Start difference. First operand 38 states and 65 transitions. Second operand 3 states. [2019-11-07 00:32:47,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:47,629 INFO L93 Difference]: Finished difference Result 87 states and 152 transitions. [2019-11-07 00:32:47,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:47,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-07 00:32:47,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:47,631 INFO L225 Difference]: With dead ends: 87 [2019-11-07 00:32:47,632 INFO L226 Difference]: Without dead ends: 54 [2019-11-07 00:32:47,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:47,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-07 00:32:47,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-11-07 00:32:47,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-07 00:32:47,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 89 transitions. [2019-11-07 00:32:47,643 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 89 transitions. Word has length 17 [2019-11-07 00:32:47,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:47,644 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 89 transitions. [2019-11-07 00:32:47,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:47,644 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 89 transitions. [2019-11-07 00:32:47,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-07 00:32:47,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:47,646 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:47,646 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:47,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:47,647 INFO L82 PathProgramCache]: Analyzing trace with hash 578525748, now seen corresponding path program 1 times [2019-11-07 00:32:47,647 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:47,647 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198363125] [2019-11-07 00:32:47,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:47,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:47,689 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198363125] [2019-11-07 00:32:47,689 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:47,690 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:47,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865569906] [2019-11-07 00:32:47,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:47,691 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:47,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:47,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:47,694 INFO L87 Difference]: Start difference. First operand 52 states and 89 transitions. Second operand 3 states. [2019-11-07 00:32:47,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:47,715 INFO L93 Difference]: Finished difference Result 81 states and 135 transitions. [2019-11-07 00:32:47,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:47,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-07 00:32:47,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:47,717 INFO L225 Difference]: With dead ends: 81 [2019-11-07 00:32:47,718 INFO L226 Difference]: Without dead ends: 57 [2019-11-07 00:32:47,718 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:47,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-07 00:32:47,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-11-07 00:32:47,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-07 00:32:47,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 91 transitions. [2019-11-07 00:32:47,729 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 91 transitions. Word has length 18 [2019-11-07 00:32:47,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:47,729 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 91 transitions. [2019-11-07 00:32:47,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:47,730 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2019-11-07 00:32:47,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-07 00:32:47,731 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:47,731 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:47,731 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:47,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:47,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1279590326, now seen corresponding path program 1 times [2019-11-07 00:32:47,732 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:47,733 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184722922] [2019-11-07 00:32:47,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:47,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:47,777 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184722922] [2019-11-07 00:32:47,778 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:47,778 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:47,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470123529] [2019-11-07 00:32:47,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:47,779 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:47,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:47,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:47,780 INFO L87 Difference]: Start difference. First operand 55 states and 91 transitions. Second operand 3 states. [2019-11-07 00:32:47,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:47,818 INFO L93 Difference]: Finished difference Result 100 states and 168 transitions. [2019-11-07 00:32:47,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:47,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-07 00:32:47,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:47,820 INFO L225 Difference]: With dead ends: 100 [2019-11-07 00:32:47,821 INFO L226 Difference]: Without dead ends: 98 [2019-11-07 00:32:47,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:47,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-07 00:32:47,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 72. [2019-11-07 00:32:47,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-07 00:32:47,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 120 transitions. [2019-11-07 00:32:47,833 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 120 transitions. Word has length 18 [2019-11-07 00:32:47,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:47,834 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 120 transitions. [2019-11-07 00:32:47,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:47,834 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 120 transitions. [2019-11-07 00:32:47,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-07 00:32:47,835 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:47,835 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:47,836 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:47,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:47,836 INFO L82 PathProgramCache]: Analyzing trace with hash 886563316, now seen corresponding path program 1 times [2019-11-07 00:32:47,837 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:47,837 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778372685] [2019-11-07 00:32:47,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:47,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:47,877 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778372685] [2019-11-07 00:32:47,877 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:47,877 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:47,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263954506] [2019-11-07 00:32:47,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:47,878 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:47,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:47,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:47,879 INFO L87 Difference]: Start difference. First operand 72 states and 120 transitions. Second operand 3 states. [2019-11-07 00:32:47,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:47,904 INFO L93 Difference]: Finished difference Result 164 states and 278 transitions. [2019-11-07 00:32:47,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:47,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-07 00:32:47,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:47,906 INFO L225 Difference]: With dead ends: 164 [2019-11-07 00:32:47,906 INFO L226 Difference]: Without dead ends: 100 [2019-11-07 00:32:47,907 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:47,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-07 00:32:47,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-11-07 00:32:47,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-07 00:32:47,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 162 transitions. [2019-11-07 00:32:47,918 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 162 transitions. Word has length 18 [2019-11-07 00:32:47,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:47,919 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 162 transitions. [2019-11-07 00:32:47,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:47,919 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 162 transitions. [2019-11-07 00:32:47,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-07 00:32:47,920 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:47,921 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:47,921 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:47,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:47,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1012809135, now seen corresponding path program 1 times [2019-11-07 00:32:47,921 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:47,922 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933737883] [2019-11-07 00:32:47,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:47,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:47,980 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933737883] [2019-11-07 00:32:47,980 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:47,980 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:47,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619827928] [2019-11-07 00:32:47,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:47,981 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:47,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:47,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:47,982 INFO L87 Difference]: Start difference. First operand 98 states and 162 transitions. Second operand 3 states. [2019-11-07 00:32:48,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:48,007 INFO L93 Difference]: Finished difference Result 147 states and 241 transitions. [2019-11-07 00:32:48,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:48,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-07 00:32:48,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:48,009 INFO L225 Difference]: With dead ends: 147 [2019-11-07 00:32:48,009 INFO L226 Difference]: Without dead ends: 102 [2019-11-07 00:32:48,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:48,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-07 00:32:48,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-11-07 00:32:48,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-07 00:32:48,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 162 transitions. [2019-11-07 00:32:48,021 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 162 transitions. Word has length 19 [2019-11-07 00:32:48,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:48,021 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 162 transitions. [2019-11-07 00:32:48,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:48,022 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 162 transitions. [2019-11-07 00:32:48,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-07 00:32:48,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:48,026 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:48,026 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:48,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:48,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1713873713, now seen corresponding path program 1 times [2019-11-07 00:32:48,027 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:48,028 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676697929] [2019-11-07 00:32:48,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:48,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:48,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:48,069 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676697929] [2019-11-07 00:32:48,070 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:48,070 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:48,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499468023] [2019-11-07 00:32:48,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:48,071 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:48,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:48,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:48,072 INFO L87 Difference]: Start difference. First operand 100 states and 162 transitions. Second operand 3 states. [2019-11-07 00:32:48,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:48,089 INFO L93 Difference]: Finished difference Result 180 states and 296 transitions. [2019-11-07 00:32:48,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:48,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-07 00:32:48,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:48,093 INFO L225 Difference]: With dead ends: 180 [2019-11-07 00:32:48,093 INFO L226 Difference]: Without dead ends: 178 [2019-11-07 00:32:48,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:48,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-07 00:32:48,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 136. [2019-11-07 00:32:48,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-07 00:32:48,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 218 transitions. [2019-11-07 00:32:48,106 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 218 transitions. Word has length 19 [2019-11-07 00:32:48,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:48,107 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 218 transitions. [2019-11-07 00:32:48,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:48,107 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 218 transitions. [2019-11-07 00:32:48,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-07 00:32:48,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:48,109 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:48,109 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:48,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:48,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1320846703, now seen corresponding path program 1 times [2019-11-07 00:32:48,110 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:48,110 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090953568] [2019-11-07 00:32:48,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:48,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:48,136 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090953568] [2019-11-07 00:32:48,136 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:48,137 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:48,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962993180] [2019-11-07 00:32:48,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:48,138 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:48,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:48,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:48,139 INFO L87 Difference]: Start difference. First operand 136 states and 218 transitions. Second operand 3 states. [2019-11-07 00:32:48,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:48,159 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2019-11-07 00:32:48,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:48,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-07 00:32:48,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:48,161 INFO L225 Difference]: With dead ends: 312 [2019-11-07 00:32:48,161 INFO L226 Difference]: Without dead ends: 186 [2019-11-07 00:32:48,163 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:48,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-07 00:32:48,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2019-11-07 00:32:48,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-07 00:32:48,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 290 transitions. [2019-11-07 00:32:48,178 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 290 transitions. Word has length 19 [2019-11-07 00:32:48,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:48,178 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 290 transitions. [2019-11-07 00:32:48,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:48,179 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 290 transitions. [2019-11-07 00:32:48,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-07 00:32:48,180 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:48,181 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:48,181 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:48,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:48,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1590692585, now seen corresponding path program 1 times [2019-11-07 00:32:48,182 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:48,182 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596963320] [2019-11-07 00:32:48,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:48,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:48,210 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596963320] [2019-11-07 00:32:48,210 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:48,210 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:48,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942590801] [2019-11-07 00:32:48,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:48,211 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:48,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:48,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:48,212 INFO L87 Difference]: Start difference. First operand 184 states and 290 transitions. Second operand 3 states. [2019-11-07 00:32:48,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:48,255 INFO L93 Difference]: Finished difference Result 276 states and 432 transitions. [2019-11-07 00:32:48,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:48,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-07 00:32:48,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:48,260 INFO L225 Difference]: With dead ends: 276 [2019-11-07 00:32:48,260 INFO L226 Difference]: Without dead ends: 190 [2019-11-07 00:32:48,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:48,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-07 00:32:48,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2019-11-07 00:32:48,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-07 00:32:48,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 290 transitions. [2019-11-07 00:32:48,274 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 290 transitions. Word has length 20 [2019-11-07 00:32:48,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:48,274 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 290 transitions. [2019-11-07 00:32:48,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:48,274 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 290 transitions. [2019-11-07 00:32:48,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-07 00:32:48,276 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:48,276 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:48,276 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:48,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:48,277 INFO L82 PathProgramCache]: Analyzing trace with hash -2003210133, now seen corresponding path program 1 times [2019-11-07 00:32:48,277 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:48,277 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809513311] [2019-11-07 00:32:48,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:48,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:48,306 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809513311] [2019-11-07 00:32:48,307 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:48,308 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:48,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112815710] [2019-11-07 00:32:48,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:48,308 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:48,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:48,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:48,309 INFO L87 Difference]: Start difference. First operand 188 states and 290 transitions. Second operand 3 states. [2019-11-07 00:32:48,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:48,340 INFO L93 Difference]: Finished difference Result 332 states and 520 transitions. [2019-11-07 00:32:48,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:48,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-07 00:32:48,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:48,344 INFO L225 Difference]: With dead ends: 332 [2019-11-07 00:32:48,345 INFO L226 Difference]: Without dead ends: 330 [2019-11-07 00:32:48,345 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:48,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-11-07 00:32:48,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 264. [2019-11-07 00:32:48,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-11-07 00:32:48,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 398 transitions. [2019-11-07 00:32:48,368 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 398 transitions. Word has length 20 [2019-11-07 00:32:48,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:48,368 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 398 transitions. [2019-11-07 00:32:48,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:48,369 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 398 transitions. [2019-11-07 00:32:48,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-07 00:32:48,374 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:48,374 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:48,374 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:48,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:48,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1898730153, now seen corresponding path program 1 times [2019-11-07 00:32:48,375 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:48,375 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171263440] [2019-11-07 00:32:48,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:48,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:48,429 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171263440] [2019-11-07 00:32:48,429 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:48,430 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:48,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871985811] [2019-11-07 00:32:48,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:48,430 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:48,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:48,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:48,432 INFO L87 Difference]: Start difference. First operand 264 states and 398 transitions. Second operand 3 states. [2019-11-07 00:32:48,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:48,464 INFO L93 Difference]: Finished difference Result 604 states and 912 transitions. [2019-11-07 00:32:48,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:48,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-07 00:32:48,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:48,469 INFO L225 Difference]: With dead ends: 604 [2019-11-07 00:32:48,469 INFO L226 Difference]: Without dead ends: 354 [2019-11-07 00:32:48,471 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:48,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-11-07 00:32:48,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2019-11-07 00:32:48,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-11-07 00:32:48,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 518 transitions. [2019-11-07 00:32:48,505 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 518 transitions. Word has length 20 [2019-11-07 00:32:48,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:48,505 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 518 transitions. [2019-11-07 00:32:48,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:48,505 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 518 transitions. [2019-11-07 00:32:48,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-07 00:32:48,509 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:48,509 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:48,510 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:48,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:48,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1969756604, now seen corresponding path program 1 times [2019-11-07 00:32:48,510 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:48,511 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138237261] [2019-11-07 00:32:48,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:48,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:48,562 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138237261] [2019-11-07 00:32:48,563 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:48,564 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:48,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529262273] [2019-11-07 00:32:48,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:48,565 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:48,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:48,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:48,565 INFO L87 Difference]: Start difference. First operand 352 states and 518 transitions. Second operand 3 states. [2019-11-07 00:32:48,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:48,592 INFO L93 Difference]: Finished difference Result 528 states and 772 transitions. [2019-11-07 00:32:48,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:48,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-07 00:32:48,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:48,596 INFO L225 Difference]: With dead ends: 528 [2019-11-07 00:32:48,596 INFO L226 Difference]: Without dead ends: 362 [2019-11-07 00:32:48,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:48,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-11-07 00:32:48,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2019-11-07 00:32:48,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-11-07 00:32:48,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 518 transitions. [2019-11-07 00:32:48,610 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 518 transitions. Word has length 21 [2019-11-07 00:32:48,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:48,612 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 518 transitions. [2019-11-07 00:32:48,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:48,613 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 518 transitions. [2019-11-07 00:32:48,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-07 00:32:48,616 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:48,616 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:48,616 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:48,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:48,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1268692026, now seen corresponding path program 1 times [2019-11-07 00:32:48,617 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:48,617 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099472310] [2019-11-07 00:32:48,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:48,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:48,670 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099472310] [2019-11-07 00:32:48,670 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:48,670 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:48,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849899419] [2019-11-07 00:32:48,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:48,671 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:48,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:48,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:48,672 INFO L87 Difference]: Start difference. First operand 360 states and 518 transitions. Second operand 3 states. [2019-11-07 00:32:48,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:48,699 INFO L93 Difference]: Finished difference Result 620 states and 904 transitions. [2019-11-07 00:32:48,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:48,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-07 00:32:48,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:48,706 INFO L225 Difference]: With dead ends: 620 [2019-11-07 00:32:48,707 INFO L226 Difference]: Without dead ends: 618 [2019-11-07 00:32:48,707 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:48,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-11-07 00:32:48,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 520. [2019-11-07 00:32:48,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-11-07 00:32:48,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 726 transitions. [2019-11-07 00:32:48,730 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 726 transitions. Word has length 21 [2019-11-07 00:32:48,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:48,730 INFO L462 AbstractCegarLoop]: Abstraction has 520 states and 726 transitions. [2019-11-07 00:32:48,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:48,731 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 726 transitions. [2019-11-07 00:32:48,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-07 00:32:48,734 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:48,734 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:48,734 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:48,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:48,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1661719036, now seen corresponding path program 1 times [2019-11-07 00:32:48,736 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:48,744 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493938967] [2019-11-07 00:32:48,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:48,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:48,809 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493938967] [2019-11-07 00:32:48,809 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:48,809 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:48,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809824555] [2019-11-07 00:32:48,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:48,810 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:48,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:48,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:48,814 INFO L87 Difference]: Start difference. First operand 520 states and 726 transitions. Second operand 3 states. [2019-11-07 00:32:48,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:48,855 INFO L93 Difference]: Finished difference Result 1180 states and 1640 transitions. [2019-11-07 00:32:48,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:48,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-07 00:32:48,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:48,859 INFO L225 Difference]: With dead ends: 1180 [2019-11-07 00:32:48,860 INFO L226 Difference]: Without dead ends: 682 [2019-11-07 00:32:48,862 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:48,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-11-07 00:32:48,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 680. [2019-11-07 00:32:48,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-11-07 00:32:48,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 918 transitions. [2019-11-07 00:32:48,885 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 918 transitions. Word has length 21 [2019-11-07 00:32:48,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:48,885 INFO L462 AbstractCegarLoop]: Abstraction has 680 states and 918 transitions. [2019-11-07 00:32:48,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:48,886 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 918 transitions. [2019-11-07 00:32:48,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-07 00:32:48,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:48,888 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:48,888 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:48,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:48,888 INFO L82 PathProgramCache]: Analyzing trace with hash -674531426, now seen corresponding path program 1 times [2019-11-07 00:32:48,889 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:48,889 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143727917] [2019-11-07 00:32:48,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:48,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:48,926 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143727917] [2019-11-07 00:32:48,926 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:48,926 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:48,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522074939] [2019-11-07 00:32:48,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:48,927 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:48,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:48,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:48,928 INFO L87 Difference]: Start difference. First operand 680 states and 918 transitions. Second operand 3 states. [2019-11-07 00:32:48,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:48,955 INFO L93 Difference]: Finished difference Result 1020 states and 1368 transitions. [2019-11-07 00:32:48,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:48,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-07 00:32:48,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:48,960 INFO L225 Difference]: With dead ends: 1020 [2019-11-07 00:32:48,960 INFO L226 Difference]: Without dead ends: 698 [2019-11-07 00:32:48,961 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:48,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-11-07 00:32:48,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2019-11-07 00:32:48,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-11-07 00:32:48,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 918 transitions. [2019-11-07 00:32:48,984 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 918 transitions. Word has length 22 [2019-11-07 00:32:48,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:48,984 INFO L462 AbstractCegarLoop]: Abstraction has 696 states and 918 transitions. [2019-11-07 00:32:48,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:48,985 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 918 transitions. [2019-11-07 00:32:48,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-07 00:32:48,986 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:48,986 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:48,987 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:48,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:48,987 INFO L82 PathProgramCache]: Analyzing trace with hash 26533152, now seen corresponding path program 1 times [2019-11-07 00:32:48,987 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:48,987 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998453571] [2019-11-07 00:32:48,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:49,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:49,005 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998453571] [2019-11-07 00:32:49,006 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:49,006 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:49,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451324770] [2019-11-07 00:32:49,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:49,007 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:49,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:49,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:49,007 INFO L87 Difference]: Start difference. First operand 696 states and 918 transitions. Second operand 3 states. [2019-11-07 00:32:49,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:49,038 INFO L93 Difference]: Finished difference Result 1164 states and 1544 transitions. [2019-11-07 00:32:49,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:49,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-07 00:32:49,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:49,044 INFO L225 Difference]: With dead ends: 1164 [2019-11-07 00:32:49,045 INFO L226 Difference]: Without dead ends: 1162 [2019-11-07 00:32:49,046 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:49,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2019-11-07 00:32:49,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1032. [2019-11-07 00:32:49,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2019-11-07 00:32:49,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1318 transitions. [2019-11-07 00:32:49,085 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1318 transitions. Word has length 22 [2019-11-07 00:32:49,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:49,086 INFO L462 AbstractCegarLoop]: Abstraction has 1032 states and 1318 transitions. [2019-11-07 00:32:49,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:49,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1318 transitions. [2019-11-07 00:32:49,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-07 00:32:49,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:49,089 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:49,089 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:49,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:49,090 INFO L82 PathProgramCache]: Analyzing trace with hash -366493858, now seen corresponding path program 1 times [2019-11-07 00:32:49,090 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:49,090 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366220084] [2019-11-07 00:32:49,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:49,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:49,107 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366220084] [2019-11-07 00:32:49,108 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:49,108 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:49,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541647244] [2019-11-07 00:32:49,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:49,109 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:49,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:49,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:49,110 INFO L87 Difference]: Start difference. First operand 1032 states and 1318 transitions. Second operand 3 states. [2019-11-07 00:32:49,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:49,152 INFO L93 Difference]: Finished difference Result 2316 states and 2920 transitions. [2019-11-07 00:32:49,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:49,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-07 00:32:49,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:49,160 INFO L225 Difference]: With dead ends: 2316 [2019-11-07 00:32:49,160 INFO L226 Difference]: Without dead ends: 1322 [2019-11-07 00:32:49,163 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:49,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-11-07 00:32:49,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1320. [2019-11-07 00:32:49,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1320 states. [2019-11-07 00:32:49,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1606 transitions. [2019-11-07 00:32:49,251 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1606 transitions. Word has length 22 [2019-11-07 00:32:49,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:49,251 INFO L462 AbstractCegarLoop]: Abstraction has 1320 states and 1606 transitions. [2019-11-07 00:32:49,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:49,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1606 transitions. [2019-11-07 00:32:49,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-07 00:32:49,255 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:49,256 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:49,256 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:49,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:49,257 INFO L82 PathProgramCache]: Analyzing trace with hash 822743769, now seen corresponding path program 1 times [2019-11-07 00:32:49,257 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:49,257 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543070823] [2019-11-07 00:32:49,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:49,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:49,280 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543070823] [2019-11-07 00:32:49,280 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:49,280 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:49,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643789615] [2019-11-07 00:32:49,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:49,283 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:49,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:49,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:49,284 INFO L87 Difference]: Start difference. First operand 1320 states and 1606 transitions. Second operand 3 states. [2019-11-07 00:32:49,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:49,342 INFO L93 Difference]: Finished difference Result 1980 states and 2392 transitions. [2019-11-07 00:32:49,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:49,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-07 00:32:49,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:49,351 INFO L225 Difference]: With dead ends: 1980 [2019-11-07 00:32:49,351 INFO L226 Difference]: Without dead ends: 1354 [2019-11-07 00:32:49,353 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:49,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-11-07 00:32:49,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2019-11-07 00:32:49,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-11-07 00:32:49,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1606 transitions. [2019-11-07 00:32:49,427 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1606 transitions. Word has length 23 [2019-11-07 00:32:49,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:49,428 INFO L462 AbstractCegarLoop]: Abstraction has 1352 states and 1606 transitions. [2019-11-07 00:32:49,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:49,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1606 transitions. [2019-11-07 00:32:49,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-07 00:32:49,431 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:49,431 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:49,432 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:49,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:49,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1523808347, now seen corresponding path program 1 times [2019-11-07 00:32:49,432 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:49,433 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735184624] [2019-11-07 00:32:49,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:49,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:49,469 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735184624] [2019-11-07 00:32:49,470 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:49,470 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:49,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039439077] [2019-11-07 00:32:49,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:49,471 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:49,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:49,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:49,472 INFO L87 Difference]: Start difference. First operand 1352 states and 1606 transitions. Second operand 3 states. [2019-11-07 00:32:49,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:49,551 INFO L93 Difference]: Finished difference Result 2186 states and 2567 transitions. [2019-11-07 00:32:49,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:49,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-07 00:32:49,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:49,564 INFO L225 Difference]: With dead ends: 2186 [2019-11-07 00:32:49,564 INFO L226 Difference]: Without dead ends: 2184 [2019-11-07 00:32:49,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:49,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2019-11-07 00:32:49,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 2056. [2019-11-07 00:32:49,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2019-11-07 00:32:49,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2374 transitions. [2019-11-07 00:32:49,641 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2374 transitions. Word has length 23 [2019-11-07 00:32:49,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:49,642 INFO L462 AbstractCegarLoop]: Abstraction has 2056 states and 2374 transitions. [2019-11-07 00:32:49,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:49,642 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2374 transitions. [2019-11-07 00:32:49,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-07 00:32:49,647 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:32:49,647 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:32:49,647 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:32:49,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:32:49,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1130781337, now seen corresponding path program 1 times [2019-11-07 00:32:49,648 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:32:49,648 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624127780] [2019-11-07 00:32:49,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:32:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:32:49,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:32:49,668 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624127780] [2019-11-07 00:32:49,668 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:32:49,668 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:32:49,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793902606] [2019-11-07 00:32:49,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:32:49,669 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:32:49,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:32:49,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:49,670 INFO L87 Difference]: Start difference. First operand 2056 states and 2374 transitions. Second operand 3 states. [2019-11-07 00:32:49,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:32:49,744 INFO L93 Difference]: Finished difference Result 4552 states and 5126 transitions. [2019-11-07 00:32:49,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:32:49,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-07 00:32:49,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:32:49,745 INFO L225 Difference]: With dead ends: 4552 [2019-11-07 00:32:49,746 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 00:32:49,753 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:32:49,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 00:32:49,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 00:32:49,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 00:32:49,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 00:32:49,754 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-11-07 00:32:49,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:32:49,754 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 00:32:49,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:32:49,754 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 00:32:49,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 00:32:49,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 00:32:49,779 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-11-07 00:32:49,779 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:32:49,779 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:32:49,779 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 00:32:49,779 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 00:32:49,779 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 00:32:49,779 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 121) no Hoare annotation was computed. [2019-11-07 00:32:49,780 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-07 00:32:49,780 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 30 116) no Hoare annotation was computed. [2019-11-07 00:32:49,780 INFO L446 ceAbstractionStarter]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2019-11-07 00:32:49,780 INFO L443 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-11-07 00:32:49,780 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-07 00:32:49,780 INFO L439 ceAbstractionStarter]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2019-11-07 00:32:49,780 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 121) no Hoare annotation was computed. [2019-11-07 00:32:49,780 INFO L443 ceAbstractionStarter]: For program point L71-1(lines 30 116) no Hoare annotation was computed. [2019-11-07 00:32:49,781 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 30 116) no Hoare annotation was computed. [2019-11-07 00:32:49,781 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 30 116) no Hoare annotation was computed. [2019-11-07 00:32:49,781 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 121) the Hoare annotation is: true [2019-11-07 00:32:49,781 INFO L443 ceAbstractionStarter]: For program point L55-1(lines 30 116) no Hoare annotation was computed. [2019-11-07 00:32:49,781 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-07 00:32:49,781 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 30 116) no Hoare annotation was computed. [2019-11-07 00:32:49,781 INFO L443 ceAbstractionStarter]: For program point L106-1(lines 30 116) no Hoare annotation was computed. [2019-11-07 00:32:49,781 INFO L443 ceAbstractionStarter]: For program point L32(lines 32 34) no Hoare annotation was computed. [2019-11-07 00:32:49,782 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) no Hoare annotation was computed. [2019-11-07 00:32:49,782 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-07 00:32:49,783 INFO L443 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2019-11-07 00:32:49,783 INFO L443 ceAbstractionStarter]: For program point L91-1(lines 30 116) no Hoare annotation was computed. [2019-11-07 00:32:49,783 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 30 116) no Hoare annotation was computed. [2019-11-07 00:32:49,783 INFO L443 ceAbstractionStarter]: For program point L67-1(lines 30 116) no Hoare annotation was computed. [2019-11-07 00:32:49,783 INFO L443 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-11-07 00:32:49,783 INFO L443 ceAbstractionStarter]: For program point L59-1(lines 30 116) no Hoare annotation was computed. [2019-11-07 00:32:49,784 INFO L446 ceAbstractionStarter]: At program point L117(lines 5 121) the Hoare annotation is: true [2019-11-07 00:32:49,784 INFO L443 ceAbstractionStarter]: For program point L51(lines 51 53) no Hoare annotation was computed. [2019-11-07 00:32:49,784 INFO L443 ceAbstractionStarter]: For program point L51-2(lines 30 116) no Hoare annotation was computed. [2019-11-07 00:32:49,784 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 30 116) no Hoare annotation was computed. [2019-11-07 00:32:49,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:32:49 BoogieIcfgContainer [2019-11-07 00:32:49,794 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 00:32:49,801 INFO L168 Benchmark]: Toolchain (without parser) took 3477.07 ms. Allocated memory was 136.3 MB in the beginning and 250.6 MB in the end (delta: 114.3 MB). Free memory was 99.9 MB in the beginning and 118.9 MB in the end (delta: -19.0 MB). Peak memory consumption was 95.3 MB. Max. memory is 7.1 GB. [2019-11-07 00:32:49,803 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 136.3 MB. Free memory was 118.3 MB in the beginning and 118.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-07 00:32:49,804 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.08 ms. Allocated memory is still 136.3 MB. Free memory was 99.7 MB in the beginning and 89.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-11-07 00:32:49,805 INFO L168 Benchmark]: Boogie Preprocessor took 110.56 ms. Allocated memory was 136.3 MB in the beginning and 199.8 MB in the end (delta: 63.4 MB). Free memory was 89.6 MB in the beginning and 177.5 MB in the end (delta: -87.9 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2019-11-07 00:32:49,810 INFO L168 Benchmark]: RCFGBuilder took 354.54 ms. Allocated memory is still 199.8 MB. Free memory was 177.5 MB in the beginning and 161.2 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. [2019-11-07 00:32:49,813 INFO L168 Benchmark]: TraceAbstraction took 2703.22 ms. Allocated memory was 199.8 MB in the beginning and 250.6 MB in the end (delta: 50.9 MB). Free memory was 161.2 MB in the beginning and 118.9 MB in the end (delta: 42.4 MB). Peak memory consumption was 93.2 MB. Max. memory is 7.1 GB. [2019-11-07 00:32:49,819 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 136.3 MB. Free memory was 118.3 MB in the beginning and 118.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 304.08 ms. Allocated memory is still 136.3 MB. Free memory was 99.7 MB in the beginning and 89.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 110.56 ms. Allocated memory was 136.3 MB in the beginning and 199.8 MB in the end (delta: 63.4 MB). Free memory was 89.6 MB in the beginning and 177.5 MB in the end (delta: -87.9 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 354.54 ms. Allocated memory is still 199.8 MB. Free memory was 177.5 MB in the beginning and 161.2 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2703.22 ms. Allocated memory was 199.8 MB in the beginning and 250.6 MB in the end (delta: 50.9 MB). Free memory was 161.2 MB in the beginning and 118.9 MB in the end (delta: 42.4 MB). Peak memory consumption was 93.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 35 locations, 1 error locations. Result: SAFE, OverallTime: 2.6s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1238 SDtfs, 574 SDslu, 829 SDs, 0 SdLazy, 107 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2056occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 530 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 138 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 383 ConstructedInterpolants, 0 QuantifiedInterpolants, 13856 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...